BibTeX records: Marie van den Bogaard

download as .bib file

@article{DBLP:journals/lmcs/BriceBR23,
  author       = {L{\'{e}}onard Brice and
                  Marie van den Bogaard and
                  Jean{-}Fran{\c{c}}ois Raskin},
  title        = {Subgame-perfect Equilibria in Mean-payoff Games (journal version)},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {19},
  number       = {4},
  year         = {2023},
  url          = {https://doi.org/10.46298/lmcs-19(4:6)2023},
  doi          = {10.46298/LMCS-19(4:6)2023},
  timestamp    = {Tue, 23 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lmcs/BriceBR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BriceRB23,
  author       = {L{\'{e}}onard Brice and
                  Jean{-}Fran{\c{c}}ois Raskin and
                  Marie van den Bogaard},
  editor       = {J{\'{e}}r{\^{o}}me Leroux and
                  Sylvain Lombardy and
                  David Peleg},
  title        = {Rational Verification for Nash and Subgame-Perfect Equilibria in Graph
                  Games},
  booktitle    = {48th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
  series       = {LIPIcs},
  volume       = {272},
  pages        = {26:1--26:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2023.26},
  doi          = {10.4230/LIPICS.MFCS.2023.26},
  timestamp    = {Mon, 28 Aug 2023 15:00:20 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/BriceRB23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-12913,
  author       = {L{\'{e}}onard Brice and
                  Jean{-}Fran{\c{c}}ois Raskin and
                  Marie van den Bogaard},
  title        = {Rational verification and checking for Nash and subgame-perfect equilibria
                  in graph games},
  journal      = {CoRR},
  volume       = {abs/2301.12913},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2301.12913},
  doi          = {10.48550/ARXIV.2301.12913},
  eprinttype    = {arXiv},
  eprint       = {2301.12913},
  timestamp    = {Wed, 01 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2301-12913.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/BriceRB22,
  author       = {L{\'{e}}onard Brice and
                  Jean{-}Fran{\c{c}}ois Raskin and
                  Marie van den Bogaard},
  editor       = {Florin Manea and
                  Alex Simpson},
  title        = {On the Complexity of SPEs in Parity Games},
  booktitle    = {30th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2022,
                  February 14-19, 2022, G{\"{o}}ttingen, Germany (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {216},
  pages        = {10:1--10:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.CSL.2022.10},
  doi          = {10.4230/LIPICS.CSL.2022.10},
  timestamp    = {Thu, 27 Jan 2022 17:26:21 +0100},
  biburl       = {https://dblp.org/rec/conf/csl/BriceRB22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/DoyenB22,
  author       = {Laurent Doyen and
                  Marie van den Bogaard},
  editor       = {Alexander S. Kulikov and
                  Sofya Raskhodnikova},
  title        = {Bounds for Synchronizing Markov Decision Processes},
  booktitle    = {Computer Science - Theory and Applications - 17th International Computer
                  Science Symposium in Russia, {CSR} 2022, Virtual Event, June 29 -
                  July 1, 2022, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13296},
  pages        = {133--151},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-09574-0\_9},
  doi          = {10.1007/978-3-031-09574-0\_9},
  timestamp    = {Thu, 01 Dec 2022 15:24:22 +0100},
  biburl       = {https://dblp.org/rec/conf/csr/DoyenB22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BriceRB22,
  author       = {L{\'{e}}onard Brice and
                  Jean{-}Fran{\c{c}}ois Raskin and
                  Marie van den Bogaard},
  editor       = {Mikolaj Bojanczyk and
                  Emanuela Merelli and
                  David P. Woodruff},
  title        = {The Complexity of SPEs in Mean-Payoff Games},
  booktitle    = {49th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2022, July 4-8, 2022, Paris, France},
  series       = {LIPIcs},
  volume       = {229},
  pages        = {116:1--116:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2022.116},
  doi          = {10.4230/LIPICS.ICALP.2022.116},
  timestamp    = {Tue, 28 Jun 2022 15:52:51 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BriceRB22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-08499,
  author       = {L{\'{e}}onard Brice and
                  Jean{-}Fran{\c{c}}ois Raskin and
                  Marie van den Bogaard},
  title        = {The Complexity of SPEs in Mean-payoff Games},
  journal      = {CoRR},
  volume       = {abs/2202.08499},
  year         = {2022},
  url          = {https://arxiv.org/abs/2202.08499},
  eprinttype    = {arXiv},
  eprint       = {2202.08499},
  timestamp    = {Tue, 01 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2202-08499.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-08546,
  author       = {L{\'{e}}onard Brice and
                  Marie van den Bogaard and
                  Jean{-}Fran{\c{c}}ois Raskin},
  title        = {Subgame-perfect Equilibria in Mean-payoff Games (journal version)},
  journal      = {CoRR},
  volume       = {abs/2203.08546},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2203.08546},
  doi          = {10.48550/ARXIV.2203.08546},
  eprinttype    = {arXiv},
  eprint       = {2203.08546},
  timestamp    = {Mon, 28 Mar 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2203-08546.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-12814,
  author       = {Laurent Doyen and
                  Marie van den Bogaard},
  title        = {Bounds for Synchronizing Markov Decision Processes},
  journal      = {CoRR},
  volume       = {abs/2204.12814},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2204.12814},
  doi          = {10.48550/ARXIV.2204.12814},
  eprinttype    = {arXiv},
  eprint       = {2204.12814},
  timestamp    = {Fri, 29 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2204-12814.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BriceRB21,
  author       = {L{\'{e}}onard Brice and
                  Jean{-}Fran{\c{c}}ois Raskin and
                  Marie van den Bogaard},
  editor       = {Serge Haddad and
                  Daniele Varacca},
  title        = {Subgame-Perfect Equilibria in Mean-Payoff Games},
  booktitle    = {32nd International Conference on Concurrency Theory, {CONCUR} 2021,
                  August 24-27, 2021, Virtual Conference},
  series       = {LIPIcs},
  volume       = {203},
  pages        = {8:1--8:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.CONCUR.2021.8},
  doi          = {10.4230/LIPICS.CONCUR.2021.8},
  timestamp    = {Fri, 13 Aug 2021 16:29:32 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/BriceRB21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-10685,
  author       = {L{\'{e}}onard Brice and
                  Jean{-}Fran{\c{c}}ois Raskin and
                  Marie van den Bogaard},
  title        = {Subgame-perfect Equilibria in Mean-payoff Games},
  journal      = {CoRR},
  volume       = {abs/2101.10685},
  year         = {2021},
  url          = {https://arxiv.org/abs/2101.10685},
  eprinttype    = {arXiv},
  eprint       = {2101.10685},
  timestamp    = {Sun, 31 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2101-10685.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-07458,
  author       = {L{\'{e}}onard Brice and
                  Marie van den Bogaard and
                  Jean{-}Fran{\c{c}}ois Raskin},
  title        = {On the Complexity of SPEs in Parity Games},
  journal      = {CoRR},
  volume       = {abs/2107.07458},
  year         = {2021},
  url          = {https://arxiv.org/abs/2107.07458},
  eprinttype    = {arXiv},
  eprint       = {2107.07458},
  timestamp    = {Wed, 21 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2107-07458.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/BrihayeBGRB20,
  author       = {Thomas Brihaye and
                  V{\'{e}}ronique Bruy{\`{e}}re and
                  Aline Goeminne and
                  Jean{-}Fran{\c{c}}ois Raskin and
                  Marie van den Bogaard},
  title        = {The Complexity of Subgame Perfect Equilibria in Quantitative Reachability
                  Games},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {16},
  number       = {4},
  year         = {2020},
  url          = {https://lmcs.episciences.org/6883},
  timestamp    = {Wed, 16 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lmcs/BrihayeBGRB20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/BrihayeBGRB19,
  author       = {Thomas Brihaye and
                  V{\'{e}}ronique Bruy{\`{e}}re and
                  Aline Goeminne and
                  Jean{-}Fran{\c{c}}ois Raskin and
                  Marie van den Bogaard},
  editor       = {Wan J. Fokkink and
                  Rob van Glabbeek},
  title        = {The Complexity of Subgame Perfect Equilibria in Quantitative Reachability
                  Games},
  booktitle    = {30th International Conference on Concurrency Theory, {CONCUR} 2019,
                  August 27-30, 2019, Amsterdam, the Netherlands},
  series       = {LIPIcs},
  volume       = {140},
  pages        = {13:1--13:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.CONCUR.2019.13},
  doi          = {10.4230/LIPICS.CONCUR.2019.13},
  timestamp    = {Mon, 18 May 2020 10:45:19 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/BrihayeBGRB19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fossacs/CadilhacPB19,
  author       = {Micha{\"{e}}l Cadilhac and
                  Guillermo A. P{\'{e}}rez and
                  Marie van den Bogaard},
  editor       = {Mikolaj Bojanczyk and
                  Alex Simpson},
  title        = {The Impatient May Use Limited Optimism to Minimize Regret},
  booktitle    = {Foundations of Software Science and Computation Structures - 22nd
                  International Conference, {FOSSACS} 2019, Held as Part of the European
                  Joint Conferences on Theory and Practice of Software, {ETAPS} 2019,
                  Prague, Czech Republic, April 6-11, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11425},
  pages        = {133--149},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-17127-8\_8},
  doi          = {10.1007/978-3-030-17127-8\_8},
  timestamp    = {Thu, 08 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/fossacs/CadilhacPB19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00784,
  author       = {Thomas Brihaye and
                  V{\'{e}}ronique Bruy{\`{e}}re and
                  Aline Goeminne and
                  Jean{-}Fran{\c{c}}ois Raskin and
                  Marie van den Bogaard},
  title        = {The Complexity of Subgame Perfect Equilibria in Quantitative Reachability
                  Games (full version)},
  journal      = {CoRR},
  volume       = {abs/1905.00784},
  year         = {2019},
  url          = {http://arxiv.org/abs/1905.00784},
  eprinttype    = {arXiv},
  eprint       = {1905.00784},
  timestamp    = {Mon, 27 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1905-00784.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/BerwangerMB18,
  author       = {Dietmar Berwanger and
                  Anup Basil Mathew and
                  Marie van den Bogaard},
  title        = {Hierarchical information and the synthesis of distributed strategies},
  journal      = {Acta Informatica},
  volume       = {55},
  number       = {8},
  pages        = {669--701},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00236-017-0306-5},
  doi          = {10.1007/S00236-017-0306-5},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/BerwangerMB18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BerwangerB18,
  author       = {Dietmar Berwanger and
                  Marie van den Bogaard},
  title        = {Consensus Game Acceptors and Iterated Transductions},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {29},
  number       = {2},
  pages        = {165--186},
  year         = {2018},
  url          = {https://doi.org/10.1142/S0129054118400026},
  doi          = {10.1142/S0129054118400026},
  timestamp    = {Wed, 18 Apr 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/BerwangerB18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/BassetJPRB18,
  author       = {Nicolas Basset and
                  Isma{\"{e}}l Jecker and
                  Arno Pauly and
                  Jean{-}Fran{\c{c}}ois Raskin and
                  Marie van den Bogaard},
  editor       = {Dan R. Ghica and
                  Achim Jung},
  title        = {Beyond Admissibility: Dominance Between Chains of Strategies},
  booktitle    = {27th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2018,
                  September 4-7, 2018, Birmingham, {UK}},
  series       = {LIPIcs},
  volume       = {119},
  pages        = {10:1--10:22},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.CSL.2018.10},
  doi          = {10.4230/LIPICS.CSL.2018.10},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/csl/BassetJPRB18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-11608,
  author       = {Nicolas Basset and
                  Isma{\"{e}}l Jecker and
                  Arno Pauly and
                  Jean{-}Fran{\c{c}}ois Raskin and
                  Marie van den Bogaard},
  title        = {Beyond admissibility: Dominance between chains of strategies},
  journal      = {CoRR},
  volume       = {abs/1805.11608},
  year         = {2018},
  url          = {http://arxiv.org/abs/1805.11608},
  eprinttype    = {arXiv},
  eprint       = {1805.11608},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1805-11608.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-07146,
  author       = {Micha{\"{e}}l Cadilhac and
                  Guillermo A. P{\'{e}}rez and
                  Marie van den Bogaard},
  title        = {The Impatient May Use Limited Optimism to Minimize Regret},
  journal      = {CoRR},
  volume       = {abs/1811.07146},
  year         = {2018},
  url          = {http://arxiv.org/abs/1811.07146},
  eprinttype    = {arXiv},
  eprint       = {1811.07146},
  timestamp    = {Thu, 08 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-07146.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/hal/VanDenBogaard16,
  author       = {Marie van den Bogaard},
  title        = {Motifs de flot d'Information dans les jeux {\`{a}} information imparfaite.
                  (Information-flow Patterns in Games with Imperfect Information)},
  school       = {University of Paris-Saclay, France},
  year         = {2016},
  url          = {https://tel.archives-ouvertes.fr/tel-01417182},
  timestamp    = {Tue, 21 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/hal/VanDenBogaard16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atva/BerwangerMB15,
  author       = {Dietmar Berwanger and
                  Anup Basil Mathew and
                  Marie van den Bogaard},
  editor       = {Bernd Finkbeiner and
                  Geguang Pu and
                  Lijun Zhang},
  title        = {Hierarchical Information Patterns and Distributed Strategy Synthesis},
  booktitle    = {Automated Technology for Verification and Analysis - 13th International
                  Symposium, {ATVA} 2015, Shanghai, China, October 12-15, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9364},
  pages        = {378--393},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-24953-7\_28},
  doi          = {10.1007/978-3-319-24953-7\_28},
  timestamp    = {Tue, 14 May 2019 10:00:49 +0200},
  biburl       = {https://dblp.org/rec/conf/atva/BerwangerMB15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/BerwangerB15,
  author       = {Dietmar Berwanger and
                  Marie van den Bogaard},
  editor       = {Igor Potapov},
  title        = {Consensus Game Acceptors},
  booktitle    = {Developments in Language Theory - 19th International Conference, {DLT}
                  2015, Liverpool, UK, July 27-30, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9168},
  pages        = {108--119},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-21500-6\_8},
  doi          = {10.1007/978-3-319-21500-6\_8},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/dlt/BerwangerB15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BerwangerB15,
  author       = {Dietmar Berwanger and
                  Marie van den Bogaard},
  editor       = {Prahladh Harsha and
                  G. Ramalingam},
  title        = {Games with Delays - {A} Frankenstein Approach},
  booktitle    = {35th {IARCS} Annual Conference on Foundation of Software Technology
                  and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
                  Bangalore, India},
  series       = {LIPIcs},
  volume       = {45},
  pages        = {307--319},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2015},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.307},
  doi          = {10.4230/LIPICS.FSTTCS.2015.307},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/BerwangerB15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerwangerB15,
  author       = {Dietmar Berwanger and
                  Marie van den Bogaard},
  title        = {A Characterisation of Context-Sensitive Languages by Consensus Games},
  journal      = {CoRR},
  volume       = {abs/1501.07131},
  year         = {2015},
  url          = {http://arxiv.org/abs/1501.07131},
  eprinttype    = {arXiv},
  eprint       = {1501.07131},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BerwangerB15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerwangerMB15,
  author       = {Dietmar Berwanger and
                  Anup Basil Mathew and
                  Marie van den Bogaard},
  title        = {Hierarchical Information Patterns and Distributed Strategy Synthesis},
  journal      = {CoRR},
  volume       = {abs/1506.03883},
  year         = {2015},
  url          = {http://arxiv.org/abs/1506.03883},
  eprinttype    = {arXiv},
  eprint       = {1506.03883},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BerwangerMB15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerwangerB15a,
  author       = {Dietmar Berwanger and
                  Marie van den Bogaard},
  title        = {Games with Delays. {A} Frankenstein Approach},
  journal      = {CoRR},
  volume       = {abs/1506.03885},
  year         = {2015},
  url          = {http://arxiv.org/abs/1506.03885},
  eprinttype    = {arXiv},
  eprint       = {1506.03885},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BerwangerB15a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics