Structure of program runs of non-standard time. - László Csirmaz (Acta Cybern., 1980)

Iterated grammars. - László Csirmaz (Acta Cybern., 1980)

On the completeness of proving partial correctness. - László Csirmaz (Acta Cybern., 1981)

Programs and Program Verifications in a General Setting. - László Csirmaz (Theor. Comput. Sci., 1981)

Variations on a Game. - József Beck; László Csirmaz (J. Comb. Theory A, 1982)

Determinateness of Program Equivalence over Peano Axioms. - László Csirmaz (Theor. Comput. Sci., 1982)

On the Strength of "Sometimes" and "Always" in Program Verification - László Csirmaz (Inf. Control., 1983)

A Property of 2-Sorted Peano Models and Program Verification. - László Csirmaz; Jeff B. Paris (Math. Log. Q., 1984)

A completeness theorem for dynamic logic. - László Csirmaz (Notre Dame J. Formal Log., 1985)

Program Correctness on Finite Fields - László Csirmaz; Bradd Hart (LICS, 1986)

Strong Semantical Characterization for Nondeterministic Programs. - László Csirmaz (Math. Log. Q., 1987)

Stability of weak second-order semantics. - László Csirmaz (Stud Logica, 1988)

The Size of a Share Must Be Large. - László Csirmaz (J. Cryptol., 1997)

Secret sharing schemes on graphs. - László Csirmaz (IACR Cryptol. ePrint Arch., 2005)

Secret sharing on infinite graphs. - László Csirmaz (IACR Cryptol. ePrint Arch., 2007)

Secret sharing on the infinite ladder. - László Csirmaz (IACR Cryptol. ePrint Arch., 2007)

The perimeter of rounded convex planar sets. - László Csirmaz (Period. Math. Hung., 2007)

On an infinite family of graphs with information ratio 2 - 1/k. - László Csirmaz; Péter Ligeti (Computing, 2009)

An impossibility result on graph secret sharing. - László Csirmaz (Des. Codes Cryptogr., 2009)

On the impossibility of graph secret sharing. - László Csirmaz (IACR Cryptol. ePrint Arch., 2009)

Secret sharing on trees: problem solved. - László Csirmaz; Gábor Tardos (IACR Cryptol. ePrint Arch., 2009)

How to share secrets simultaneously. - László Csirmaz (IACR Cryptol. ePrint Arch., 2011)

On-line secret sharing. - László Csirmaz; Gábor Tardos (Des. Codes Cryptogr., 2012)

Probabilistic Infinite Secret Sharing. - László Csirmaz (IACR Cryptol. ePrint Arch., 2012)

Complexity of universal access structures. - László Csirmaz (Inf. Process. Lett., 2012)

Using multiobjective optimization to map the entropy region of four random variables. - László Csirmaz (CoRR, 2013)

Gruppen secret sharing, or, how to share several secrets if you must? - László Csirmaz (CoRR, 2013)

Optimal Information Rate of Secret Sharing Schemes on Trees. - László Csirmaz; Gábor Tardos (IEEE Trans. Inf. Theory, 2013)

Infinite secret sharing - Examples. - Alexander Dibert; László Csirmaz (J. Math. Cryptol., 2014)

Book Inequalities. - László Csirmaz (IEEE Trans. Inf. Theory, 2014)

Secret sharing on the d-dimensional cube. - László Csirmaz (Des. Codes Cryptogr., 2015)

Erdős-Pyber Theorem for Hypergraphs and Secret Sharing. - László Csirmaz; Péter Ligeti; Gábor Tardos (Graphs Comb., 2015)

Using multiobjective optimization to map the entropy region. - László Csirmaz (Comput. Optim. Appl., 2016)

Entropy Region and Convolution. - Frantisek Matús; László Csirmaz (IEEE Trans. Inf. Theory, 2016)

Inner approximation algorithm for solving linear multiobjective optimization problems. - László Csirmaz (CoRR, 2018)

Secret sharing on large girth graphs. - László Csirmaz; Péter Ligeti (Cryptogr. Commun., 2019)

Sticky matroids and convolution. - László Csirmaz (CoRR, 2019)

Sticky polymatroids on at most five elements. - László Csirmaz (CoRR, 2019)

An optimization problem for continuous submodular functions. - László Csirmaz (CoRR, 2020)

One-adhesive polymatroids. - László Csirmaz (Kybernetika, 2020)

Algebra of Data Reconciliation. - Elöd Pal Csirmaz; László Csirmaz (CoRR, 2021)

Secret sharing and duality. - László Csirmaz (J. Math. Cryptol., 2021)

Data Synchronization: A Complete Theoretical Solution for Filesystems. - Elöd Csirmaz; László Csirmaz (Future Internet, 2022)

A short proof of the Gács-Körner theorem. - László Csirmaz (CoRR, 2023)

Infinite probabilistic secret sharing. - László Csirmaz (Kybernetika, 2023)

Synchronizing Many Filesystems in Near Linear Time. - Elöd Pal Csirmaz; László Csirmaz (Future Internet, 2023)

Attempting the impossible: enumerating extremal submodular functions for n=6. - Elöd Pal Csirmaz; László Csirmaz (CoRR, 2024)

Bipartite secret sharing and staircases. - László Csirmaz; Frantisek Matús; Carles Padró (Discret. Math., 2024)