default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLászló Csirmaz
Person information
- affiliation: Central European University, Budapest, Hungary
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]László Csirmaz
, Frantisek Matús, Carles Padró:
Bipartite secret sharing and staircases. Discret. Math. 347(5): 113909 (2024)- [i36]Elöd Pal Csirmaz, László Csirmaz:
Attempting the impossible: enumerating extremal submodular functions for n=6. CoRR abs/2410.15502 (2024) - 2023
- [j29]Elöd Pal Csirmaz, László Csirmaz:
Synchronizing Many Filesystems in Near Linear Time. Future Internet 15(6): 198 (2023) - [i35]Elöd Pal Csirmaz, László Csirmaz:
Synchronizing Many Filesystems in Near Linear Time. CoRR abs/2302.09666 (2023) - [i34]László Csirmaz:
A short proof of the Gács-Körner theorem. CoRR abs/2306.14718 (2023) - 2022
- [j28]Elöd Csirmaz, László Csirmaz:
Data Synchronization: A Complete Theoretical Solution for Filesystems. Future Internet 14(11): 344 (2022) - [i33]Elöd Pal Csirmaz, László Csirmaz:
Data Synchronization: A Complete Theoretical Solution for Filesystems. CoRR abs/2210.04565 (2022) - 2021
- [j27]László Csirmaz:
Secret sharing and duality. J. Math. Cryptol. 15(1): 157-173 (2021) - [i32]László Csirmaz, Frantisek Matús, Carles Padró:
Bipartite secret sharing and staircases. CoRR abs/2103.04904 (2021) - [i31]Elöd Pal Csirmaz, László Csirmaz:
Algebra of Data Reconciliation. CoRR abs/2110.06313 (2021) - 2020
- [j26]László Csirmaz:
One-adhesive polymatroids. Kybernetika 56(5): 886-902 (2020) - [i30]László Csirmaz:
An optimization problem for continuous submodular functions. CoRR abs/2009.12574 (2020)
2010 – 2019
- 2019
- [j25]László Csirmaz, Péter Ligeti:
Secret sharing on large girth graphs. Cryptogr. Commun. 11(3): 399-410 (2019) - [i29]László Csirmaz:
One-adhesive polymatroids. CoRR abs/1904.07565 (2019) - [i28]László Csirmaz:
Complexity of universal access structures. CoRR abs/1908.05021 (2019) - [i27]László Csirmaz:
Sticky matroids and convolution. CoRR abs/1909.02353 (2019) - [i26]László Csirmaz:
Secret sharing and duality. CoRR abs/1909.13663 (2019) - [i25]László Csirmaz:
Sticky polymatroids on at most five elements. CoRR abs/1911.04205 (2019) - [i24]László Csirmaz:
Secret sharing and duality. IACR Cryptol. ePrint Arch. 2019: 1197 (2019) - 2018
- [i23]László Csirmaz:
Inner approximation algorithm for solving linear multiobjective optimization problems. CoRR abs/1808.01786 (2018) - 2017
- [i22]László Csirmaz, Péter Ligeti:
Secret sharing on large girth graphs. CoRR abs/1705.10520 (2017) - 2016
- [j24]László Csirmaz:
Using multiobjective optimization to map the entropy region. Comput. Optim. Appl. 63(1): 45-67 (2016) - [j23]Frantisek Matús, László Csirmaz:
Entropy Region and Convolution. IEEE Trans. Inf. Theory 62(11): 6007-6018 (2016) - 2015
- [j22]László Csirmaz:
Secret sharing on the d-dimensional cube. Des. Codes Cryptogr. 74(3): 719-729 (2015) - [j21]László Csirmaz, Péter Ligeti, Gábor Tardos:
Erdős-Pyber Theorem for Hypergraphs and Secret Sharing. Graphs Comb. 31(5): 1335-1346 (2015) - 2014
- [j20]Alexander Dibert, László Csirmaz:
Infinite secret sharing - Examples. J. Math. Cryptol. 8(2): 141-168 (2014) - [j19]László Csirmaz:
Book Inequalities. IEEE Trans. Inf. Theory 60(11): 6811-6818 (2014) - [i21]László Csirmaz, Gábor Tardos:
On-line secret sharing. CoRR abs/1402.1368 (2014) - 2013
- [j18]László Csirmaz, Gábor Tardos:
Optimal Information Rate of Secret Sharing Schemes on Trees. IEEE Trans. Inf. Theory 59(4): 2527-2530 (2013) - [i20]László Csirmaz, Gábor Tardos:
Optimal information rate of secret sharing schemes on trees. CoRR abs/1302.4609 (2013) - [i19]László Csirmaz:
Using multiobjective optimization to map the entropy region of four random variables. CoRR abs/1310.4638 (2013) - [i18]László Csirmaz:
Secret sharing on the $d$-dimensional cube. CoRR abs/1310.4640 (2013) - [i17]László Csirmaz:
Gruppen secret sharing, or, how to share several secrets if you must? CoRR abs/1310.4652 (2013) - [i16]Frantisek Matús, László Csirmaz:
Entropy region and convolution. CoRR abs/1310.5957 (2013) - [i15]Alexander Dibert, László Csirmaz:
Infinite Secret Sharing - Examples. CoRR abs/1310.7418 (2013) - [i14]László Csirmaz:
Probabilistic Infinite Secret Sharing. CoRR abs/1310.7423 (2013) - [i13]László Csirmaz, Péter Ligeti, Gábor Tardos:
Erdős-Pyber theorem for hypergraphs and secret sharing. CoRR abs/1311.5027 (2013) - [i12]László Csirmaz:
Book inequalities. CoRR abs/1312.6490 (2013) - 2012
- [j17]László Csirmaz, Gábor Tardos:
On-line secret sharing. Des. Codes Cryptogr. 63(1): 127-147 (2012) - [j16]László Csirmaz:
Complexity of universal access structures. Inf. Process. Lett. 112(4): 149-152 (2012) - [i11]Alexander Dibert, László Csirmaz:
Infinite Secret Sharing - Examples. IACR Cryptol. ePrint Arch. 2012: 411 (2012) - [i10]László Csirmaz:
Probabilistic Infinite Secret Sharing. IACR Cryptol. ePrint Arch. 2012: 412 (2012) - 2011
- [i9]László Csirmaz, Gábor Tardos:
On-line secret sharing. IACR Cryptol. ePrint Arch. 2011: 174 (2011) - [i8]László Csirmaz:
Complexity of universal access structures. IACR Cryptol. ePrint Arch. 2011: 375 (2011) - [i7]László Csirmaz:
How to share secrets simultaneously. IACR Cryptol. ePrint Arch. 2011: 386 (2011)
2000 – 2009
- 2009
- [j15]László Csirmaz, Péter Ligeti:
On an infinite family of graphs with information ratio 2 - 1/k. Computing 85(1-2): 127-136 (2009) - [j14]László Csirmaz:
An impossibility result on graph secret sharing. Des. Codes Cryptogr. 53(3): 195-209 (2009) - [i6]László Csirmaz:
On the impossibility of graph secret sharing. IACR Cryptol. ePrint Arch. 2009: 59 (2009) - [i5]László Csirmaz, Gábor Tardos:
Secret sharing on trees: problem solved. IACR Cryptol. ePrint Arch. 2009: 71 (2009) - 2007
- [j13]László Csirmaz:
The perimeter of rounded convex planar sets. Period. Math. Hung. 54(1): 31-49 (2007) - [i4]László Csirmaz:
Secret sharing on infinite graphs. IACR Cryptol. ePrint Arch. 2007: 297 (2007) - [i3]László Csirmaz:
Secret sharing on the infinite ladder. IACR Cryptol. ePrint Arch. 2007: 355 (2007) - 2005
- [i2]László Csirmaz:
Secret sharing schemes on graphs. IACR Cryptol. ePrint Arch. 2005: 59 (2005) - [i1]László Csirmaz:
Secret sharing on the d-dimensional cube. IACR Cryptol. ePrint Arch. 2005: 177 (2005)
1990 – 1999
- 1997
- [j12]László Csirmaz:
The Size of a Share Must Be Large. J. Cryptol. 10(4): 223-231 (1997) - 1994
- [c2]László Csirmaz:
The Size of a Share Must Be Large. EUROCRYPT 1994: 13-22
1980 – 1989
- 1988
- [j11]László Csirmaz:
Stability of weak second-order semantics. Stud Logica 47(3): 193-202 (1988) - 1987
- [j10]László Csirmaz:
Strong Semantical Characterization for Nondeterministic Programs. Math. Log. Q. 33(5): 407-416 (1987) - 1986
- [c1]László Csirmaz, Bradd Hart:
Program Correctness on Finite Fields. LICS 1986: 4-10 - 1985
- [j9]László Csirmaz:
A completeness theorem for dynamic logic. Notre Dame J. Formal Log. 26(1): 51-60 (1985) - 1984
- [j8]László Csirmaz, Jeff B. Paris:
A Property of 2-Sorted Peano Models and Program Verification. Math. Log. Q. 30(19-24): 325-334 (1984) - 1983
- [j7]L. Csirmaz:
On the Strength of "Sometimes" and "Always" in Program Verification. Inf. Control. 57(2/3): 165-179 (1983) - 1982
- [j6]József Beck, László Csirmaz:
Variations on a Game. J. Comb. Theory A 33(3): 297-315 (1982) - [j5]L. Csirmaz:
Determinateness of Program Equivalence over Peano Axioms. Theor. Comput. Sci. 21: 231-235 (1982) - 1981
- [j4]László Csirmaz:
On the completeness of proving partial correctness. Acta Cybern. 5(2): 181-190 (1981) - [j3]L. Csirmaz:
Programs and Program Verifications in a General Setting. Theor. Comput. Sci. 16: 199-210 (1981) - 1980
- [j2]L. Csirmaz:
Structure of program runs of non-standard time. Acta Cybern. 4(4): 325-331 (1980) - [j1]László Csirmaz:
Iterated grammars. Acta Cybern. 5(1): 43-47 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
