László Csirmaz

From MaRDI portal
Revision as of 07:06, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:247008

Available identifiers

zbMath Open csirmaz.laszloDBLP73/347WikidataQ19703285 ScholiaQ19703285MaRDI QIDQ247008

List of research outcomes





PublicationDate of PublicationType
Bipartite secret sharing and staircases2024-03-27Paper
Infinite probabilistic secret sharing2023-08-17Paper
A short proof of the G\'acs--K\"orner theorem2023-06-26Paper
Algebra of Data Reconciliation2023-01-23Paper
An optimization problem for continuous submodular functions2022-08-29Paper
Mathematical Logic2021-08-24Paper
Inner approximation algorithm for solving linear multiobjective optimization problems2021-08-19Paper
Sticky Polymatroids on At Most Five Elements2021-06-29Paper
Secret sharing and duality2021-06-17Paper
One-adhesive polymatroids2021-04-13Paper
Cyclic flats of a polymatroid2021-03-29Paper
Sticky matroids and convolution2019-09-05Paper
Secret sharing on large girth graphs2019-05-15Paper
Optimal Information Rate of Secret Sharing Schemes on Trees2017-06-08Paper
Book Inequalities2017-05-16Paper
Entropy Region and Convolution2017-04-28Paper
Using multiobjective optimization to map the entropy region2016-03-07Paper
Erdős-Pyber theorem for hypergraphs and secret sharing2015-09-24Paper
Secret sharing on the \(d\)-dimensional cube2015-03-12Paper
Infinite secret sharing -- examples2014-06-30Paper
Gruppen secret sharing or how to share several secrets if you must?2014-02-18Paper
https://portal.mardi4nfdi.de/entity/Q29090132012-08-29Paper
Complexity of universal access structures2012-05-04Paper
On-line secret sharing2012-03-01Paper
Corrigendum to secret sharing on infinite graphs2011-02-17Paper
An impossibility result on graph secret sharing2009-11-27Paper
On an infinite family of graphs with information ratio \(2 - 1/k\)2009-08-10Paper
https://portal.mardi4nfdi.de/entity/Q36130992009-03-11Paper
Secret sharing schemes on graphs2008-10-22Paper
The perimeter of rounded convex planar sets2007-10-17Paper
https://portal.mardi4nfdi.de/entity/Q34288472007-03-29Paper
https://portal.mardi4nfdi.de/entity/Q34288592007-03-29Paper
Connected graph game2003-05-18Paper
https://portal.mardi4nfdi.de/entity/Q42315791999-03-14Paper
https://portal.mardi4nfdi.de/entity/Q42316011999-03-14Paper
The size of a share must be large1998-10-19Paper
https://portal.mardi4nfdi.de/entity/Q43657231998-05-03Paper
https://portal.mardi4nfdi.de/entity/Q43708571998-01-07Paper
Program correctness on finite fields1997-04-08Paper
Stability of weak second-order semantics1989-01-01Paper
Strong Semantical Characterization for Nondeterministic Programs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37699561986-01-01Paper
A completeness theorem for dynamic logic1985-01-01Paper
A PROPERTY OF 2‐SORTED PEANO MODELS AND PROGRAM VERIFICATION1984-01-01Paper
On the strength of “sometimes” and “always” in program verification1983-01-01Paper
Determinateness of program equivalence over peano axioms1982-01-01Paper
Variations on a game1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36835281982-01-01Paper
Programs and program verifications in a general setting1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39113621981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39579121981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38834741980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38949501980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39190641980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39337711980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38582401979-01-01Paper

Research outcomes over time

This page was built for person: László Csirmaz