László Csirmaz

Orcid: 0000-0001-7530-8307

Affiliations:
  • Central European University, Budapest, Hungary


According to our database1, László Csirmaz authored at least 46 papers between 1980 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Synchronizing Many Filesystems in Near Linear Time.
Future Internet, June, 2023

A short proof of the Gács-Körner theorem.
CoRR, 2023

2022
Data Synchronization: A Complete Theoretical Solution for Filesystems.
Future Internet, 2022

2021
Algebra of Data Reconciliation.
CoRR, 2021

Bipartite secret sharing and staircases.
CoRR, 2021

2020
One-adhesive polymatroids.
Kybernetika, 2020

An optimization problem for continuous submodular functions.
CoRR, 2020

2019
Secret sharing and duality.
IACR Cryptol. ePrint Arch., 2019

Sticky polymatroids on at most five elements.
CoRR, 2019

Sticky matroids and convolution.
CoRR, 2019

Secret sharing on large girth graphs.
Cryptogr. Commun., 2019

2018
Inner approximation algorithm for solving linear multiobjective optimization problems.
CoRR, 2018

2016
Entropy Region and Convolution.
IEEE Trans. Inf. Theory, 2016

Using multiobjective optimization to map the entropy region.
Comput. Optim. Appl., 2016

2015
Erdős-Pyber Theorem for Hypergraphs and Secret Sharing.
Graphs Comb., 2015

Secret sharing on the d-dimensional cube.
Des. Codes Cryptogr., 2015

2014
Book Inequalities.
IEEE Trans. Inf. Theory, 2014

2013
Optimal Information Rate of Secret Sharing Schemes on Trees.
IEEE Trans. Inf. Theory, 2013

Gruppen secret sharing, or, how to share several secrets if you must?
CoRR, 2013

Using multiobjective optimization to map the entropy region of four random variables.
CoRR, 2013

2012
Complexity of universal access structures.
Inf. Process. Lett., 2012

Infinite Secret Sharing - Examples.
IACR Cryptol. ePrint Arch., 2012

Probabilistic Infinite Secret Sharing.
IACR Cryptol. ePrint Arch., 2012

On-line secret sharing.
Des. Codes Cryptogr., 2012

2011
How to share secrets simultaneously.
IACR Cryptol. ePrint Arch., 2011

2009
Secret sharing on trees: problem solved.
IACR Cryptol. ePrint Arch., 2009

On the impossibility of graph secret sharing.
IACR Cryptol. ePrint Arch., 2009

An impossibility result on graph secret sharing.
Des. Codes Cryptogr., 2009

On an infinite family of graphs with information ratio 2 - 1/<i>k</i>.
Computing, 2009

2007
The perimeter of rounded convex planar sets.
Period. Math. Hung., 2007

Secret sharing on the infinite ladder.
IACR Cryptol. ePrint Arch., 2007

Secret sharing on infinite graphs.
IACR Cryptol. ePrint Arch., 2007

2005
Secret sharing schemes on graphs.
IACR Cryptol. ePrint Arch., 2005

1997
The Size of a Share Must Be Large.
J. Cryptol., 1997

1988
Stability of weak second-order semantics.
Stud Logica, 1988

1987
Strong Semantical Characterization for Nondeterministic Programs.
Math. Log. Q., 1987

1986
Program Correctness on Finite Fields
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1985
A completeness theorem for dynamic logic.
Notre Dame J. Formal Log., 1985

1984
A Property of 2-Sorted Peano Models and Program Verification.
Math. Log. Q., 1984

1983
On the Strength of "Sometimes" and "Always" in Program Verification
Inf. Control., 1983

1982
Determinateness of Program Equivalence over Peano Axioms.
Theor. Comput. Sci., 1982

Variations on a Game.
J. Comb. Theory, Ser. A, 1982

1981
Programs and Program Verifications in a General Setting.
Theor. Comput. Sci., 1981

On the completeness of proving partial correctness.
Acta Cybern., 1981

1980
Iterated grammars.
Acta Cybern., 1980

Structure of program runs of non-standard time.
Acta Cybern., 1980


  Loading...