László Csirmaz
Academic/Research Areas:
Publications
|
Nemsztenderd analízis. Budapest: Typotex, 1999.
|
|
Studies in logic, language, and information. Stanford, Calif.: CSLI Publications : FoLLI, 1995.
|
|
DIMACS technical report, 90-28. [S.l.]: DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, 1990.
|
|
DIMACS technical report, 90-29. [S.l.]: DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, 1990.
|
|
DIMACS technical report, 90-25. [S.l.]: DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, 1990.
|
|
Problems of the József Kürschák mathematical competitions, 1966-1981. Budapest: Bolyai János Matematikai Társulat, 1982.
|
|
"The size of a share must be large." In Advances in cryptology---EUROCRYPT '94 (Perugia), 13-22. Lecture Notes in Comput. Sci. 950: Springer, 1995.
|
|
"Exact bounds on tree based secret sharing schemes." In Tatracrypt Conference on Cryptology., 2007.
|
|
"Exact bounds on tree based secret sharing schemes." In TatraCrypt. Smolenice, 2007.
|
|
"Publikciómat mindenkinek – jogi, technikai, szakmai kérdések." In Networkshop, Eger., 2007.
|
|
"Mennyire biztonságosak a kriptográfiai protokollok?" In Networkshop 2006 konferencia. Miskolc, 2006.
|
|
"Geometrical Cryptography." In Workshop on Coding and Cryptopgraphy, 101-111. Cee, 2003.
|
|
"Elliptikus görbén alapuló titkosírás." In Proceedings of NetworkShop 2002. Eger: Eszterházy Károly Fõiskola, 2002.
|
|
"Nonstandard logics of programs." In Algebra, combinatorics and logic in computer science, Vol. I, II, 285-294., 1983.
|
|
"Complexity of universal access structures." Information Processing Letters 112 (2012): 149-152.
|
|
"On-line secret sharing." Designs, Codes and Cryptography 63 (2012): 127-147.
|
|
"On an infinite family of graphs with information ratio $2-1/k$." Computing. Archives for Scientific ComputingComputing. Archives for Scientific Computing 85, no. 1-2 (2009): 127-136.
|
|
"On the impossibility of graph secret sharing." Des. Codes Cryptogr.Designs, Codes and Cryptography (2009).
|
|
"Secret sharing on trees: problem solved." (2008).
|
|
"Secret sharing on the infinite ladder." (2008).
|
|
"Secret sharing on infinite graphs." (2008).
|
|
"Secret sharing schemes on graphs." Studia Sci. Math. Hungar. 44, no. 3 (2007): 297-306.
|
|
"The perimeter of rounded convex planar sets." Period. Math. Hungar. 54, no. 1 (2007): 31-49.
|
|
"Geometric codes." Alkalmazott matematikai lapok 23, no. 2 (2006): 349-361.
|
|
"Subpixel image processing." Alkalmaz. Mat. Lapok 23, no. 1 (2006): 85-98.
|
|
"Secret sharing on the d-dimensional cube." (2005).
|
|
"A communication protocol." Hiradástechnika, no. 3 (2003): 42-46.
|
|
"Connected Graph Games." Studia Scientiarum Mathematicarum Hungarica, no. 39 (2002): 129-136.
|
|
"Elliptic curves." Elektronika, no. 9 (2002): 30-34.
|
|
"Recursive functions of one variable." Matematikai Lapok, no. 4 (1998): 1-6.
|
|
"The size of a share must be large." Journal of Cryptology 10, no. 4 (1997): 223-231.
|
|
"Program correctness on finite fields." Periodica Mathematica Hungarica 33, no. 1 (1996): 23-33.
|
|
"The dealer's random bits in perfect secret sharing schemes." Studia scientiarum mathematicarum Hungarica 32, no. 3-4 (1996): 429-437.
|
|
"Recursive functions of one variable." Mat. Lapok (N.S.) 4, no. 1 (1994): 1-6 (1998).
|
|
"Egyváltozós rekurzív függvények." Matematikai lapok 4, no. 1 (1994): 1-6.
|
|
"Hilbert tizedik problémája." Matematikai lapok 3, no. 1-2 (1993): 1-16.
|
|
"Stability of weak second-order semantics." Studia Logica 47, no. 3 (1988): 193-202.
|
|
"Strong semantical characterization for nondeterministic programs." Z. Math. Logik Grundlag. Math. 33, no. 5 (1987): 407-416.
|
|
"A completeness theorem for dynamic logic." Notre Dame J. Formal Logic 26, no. 1 (1985): 51-60.
|
|
"A property of 2–sorted Peano models and program verification." Zeitschrift für Math. Logik, no. 30 (1984): 325-334.
|
|
"On the strength of ”sometimes” and ”always” in program verification." Information and Control, no. 57 (1983): 165-169.
|
|
"Variations on a game." Journal of Combinatorial Theory, Series A (1982): 297-315.
|
|
"Nonstandard program runs and program correctness." Matematikai Lapok, no. 30 (1982): 81-125.
|
|
"Determinateness of program equivalence over Peano’s axioms." Theoretical Comp. Sci., no. 21 (1982): 231-235.
|
|
"Programs and program verification in a general setting." Theoretical Comp. Sci., no. 16 (1981): 199-210.
|
|
"Theorems and problems about nonstandard dynamic logic." Proceeding of Work- shop on Algorithms, Technical Univ. of Poznan (1981): 17-19.
|
|
"Nonstandard runs and program verification." Bulletin of Sect. of Logic, Polish Acad. Sci., no. 10 (1981): 68-74.
|
|
"On the completeness of proving partial correctness." Acta Cybernetica, no. 5 (1981): 181-190.
|
|
"On a combinatorial game with an application to Go–Moku." Discrete Mathematics, no. 29 (1980): 19-23.
|
|
"A survey of semantics of Floyd-Hoare derivability." CL & CL---Comput. Linguist. Comput. Lang. 14 (1980): 21-42.
|
|
"Structure of program runs of nonstandard time.", no. 4 (1980): 325-331.
|
|
"Iterated grammars." Acta Cybernetica, no. 5 (1980): 43-37.
|
|
"Remarks on Floyd–Hoare derivability." Bulletin of Sect. of Logic Polish Academy of Sci., no. 9 (1980): 131-135.
|
|
"On a generalization of the game Go–Moku II." Studia Mathematica Hungarica, no. 14 (1979): 461-469.
|
|
"On a generalization of the game Go–Moku I." Studia Mathematica Hungarica, no. 14 (1979): 209-226.
|
|
"On definability in Peano arithmetic." Polish Acad. Sci. Inst. Philos. Sociol. Bull. Sect. Logic 8, no. 3 (1979): 148-153.
|
|
"Nonstandard program runnings and correctness of programs." Mat. Lapok 30, no. 1-3 (1978): 81-125.
|
|
"Proof correct up to 99%." (1998).
|
|
Zero Knowledge Proofs., 2004.
|
|
Matematikai logika : egyetemi jegyzet. Budapest: Elte, 1994.
|
|
Multi-level Permission, Technical Report. Rutgers University: Dimacs, 1990.
|
|
An Algol–68 interpreter, Technical Report. Chicago: Univ. of Chicago, 1987.
|
|
Mathematical Logic, Lecture Notes. Montreal: MgGill University, 1985.
|