László Csirmaz - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 37 from 37

2023

Synchronizing Many Filesystems in Near Linear TimeElöd Pal Csirmaz, László Csirmaz. fi, 15(6):198, June 2023. [doi]

2022

Data Synchronization: A Complete Theoretical Solution for FilesystemsElöd Csirmaz, László Csirmaz. fi, 14(11):344, 2022. [doi]

2020

One-adhesive polymatroidsLászló Csirmaz. kybernetika, 56(5):886-902, 2020. [doi]

Secret sharing and dualityLászló Csirmaz. jmc, 15(1):157-173, 2020. [doi]

2019

Secret sharing and dualityLászló Csirmaz. iacr, 2019:1197, 2019. [doi]

Secret sharing on large girth graphsLászló Csirmaz, Péter Ligeti. ccds, 11(3):399-410, 2019. [doi]

2016

Using multiobjective optimization to map the entropy regionLászló Csirmaz. coap, 63(1):45-67, 2016. [doi]

Entropy Region and ConvolutionFrantisek Matús, László Csirmaz. TIT, 62(11):6007-6018, 2016. [doi]

2015

Secret sharing on the d-dimensional cubeLászló Csirmaz. dcc, 74(3):719-729, 2015. [doi]

Erdős-Pyber Theorem for Hypergraphs and Secret SharingLászló Csirmaz, Péter Ligeti, Gábor Tardos. gc, 31(5):1335-1346, 2015. [doi]

2014

Book InequalitiesLászló Csirmaz. TIT, 60(11):6811-6818, 2014. [doi]

Infinite secret sharing - ExamplesAlexander Dibert, László Csirmaz. jmc, 8(2):141-168, 2014. [doi]

2013

Optimal Information Rate of Secret Sharing Schemes on TreesLászló Csirmaz, Gábor Tardos. TIT, 59(4):2527-2530, 2013. [doi]

2012

Complexity of universal access structuresLászló Csirmaz. ipl, 112(4):149-152, 2012. [doi]

Probabilistic Infinite Secret SharingLászló Csirmaz. iacr, 2012:412, 2012. [doi]

On-line secret sharingLászló Csirmaz, Gábor Tardos. dcc, 63(1):127-147, 2012. [doi]

Infinite Secret Sharing - ExamplesAlexander Dibert, László Csirmaz. iacr, 2012:411, 2012. [doi]

2011

How to share secrets simultaneouslyLászló Csirmaz. iacr, 2011:386, 2011. [doi]

Complexity of universal access structuresLászló Csirmaz. iacr, 2011:375, 2011. [doi]

On-line secret sharingLászló Csirmaz, Gábor Tardos. iacr, 2011:174, 2011. [doi]

2009

On the impossibility of graph secret sharingLászló Csirmaz. iacr, 2009:59, 2009. [doi]

An impossibility result on graph secret sharingLászló Csirmaz. dcc, 53(3):195-209, 2009. [doi]

kLászló Csirmaz, Péter Ligeti. computing, 85(1-2):127-136, 2009. [doi]

Secret sharing on trees: problem solvedLászló Csirmaz, Gábor Tardos. iacr, 2009:71, 2009. [doi]

2007

Secret sharing on the infinite ladderLászló Csirmaz. iacr, 2007:355, 2007. [doi]

Secret sharing on infinite graphsLászló Csirmaz. iacr, 2007:297, 2007. [doi]

2005

Secret sharing on the d-dimensional cubeLászló Csirmaz. iacr, 2005:177, 2005. [doi]

Secret sharing schemes on graphsLászló Csirmaz. iacr, 2005:59, 2005. [doi]

1997

The Size of a Share Must Be LargeLászló Csirmaz. joc, 10(4):223-231, 1997. [doi]

1994

The Size of a Share Must Be LargeLászló Csirmaz. eurocrypt 1994: 13-22 [doi]

1988

Stability of weak second-order semanticsLászló Csirmaz. sLogica, 47(3):193-202, 1988. [doi]

1987

Strong Semantical Characterization for Nondeterministic ProgramsLászló Csirmaz. mlq, 33(5):407-416, 1987. [doi]

1986

Program Correctness on Finite FieldsLászló Csirmaz, Bradd Hart. lics 1986: 4-10

1985

A completeness theorem for dynamic logicLászló Csirmaz. ndjfl, 26(1):51-60, 1985. [doi]

1984

A Property of 2-Sorted Peano Models and Program VerificationLászló Csirmaz, Jeff B. Paris. mlq, 30(19-24):325-334, 1984. [doi]

1981

Iterated grammarsLászló Csirmaz. actaC, 5:43-47, 1981.

On the completeness of proving partial correctnessLászló Csirmaz. actaC, 5:181-190, 1981.

Sign in or sign up to see more results.

runs on WebDSL