László Csirmaz

Frantisek Matús

Carles Padró

Discret. Math., 2024

2023

Synchronizing Many Filesystems in Near Linear Time.

[BibT_eX]

[DOI]

Elöd Pal Csirmaz

Future Internet, June, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

2022

Data Synchronization: A Complete Theoretical Solution for Filesystems.

[BibT_eX]

[DOI]

Elöd Csirmaz

Future Internet, 2022

2021

Secret sharing and duality.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2021

Algebra of Data Reconciliation.

[BibT_eX]

[DOI]

Elöd Pal Csirmaz

CoRR, 2021

2020

One-adhesive polymatroids.

[BibT_eX]

[DOI]

Kybernetika, 2020

An optimization problem for continuous submodular functions.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Sticky polymatroids on at most five elements.

[BibT_eX]

[DOI]

CoRR, 2019

Sticky matroids and convolution.

[BibT_eX]

[DOI]

CoRR, 2019

Secret sharing on large girth graphs.

[BibT_eX]

[DOI]

Péter Ligeti

Cryptogr. Commun., 2019

2018

Inner approximation algorithm for solving linear multiobjective optimization problems.

[BibT_eX]

[DOI]

CoRR, 2018

2016

Entropy Region and Convolution.

[BibT_eX]

[DOI]

Frantisek Matús

IEEE Trans. Inf. Theory, 2016

Using multiobjective optimization to map the entropy region.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2016

2015

Erdős-Pyber Theorem for Hypergraphs and Secret Sharing.

[BibT_eX]

[DOI]

Péter Ligeti

Graphs Comb., 2015

Secret sharing on the d-dimensional cube.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

2014

Book Inequalities.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Infinite secret sharing - Examples.

[BibT_eX]

[DOI]

Alexander Dibert

J. Math. Cryptol., 2014

2013

Optimal Information Rate of Secret Sharing Schemes on Trees.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

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

[BibT_eX]

[DOI]

CoRR, 2013

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

[BibT_eX]

[DOI]

CoRR, 2013

2012

Complexity of universal access structures.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Probabilistic Infinite Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

On-line secret sharing.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2012

2011

How to share secrets simultaneously.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

2009

Secret sharing on trees: problem solved.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

On the impossibility of graph secret sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

An impossibility result on graph secret sharing.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

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

[BibT_eX]

[DOI]

Péter Ligeti

Computing, 2009

2007

The perimeter of rounded convex planar sets.

[BibT_eX]

[DOI]

Period. Math. Hung., 2007

Secret sharing on the infinite ladder.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Secret sharing on infinite graphs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

2005

Secret sharing schemes on graphs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

1997

The Size of a Share Must Be Large.

[BibT_eX]

[DOI]

J. Cryptol., 1997

1988

Stability of weak second-order semantics.

[BibT_eX]

[DOI]

Stud Logica, 1988

1987

Strong Semantical Characterization for Nondeterministic Programs.

[BibT_eX]

[DOI]

Math. Log. Q., 1987

1986

Program Correctness on Finite Fields

[BibT_eX]

Bradd Hart

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

1985

A completeness theorem for dynamic logic.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1985

1984

A Property of 2-Sorted Peano Models and Program Verification.

[BibT_eX]

[DOI]

Jeff B. Paris

Math. Log. Q., 1984

1983

On the Strength of "Sometimes" and "Always" in Program Verification

[BibT_eX]

[DOI]

Inf. Control., 1983

1982

Determinateness of Program Equivalence over Peano Axioms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Variations on a Game.

[BibT_eX]

[DOI]

József Beck

J. Comb. Theory A, 1982

1981

Programs and Program Verifications in a General Setting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1981

On the completeness of proving partial correctness.

[BibT_eX]

[DOI]

Acta Cybern., 1981

1980

Iterated grammars.

[BibT_eX]

[DOI]

Acta Cybern., 1980

Structure of program runs of non-standard time.

[BibT_eX]

[DOI]