BibTeX records: Paul E. Schupp

download as .bib file

@article{DBLP:journals/computability/MiasnikovS17,
  author       = {Alexei Miasnikov and
                  Paul E. Schupp},
  title        = {Computational complexity and the conjugacy problem},
  journal      = {Comput.},
  volume       = {6},
  number       = {4},
  pages        = {307--318},
  year         = {2017},
  url          = {https://doi.org/10.3233/COM-160060},
  doi          = {10.3233/COM-160060},
  timestamp    = {Thu, 24 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/computability/MiasnikovS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/JockuschS17,
  author       = {Carl G. Jockusch Jr. and
                  Paul E. Schupp},
  editor       = {Adam R. Day and
                  Michael R. Fellows and
                  Noam Greenberg and
                  Bakhadyr Khoussainov and
                  Alexander G. Melnikov and
                  Frances A. Rosamond},
  title        = {Asymptotic Density and the Theory of Computability: {A} Partial Survey},
  booktitle    = {Computability and Complexity - Essays Dedicated to Rodney G. Downey
                  on the Occasion of His 60th Birthday},
  series       = {Lecture Notes in Computer Science},
  volume       = {10010},
  pages        = {501--520},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-50062-1\_30},
  doi          = {10.1007/978-3-319-50062-1\_30},
  timestamp    = {Sun, 25 Oct 2020 23:08:30 +0100},
  biburl       = {https://dblp.org/rec/conf/birthday/JockuschS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computability/HirschfeldtJMS16,
  author       = {Denis R. Hirschfeldt and
                  Carl G. Jockusch Jr. and
                  Timothy H. McNicholl and
                  Paul E. Schupp},
  title        = {Asymptotic density and the coarse computability bound},
  journal      = {Comput.},
  volume       = {5},
  number       = {1},
  pages        = {13--27},
  year         = {2016},
  url          = {https://doi.org/10.3233/COM-150035},
  doi          = {10.3233/COM-150035},
  timestamp    = {Thu, 24 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/computability/HirschfeldtJMS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/HirschfeldtJKS16,
  author       = {Denis R. Hirschfeldt and
                  Carl G. Jockusch Jr. and
                  Rutger Kuyper and
                  Paul E. Schupp},
  title        = {Coarse Reducibility and Algorithmic Randomness},
  journal      = {J. Symb. Log.},
  volume       = {81},
  number       = {3},
  pages        = {1028--1046},
  year         = {2016},
  url          = {https://doi.org/10.1017/jsl.2015.70},
  doi          = {10.1017/JSL.2015.70},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsyml/HirschfeldtJKS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/DowneyJMS15,
  author       = {Rod Downey and
                  Carl G. Jockusch Jr. and
                  Timothy H. McNicholl and
                  Paul E. Schupp},
  title        = {Asymptotic density and the Ershov hierarchy},
  journal      = {Math. Log. Q.},
  volume       = {61},
  number       = {3},
  pages        = {189--195},
  year         = {2015},
  url          = {https://doi.org/10.1002/malq.201300081},
  doi          = {10.1002/MALQ.201300081},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mlq/DowneyJMS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ceccherini-Silberstein15,
  author       = {Tullio Ceccherini{-}Silberstein and
                  Michel Coornaert and
                  Francesca Fiorenzi and
                  Paul E. Schupp and
                  Nicholas W. M. Touikan},
  title        = {Multipass automata and group word problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {600},
  pages        = {19--33},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2015.06.054},
  doi          = {10.1016/J.TCS.2015.06.054},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ceccherini-Silberstein15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Ceccherini-SilbersteinCFS14,
  author       = {Tullio Ceccherini{-}Silberstein and
                  Michel Coornaert and
                  Francesca Fiorenzi and
                  Paul E. Schupp},
  title        = {Multipass automata and group word problems},
  journal      = {CoRR},
  volume       = {abs/1404.7442},
  year         = {2014},
  url          = {http://arxiv.org/abs/1404.7442},
  eprinttype    = {arXiv},
  eprint       = {1404.7442},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Ceccherini-SilbersteinCFS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jml/DowneyJS13,
  author       = {Rodney G. Downey and
                  Carl G. Jockusch Jr. and
                  Paul E. Schupp},
  title        = {Asymptotic density and computably Enumerable Sets},
  journal      = {J. Math. Log.},
  volume       = {13},
  number       = {2},
  pages        = {1350005},
  year         = {2013},
  url          = {https://doi.org/10.1142/S0219061313500050},
  doi          = {10.1142/S0219061313500050},
  timestamp    = {Fri, 18 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jml/DowneyJS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Ceccherini-SilbersteinCFS12,
  author       = {Tullio Ceccherini{-}Silberstein and
                  Michel Coornaert and
                  Francesca Fiorenzi and
                  Paul E. Schupp},
  title        = {Groups, graphs, languages, automata, games and second-order monadic
                  logic},
  journal      = {Eur. J. Comb.},
  volume       = {33},
  number       = {7},
  pages        = {1330--1368},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.ejc.2012.03.010},
  doi          = {10.1016/J.EJC.2012.03.010},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/Ceccherini-SilbersteinCFS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlms/JockuschS12,
  author       = {Carl G. Jockusch Jr. and
                  Paul E. Schupp},
  title        = {Generic computability, Turing degrees, and asymptotic density},
  journal      = {J. Lond. Math. Soc.},
  volume       = {85},
  number       = {2},
  pages        = {472--490},
  year         = {2012},
  url          = {https://doi.org/10.1112/jlms/jdr051},
  doi          = {10.1112/JLMS/JDR051},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jlms/JockuschS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-3108,
  author       = {Tullio Ceccherini{-}Silberstein and
                  Michel Coornaert and
                  Francesca Fiorenzi and
                  Paul E. Schupp},
  title        = {Groups, Graphs, Languages, Automata, Games and Second-order Monadic
                  Logic},
  journal      = {CoRR},
  volume       = {abs/1201.3108},
  year         = {2012},
  url          = {http://arxiv.org/abs/1201.3108},
  eprinttype    = {arXiv},
  eprint       = {1201.3108},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1201-3108.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GurevichS07,
  author       = {Yuri Gurevich and
                  Paul E. Schupp},
  title        = {Membership Problem for the Modular Group},
  journal      = {{SIAM} J. Comput.},
  volume       = {37},
  number       = {2},
  pages        = {425--459},
  year         = {2007},
  url          = {https://doi.org/10.1137/050643295},
  doi          = {10.1137/050643295},
  timestamp    = {Wed, 22 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/GurevichS07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0706-4095,
  author       = {Ilya Kapovich and
                  Paul E. Schupp},
  title        = {Some Quantitative Aspects of Fractional Computability},
  journal      = {CoRR},
  volume       = {abs/0706.4095},
  year         = {2007},
  url          = {http://arxiv.org/abs/0706.4095},
  eprinttype    = {arXiv},
  eprint       = {0706.4095},
  timestamp    = {Wed, 22 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0706-4095.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-GR-0303386,
  author       = {Ilya Kapovich and
                  Paul E. Schupp and
                  Vladimir Shpilrain},
  title        = {Generic properties of Whitehead's Algorithm, stabilizers in Aut(F\({}_{\mbox{k}}\))
                  and one-relator groups},
  journal      = {CoRR},
  volume       = {math.GR/0303386},
  year         = {2003},
  url          = {http://arxiv.org/abs/math/0303386},
  timestamp    = {Wed, 22 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/math-GR-0303386.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-GR-0203239,
  author       = {Ilya Kapovich and
                  Alexei G. Myasnikov and
                  Paul E. Schupp and
                  Vladimir Shpilrain},
  title        = {Generic-case complexity, decision problems in group theory and random
                  walks},
  journal      = {CoRR},
  volume       = {math.GR/0203239},
  year         = {2002},
  url          = {https://arxiv.org/abs/math/0203239},
  timestamp    = {Wed, 22 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/math-GR-0203239.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-GR-0206273,
  author       = {Ilya Kapovich and
                  Alexei G. Myasnikov and
                  Paul E. Schupp and
                  Vladimir Shpilrain},
  title        = {Average-case complexity and decision problems in group theory},
  journal      = {CoRR},
  volume       = {math.GR/0206273},
  year         = {2002},
  url          = {https://arxiv.org/abs/math/0206273},
  timestamp    = {Wed, 22 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/math-GR-0206273.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Schupp98,
  author       = {Paul E. Schupp},
  title        = {On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite
                  Quotients of the Modular Group},
  journal      = {Theor. Comput. Sci.},
  volume       = {204},
  number       = {1-2},
  pages        = {233--248},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0304-3975(98)00041-3},
  doi          = {10.1016/S0304-3975(98)00041-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Schupp98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MullerS95,
  author       = {David E. Muller and
                  Paul E. Schupp},
  title        = {Simulating Alternating Tree Automata by Nondeterministic Automata:
                  New Results and New Proofs of the Theorems of Rabin, McNaughton and
                  Safra},
  journal      = {Theor. Comput. Sci.},
  volume       = {141},
  number       = {1{\&}2},
  pages        = {69--107},
  year         = {1995},
  url          = {https://doi.org/10.1016/0304-3975(94)00214-4},
  doi          = {10.1016/0304-3975(94)00214-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MullerS95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/SaoudiMS92,
  author       = {Ahmed Saoudi and
                  David E. Muller and
                  Paul E. Schupp},
  title        = {Finite State Processes, Z-Temporal Logic and the Monadic Theory of
                  the Integers},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {3},
  number       = {3},
  pages        = {233--244},
  year         = {1992},
  url          = {https://doi.org/10.1142/S0129054192000152},
  doi          = {10.1142/S0129054192000152},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/SaoudiMS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MullerSS92,
  author       = {David E. Muller and
                  Ahmed Saoudi and
                  Paul E. Schupp},
  title        = {Alternating Automata, the Weak Monadic Theory of Trees and its Complexity},
  journal      = {Theor. Comput. Sci.},
  volume       = {97},
  number       = {2},
  pages        = {233--244},
  year         = {1992},
  url          = {https://doi.org/10.1016/0304-3975(92)90076-R},
  doi          = {10.1016/0304-3975(92)90076-R},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MullerSS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icci/MullerSS92,
  author       = {David E. Muller and
                  Paul E. Schupp and
                  Ahmed Saoudi},
  editor       = {Waldemar W. Koczkodaj and
                  Peter E. Lauer and
                  Anestis A. Toptsis},
  title        = {On the Decidability of the Linear Z-Temporal Logic and the Monadic
                  Second Order Theory},
  booktitle    = {Computing and Information - ICCI'92, Fourth International Conference
                  on Computing and Information, Toronto, Ontario, Canada, May 28-30,
                  1992, Proceedings},
  pages        = {2--5},
  publisher    = {{IEEE} Computer Society},
  year         = {1992},
  timestamp    = {Mon, 15 Apr 2002 13:14:05 +0200},
  biburl       = {https://dblp.org/rec/conf/icci/MullerSS92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/SaoudiMS90,
  author       = {Ahmed Saoudi and
                  David E. Muller and
                  Paul E. Schupp},
  title        = {On the Complexity of omega-Tree Sets and Nerode Theorem},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {1},
  number       = {1},
  pages        = {11--22},
  year         = {1990},
  url          = {https://doi.org/10.1142/S0129054190000035},
  doi          = {10.1142/S0129054190000035},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/SaoudiMS90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/MullerSS88,
  author       = {David E. Muller and
                  Ahmed Saoudi and
                  Paul E. Schupp},
  title        = {Weak Alternating Automata Give a Simple Explanation of Why Most Temporal
                  and Dynamic Logics are Decidable in Exponential Time},
  booktitle    = {Proceedings of the Third Annual Symposium on Logic in Computer Science
                  {(LICS} '88), Edinburgh, Scotland, UK, July 5-8, 1988},
  pages        = {422--427},
  publisher    = {{IEEE} Computer Society},
  year         = {1988},
  url          = {https://doi.org/10.1109/LICS.1988.5139},
  doi          = {10.1109/LICS.1988.5139},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/MullerSS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MullerS87,
  author       = {David E. Muller and
                  Paul E. Schupp},
  title        = {Alternating Automata on Infinite Trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {54},
  pages        = {267--276},
  year         = {1987},
  url          = {https://doi.org/10.1016/0304-3975(87)90133-2},
  doi          = {10.1016/0304-3975(87)90133-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MullerS87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MullerSS86,
  author       = {David E. Muller and
                  Ahmed Saoudi and
                  Paul E. Schupp},
  editor       = {Laurent Kott},
  title        = {Alternating Automata. The Weak Monadic Theory of the Tree, and its
                  Complexity},
  booktitle    = {Automata, Languages and Programming, 13th International Colloquium,
                  ICALP86, Rennes, France, July 15-19, 1986, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {226},
  pages        = {275--283},
  publisher    = {Springer},
  year         = {1986},
  url          = {https://doi.org/10.1007/3-540-16761-7\_77},
  doi          = {10.1007/3-540-16761-7\_77},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/MullerSS86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/PerrinS86,
  author       = {Dominique Perrin and
                  Paul E. Schupp},
  title        = {Automata on the Integers, Recurrence Distinguishability, and the Equivalence
                  and Decidability of Monadic Theories},
  booktitle    = {Proceedings of the Symposium on Logic in Computer Science {(LICS}
                  '86), Cambridge, Massachusetts, USA, June 16-18, 1986},
  pages        = {301--304},
  publisher    = {{IEEE} Computer Society},
  year         = {1986},
  timestamp    = {Thu, 22 Jan 2015 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/PerrinS86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/litp/Schupp86,
  author       = {Paul E. Schupp},
  editor       = {Christian Choffrut},
  title        = {Arrays, Automata and Groups: Some Interconnections},
  booktitle    = {Automata Networks, {LITP} Spring School on Theoretical Computer Science,
                  Angel{\`{e}}s-Village, France, May 12-16, 1986, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {316},
  pages        = {19--28},
  publisher    = {Springer},
  year         = {1986},
  url          = {https://doi.org/10.1007/3-540-19444-4\_11},
  doi          = {10.1007/3-540-19444-4\_11},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/litp/Schupp86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MullerS85,
  author       = {David E. Muller and
                  Paul E. Schupp},
  title        = {The Theory of Ends, Pushdown Automata, and Second-Order Logic},
  journal      = {Theor. Comput. Sci.},
  volume       = {37},
  pages        = {51--75},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90087-8},
  doi          = {10.1016/0304-3975(85)90087-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MullerS85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PerrinS84,
  author       = {Dominique Perrin and
                  Paul E. Schupp},
  title        = {Sur les Monoides {\`{A}} un Relateur qui sont des Groupes},
  journal      = {Theor. Comput. Sci.},
  volume       = {33},
  pages        = {331--334},
  year         = {1984},
  url          = {https://doi.org/10.1016/0304-3975(84)90094-X},
  doi          = {10.1016/0304-3975(84)90094-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PerrinS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/litp/MullerS84,
  author       = {David E. Muller and
                  Paul E. Schupp},
  editor       = {Maurice Nivat and
                  Dominique Perrin},
  title        = {Alternating automata on infinite objects, determinacy and Rabin's
                  theorem},
  booktitle    = {Automata on Infinite Words, Ecole de Printemps d'Informatique Th{\'{e}}orique,
                  Le Mont Dore, France, May 14-18, 1984},
  series       = {Lecture Notes in Computer Science},
  volume       = {192},
  pages        = {100--107},
  publisher    = {Springer},
  year         = {1984},
  url          = {https://doi.org/10.1007/3-540-15641-0\_27},
  doi          = {10.1007/3-540-15641-0\_27},
  timestamp    = {Fri, 17 Jul 2020 16:12:48 +0200},
  biburl       = {https://dblp.org/rec/conf/litp/MullerS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MullerS83,
  author       = {David E. Muller and
                  Paul E. Schupp},
  title        = {Groups, the Theory of Ends, and Context-Free Languages},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {26},
  number       = {3},
  pages        = {295--310},
  year         = {1983},
  url          = {https://doi.org/10.1016/0022-0000(83)90003-X},
  doi          = {10.1016/0022-0000(83)90003-X},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/MullerS83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MullerS81,
  author       = {David E. Muller and
                  Paul E. Schupp},
  title        = {Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability
                  Problems},
  booktitle    = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
                  May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
  pages        = {46--54},
  publisher    = {{ACM}},
  year         = {1981},
  url          = {https://doi.org/10.1145/800076.802456},
  doi          = {10.1145/800076.802456},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/MullerS81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics