BibTeX records: Dani Dorfman

download as .bib file

@inproceedings{DBLP:conf/icalp/DorfmanKZ19,
  author    = {Dani Dorfman and
               Haim Kaplan and
               Uri Zwick},
  editor    = {Christel Baier and
               Ioannis Chatzigiannakis and
               Paola Flocchini and
               Stefano Leonardi},
  title     = {A Faster Deterministic Exponential Time Algorithm for Energy Games
               and Mean Payoff Games},
  booktitle = {46th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2019, July 9-12, 2019, Patras, Greece},
  series    = {LIPIcs},
  volume    = {132},
  pages     = {114:1--114:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2019.114},
  doi       = {10.4230/LIPIcs.ICALP.2019.114},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/icalp/DorfmanKZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DorfmanK0PZ18,
  author    = {Dani Dorfman and
               Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Seth Pettie and
               Uri Zwick},
  editor    = {Yossi Azar and
               Hannah Bast and
               Grzegorz Herman},
  title     = {Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary
               Search Trees},
  booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
               2018, Helsinki, Finland},
  series    = {LIPIcs},
  volume    = {112},
  pages     = {24:1--24:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.ESA.2018.24},
  doi       = {10.4230/LIPIcs.ESA.2018.24},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/esa/DorfmanK0PZ18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DorfmanK0Z18,
  author    = {Dani Dorfman and
               Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Uri Zwick},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Pairing heaps: the forward variant},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {13:1--13:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.13},
  doi       = {10.4230/LIPIcs.MFCS.2018.13},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/DorfmanK0Z18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-08692,
  author    = {Dani Dorfman and
               Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Seth Pettie and
               Uri Zwick},
  title     = {Improved bounds for multipass pairing heaps and path-balanced binary
               search trees},
  journal   = {CoRR},
  volume    = {abs/1806.08692},
  year      = {2018},
  url       = {http://arxiv.org/abs/1806.08692},
  archivePrefix = {arXiv},
  eprint    = {1806.08692},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1806-08692.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-01152,
  author    = {Dani Dorfman and
               Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Uri Zwick},
  title     = {Pairing heaps: the forward variant},
  journal   = {CoRR},
  volume    = {abs/1709.01152},
  year      = {2017},
  url       = {http://arxiv.org/abs/1709.01152},
  archivePrefix = {arXiv},
  eprint    = {1709.01152},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1709-01152.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics