BibTeX records: Ildikó Sain

download as .bib file

@article{DBLP:journals/synthese/MikulasSS15,
  author       = {Szabolcs Mikul{\'{a}}s and
                  Ildik{\'{o}} Sain and
                  Andr{\'{a}}s Simon},
  title        = {Complexity of equational theory of relational algebras with standard
                  projection elements},
  journal      = {Synth.},
  volume       = {192},
  number       = {7},
  pages        = {2159--2182},
  year         = {2015},
  url          = {https://doi.org/10.1007/s11229-015-0689-1},
  doi          = {10.1007/S11229-015-0689-1},
  timestamp    = {Thu, 09 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/synthese/MikulasSS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igpl/Sain00,
  author       = {Ildik{\'{o}} Sain},
  title        = {On the Search for a Finitizable Algebraization of First Order Logic},
  journal      = {Log. J. {IGPL}},
  volume       = {8},
  number       = {4},
  pages        = {497--591},
  year         = {2000},
  url          = {https://doi.org/10.1093/jigpal/8.4.497},
  doi          = {10.1093/JIGPAL/8.4.497},
  timestamp    = {Fri, 06 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/igpl/Sain00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igpl/SainG97,
  author       = {Ildik{\'{o}} Sain and
                  Viktor Gyuris},
  title        = {Finite Schematizable Algebraic Logic},
  journal      = {Log. J. {IGPL}},
  volume       = {5},
  number       = {5},
  pages        = {699--751},
  year         = {1997},
  url          = {https://doi.org/10.1093/jigpal/5.5.699},
  doi          = {10.1093/JIGPAL/5.5.699},
  timestamp    = {Fri, 06 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/igpl/SainG97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igpl/NemetiSS95,
  author       = {Istv{\'{a}}n N{\'{e}}meti and
                  Ildik{\'{o}} Sain and
                  Andr{\'{a}}s Simon},
  title        = {Undecidability of the Equational Theory of Some Classes of Residuated
                  Boolean Algebras with Operators},
  journal      = {Log. J. {IGPL}},
  volume       = {3},
  number       = {1},
  pages        = {93--105},
  year         = {1995},
  url          = {https://doi.org/10.1093/jigpal/3.1.93},
  doi          = {10.1093/JIGPAL/3.1.93},
  timestamp    = {Fri, 06 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/igpl/NemetiSS95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jolli/KuruczNSS95,
  author       = {{\'{A}}gnes Kurucz and
                  Istv{\'{a}}n N{\'{e}}meti and
                  Ildik{\'{o}} Sain and
                  Andr{\'{a}}s Simon},
  title        = {Decidable and Undecidable Logics with a Binary Modality},
  journal      = {J. Log. Lang. Inf.},
  volume       = {4},
  number       = {3},
  pages        = {191--206},
  year         = {1995},
  url          = {https://doi.org/10.1007/BF01049412},
  doi          = {10.1007/BF01049412},
  timestamp    = {Thu, 17 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jolli/KuruczNSS95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/BiroS93,
  author       = {Bal{\'{a}}zs Bir{\'{o}} and
                  Ildik{\'{o}} Sain},
  title        = {Peano Arithmetic as Axiomatization of the Time Frame in Logics of
                  Programs and in Dynamic Logics},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {63},
  number       = {3},
  pages        = {201--225},
  year         = {1993},
  url          = {https://doi.org/10.1016/0168-0072(93)90148-7},
  doi          = {10.1016/0168-0072(93)90148-7},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/BiroS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igpl/KuruczNSS93,
  author       = {{\'{A}}gnes Kurucz and
                  Istv{\'{a}}n N{\'{e}}meti and
                  Ildik{\'{o}} Sain and
                  Andr{\'{a}}s Simon},
  title        = {Undecidable Varieties of Semilattice - ordered Semigroups, of Boolean
                  Algebras with Operators, and logics extending Lambek Calculus},
  journal      = {Log. J. {IGPL}},
  volume       = {1},
  number       = {1},
  pages        = {91--98},
  year         = {1993},
  url          = {https://doi.org/10.1093/jigpal/1.1.91},
  doi          = {10.1093/JIGPAL/1.1.91},
  timestamp    = {Fri, 06 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/igpl/KuruczNSS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/amast/AndrekaNS93,
  author       = {Hajnal Andr{\'{e}}ka and
                  Istv{\'{a}}n N{\'{e}}meti and
                  Ildik{\'{o}} Sain},
  editor       = {Maurice Nivat and
                  Charles Rattray and
                  Teodor Rus and
                  Giuseppe Scollo},
  title        = {Applying Algebraic Logic to Logic},
  booktitle    = {Algebraic Methodology and Software Technology {(AMAST} '93), Proceedings
                  of the Third International Conference on Methodology and Software
                  Technology, University of Twente, Enschede, The Netherlands, 21-25
                  June, 1993},
  series       = {Workshops in Computing},
  pages        = {5--26},
  publisher    = {Springer},
  year         = {1993},
  timestamp    = {Tue, 18 Feb 2003 11:00:12 +0100},
  biburl       = {https://dblp.org/rec/conf/amast/AndrekaNS93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sain92,
  author       = {Ildik{\'{o}} Sain},
  title        = {Temporal Logics Need Their Clocks},
  journal      = {Theor. Comput. Sci.},
  volume       = {95},
  number       = {1},
  pages        = {75--95},
  year         = {1992},
  url          = {https://doi.org/10.1016/0304-3975(92)90067-P},
  doi          = {10.1016/0304-3975(92)90067-P},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Sain92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AndrekaNS91,
  author       = {Hajnal Andr{\'{e}}ka and
                  Istv{\'{a}}n N{\'{e}}meti and
                  Ildik{\'{o}} Sain},
  title        = {On the Strength of Temporal Proofs},
  journal      = {Theor. Comput. Sci.},
  volume       = {80},
  number       = {2},
  pages        = {125--151},
  year         = {1991},
  url          = {https://doi.org/10.1016/0304-3975(91)90386-G},
  doi          = {10.1016/0304-3975(91)90386-G},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AndrekaNS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/imycs/Sain90,
  author       = {Ildik{\'{o}} Sain},
  editor       = {J{\"{u}}rgen Dassow and
                  Jozef Kelemen},
  title        = {Past Proves More Invariance Properties but not PCA's},
  booktitle    = {Aspects and Prospects of Theoretical Computer Science, 6th International
                  Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November
                  19-23, 1990, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {464},
  pages        = {80--92},
  publisher    = {Springer},
  year         = {1990},
  url          = {https://doi.org/10.1007/3-540-53414-8\_31},
  doi          = {10.1007/3-540-53414-8\_31},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/imycs/Sain90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Sain90,
  author       = {Ildik{\'{o}} Sain},
  editor       = {Branislav Rovan},
  title        = {Results on the Glory of the Past},
  booktitle    = {Mathematical Foundations of Computer Science 1990, MFCS'90, Bansk{\'{a}}
                  Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {452},
  pages        = {478--484},
  publisher    = {Springer},
  year         = {1990},
  url          = {https://doi.org/10.1007/BFb0029645},
  doi          = {10.1007/BFB0029645},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/Sain90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ndjfl/Sain89,
  author       = {Ildik{\'{o}} Sain},
  title        = {An Elementary Proof for Some Semantic Characterizations of Nondeterministic
                  Floyd-Hoare Logic},
  journal      = {Notre Dame J. Formal Log.},
  volume       = {30},
  number       = {4},
  pages        = {563--573},
  year         = {1989},
  url          = {https://doi.org/10.1305/ndjfl/1093635239},
  doi          = {10.1305/NDJFL/1093635239},
  timestamp    = {Thu, 21 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ndjfl/Sain89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MakowskyS89,
  author       = {Johann A. Makowsky and
                  Ildik{\'{o}} Sain},
  title        = {Weak Second Order Characterizations of Various Program Verification
                  Systems},
  journal      = {Theor. Comput. Sci.},
  volume       = {66},
  number       = {3},
  pages        = {299--321},
  year         = {1989},
  url          = {https://doi.org/10.1016/0304-3975(89)90156-4},
  doi          = {10.1016/0304-3975(89)90156-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MakowskyS89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/PasztorS89,
  author       = {Ana Pasztor and
                  Ildik{\'{o}} Sain},
  editor       = {Egon B{\"{o}}rger and
                  Hans Kleine B{\"{u}}ning and
                  Michael M. Richter},
  title        = {A Streamlined Temporal Completeness Theorem},
  booktitle    = {{CSL} '89, 3rd Workshop on Computer Science Logic, Kaiserslautern,
                  Germany, October 2-6, 1989, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {440},
  pages        = {322--336},
  publisher    = {Springer},
  year         = {1989},
  url          = {https://doi.org/10.1007/3-540-52753-2\_48},
  doi          = {10.1007/3-540-52753-2\_48},
  timestamp    = {Tue, 14 May 2019 10:00:42 +0200},
  biburl       = {https://dblp.org/rec/conf/csl/PasztorS89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AndrekaNS89,
  author       = {Hajnal Andr{\'{e}}ka and
                  Istv{\'{a}}n N{\'{e}}meti and
                  Ildik{\'{o}} Sain},
  editor       = {Antoni Kreczmar and
                  Grazyna Mirkowska},
  title        = {On the Strength of Temporal Proofs},
  booktitle    = {Mathematical Foundations of Computer Science 1989, MFCS'89, Porabka-Kozubnik,
                  Poland, August 28 - September 1, 1989, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {379},
  pages        = {135--144},
  publisher    = {Springer},
  year         = {1989},
  url          = {https://doi.org/10.1007/3-540-51486-4\_61},
  doi          = {10.1007/3-540-51486-4\_61},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/AndrekaNS89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ndjfl/Sain88,
  author       = {Ildik{\'{o}} Sain},
  title        = {Concerning some cylindric algebra versions of the downward L{\"{o}}wenheim-Skolem
                  theorem},
  journal      = {Notre Dame J. Formal Log.},
  volume       = {29},
  number       = {3},
  pages        = {332--344},
  year         = {1988},
  url          = {https://doi.org/10.1305/ndjfl/1093637932},
  doi          = {10.1305/NDJFL/1093637932},
  timestamp    = {Thu, 21 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ndjfl/Sain88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sLogica/Sain88,
  author       = {Ildik{\'{o}} Sain},
  title        = {Is "some-other-time" sometimes better than "sometime"
                  for proving partial correctness of programs?},
  journal      = {Stud Logica},
  volume       = {47},
  number       = {3},
  pages        = {279--301},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF00370557},
  doi          = {10.1007/BF00370557},
  timestamp    = {Tue, 01 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/sLogica/Sain88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aluacs/Sain88,
  author       = {Ildik{\'{o}} Sain},
  editor       = {Clifford Bergman and
                  Roger D. Maddux and
                  Don Pigozzi},
  title        = {Beth's and Craig's properties via epimorphisms and amalgamation in
                  algebraic logic},
  booktitle    = {Algebraic Logic and Universal Algebra in Computer Science, Conference,
                  Ames, Iowa, USA, June 1-4, 1988, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {425},
  pages        = {209--225},
  publisher    = {Springer},
  year         = {1988},
  url          = {https://doi.org/10.1007/BFb0043086},
  doi          = {10.1007/BFB0043086},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/aluacs/Sain88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sain87,
  author       = {Ildik{\'{o}} Sain},
  title        = {Total Correctness in Nonstandard Logics of Programs},
  journal      = {Theor. Comput. Sci.},
  volume       = {50},
  pages        = {285--321},
  year         = {1987},
  url          = {https://doi.org/10.1016/0304-3975(87)90118-6},
  doi          = {10.1016/0304-3975(87)90118-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Sain87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/MakowskyS86,
  author       = {Johann A. Makowsky and
                  Ildik{\'{o}} Sain},
  title        = {On the Equivalence of Weak Second Order and Nonstandard Time Semantics
                  For Various Program Verification Systems},
  booktitle    = {Proceedings of the Symposium on Logic in Computer Science {(LICS}
                  '86), Cambridge, Massachusetts, USA, June 16-18, 1986},
  pages        = {293--300},
  publisher    = {{IEEE} Computer Society},
  year         = {1986},
  timestamp    = {Thu, 22 Jan 2015 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/MakowskyS86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sain85,
  author       = {Ildik{\'{o}} Sain},
  title        = {A Simple Proof for the Completeness of Floyd's Method},
  journal      = {Theor. Comput. Sci.},
  volume       = {35},
  pages        = {345--348},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90024-6},
  doi          = {10.1016/0304-3975(85)90024-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Sain85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lop/Sain85,
  author       = {Ildik{\'{o}} Sain},
  editor       = {Rohit Parikh},
  title        = {The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal
                  Logic) Program Verification Methods},
  booktitle    = {Logics of Programs, Conference, Brooklyn College, New York, NY, USA,
                  June 17-19, 1985, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {193},
  pages        = {302--342},
  publisher    = {Springer},
  year         = {1985},
  url          = {https://doi.org/10.1007/3-540-15648-8\_24},
  doi          = {10.1007/3-540-15648-8\_24},
  timestamp    = {Tue, 14 May 2019 10:00:52 +0200},
  biburl       = {https://dblp.org/rec/conf/lop/Sain85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/Sain84,
  author       = {Ildik{\'{o}} Sain},
  title        = {Structured Nonstandard Dynamic Logic},
  journal      = {Math. Log. Q.},
  volume       = {30},
  number       = {31},
  pages        = {481--497},
  year         = {1984},
  url          = {https://doi.org/10.1002/malq.19840303102},
  doi          = {10.1002/MALQ.19840303102},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mlq/Sain84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AndrekaNS82,
  author       = {Hajnal Andr{\'{e}}ka and
                  Istv{\'{a}}n N{\'{e}}meti and
                  Ildik{\'{o}} Sain},
  title        = {A Complete Logic for Reasoning about Programs via Nonstandard Model
                  Theory {I}},
  journal      = {Theor. Comput. Sci.},
  volume       = {17},
  pages        = {193--212},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90004-4},
  doi          = {10.1016/0304-3975(82)90004-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AndrekaNS82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AndrekaNS82a,
  author       = {Hajnal Andr{\'{e}}ka and
                  Istv{\'{a}}n N{\'{e}}meti and
                  Ildik{\'{o}} Sain},
  title        = {A Complete Logic for Reasoning about Programs via Nonstandard Model
                  Theory {II}},
  journal      = {Theor. Comput. Sci.},
  volume       = {17},
  pages        = {259--278},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90025-1},
  doi          = {10.1016/0304-3975(82)90025-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AndrekaNS82a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Sain81,
  author       = {Ildik{\'{o}} Sain},
  editor       = {Ferenc G{\'{e}}cseg},
  title        = {First Order Dynamic Logic with Decidable Proofs and Workable Model
                  Theory},
  booktitle    = {Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981
                  International FCT-Conference, Szeged, Hungary, August 24-28, 1981},
  series       = {Lecture Notes in Computer Science},
  volume       = {117},
  pages        = {334--340},
  publisher    = {Springer},
  year         = {1981},
  url          = {https://doi.org/10.1007/3-540-10854-8\_37},
  doi          = {10.1007/3-540-10854-8\_37},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/fct/Sain81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AndrekaNS81,
  author       = {Hajnal Andr{\'{e}}ka and
                  Istv{\'{a}}n N{\'{e}}meti and
                  Ildik{\'{o}} Sain},
  editor       = {Jozef Gruska and
                  Michal Chytil},
  title        = {A Characterization of Floyd-Provable Programs},
  booktitle    = {Mathematical Foundations of Computer Science 1981, Strbske Pleso,
                  Czechoslovakia, August 31 - September 4, 1981, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {118},
  pages        = {162--171},
  publisher    = {Springer},
  year         = {1981},
  url          = {https://doi.org/10.1007/3-540-10856-4\_82},
  doi          = {10.1007/3-540-10856-4\_82},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/AndrekaNS81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/AndrekaNS79,
  author       = {Hajnal Andr{\'{e}}ka and
                  Istv{\'{a}}n N{\'{e}}meti and
                  Ildik{\'{o}} Sain},
  editor       = {Lothar Budach},
  title        = {Henkin-type semantics for program-schemes to turn negative results
                  to positive},
  booktitle    = {Fundamentals of Computation Theory, {FCT} 1979, Proceedings of the
                  Conference on Algebraic, Arthmetic, and Categorial Methods in Computation
                  Theory, Berlin/Wendisch-Rietz, Germany, September 17-21, 1979},
  pages        = {18--24},
  publisher    = {Akademie-Verlag, Berlin},
  year         = {1979},
  timestamp    = {Mon, 29 Jul 2019 11:58:23 +0200},
  biburl       = {https://dblp.org/rec/conf/fct/AndrekaNS79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AndrekaNS79,
  author       = {Hajnal Andr{\'{e}}ka and
                  Istv{\'{a}}n N{\'{e}}meti and
                  Ildik{\'{o}} Sain},
  editor       = {Jir{\'{\i}} Becv{\'{a}}r},
  title        = {Completeness Problems in Verification of Programs and Program Schemes},
  booktitle    = {Mathematical Foundations of Computer Science 1979, Proceedings, 8th
                  Symposium, Olomouc, Czechoslovakia, September 3-7, 1979},
  series       = {Lecture Notes in Computer Science},
  volume       = {74},
  pages        = {208--218},
  publisher    = {Springer},
  year         = {1979},
  url          = {https://doi.org/10.1007/3-540-09526-8\_17},
  doi          = {10.1007/3-540-09526-8\_17},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/AndrekaNS79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics