| Publication | Date of Publication | Type |
|---|
Bipartite secret sharing and staircases
Discrete Mathematics | 2024-03-27 | Paper |
Infinite probabilistic secret sharing
Kybernetika | 2023-08-17 | Paper |
| A short proof of the G\'acs--K\"orner theorem | 2023-06-26 | Paper |
Algebra of Data Reconciliation
Studia Scientiarum Mathematicarum Hungarica | 2023-01-23 | Paper |
An optimization problem for continuous submodular functions
Studia Universitatis Babes-Bolyai Matematica | 2022-08-29 | Paper |
Mathematical logic. Exercises and solutions
Problem Books in Mathematics | 2021-08-24 | Paper |
Inner approximation algorithm for solving linear multiobjective optimization problems
Optimization | 2021-08-19 | Paper |
Sticky polymatroids on at most five elements
Studia Scientiarum Mathematicarum Hungarica | 2021-06-29 | Paper |
Secret sharing and duality
Journal of Mathematical Cryptology | 2021-06-17 | Paper |
One-adhesive polymatroids.
Kybernetika | 2021-04-13 | Paper |
Cyclic flats of a polymatroid
Annals of Combinatorics | 2021-03-29 | Paper |
| Sticky matroids and convolution | 2019-09-05 | Paper |
Secret sharing on large girth graphs
Cryptography and Communications | 2019-05-15 | Paper |
Optimal Information Rate of Secret Sharing Schemes on Trees
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Book Inequalities
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Entropy Region and Convolution
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Using multiobjective optimization to map the entropy region
Computational Optimization and Applications | 2016-03-07 | Paper |
Erdős-Pyber theorem for hypergraphs and secret sharing
Graphs and Combinatorics | 2015-09-24 | Paper |
Secret sharing on the \(d\)-dimensional cube
Designs, Codes and Cryptography | 2015-03-12 | Paper |
Infinite secret sharing -- examples
Journal of Mathematical Cryptology | 2014-06-30 | Paper |
Gruppen secret sharing or how to share several secrets if you must?
Mathematica Slovaca | 2014-02-18 | Paper |
| Secure utilization of local and regional data assets through mobile environments | 2012-08-29 | Paper |
Complexity of universal access structures
Information Processing Letters | 2012-05-04 | Paper |
On-line secret sharing
Designs, Codes and Cryptography | 2012-03-01 | Paper |
Corrigendum to: Secret sharing on infinite graphs
Tatra Mountains Mathematical Publications | 2011-02-17 | Paper |
An impossibility result on graph secret sharing
Designs, Codes and Cryptography | 2009-11-27 | Paper |
On an infinite family of graphs with information ratio \(2 - 1/k\)
Computing | 2009-08-10 | Paper |
| Secret sharing on infinite graphs | 2009-03-11 | Paper |
Secret sharing schemes on graphs
Studia Scientiarum Mathematicarum Hungarica | 2008-10-22 | Paper |
The perimeter of rounded convex planar sets
Periodica Mathematica Hungarica | 2007-10-17 | Paper |
| scientific article; zbMATH DE number 5138868 (Why is no real title available?) | 2007-03-29 | Paper |
| Subpixel image processing | 2007-03-29 | Paper |
Connected graph game
Studia Scientiarum Mathematicarum Hungarica | 2003-05-18 | Paper |
| scientific article; zbMATH DE number 1261118 (Why is no real title available?) | 1999-03-14 | Paper |
| scientific article; zbMATH DE number 1261165 (Why is no real title available?) | 1999-03-14 | Paper |
The size of a share must be large
Journal of Cryptology | 1998-10-19 | Paper |
| scientific article; zbMATH DE number 1088899 (Why is no real title available?) | 1998-05-03 | Paper |
| scientific article; zbMATH DE number 1101416 (Why is no real title available?) | 1998-01-07 | Paper |
Program correctness on finite fields
Periodica Mathematica Hungarica | 1997-04-08 | Paper |
Stability of weak second-order semantics
Studia Logica | 1989-01-01 | Paper |
Strong Semantical Characterization for Nondeterministic Programs
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4028889 (Why is no real title available?) | 1986-01-01 | Paper |
A completeness theorem for dynamic logic
Notre Dame Journal of Formal Logic | 1985-01-01 | Paper |
A PROPERTY OF 2‐SORTED PEANO MODELS AND PROGRAM VERIFICATION
Mathematical Logic Quarterly | 1984-01-01 | Paper |
On the strength of “sometimes” and “always” in program verification
Information and Control | 1983-01-01 | Paper |
Variations on a game
Journal of Combinatorial Theory. Series A | 1982-01-01 | Paper |
Determinateness of program equivalence over peano axioms
Theoretical Computer Science | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3905832 (Why is no real title available?) | 1982-01-01 | Paper |
Programs and program verifications in a general setting
Theoretical Computer Science | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3722069 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3778706 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3688694 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3731317 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3702097 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3750322 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3659564 (Why is no real title available?) | 1979-01-01 | Paper |
