BibTeX records: Uri Zwick

download as .bib file

@inproceedings{DBLP:conf/soda/BrakensiekHPZ21,
  author    = {Joshua Brakensiek and
               Neng Huang and
               Aaron Potechin and
               Uri Zwick},
  editor    = {D{\'{a}}niel Marx},
  title     = {On the Mysteries of {MAX} {NAE-SAT}},
  booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
               {SODA} 2021, Virtual Conference, January 10 - 13, 2021},
  pages     = {484--503},
  publisher = {{SIAM}},
  year      = {2021},
  url       = {https://doi.org/10.1137/1.9781611976465.30},
  doi       = {10.1137/1.9781611976465.30},
  timestamp = {Thu, 15 Jul 2021 13:48:55 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/BrakensiekHPZ21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FischerOZ20,
  author    = {Orr Fischer and
               Rotem Oshman and
               Uri Zwick},
  title     = {Public vs. private randomness in simultaneous multi-party communication
               complexity},
  journal   = {Theor. Comput. Sci.},
  volume    = {810},
  pages     = {72--81},
  year      = {2020},
  url       = {https://doi.org/10.1016/j.tcs.2018.04.032},
  doi       = {10.1016/j.tcs.2018.04.032},
  timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/FischerOZ20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-10677,
  author    = {Joshua Brakensiek and
               Neng Huang and
               Aaron Potechin and
               Uri Zwick},
  title     = {On the Mysteries of {MAX} {NAE-SAT}},
  journal   = {CoRR},
  volume    = {abs/2009.10677},
  year      = {2020},
  url       = {https://arxiv.org/abs/2009.10677},
  archivePrefix = {arXiv},
  eprint    = {2009.10677},
  timestamp = {Wed, 23 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2009-10677.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlstrupKTZ19,
  author    = {Stephen Alstrup and
               Haim Kaplan and
               Mikkel Thorup and
               Uri Zwick},
  title     = {Adjacency Labeling Schemes and Induced-Universal Graphs},
  journal   = {{SIAM} J. Discret. Math.},
  volume    = {33},
  number    = {1},
  pages     = {116--137},
  year      = {2019},
  url       = {https://doi.org/10.1137/16M1105967},
  doi       = {10.1137/16M1105967},
  timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamdm/AlstrupKTZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HolmKTZZ19,
  author    = {Jacob Holm and
               Valerie King and
               Mikkel Thorup and
               Or Zamir and
               Uri Zwick},
  editor    = {David Zuckerman},
  title     = {Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges},
  booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2019, Baltimore, Maryland, USA, November 9-12, 2019},
  pages     = {896--909},
  publisher = {{IEEE} Computer Society},
  year      = {2019},
  url       = {https://doi.org/10.1109/FOCS.2019.00058},
  doi       = {10.1109/FOCS.2019.00058},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/focs/HolmKTZZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ThorupZZ19,
  author    = {Mikkel Thorup and
               Or Zamir and
               Uri Zwick},
  editor    = {Christel Baier and
               Ioannis Chatzigiannakis and
               Paola Flocchini and
               Stefano Leonardi},
  title     = {Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and
               Soft Heaps},
  booktitle = {46th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2019, July 9-12, 2019, Patras, Greece},
  series    = {LIPIcs},
  volume    = {132},
  pages     = {95:1--95:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2019.95},
  doi       = {10.4230/LIPIcs.ICALP.2019.95},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/icalp/ThorupZZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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 = {Mon, 08 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/DorfmanKZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Kaplan0ZZ19,
  author    = {Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Or Zamir and
               Uri Zwick},
  editor    = {Jeremy T. Fineman and
               Michael Mitzenmacher},
  title     = {Selection from Heaps, Row-Sorted Matrices, and {X+Y} Using Soft Heaps},
  booktitle = {2nd Symposium on Simplicity in Algorithms, {SOSA} 2019, January 8-9,
               2019, San Diego, CA, {USA}},
  series    = {{OASICS}},
  volume    = {69},
  pages     = {5:1--5:21},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/OASIcs.SOSA.2019.5},
  doi       = {10.4230/OASIcs.SOSA.2019.5},
  timestamp = {Thu, 11 Mar 2021 14:44:30 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/Kaplan0ZZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KaplanZZ19,
  author    = {Haim Kaplan and
               Or Zamir and
               Uri Zwick},
  editor    = {Timothy M. Chan},
  title     = {A sort of an adversary},
  booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  pages     = {1291--1310},
  publisher = {{SIAM}},
  year      = {2019},
  url       = {https://doi.org/10.1137/1.9781611975482.79},
  doi       = {10.1137/1.9781611975482.79},
  timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/KaplanZZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HansenKZZ19,
  author    = {Thomas Dueholm Hansen and
               Haim Kaplan and
               Or Zamir and
               Uri Zwick},
  editor    = {Moses Charikar and
               Edith Cohen},
  title     = {Faster \emph{k}-SAT algorithms using biased-PPSZ},
  booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
  pages     = {578--589},
  publisher = {{ACM}},
  year      = {2019},
  url       = {https://doi.org/10.1145/3313276.3316359},
  doi       = {10.1145/3313276.3316359},
  timestamp = {Sat, 22 Jun 2019 17:42:26 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/HansenKZZ19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-11147,
  author    = {Jacob Holm and
               Valerie King and
               Mikkel Thorup and
               Or Zamir and
               Uri Zwick},
  title     = {Random k-out subgraph leaves only O(n/k) inter-component edges},
  journal   = {CoRR},
  volume    = {abs/1909.11147},
  year      = {2019},
  url       = {http://arxiv.org/abs/1909.11147},
  archivePrefix = {arXiv},
  eprint    = {1909.11147},
  timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1909-11147.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-1802-07041,
  author    = {Haim Kaplan and
               L{\'{a}}szl{\'{o}} Kozma and
               Or Zamir and
               Uri Zwick},
  title     = {Selection from heaps, row-sorted matrices and {X+Y} using soft heaps},
  journal   = {CoRR},
  volume    = {abs/1802.07041},
  year      = {2018},
  url       = {http://arxiv.org/abs/1802.07041},
  archivePrefix = {arXiv},
  eprint    = {1802.07041},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1802-07041.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/talg/HansenKTZ17,
  author    = {Thomas Dueholm Hansen and
               Haim Kaplan and
               Robert E. Tarjan and
               Uri Zwick},
  title     = {Hollow Heaps},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {3},
  pages     = {42:1--42:27},
  year      = {2017},
  url       = {https://doi.org/10.1145/3093240},
  doi       = {10.1145/3093240},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/HansenKTZ17.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}
}
@article{DBLP:journals/siamcomp/RodittyZ16,
  author    = {Liam Roditty and
               Uri Zwick},
  title     = {A Fully Dynamic Reachability Algorithm for Directed Graphs with an
               Almost Linear Update Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {3},
  pages     = {712--733},
  year      = {2016},
  url       = {https://doi.org/10.1137/13093618X},
  doi       = {10.1137/13093618X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RodittyZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HansenZ16,
  author    = {Thomas Dueholm Hansen and
               Uri Zwick},
  editor    = {Ioannis Chatzigiannakis and
               Michael Mitzenmacher and
               Yuval Rabani and
               Davide Sangiorgi},
  title     = {Random-Edge Is Slower Than Random-Facet on Abstract Cubes},
  booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2016, July 11-15, 2016, Rome, Italy},
  series    = {LIPIcs},
  volume    = {55},
  pages     = {51:1--51:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2016},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2016.51},
  doi       = {10.4230/LIPIcs.ICALP.2016.51},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/icalp/HansenZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/FischerOZ16,
  author    = {Orr Fischer and
               Rotem Oshman and
               Uri Zwick},
  editor    = {Jukka Suomela},
  title     = {Public vs. Private Randomness in Simultaneous Multi-party Communication
               Complexity},
  booktitle = {Structural Information and Communication Complexity - 23rd International
               Colloquium, {SIROCCO} 2016, Helsinki, Finland, July 19-21, 2016, Revised
               Selected Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {9988},
  pages     = {60--74},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-3-319-48314-6\_5},
  doi       = {10.1007/978-3-319-48314-6\_5},
  timestamp = {Tue, 29 Dec 2020 18:39:44 +0100},
  biburl    = {https://dblp.org/rec/conf/sirocco/FischerOZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChechikKTZZ16,
  author    = {Shiri Chechik and
               Haim Kaplan and
               Mikkel Thorup and
               Or Zamir and
               Uri Zwick},
  editor    = {Nicolas Ollinger and
               Heribert Vollmer},
  title     = {Bottleneck Paths and Trees and Deterministic Graphical Games},
  booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
               2016, February 17-20, 2016, Orl{\'{e}}ans, France},
  series    = {LIPIcs},
  volume    = {47},
  pages     = {27:1--27:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2016},
  url       = {https://doi.org/10.4230/LIPIcs.STACS.2016.27},
  doi       = {10.4230/LIPIcs.STACS.2016.27},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/stacs/ChechikKTZZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/AlonYZ16,
  author    = {Noga Alon and
               Raphael Yuster and
               Uri Zwick},
  title     = {Color Coding},
  booktitle = {Encyclopedia of Algorithms},
  pages     = {335--338},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-1-4939-2864-4\_76},
  doi       = {10.1007/978-1-4939-2864-4\_76},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/reference/algo/AlonYZ16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WilsonZ15,
  author    = {David Bruce Wilson and
               Uri Zwick},
  title     = {A Forward-Backward Single-Source Shortest Paths Algorithm},
  journal   = {{SIAM} J. Comput.},
  volume    = {44},
  number    = {3},
  pages     = {698--739},
  year      = {2015},
  url       = {https://doi.org/10.1137/140970975},
  doi       = {10.1137/140970975},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/WilsonZ15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HansenKTZ15,
  author    = {Thomas Dueholm Hansen and
               Haim Kaplan and
               Robert Endre Tarjan and
               Uri Zwick},
  editor    = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Kazuo Iwama and
               Naoki Kobayashi and
               Bettina Speckmann},
  title     = {Hollow Heaps},
  booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
               {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {9134},
  pages     = {689--700},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-662-47672-7\_56},
  doi       = {10.1007/978-3-662-47672-7\_56},
  timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
  biburl    = {https://dblp.org/rec/conf/icalp/HansenKTZ15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KaplanZZ15,
  author    = {Haim Kaplan and
               Or Zamir and
               Uri Zwick},
  editor    = {Piotr Indyk},
  title     = {The amortized cost of finding the minimum},
  booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  pages     = {757--768},
  publisher = {{SIAM}},
  year      = {2015},
  url       = {https://doi.org/10.1137/1.9781611973730.51},
  doi       = {10.1137/1.9781611973730.51},
  timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/KaplanZZ15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HansenZ15,
  author    = {Thomas Dueholm Hansen and
               Uri Zwick},
  editor    = {Rocco A. Servedio and
               Ronitt Rubinfeld},
  title     = {An Improved Version of the Random-Facet Pivoting Rule for the Simplex
               Algorithm},
  booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
               of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
  pages     = {209--218},
  publisher = {{ACM}},
  year      = {2015},
  url       = {https://doi.org/10.1145/2746539.2746557},
  doi       = {10.1145/2746539.2746557},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/HansenZ15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlstrupKTZ15,
  author    = {Stephen Alstrup and
               Haim Kaplan and
               Mikkel Thorup and
               Uri Zwick},
  editor    = {Rocco A. Servedio and
               Ronitt Rubinfeld},
  title     = {Adjacency Labeling Schemes and Induced-Universal Graphs},
  booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
               of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
  pages     = {625--634},
  publisher = {{ACM}},
  year      = {2015},
  url       = {https://doi.org/10.1145/2746539.2746545},
  doi       = {10.1145/2746539.2746545},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/AlstrupKTZ15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HansenKTZ15,
  author    = {Thomas Dueholm Hansen and
               Haim Kaplan and
               Robert E. Tarjan and
               Uri Zwick},
  title     = {Hollow Heaps},
  journal   = {CoRR},
  volume    = {abs/1510.06535},
  year      = {2015},
  url       = {http://arxiv.org/abs/1510.06535},
  archivePrefix = {arXiv},
  eprint    = {1510.06535},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/HansenKTZ15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Ta-ShmaZ14,
  author    = {Amnon Ta{-}Shma and
               Uri Zwick},
  title     = {Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration
               Sequences},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {10},
  number    = {3},
  pages     = {12:1--12:15},
  year      = {2014},
  url       = {https://doi.org/10.1145/2601068},
  doi       = {10.1145/2601068},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/Ta-ShmaZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlstrupTGRZ14,
  author    = {Stephen Alstrup and
               Mikkel Thorup and
               Inge Li G{\o}rtz and
               Theis Rauhe and
               Uri Zwick},
  title     = {Union-Find with Constant Time Deletions},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {11},
  number    = {1},
  pages     = {6:1--6:28},
  year      = {2014},
  url       = {https://doi.org/10.1145/2636922},
  doi       = {10.1145/2636922},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/AlstrupTGRZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BjorklundPWZ14,
  author    = {Andreas Bj{\"{o}}rklund and
               Rasmus Pagh and
               Virginia Vassilevska Williams and
               Uri Zwick},
  editor    = {Javier Esparza and
               Pierre Fraigniaud and
               Thore Husfeldt and
               Elias Koutsoupias},
  title     = {Listing Triangles},
  booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
               {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
               {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {8572},
  pages     = {223--234},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-662-43948-7\_19},
  doi       = {10.1007/978-3-662-43948-7\_19},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/BjorklundPWZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HansenKZ14,
  author    = {Thomas Dueholm Hansen and
               Haim Kaplan and
               Uri Zwick},
  editor    = {Chandra Chekuri},
  title     = {Dantzig's pivoting rule for shortest paths, deterministic MDPs, and
               minimum cost to time ratio cycles},
  booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages     = {847--860},
  publisher = {{SIAM}},
  year      = {2014},
  url       = {https://doi.org/10.1137/1.9781611973402.63},
  doi       = {10.1137/1.9781611973402.63},
  timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/HansenKZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HansenPZ14,
  author    = {Thomas Dueholm Hansen and
               Mike Paterson and
               Uri Zwick},
  editor    = {Chandra Chekuri},
  title     = {Improved upper bounds for Random-Edge and Random-Jump on abstract
               cubes},
  booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages     = {874--881},
  publisher = {{SIAM}},
  year      = {2014},
  url       = {https://doi.org/10.1137/1.9781611973402.65},
  doi       = {10.1137/1.9781611973402.65},
  timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/HansenPZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlstrupKTZ14,
  author    = {Stephen Alstrup and
               Haim Kaplan and
               Mikkel Thorup and
               Uri Zwick},
  title     = {Adjacency labeling schemes and induced-universal graphs},
  journal   = {CoRR},
  volume    = {abs/1404.3391},
  year      = {2014},
  url       = {http://arxiv.org/abs/1404.3391},
  archivePrefix = {arXiv},
  eprint    = {1404.3391},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/AlstrupKTZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/WilsonZ14,
  author    = {David Bruce Wilson and
               Uri Zwick},
  title     = {A forward-backward single-source shortest paths algorithm},
  journal   = {CoRR},
  volume    = {abs/1405.7619},
  year      = {2014},
  url       = {http://arxiv.org/abs/1405.7619},
  archivePrefix = {arXiv},
  eprint    = {1405.7619},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/WilsonZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KaplanTZ14,
  author    = {Haim Kaplan and
               Robert Endre Tarjan and
               Uri Zwick},
  title     = {Fibonacci Heaps Revisited},
  journal   = {CoRR},
  volume    = {abs/1407.5750},
  year      = {2014},
  url       = {http://arxiv.org/abs/1407.5750},
  archivePrefix = {arXiv},
  eprint    = {1407.5750},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/KaplanTZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FriedmannHZ14,
  author    = {Oliver Friedmann and
               Thomas Dueholm Hansen and
               Uri Zwick},
  title     = {Random-Facet and Random-Bland require subexponential time even for
               shortest paths},
  journal   = {CoRR},
  volume    = {abs/1410.7530},
  year      = {2014},
  url       = {http://arxiv.org/abs/1410.7530},
  archivePrefix = {arXiv},
  eprint    = {1410.7530},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/FriedmannHZ14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FriedmannHZ14a,
  author    = {Oliver Friedmann and
               Thomas Dueholm Hansen and
               Uri Zwick},
  title     = {Errata for: {A} subexponential lower bound for the Random Facet algorithm
               for Parity Games},
  journal   = {CoRR},
  volume    = {abs/1410.7871},
  year      = {2014},
  url       = {http://arxiv.org/abs/1410.7871},
  archivePrefix = {arXiv},
  eprint    = {1410.7871},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/FriedmannHZ14a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HansenMZ13,
  author    = {Thomas Dueholm Hansen and
               Peter Bro Miltersen and
               Uri Zwick},
  title     = {Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based
               Stochastic Games with a Constant Discount Factor},
  journal   = {J. {ACM}},
  volume    = {60},
  number    = {1},
  pages     = {1:1--1:16},
  year      = {2013},
  url       = {https://doi.org/10.1145/2432622.2432623},
  doi       = {10.1145/2432622.2432623},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jacm/HansenMZ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PeresSSZ13,
  author    = {Yuval Peres and
               Dmitry Sotnikov and
               Benny Sudakov and
               Uri Zwick},
  title     = {All-pairs shortest paths in \emph{O}(\emph{n}\({}^{\mbox{2}}\)) time
               with high probability},
  journal   = {J. {ACM}},
  volume    = {60},
  number    = {4},
  pages     = {26:1--26:25},
  year      = {2013},
  url       = {http://doi.acm.org/10.1145/2505988},
  doi       = {10.1145/2505988},
  timestamp = {Fri, 09 Dec 2016 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jacm/PeresSSZ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaplanTZ13,
  author    = {Haim Kaplan and
               Robert Endre Tarjan and
               Uri Zwick},
  title     = {Soft Heaps Simplified},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {4},
  pages     = {1660--1673},
  year      = {2013},
  url       = {https://doi.org/10.1137/120880185},
  doi       = {10.1137/120880185},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/KaplanTZ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/WilsonZ13,
  author    = {David B. Wilson and
               Uri Zwick},
  title     = {A Forward-Backward Single-Source Shortest Paths Algorithm},
  booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2013, 26-29 October, 2013, Berkeley, CA, {USA}},
  pages     = {707--716},
  publisher = {{IEEE} Computer Society},
  year      = {2013},
  url       = {https://doi.org/10.1109/FOCS.2013.81},
  doi       = {10.1109/FOCS.2013.81},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/WilsonZ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RodittyZ12,
  author    = {Liam Roditty and
               Uri Zwick},
  title     = {Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {3},
  pages     = {670--683},
  year      = {2012},
  url       = {https://doi.org/10.1137/090776573},
  doi       = {10.1137/090776573},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RodittyZ12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RodittyZ12,
  author    = {Liam Roditty and
               Uri Zwick},
  title     = {Replacement paths and \emph{k} simple shortest paths in unweighted
               directed graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {8},
  number    = {4},
  pages     = {33:1--33:11},
  year      = {2012},
  url       = {https://doi.org/10.1145/2344422.2344423},
  doi       = {10.1145/2344422.2344423},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RodittyZ12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ShapiraYZ11,
  author    = {Asaf Shapira and
               Raphael Yuster and
               Uri Zwick},
  title     = {All-Pairs Bottleneck Paths in Vertex Weighted Graphs},
  journal   = {Algorithmica},
  volume    = {59},
  number    = {4},
  pages     = {621--633},
  year      = {2011},
  url       = {https://doi.org/10.1007/s00453-009-9328-x},
  doi       = {10.1007/s00453-009-9328-x},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/ShapiraYZ11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RodittyZ11,
  author    = {Liam Roditty and
               Uri Zwick},
  title     = {On Dynamic Shortest Paths Problems},
  journal   = {Algorithmica},
  volume    = {61},
  number    = {2},
  pages     = {389--401},
  year      = {2011},
  url       = {https://doi.org/10.1007/s00453-010-9401-5},
  doi       = {10.1007/s00453-010-9401-5},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/RodittyZ11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/ElberfeldBGMSSZS11,
  author    = {Michael Elberfeld and
               Vineet Bafna and
               Iftah Gamzu and
               Alexander Medvedovsky and
               Danny Segev and
               Dana Silverbush and
               Uri Zwick and
               Roded Sharan},
  title     = {On the Approximability of Reachability-Preserving Network Orientations},
  journal   = {Internet Math.},
  volume    = {7},
  number    = {4},
  pages     = {209--232},
  year      = {2011},
  url       = {https://doi.org/10.1080/15427951.2011.604554},
  doi       = {10.1080/15427951.2011.604554},
  timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/im/ElberfeldBGMSSZS11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HansenMZ11,
  author    = {Thomas Dueholm Hansen and
               Peter Bro Miltersen and
               Uri Zwick},
  editor    = {Bernard Chazelle},
  title     = {Strategy iteration is strongly polynomial for 2-player turn-based
               stochastic games with a constant discount factor},
  booktitle = {Innovations in Computer Science - {ICS} 2011, Tsinghua University,
               Beijing, China, January 7-9, 2011. Proceedings},
  pages     = {253--263},
  publisher = {Tsinghua University Press},
  year      = {2011},
  url       = {http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/7.html},
  timestamp = {Mon, 23 Mar 2020 08:26:00 +0100},
  biburl    = {https://dblp.org/rec/conf/innovations/HansenMZ11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FriedmannHZ11,
  author    = {Oliver Friedmann and
               Thomas Dueholm Hansen and
               Uri Zwick},
  editor    = {Dana Randall},
  title     = {A subexponential lower bound for the Random Facet algorithm for Parity
               Games},
  booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
               2011},
  pages     = {202--216},
  publisher = {{SIAM}},
  year      = {2011},
  url       = {https://doi.org/10.1137/1.9781611973082.19},
  doi       = {10.1137/1.9781611973082.19},
  timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/FriedmannHZ11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RoteZ11,
  author    = {G{\"{u}}nter Rote and
               Uri Zwick},
  editor    = {Dana Randall},
  title     = {Collapse},
  booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
               2011},
  pages     = {603--613},
  publisher = {{SIAM}},
  year      = {2011},
  url       = {https://doi.org/10.1137/1.9781611973082.47},
  doi       = {10.1137/1.9781611973082.47},
  timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/RoteZ11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FriedmannHZ11,
  author    = {Oliver Friedmann and
               Thomas Dueholm Hansen and
               Uri Zwick},
  editor    = {Lance Fortnow and
               Salil P. Vadhan},
  title     = {Subexponential lower bounds for randomized pivoting rules for the
               simplex algorithm},
  booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
               2011, San Jose, CA, USA, 6-8 June 2011},
  pages     = {283--292},
  publisher = {{ACM}},
  year      = {2011},
  url       = {https://doi.org/10.1145/1993636.1993675},
  doi       = {10.1145/1993636.1993675},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/FriedmannHZ11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-3770,
  author    = {Yuval Peres and
               Dmitry Sotnikov and
               Benny Sudakov and
               Uri Zwick},
  title     = {All-Pairs Shortest Paths in O(n\({}^{\mbox{2}}\)) time with high probability},
  journal   = {CoRR},
  volume    = {abs/1105.3770},
  year      = {2011},
  url       = {http://arxiv.org/abs/1105.3770},
  archivePrefix = {arXiv},
  eprint    = {1105.3770},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1105-3770.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MadaniTZ10,
  author    = {Omid Madani and
               Mikkel Thorup and
               Uri Zwick},
  title     = {Discounted deterministic Markov decision processes and discounted
               all-pairs shortest paths},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {33:1--33:25},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721849},
  doi       = {10.1145/1721837.1721849},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MadaniTZ10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ShalitaZ10,
  author    = {Alon Shalita and
               Uri Zwick},
  title     = {Efficient algorithms for the 2-gathering problem},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {6},
  number    = {2},
  pages     = {34:1--34:20},
  year      = {2010},
  url       = {https://doi.org/10.1145/1721837.1721850},
  doi       = {10.1145/1721837.1721850},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/ShalitaZ10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PeresSSZ10,
  author    = {Yuval Peres and
               Dmitry Sotnikov and
               Benny Sudakov and
               Uri Zwick},
  title     = {All-Pairs Shortest Paths in O(n\({}^{\mbox{2}}\)) Time with High Probability},
  booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
  pages     = {663--672},
  publisher = {{IEEE} Computer Society},
  year      = {2010},
  url       = {https://doi.org/10.1109/FOCS.2010.69},
  doi       = {10.1109/FOCS.2010.69},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/PeresSSZ10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HansenZ10,
  author    = {Thomas Dueholm Hansen and
               Uri Zwick},
  editor    = {Otfried Cheong and
               Kyung{-}Yong Chwa and
               Kunsoo Park},
  title     = {Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost
               Cycles},
  booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
               2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
               {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {6506},
  pages     = {415--426},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-17517-6\_37},
  doi       = {10.1007/978-3-642-17517-6\_37},
  timestamp = {Tue, 14 May 2019 10:00:50 +0200},
  biburl    = {https://dblp.org/rec/conf/isaac/HansenZ10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-0530,
  author    = {Thomas Dueholm Hansen and
               Peter Bro Miltersen and
               Uri Zwick},
  title     = {Strategy iteration is strongly polynomial for 2-player turn-based
               stochastic games with a constant discount factor},
  journal   = {CoRR},
  volume    = {abs/1008.0530},
  year      = {2010},
  url       = {http://arxiv.org/abs/1008.0530},
  archivePrefix = {arXiv},
  eprint    = {1008.0530},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1008-0530.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/PatersonZ09,
  author    = {Mike Paterson and
               Uri Zwick},
  title     = {Overhang},
  journal   = {Am. Math. Mon.},
  volume    = {116},
  number    = {1},
  pages     = {19--44},
  year      = {2009},
  url       = {http://www.jstor.org/stable/27642662},
  timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/tamm/PatersonZ09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/PatersonPTWZ09,
  author    = {Mike Paterson and
               Yuval Peres and
               Mikkel Thorup and
               Peter Winkler and
               Uri Zwick},
  title     = {Maximum Overhang},
  journal   = {Am. Math. Mon.},
  volume    = {116},
  number    = {9},
  pages     = {763--787},
  year      = {2009},
  url       = {http://www.jstor.org/stable/40391297},
  timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/tamm/PatersonPTWZ09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ShalitaZ09,
  author    = {Alon Shalita and
               Uri Zwick},
  editor    = {Claire Mathieu},
  title     = {Efficient algorithms for the 2-gathering problem},
  booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  pages     = {96--105},
  publisher = {{SIAM}},
  year      = {2009},
  url       = {http://dl.acm.org/citation.cfm?id=1496770.1496781},
  timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/ShalitaZ09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KaplanZ09,
  author    = {Haim Kaplan and
               Uri Zwick},
  editor    = {Claire Mathieu},
  title     = {A simpler implementation and analysis of Chazelle's soft heaps},
  booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  pages     = {477--485},
  publisher = {{SIAM}},
  year      = {2009},
  url       = {http://dl.acm.org/citation.cfm?id=1496770.1496823},
  timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/KaplanZ09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MadaniTZ09,
  author    = {Omid Madani and
               Mikkel Thorup and
               Uri Zwick},
  editor    = {Claire Mathieu},
  title     = {Discounted deterministic Markov decision processes and discounted
               all-pairs shortest paths},
  booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  pages     = {958--967},
  publisher = {{SIAM}},
  year      = {2009},
  url       = {http://dl.acm.org/citation.cfm?id=1496770.1496874},
  timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/MadaniTZ09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/XieYOHZ08,
  author    = {Xuzhen Xie and
               Mutsunori Yagiura and
               Takao Ono and
               Tomio Hirata and
               Uri Zwick},
  title     = {An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem},
  journal   = {J. Graph Algorithms Appl.},
  volume    = {12},
  number    = {4},
  pages     = {383--399},
  year      = {2008},
  url       = {https://doi.org/10.7155/jgaa.00171},
  doi       = {10.7155/jgaa.00171},
  timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jgaa/XieYOHZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RodittyZ08,
  author    = {Liam Roditty and
               Uri Zwick},
  title     = {Improved Dynamic Reachability Algorithms for Directed Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {37},
  number    = {5},
  pages     = {1455--1471},
  year      = {2008},
  url       = {https://doi.org/10.1137/060650271},
  doi       = {10.1137/060650271},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/RodittyZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JurdzinskiPZ08,
  author    = {Marcin Jurdzinski and
               Mike Paterson and
               Uri Zwick},
  title     = {A Deterministic Subexponential Algorithm for Solving Parity Games},
  journal   = {{SIAM} J. Comput.},
  volume    = {38},
  number    = {4},
  pages     = {1519--1532},
  year      = {2008},
  url       = {https://doi.org/10.1137/070686652},
  doi       = {10.1137/070686652},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/JurdzinskiPZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/RodittyTZ08,
  author    = {Liam Roditty and
               Mikkel Thorup and
               Uri Zwick},
  title     = {Roundtrip spanners and roundtrip routing in directed graphs},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {4},
  number    = {3},
  pages     = {29:1--29:17},
  year      = {2008},
  url       = {https://doi.org/10.1145/1367064.1367069},
  doi       = {10.1145/1367064.1367069},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/RodittyTZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Zwick08,
  author    = {Uri Zwick},
  editor    = {Edward A. Hirsch and
               Alexander A. Razborov and
               Alexei L. Semenov and
               Anatol Slissenko},
  title     = {Simple Stochastic Games, Mean Payoff Games, Parity Games},
  booktitle = {Computer Science - Theory and Applications, Third International Computer
               Science Symposium in Russia, {CSR} 2008, Moscow, Russia, June 7-12,
               2008, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5010},
  pages     = {29},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-79709-8\_6},
  doi       = {10.1007/978-3-540-79709-8\_6},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/csr/Zwick08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PatersonPTWZ08,
  author    = {Mike Paterson and
               Yuval Peres and
               Mikkel Thorup and
               Peter Winkler and
               Uri Zwick},
  editor    = {Shang{-}Hua Teng},
  title     = {Maximum overhang},
  booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
               2008},
  pages     = {756--765},
  publisher = {{SIAM}},
  year      = {2008},
  url       = {http://dl.acm.org/citation.cfm?id=1347082.1347165},
  timestamp = {Mon, 23 Oct 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/PatersonPTWZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/MedvedovskyBZS08,
  author    = {Alexander Medvedovsky and
               Vineet Bafna and
               Uri Zwick and
               Roded Sharan},
  editor    = {Keith A. Crandall and
               Jens Lagergren},
  title     = {An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and
               Its Applications to Orienting Protein Networks},
  booktitle = {Algorithms in Bioinformatics, 8th International Workshop, {WABI} 2008,
               Karlsruhe, Germany, September 15-19, 2008. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5251},
  pages     = {222--232},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-87361-7\_19},
  doi       = {10.1007/978-3-540-87361-7\_19},
  timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/wabi/MedvedovskyBZS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/AlonYZ08,
  author    = {Noga Alon and
               Raphael Yuster and
               Uri Zwick},
  editor    = {Ming{-}Yang Kao},
  title     = {Color Coding},
  booktitle = {Encyclopedia of Algorithms - 2008 Edition},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-0-387-30162-4\_76},
  doi       = {10.1007/978-0-387-30162-4\_76},
  timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
  biburl    = {https://dblp.org/rec/reference/algo/AlonYZ08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/XieYOHZ07,
  author    = {Xuzhen Xie and
               Mutsunori Yagiura and
               Takao Ono and
               Tomio Hirata and
               Uri Zwick},
  editor    = {Takeshi Tokuyama},
  title     = {New Bounds for the Nearly Equitable Edge Coloring Problem},
  booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
               2007, Sendai, Japan, December 17-19, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4835},
  pages     = {280--291},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-77120-3\_26},
  doi       = {10.1007/978-3-540-77120-3\_26},
  timestamp = {Tue, 14 May 2019 10:00:50 +0200},
  biburl    = {https://dblp.org/rec/conf/isaac/XieYOHZ07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/YusterZ07,
  author    = {Raphael Yuster and
               Uri Zwick},
  editor    = {Nikhil Bansal and
               Kirk Pruhs and
               Clifford Stein},
  title     = {Maximum matching in graphs with an excluded minor},
  booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
               2007},
  pages     = {108--117},
  publisher = {{SIAM}},
  year      = {2007},
  url       = {http://dl.acm.org/citation.cfm?id=1283383.1283396},
  timestamp = {Mon, 17 Aug 2020 11:36:12 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/YusterZ07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Ta-ShmaZ07,
  author    = {Amnon Ta{-}Shma and
               Uri Zwick},
  editor    = {Nikhil Bansal and
               Kirk Pruhs and
               Clifford Stein},
  title     = {Deterministic rendezvous, treasure hunts and strongly universal exploration
               sequences},
  booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
               2007},
  pages     = {599--608},
  publisher = {{SIAM}},
  year      = {2007},
  url       = {http://dl.acm.org/citation.cfm?id=1283383.1283448},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/Ta-ShmaZ07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ShapiraYZ07,
  author    = {Asaf Shapira and
               Raphael Yuster and
               Uri Zwick},
  editor    = {Nikhil Bansal and
               Kirk Pruhs and
               Clifford Stein},
  title     = {All-pairs bottleneck paths in vertex weighted graphs},
  booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
               2007},
  pages     = {978--985},
  publisher = {{SIAM}},
  year      = {2007},
  url       = {http://dl.acm.org/citation.cfm?id=1283383.1283488},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/ShapiraYZ07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArmonZ06,
  author    = {Amitai Armon and
               Uri Zwick},
  title     = {Multicriteria Global Minimum Cuts},
  journal   = {Algorithmica},
  volume    = {46},
  number    = {1},
  pages     = {15--26},
  year      = {2006},
  url       = {https://doi.org/10.1007/s00453-006-0068-x},
  doi       = {10.1007/s00453-006-0068-x},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/ArmonZ06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Zwick06,
  author    = {Uri Zwick},
  title     = {A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest
               Paths Problem with Real Edge Lengths},
  journal   = {Algorithmica},
  volume    = {46},
  number    = {2},
  pages     = {181--192},
  year      = {2006},
  url       = {https://doi.org/10.1007/s00453-005-1199-1},
  doi       = {10.1007/s00453-005-1199-1},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/Zwick06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MendelsonTTZ06,
  author    = {Ran Mendelson and
               Robert Endre Tarjan and
               Mikkel Thorup and
               Uri Zwick},
  title     = {Melding priority queues},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {2},
  number    = {4},
  pages     = {535--556},
  year      = {2006},
  url       = {https://doi.org/10.1145/1198513.1198517},
  doi       = {10.1145/1198513.1198517},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/MendelsonTTZ06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JurdzinskiPZ06,
  author    = {Marcin Jurdzinski and
               Mike Paterson and
               Uri Zwick},
  title     = {A deterministic subexponential algorithm for solving parity games},
  booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  pages     = {117--123},
  publisher = {{ACM} Press},
  year      = {2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557.1109571},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/JurdzinskiPZ06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/PatersonZ06,
  author    = {Mike Paterson and
               Uri Zwick},
  title     = {Overhang},
  booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  pages     = {231--240},
  publisher = {{ACM} Press},
  year      = {2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557.1109584},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/PatersonZ06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ThorupZ06,
  author    = {Mikkel Thorup and
               Uri Zwick},
  title     = {Spanners and emulators with sublinear distance errors},
  booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  pages     = {802--809},
  publisher = {{ACM} Press},
  year      = {2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557.1109645},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/ThorupZ06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2006,
  editor    = {Josep D{\'{\i}}az and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Uri Zwick},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, 9th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
               Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
               Spain, August 28-30 2006, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4110},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11830924},
  doi       = {10.1007/11830924},
  isbn      = {3-540-38044-2},
  timestamp = {Tue, 14 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/approx/2006.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ThorupZ05,
  author    = {Mikkel Thorup and
               Uri Zwick},
  title     = {Approximate distance oracles},
  journal   = {J. {ACM}},
  volume    = {52},
  number    = {1},
  pages     = {1--24},
  year      = {2005},
  url       = {https://doi.org/10.1145/1044731.1044732},
  doi       = {10.1145/1044731.1044732},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jacm/ThorupZ05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AvidorZ05,
  author    = {Adi Avidor and
               Uri Zwick},
  title     = {Approximating {MIN} 2-SAT and {MIN} 3-SAT},
  journal   = {Theory Comput. Syst.},
  volume    = {38},
  number    = {3},
  pages     = {329--345},
  year      = {2005},
  url       = {https://doi.org/10.1007/s00224-005-1140-7},
  doi       = {10.1007/s00224-005-1140-7},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/mst/AvidorZ05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/YusterZ05,
  author    = {Raphael Yuster and
               Uri Zwick},
  title     = {Fast sparse matrix multiplication},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {1},
  number    = {1},
  pages     = {2--13},
  year      = {2005},
  url       = {https://doi.org/10.1145/1077464.1077466},
  doi       = {10.1145/1077464.1077466},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/talg/YusterZ05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AvidorZ05,
  author    = {Adi Avidor and
               Uri Zwick},
  editor    = {Chandra Chekuri and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Luca Trevisan},
  title     = {Rounding Two and Three Dimensional Solutions of the {SDP} Relaxation
               of {MAX} {CUT}},
  booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms
               and Techniques, 8th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
               on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
               August 22-24, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3624},
  pages     = {14--25},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11538462\_2},
  doi       = {10.1007/11538462\_2},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/conf/approx/AvidorZ05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/YusterZ05,
  author    = {Raphael Yuster and
               Uri Zwick},
  title     = {Answering distance queries in directed graphs using fast matrix multiplication},
  booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
               2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
  pages     = {389--396},
  publisher = {{IEEE} Computer Society},
  year      = {2005},
  url       = {https://doi.org/10.1109/SFCS.2005.20},
  doi       = {10.1109/SFCS.2005.20},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/YusterZ05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlstrupGRTZ05,
  author    = {Stephen Alstrup and
               Inge Li G{\o}rtz and
               Theis Rauhe and
               Mikkel Thorup and
               Uri Zwick},
  editor    = {Lu{\'{\i}}s Caires and
               Giuseppe F. Italiano and
               Lu{\'{\i}}s Monteiro and
               Catuscia Palamidessi and
               Moti Yung},
  title     = {Union-Find with Constant Time Deletions},
  booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
               {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3580},
  pages     = {78--89},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11523468\_7},
  doi       = {10.1007/11523468\_7},
  timestamp = {Tue, 14 May 2019 10:00:44 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/AlstrupGRTZ05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/RodittyZ05,
  author    = {Liam Roditty and
               Uri Zwick},
  editor    = {Lu{\'{\i}}s Caires and
               Giuseppe F. Italiano and
               Lu{\'{\i}}s Monteiro and
               Catuscia Palamidessi and
               Moti Yung},
  title     = {Replacement Paths and \emph{k} Simple Shortest Paths in Unweighted
               Directed Graphs},
  booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
               {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3580},
  pages     = {249--260},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11523468\_21},
  doi       = {10.1007/11523468\_21},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/RodittyZ05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/RodittyTZ05,
  author    = {Liam Roditty and
               Mikkel Thorup and
               Uri Zwick},
  editor    = {Lu{\'{\i}}s Caires and
               Giuseppe F. Italiano and
               Lu{\'{\i}}s Monteiro and
               Catuscia Palamidessi and
               Moti Yung},
  title     = {Deterministic Constructions of Approximate Distance Oracles and Spanners},
  booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
               {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3580},
  pages     = {261--272},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11523468\_22},
  doi       = {10.1007/11523468\_22},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/RodittyTZ05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/AvidorBZ05,
  author    = {Adi Avidor and
               Ido Berkovitch and
               Uri Zwick},
  editor    = {Thomas Erlebach and
               Giuseppe Persiano},
  title     = {Improved Approximation Algorithms for {MAX} {NAE-SAT} and {MAX} {SAT}},
  booktitle = {Approximation and Online Algorithms, Third International Workshop,
               {WAOA} 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised
               Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {3879},
  pages     = {27--40},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11671411\_3},
  doi       = {10.1007/11671411\_3},
  timestamp = {Tue, 14 May 2019 10:00:46 +0200},
  biburl    = {https://dblp.org/rec/conf/waoa/AvidorBZ05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HalperinLZ04,
  author    = {Eran Halperin and
               Dror Livnat and
               Uri Zwick},
  title     = {{MAX} {CUT} in cubic graphs},
  journal   = {J. Algorithms},
  volume    = {53},
  number    = {2},
  pages     = {169--185},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.jalgor.2004.06.001},
  doi       = {10.1016/j.jalgor.2004.06.001},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jal/HalperinLZ04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/RodittyZ04,
  author    = {Liam Roditty and
               Uri Zwick},
  editor    = {Susanne Albers and
               Tomasz Radzik},
  title     = {On Dynamic Shortest Paths Problems},
  booktitle = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,
               September 14-17, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3221},
  pages     = {580--591},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/978-3-540-30140-0\_52},
  doi       = {10.1007/978-3-540-30140-0\_52},
  timestamp = {Tue, 14 May 2019 10:00:54 +0200},
  biburl    = {https://dblp.org/rec/conf/esa/RodittyZ04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/YusterZ04,
  author    = {Raphael Yuster and
               Uri Zwick},
  editor    = {Susanne Albers and
               Tomasz Radzik},
  title     = {Fast Sparse Matrix Multiplication},
  booktitle = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,
               September 14-17, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3221},
  pages     = {604--615},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/978-3-540-30140-0\_54},
  doi       = {10.1007/978-3-540-30140-0\_54},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/esa/YusterZ04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RodittyZ04,
  author    = {Liam Roditty and
               Uri Zwick},
  title     = {Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs},
  booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
               October 2004, Rome, Italy, Proceedings},
  pages     = {499--508},
  publisher = {{IEEE} Computer Society},
  year      = {2004},
  url       = {https://doi.org/10.1109/FOCS.2004.22},
  doi       = {10.1109/FOCS.2004.22},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/RodittyZ04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ArmonZ04,
  author    = {Amitai Armon and
               Uri Zwick},
  editor    = {Rudolf Fleischer and
               Gerhard Trippen},
  title     = {Multicriteria Global Minimum Cuts},
  booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
               2004, Hong Kong, China, December 20-22, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3341},
  pages     = {65--76},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/978-3-540-30551-4\_8},
  doi       = {10.1007/978-3-540-30551-4\_8},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/isaac/ArmonZ04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Zwick04,
  author    = {Uri Zwick},
  editor    = {Rudolf Fleischer and
               Gerhard Trippen},
  title     = {A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest
               Paths Problem with Real Edge Lengths},
  booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
               2004, Hong Kong, China, December 20-22, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3341},
  pages     = {921--932},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/978-3-540-30551-4\_78},
  doi       = {10.1007/978-3-540-30551-4\_78},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/isaac/Zwick04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MendelsonTZ04,
  author    = {Ran Mendelson and
               Mikkel Thorup and
               Uri Zwick},
  editor    = {J. Ian Munro},
  title     = {Meldable {RAM} priority queues and minimum directed spanning trees},
  booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
               2004},
  pages     = {40--48},
  publisher = {{SIAM}},
  year      = {2004},
  url       = {http://dl.acm.org/citation.cfm?id=982792.982798},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/MendelsonTZ04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/YusterZ04,
  author    = {Raphael Yuster and
               Uri Zwick},
  editor    = {J. Ian Munro},
  title     = {Detecting short directed cycles using rectangular matrix multiplication
               and dynamic programming},
  booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
               2004},
  pages     = {254--260},
  publisher = {{SIAM}},
  year      = {2004},
  url       = {http://dl.acm.org/citation.cfm?id=982792.982828},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/YusterZ04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RodittyZ04,
  author    = {Liam Roditty and
               Uri Zwick},
  editor    = {L{\'{a}}szl{\'{o}} Babai},
  title     = {A fully dynamic reachability algorithm for directed graphs with an
               almost linear update time},
  booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
               Chicago, IL, USA, June 13-16, 2004},
  pages     = {184--191},
  publisher = {{ACM}},
  year      = {2004},
  url       = {https://doi.org/10.1145/1007352.1007387},
  doi       = {10.1145/1007352.1007387},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/RodittyZ04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/MendelsonTTZ04,
  author    = {Ran Mendelson and
               Robert Endre Tarjan and
               Mikkel Thorup and
               Uri Zwick},
  editor    = {Torben Hagerup and
               Jyrki Katajainen},
  title     = {Melding Priority Queues},
  booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
               Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3111},
  pages     = {223--235},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/978-3-540-27810-8\_20},
  doi       = {10.1007/978-3-540-27810-8\_20},
  timestamp = {Tue, 14 May 2019 10:00:39 +0200},
  biburl    = {https://dblp.org/rec/conf/swat/MendelsonTTZ04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CohenKZ03,
  author    = {Edith Cohen and
               Haim Kaplan and
               Uri Zwick},
  title     = {Connection caching: model and algorithms},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {67},
  number    = {1},
  pages     = {92--126},
  year      = {2003},
  url       = {https://doi.org/10.1016/S0022-0000(03)00041-2},
  doi       = {10.1016/S0022-0000(03)00041-2},
  timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jcss/CohenKZ03.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CohenHKZ03,
  author    = {Edith Cohen and
               Eran Halperin and
               Haim Kaplan and
               Uri Zwick},
  title     = {Reachability and Distance Queries via 2-Hop Labels},
  journal   = {{SIAM} J. Comput.},
  volume    = {32},
  number    = {5},
  pages     = {1338--1355},
  year      = {2003},
  url       = {https://doi.org/10.1137/S0097539702403098},
  doi       = {10.1137/S0097539702403098},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/CohenHKZ03.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2003,
  editor    = {Giuseppe Di Battista and
               Uri Zwick},
  title     = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest,
               Hungary, September 16-19, 2003, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2832},
  publisher = {Springer},
  year      = {2003},
  url       = {https://doi.org/10.1007/b13632},
  doi       = {10.1007/b13632},
  isbn      = {3-540-20064-9},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/esa/2003.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CohenKZ02,
  author    = {Edith Cohen and
               Haim Kaplan and
               Uri Zwick},
  title     = {Competitive Analysis of the {LRFU} Paging Algorithm},
  journal   = {Algorithmica},
  volume    = {33},
  number    = {4},
  pages     = {511--516},
  year      = {2002},
  url       = {https://doi.org/10.1007/s00453-002-0936-y},
  doi       = {10.1007/s00453-002-0936-y},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/CohenKZ02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Zwick02,
  author    = {Uri Zwick},
  title     = {All pairs shortest paths using bridging sets and rectangular matrix
               multiplication},
  journal   = {J. {ACM}},
  volume    = {49},
  number    = {3},
  pages     = {289--317},
  year      = {2002},
  url       = {https://doi.org/10.1145/567112.567114},
  doi       = {10.1145/567112.567114},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jacm/Zwick02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HalperinNZ02,
  author    = {Eran Halperin and
               Ram Nathaniel and
               Uri Zwick},
  title     = {Coloring k-colorable graphs using relatively small palettes},
  journal   = {J. Algorithms},
  volume    = {45},
  number    = {1},
  pages     = {72--90},
  year      = {2002},
  url       = {https://doi.org/10.1016/S0196-6774(02)00217-1},
  doi       = {10.1016/S0196-6774(02)00217-1},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jal/HalperinNZ02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HalperinZ02,
  author    = {Eran Halperin and
               Uri Zwick},
  title     = {A unified framework for obtaining improved approximation algorithms
               for maximum graph bisection problems},
  journal   = {Random Struct. Algorithms},
  volume    = {20},
  number    = {3},
  pages     = {382--402},
  year      = {2002},
  url       = {https://doi.org/10.1002/rsa.10035},
  doi       = {10.1002/rsa.10035},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/rsa/HalperinZ02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/winet/NaorLZ02,
  author    = {Zohar Naor and
               Hanoch Levy and
               Uri Zwick},
  title     = {Cell Identification Codes for Tracking Mobile Users},
  journal   = {Wirel. Networks},
  volume    = {8},
  number    = {1},
  pages     = {73--84},
  year      = {2002},
  url       = {https://doi.org/10.1023/A:1012723626016},
  doi       = {10.1023/A:1012723626016},
  timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/winet/NaorLZ02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RodittyZ02,
  author    = {Liam Roditty and
               Uri Zwick},
  title     = {Improved Dynamic Reachability Algorithms for Directed Graphs},
  booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
               November 2002, Vancouver, BC, Canada, Proceedings},
  pages     = {679},
  publisher = {{IEEE} Computer Society},
  year      = {2002},
  url       = {https://doi.org/10.1109/SFCS.2002.1181993},
  doi       = {10.1109/SFCS.2002.1181993},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/RodittyZ02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/LewinLZ02,
  author    = {Michael Lewin and
               Dror Livnat and
               Uri Zwick},
  editor    = {William J. Cook and
               Andreas S. Schulz},
  title     = {Improved Rounding Techniques for the {MAX} 2-SAT and {MAX} {DI-CUT}
               Problems},
  booktitle = {Integer Programming and Combinatorial Optimization, 9th International
               {IPCO} Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2337},
  pages     = {67--82},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-47867-1\_6},
  doi       = {10.1007/3-540-47867-1\_6},
  timestamp = {Tue, 14 May 2019 10:00:50 +0200},
  biburl    = {https://dblp.org/rec/conf/ipco/LewinLZ02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AvidorZ02,
  author    = {Adi Avidor and
               Uri Zwick},
  editor    = {Prosenjit Bose and
               Pat Morin},
  title     = {Approximating {MIN} k-SAT},
  booktitle = {Algorithms and Computation, 13th International Symposium, {ISAAC}
               2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2518},
  pages     = {465--475},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-36136-7\_41},
  doi       = {10.1007/3-540-36136-7\_41},
  timestamp = {Tue, 14 May 2019 10:00:50 +0200},
  biburl    = {https://dblp.org/rec/conf/isaac/AvidorZ02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Zwick02,
  author    = {Uri Zwick},
  editor    = {David Eppstein},
  title     = {Jenga},
  booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages     = {243--246},
  publisher = {{ACM/SIAM}},
  year      = {2002},
  url       = {http://dl.acm.org/citation.cfm?id=545381.545412},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/Zwick02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Zwick02a,
  author    = {Uri Zwick},
  editor    = {David Eppstein},
  title     = {Computer assisted proof of optimal approximability results},
  booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages     = {496--505},
  publisher = {{ACM/SIAM}},
  year      = {2002},
  url       = {http://dl.acm.org/citation.cfm?id=545381.545448},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/Zwick02a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HalperinLZ02,
  author    = {Eran Halperin and
               Dror Livnat and
               Uri Zwick},
  editor    = {David Eppstein},
  title     = {{MAX} {CUT} in cubic graphs},
  booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages     = {506--513},
  publisher = {{ACM/SIAM}},
  year      = {2002},
  url       = {http://dl.acm.org/citation.cfm?id=545381.545449},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/HalperinLZ02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RodittyTZ02,
  author    = {Liam Roditty and
               Mikkel Thorup and
               Uri Zwick},
  editor    = {David Eppstein},
  title     = {Roundtrip spanners and roundtrip routing in directed graphs},
  booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages     = {844--851},
  publisher = {{ACM/SIAM}},
  year      = {2002},
  url       = {http://dl.acm.org/citation.cfm?id=545381.545491},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/RodittyTZ02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CohenHKZ02,
  author    = {Edith Cohen and
               Eran Halperin and
               Haim Kaplan and
               Uri Zwick},
  editor    = {David Eppstein},
  title     = {Reachability and distance queries via 2-hop labels},
  booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
  pages     = {937--946},
  publisher = {{ACM/SIAM}},
  year      = {2002},
  url       = {http://dl.acm.org/citation.cfm?id=545381.545503},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/CohenHKZ02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ChocklerZ01,
  author    = {Hana Chockler and
               Uri Zwick},
  title     = {Which bases admit non-trivial shrinkage of formulae?},
  journal   = {Comput. Complex.},
  volume    = {10},
  number    = {1},
  pages     = {28--40},
  year      = {2001},
  url       = {https://doi.org/10.1007/PL00001610},
  doi       = {10.1007/PL00001610},
  timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cc/ChocklerZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/CohenZ01,
  author    = {Edith Cohen and
               Uri Zwick},
  title     = {All-Pairs Small-Stretch Paths},
  journal   = {J. Algorithms},
  volume    = {38},
  number    = {2},
  pages     = {335--353},
  year      = {2001},
  url       = {https://doi.org/10.1006/jagm.2000.1117},
  doi       = {10.1006/jagm.2000.1117},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jal/CohenZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HalperinZ01,
  author    = {Shay Halperin and
               Uri Zwick},
  title     = {Optimal Randomized {EREW} {PRAM} Algorithms for Finding Spanning Forests},
  journal   = {J. Algorithms},
  volume    = {39},
  number    = {1},
  pages     = {1--46},
  year      = {2001},
  url       = {https://doi.org/10.1006/jagm.2000.1146},
  doi       = {10.1006/jagm.2000.1146},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jal/HalperinZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HalperinZ01a,
  author    = {Eran Halperin and
               Uri Zwick},
  title     = {Approximation Algorithms for {MAX} 4-SAT and Rounding Procedures for
               Semidefinite Programs},
  journal   = {J. Algorithms},
  volume    = {40},
  number    = {2},
  pages     = {184--211},
  year      = {2001},
  url       = {https://doi.org/10.1006/jagm.2001.1162},
  doi       = {10.1006/jagm.2001.1162},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jal/HalperinZ01a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DorHUZ01,
  author    = {Dorit Dor and
               Johan H{\aa}stad and
               Staffan Ulfberg and
               Uri Zwick},
  title     = {On Lower Bounds for Selecting the Median},
  journal   = {{SIAM} J. Discret. Math.},
  volume    = {14},
  number    = {3},
  pages     = {299--311},
  year      = {2001},
  url       = {https://doi.org/10.1137/S0895480196309481},
  doi       = {10.1137/S0895480196309481},
  timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamdm/DorHUZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DorZ01,
  author    = {Dorit Dor and
               Uri Zwick},
  title     = {Median Selection Requires (2+epsilon)n Comparisons},
  journal   = {{SIAM} J. Discret. Math.},
  volume    = {14},
  number    = {3},
  pages     = {312--325},
  year      = {2001},
  url       = {https://doi.org/10.1137/S0895480199353895},
  doi       = {10.1137/S0895480199353895},
  timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamdm/DorZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlonSZ01,
  author    = {Noga Alon and
               Benny Sudakov and
               Uri Zwick},
  title     = {Constructing Worst Case Instances for Semidefinite Programming Based
               Approximation Algorithms},
  journal   = {{SIAM} J. Discret. Math.},
  volume    = {15},
  number    = {1},
  pages     = {58--72},
  year      = {2001},
  url       = {https://doi.org/10.1137/S0895480100379713},
  doi       = {10.1137/S0895480100379713},
  timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamdm/AlonSZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Zwick01,
  author    = {Uri Zwick},
  editor    = {Friedhelm Meyer auf der Heide},
  title     = {Exact and Approximate Distances in Graphs - {A} Survey},
  booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
               August 28-31, 2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2161},
  pages     = {33--48},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-44676-1\_3},
  doi       = {10.1007/3-540-44676-1\_3},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/esa/Zwick01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Zwick01,
  author    = {Uri Zwick},
  editor    = {Ramesh Hariharan and
               Madhavan Mukund and
               V. Vinay},
  title     = {Semidefinite Programming Based Approximation Algorithms},
  booktitle = {{FST} {TCS} 2001: Foundations of Software Technology and Theoretical
               Computer Science, 21st Conference, Bangalore, India, December 13-15,
               2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2245},
  pages     = {57},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-45294-X\_5},
  doi       = {10.1007/3-540-45294-X\_5},
  timestamp = {Tue, 14 May 2019 10:00:51 +0200},
  biburl    = {https://dblp.org/rec/conf/fsttcs/Zwick01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/HalperinZ01,
  author    = {Eran Halperin and
               Uri Zwick},
  editor    = {Karen Aardal and
               Bert Gerards},
  title     = {A Unified Framework for Obtaining Improved Approximation Algorithms
               for Maximum Graph Bisection Problems},
  booktitle = {Integer Programming and Combinatorial Optimization, 8th International
               {IPCO} Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2081},
  pages     = {210--225},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-45535-3\_17},
  doi       = {10.1007/3-540-45535-3\_17},
  timestamp = {Tue, 14 May 2019 10:00:50 +0200},
  biburl    = {https://dblp.org/rec/conf/ipco/HalperinZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HalperinZ01,
  author    = {Eran Halperin and
               Uri Zwick},
  editor    = {S. Rao Kosaraju},
  title     = {Combinatorial approximation algorithms for the maximum directed cut
               problem},
  booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
               January 7-9, 2001, Washington, DC, {USA}},
  pages     = {1--7},
  publisher = {{ACM/SIAM}},
  year      = {2001},
  url       = {http://dl.acm.org/citation.cfm?id=365411.365412},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/HalperinZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlonSZ01,
  author    = {Noga Alon and
               Benny Sudakov and
               Uri Zwick},
  editor    = {S. Rao Kosaraju},
  title     = {Constructing worst case instances for semidefinite programming based
               approximation algorithms},
  booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
               January 7-9, 2001, Washington, DC, {USA}},
  pages     = {92--100},
  publisher = {{ACM/SIAM}},
  year      = {2001},
  url       = {http://dl.acm.org/citation.cfm?id=365411.365424},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/AlonSZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HalperinNZ01,
  author    = {Eran Halperin and
               Ram Nathaniel and
               Uri Zwick},
  editor    = {S. Rao Kosaraju},
  title     = {Coloring k-colorable graphs using smaller palettes},
  booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
               January 7-9, 2001, Washington, DC, {USA}},
  pages     = {319--326},
  publisher = {{ACM/SIAM}},
  year      = {2001},
  url       = {http://dl.acm.org/citation.cfm?id=365411.365468},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/HalperinNZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChocklerZ01,
  author    = {Hana Chockler and
               Uri Zwick},
  editor    = {S. Rao Kosaraju},
  title     = {Which formulae shrink under random restrictions?},
  booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
               January 7-9, 2001, Washington, DC, {USA}},
  pages     = {702--708},
  publisher = {{ACM/SIAM}},
  year      = {2001},
  url       = {http://dl.acm.org/citation.cfm?id=365411.365755},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/ChocklerZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/ThorupZ01,
  author    = {Mikkel Thorup and
               Uri Zwick},
  editor    = {Arnold L. Rosenberg},
  title     = {Compact routing schemes},
  booktitle = {Proceedings of the Thirteenth Annual {ACM} Symposium on Parallel Algorithms
               and Architectures, {SPAA} 2001, Heraklion, Crete Island, Greece, July
               4-6, 2001},
  pages     = {1--10},
  publisher = {{ACM}},
  year      = {2001},
  url       = {https://doi.org/10.1145/378580.378581},
  doi       = {10.1145/378580.378581},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/spaa/ThorupZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ThorupZ01,
  author    = {Mikkel Thorup and
               Uri Zwick},
  editor    = {Jeffrey Scott Vitter and
               Paul G. Spirakis and
               Mihalis Yannakakis},
  title     = {Approximate distance oracles},
  booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
               July 6-8, 2001, Heraklion, Crete, Greece},
  pages     = {183--192},
  publisher = {{ACM}},
  year      = {2001},
  url       = {https://doi.org/10.1145/380752.380798},
  doi       = {10.1145/380752.380798},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/ThorupZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/CohenKZ01,
  author    = {Edith Cohen and
               Haim Kaplan and
               Uri Zwick},
  editor    = {Frank K. H. A. Dehne and
               J{\"{o}}rg{-}R{\"{u}}diger Sack and
               Roberto Tamassia},
  title     = {Competitive Analysis of the {LRFU} Paging Algorithm},
  booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
               2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2125},
  pages     = {148--154},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-44634-6\_14},
  doi       = {10.1007/3-540-44634-6\_14},
  timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
  biburl    = {https://dblp.org/rec/conf/wads/CohenKZ01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0105029,
  author    = {Eran Halperin and
               Ram Nathaniel and
               Uri Zwick},
  title     = {Coloring k-colorable graphs using relatively small palettes},
  journal   = {CoRR},
  volume    = {cs.DS/0105029},
  year      = {2001},
  url       = {https://arxiv.org/abs/cs/0105029},
  timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/cs-DS-0105029.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DorHZ00,
  author    = {Dorit Dor and
               Shay Halperin and
               Uri Zwick},
  title     = {All-Pairs Almost Shortest Paths},
  journal   = {{SIAM} J. Comput.},
  volume    = {29},
  number    = {5},
  pages     = {1740--1759},
  year      = {2000},
  url       = {https://doi.org/10.1137/S0097539797327908},
  doi       = {10.1137/S0097539797327908},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DorHZ00.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/CohenKZ00,
  author    = {Edith Cohen and
               Haim Kaplan and
               Uri Zwick},
  editor    = {Gary L. Miller and
               Shang{-}Hua Teng},
  title     = {Connection caching under vaious models of communication},
  booktitle = {Proceedings of the Twelfth annual {ACM} Symposium on Parallel Algorithms
               and Architectures, {SPAA} 2000, Bar Harbor, Maine, USA, July 9-13,
               2000},
  pages     = {54--63},
  publisher = {{ACM}},
  year      = {2000},
  url       = {https://doi.org/10.1145/341800.341808},
  doi       = {10.1145/341800.341808},
  timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
  biburl    = {https://dblp.org/rec/conf/spaa/CohenKZ00.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0008011,
  author    = {Uri Zwick},
  title     = {All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix
               Multiplication},
  journal   = {CoRR},
  volume    = {cs.DS/0008011},
  year      = {2000},
  url       = {https://arxiv.org/abs/cs/0008011},
  timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/cs-DS-0008011.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-060,
  author    = {Uri Zwick},
  title     = {All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix
               Multiplication},
  journal   = {Electron. Colloquium Comput. Complex.},
  volume    = {7},
  number    = {60},
  year      = {2000},
  url       = {http://eccc.hpi-web.de/eccc-reports/2000/TR00-060/index.html},
  timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/ECCC-TR00-060.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/DorZ99,
  author    = {Dorit Dor and
               Uri Zwick},
  title     = {{SOKOBAN} and other motion planning problems},
  journal   = {Comput. Geom.},
  volume    = {13},
  number    = {4},
  pages     = {215--228},
  year      = {1999},
  url       = {https://doi.org/10.1016/S0925-7721(99)00017-6},
  doi       = {10.1016/S0925-7721(99)00017-6},
  timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/comgeo/DorZ99.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/NayakSZ99,
  author    = {Ashwin Nayak and
               Alistair Sinclair and
               Uri Zwick},
  title     = {Spatial Codes and the Hardness of String Folding Problems},
  journal   = {J. Comput. Biol.},
  volume    = {6},
  number    = {1},
  pages     = {13--36},
  year      = {1999},
  url       = {https://doi.org/10.1089/cmb.1999.6.13},
  doi       = {10.1089/cmb.1999.6.13},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jcb/NayakSZ99.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DorZ99,
  author    = {Dorit Dor and
               Uri Zwick},
  title     = {Selecting the Median},
  journal   = {{SIAM} J. Comput.},
  volume    = {28},
  number    = {5},
  pages     = {1722--1758},
  year      = {1999},
  url       = {https://doi.org/10.1137/S0097539795288611},
  doi       = {10.1137/S0097539795288611},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DorZ99.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ShoshanZ99,
  author    = {Avi Shoshan and
               Uri Zwick},
  title     = {All Pairs Shortest Paths in Undirected Graphs with Integer Weights},
  booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
               17-18 October, 1999, New York, NY, {USA}},
  pages     = {605--615},
  publisher = {{IEEE} Computer Society},
  year      = {1999},
  url       = {https://doi.org/10.1109/SFFCS.1999.814635},
  doi       = {10.1109/SFFCS.1999.814635},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/ShoshanZ99.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/HalperinZ99,
  author    = {Eran Halperin and
               Uri Zwick},
  editor    = {G{\'{e}}rard Cornu{\'{e}}jols and
               Rainer E. Burkard and
               Gerhard J. Woeginger},
  title     = {Approximation Algorithms for {MAX} 4-SAT and Rounding Procedures for
               Semidefinite Programs},
  booktitle = {Integer Programming and Combinatorial Optimization, 7th International
               {IPCO} Conference, Graz, Austria, June 9-11, 1999, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1610},
  pages     = {202--217},
  publisher = {Springer},
  year      = {1999},
  url       = {https://doi.org/10.1007/3-540-48777-8\_16},
  doi       = {10.1007/3-540-48777-8\_16},
  timestamp = {Tue, 14 May 2019 10:00:50 +0200},
  biburl    = {https://dblp.org/rec/conf/ipco/HalperinZ99.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Zwick99,
  author    = {Uri Zwick},
  editor    = {Jeffrey Scott Vitter and
               Lawrence L. Larmore and
               Frank Thomson Leighton},
  title     = {All Pairs Lightest Shortest Paths},
  booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
               Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages     = {61--69},
  publisher = {{ACM}},
  year      = {1999},
  url       = {https://doi.org/10.1145/301250.301271},
  doi       = {10.1145/301250.301271},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/Zwick99.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenKZ99,
  author    = {Edith Cohen and
               Haim Kaplan and
               Uri Zwick},
  editor    = {Jeffrey Scott Vitter and
               Lawrence L. Larmore and
               Frank Thomson Leighton},
  title     = {Connection Caching},
  booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
               Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages     = {612--621},
  publisher = {{ACM}},
  year      = {1999},
  url       = {https://doi.org/10.1145/301250.301416},
  doi       = {10.1145/301250.301416},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/CohenKZ99.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Zwick99a,
  author    = {Uri Zwick},
  editor    = {Jeffrey Scott Vitter and
               Lawrence L. Larmore and
               Frank Thomson Leighton},
  title     = {Outward Rotations: {A} Tool for Rounding Solutions of Semidefinite
               Programming Relaxations, with Applications to {MAX} {CUT} and Other
               Problems},
  booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
               Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages     = {679--687},
  publisher = {{ACM}},
  year      = {1999},
  url       = {https://doi.org/10.1145/301250.301431},
  doi       = {10.1145/301250.301431},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/Zwick99a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Zwick98,
  author    = {Uri Zwick},
  title     = {All Pairs Shortest Paths in Weighted Directed Graphs {\textthreequarters}
               Exact and Almost Exact Algorithms},
  booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
               November 8-11, 1998, Palo Alto, California, {USA}},
  pages     = {310--319},
  publisher = {{IEEE} Computer Society},
  year      = {1998},
  url       = {https://doi.org/10.1109/SFCS.1998.743464},
  doi       = {10.1109/SFCS.1998.743464},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/Zwick98.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Zwick98,
  author    = {Uri Zwick},
  editor    = {Howard J. Karloff},
  title     = {Approximation Algorithms for Constraint Satisfaction Problems Involving
               at Most Three Variables per Constraint},
  booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               25-27 January 1998, San Francisco, California, {USA}},
  pages     = {201--210},
  publisher = {{ACM/SIAM}},
  year      = {1998},
  url       = {http://dl.acm.org/citation.cfm?id=314613.314701},
  timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/Zwick98.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/NayakSZ98,
  author    = {Ashwin Nayak and
               Alistair Sinclair and
               Uri Zwick},
  editor    = {Howard J. Karloff},
  title     = {Spatial Codes and the Hardness of String Folding Problems (Extended
               Abstract)},
  booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               25-27 January 1998, San Francisco, California, {USA}},
  pages     = {639--648},
  publisher = {{ACM/SIAM}},
  year      = {1998},
  url       = {http://dl.acm.org/citation.cfm?id=314613.315034},
  timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/NayakSZ98.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Zwick98,
  author    = {Uri Zwick},
  editor    = {Jeffrey Scott Vitter},
  title     = {Finding Almost-Satisfying Assignments},
  booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
               of Computing, Dallas, Texas, USA, May 23-26, 1998},
  pages     = {551--560},
  publisher = {{ACM}},
  year      = {1998},
  url       = {https://doi.org/10.1145/276698.276869},
  doi       = {10.1145/276698.276869},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/Zwick98.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlonYZ97,
  author    = {Noga Alon and
               Raphael Yuster and
               Uri Zwick},
  title     = {Finding and Counting Given Length Cycles},
  journal   = {Algorithmica},
  volume    = {17},
  number    = {3},
  pages     = {209--223},
  year      = {1997},
  url       = {https://doi.org/10.1007/BF02523189},
  doi       = {10.1007/BF02523189},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/AlonYZ97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DubinerZ97,
  author    = {Moshe Dubiner and
               Uri Zwick},
  title     = {Amplification by Read-Once Formulas},
  journal   = {{SIAM} J. Comput.},
  volume    = {26},
  number    = {1},
  pages     = {15--38},
  year      = {1997},
  url       = {https://doi.org/10.1137/S009753979223633X},
  doi       = {10.1137/S009753979223633X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DubinerZ97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/YusterZ97,
  author    = {Raphael Yuster and
               Uri Zwick},
  title     = {Finding Even Cycles Even Faster},
  journal   = {{SIAM} J. Discret. Math.},
  volume    = {10},
  number    = {2},
  pages     = {209--222},
  year      = {1997},
  url       = {https://doi.org/10.1137/S0895480194274133},
  doi       = {10.1137/S0895480194274133},
  timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamdm/YusterZ97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/TardosZ97,
  author    = {G{\'{a}}bor Tardos and
               Uri Zwick},
  title     = {The Communication Complexity of the Universal Relation},
  booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
               Complexity, Ulm, Germany, June 24-27, 1997},
  pages     = {247--259},
  publisher = {{IEEE} Computer Society},
  year      = {1997},
  url       = {https://doi.org/10.1109/CCC.1997.612320},
  doi       = {10.1109/CCC.1997.612320},
  timestamp = {Fri, 20 Dec 2019 11:26:24 +0100},
  biburl    = {https://dblp.org/rec/conf/coco/TardosZ97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KarloffZ97,
  author    = {Howard J. Karloff and
               Uri Zwick},
  title     = {A 7/8-Approximation Algorithm for {MAX} 3SAT?},
  booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
               Miami Beach, Florida, USA, October 19-22, 1997},
  pages     = {406--415},
  publisher = {{IEEE} Computer Society},
  year      = {1997},
  url       = {https://doi.org/10.1109/SFCS.1997.646129},
  doi       = {10.1109/SFCS.1997.646129},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/KarloffZ97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CohenZ97,
  author    = {Edith Cohen and
               Uri Zwick},
  editor    = {Michael E. Saks},
  title     = {All-Pairs Small-Stretch Paths},
  booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
  pages     = {93--102},
  publisher = {{ACM/SIAM}},
  year      = {1997},
  url       = {http://dl.acm.org/citation.cfm?id=314161.314190},
  timestamp = {Thu, 05 Jul 2018 07:29:42 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/CohenZ97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-040,
  author    = {Dorit Dor and
               Shay Halperin and
               Uri Zwick},
  title     = {All Pairs Almost Shortest Paths},
  journal   = {Electron. Colloquium Comput. Complex.},
  volume    = {4},
  number    = {40},
  year      = {1997},
  url       = {http://eccc.hpi-web.de/eccc-reports/1997/TR97-040/index.html},
  timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/ECCC-TR97-040.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/DorZ96,
  author    = {Dorit Dor and
               Uri Zwick},
  title     = {Finding The alpha n-Th Largest Element},
  journal   = {Comb.},
  volume    = {16},
  number    = {1},
  pages     = {41--58},
  year      = {1996},
  url       = {https://doi.org/10.1007/BF01300126},
  doi       = {10.1007/BF01300126},
  timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/combinatorica/DorZ96.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/em/EpsteinlZ96,
  author    = {David B. A. Epstein and
               Anthony R. lano{-}Fletcher and
               Uri Zwick},
  title     = {Growth Functions and Automatic Groups},
  journal   = {Exp. Math.},
  volume    = {5},
  number    = {4},
  pages     = {297--315},
  year      = {1996},
  url       = {https://doi.org/10.1080/10586458.1996.10504595},
  doi       = {10.1080/10586458.1996.10504595},
  timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/em/EpsteinlZ96.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zwick96,
  author    = {Uri Zwick},
  title     = {On the Number of ANDs Versus the Number of ORs in Monotone Boolean
               Circuits},
  journal   = {Inf. Process. Lett.},
  volume    = {59},
  number    = {1},
  pages     = {29--30},
  year      = {1996},
  url       = {https://doi.org/10.1016/0020-0190(96)00080-4},
  doi       = {10.1016/0020-0190(96)00080-4},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ipl/Zwick96.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HalperinZ96,
  author    = {Shay Halperin and
               Uri Zwick},
  title     = {An Optimal Randomised Logarithmic Time Connectivity Algorithm for
               the {EREW} {PRAM}},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {53},
  number    = {3},
  pages     = {395--416},
  year      = {1996},
  url       = {https://doi.org/10.1006/jcss.1996.0078},
  doi       = {10.1006/jcss.1996.0078},
  timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jcss/HalperinZ96.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Ben-AmramJZ96,
  author    = {Amir M. Ben{-}Amram and
               Bryant A. Julstrom and
               Uri Zwick},
  title     = {A Note on Busy Beavers and Other Creatures},
  journal   = {Math. Syst. Theory},
  volume    = {29},
  number    = {4},
  pages     = {375--386},
  year      = {1996},
  url       = {http://www.springerlink.com/content/3r25m95gu015y6xd/},
  timestamp = {Sun, 17 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/mst/Ben-AmramJZ96.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZwickP96,
  author    = {Uri Zwick and
               Mike Paterson},
  title     = {The Complexity of Mean Payoff Games on Graphs},
  journal   = {Theor. Comput. Sci.},
  volume    = {158},
  number    = {1{\&}2},
  pages     = {343--359},
  year      = {1996},
  url       = {https://doi.org/10.1016/0304-3975(95)00188-3},
  doi       = {10.1016/0304-3975(95)00188-3},
  timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/ZwickP96.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DorZ96,
  author    = {Dorit Dor and
               Uri Zwick},
  title     = {Median Selection Requires (2+epsilon)n Comparisons},
  booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
               Burlington, Vermont, USA, 14-16 October, 1996},
  pages     = {125--134},
  publisher = {{IEEE} Computer Society},
  year      = {1996},
  url       = {https://doi.org/10.1109/SFCS.1996.548471},
  doi       = {10.1109/SFCS.1996.548471},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/DorZ96.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DorHZ96,
  author    = {Dorit Dor and
               Shay Halperin and
               Uri Zwick},
  title     = {All Pairs Almost Shortest Paths},
  booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
               Burlington, Vermont, USA, 14-16 October, 1996},
  pages     = {452--461},
  publisher = {{IEEE} Computer Society},
  year      = {1996},
  url       = {https://doi.org/10.1109/SFCS.1996.548504},
  doi       = {10.1109/SFCS.1996.548504},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/DorHZ96.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HalperinZ96,
  author    = {Shay Halperin and
               Uri Zwick},
  editor    = {{\'{E}}va Tardos},
  title     = {Optimal randomized {EREW} {PRAM} Algorithms for Finding Spanning Forests
               and for other Basic Graph Connectivity Problems},
  booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
  pages     = {438--447},
  publisher = {{ACM/SIAM}},
  year      = {1996},
  url       = {http://dl.acm.org/citation.cfm?id=313852.314099},
  timestamp = {Thu, 05 Jul 2018 07:29:31 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/HalperinZ96.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlonYZ95,
  author    = {Noga Alon and
               Raphael Yuster and
               Uri Zwick},
  title     = {Color-Coding},
  journal   = {J. {ACM}},
  volume    = {42},
  number    = {4},
  pages     = {844--856},
  year      = {1995},
  url       = {https://doi.org/10.1145/210332.210337},
  doi       = {10.1145/210332.210337},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jacm/AlonYZ95.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ColeHPZ95,
  author    = {Richard Cole and
               Ramesh Hariharan and
               Mike Paterson and
               Uri Zwick},
  title     = {Tighter Lower Bounds on the Exact Complexity of String Matching},
  journal   = {{SIAM} J. Comput.},
  volume    = {24},
  number    = {1},
  pages     = {30--45},
  year      = {1995},
  url       = {https://doi.org/10.1137/S0097539793245829},
  doi       = {10.1137/S0097539793245829},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/ColeHPZ95.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Zwick95,
  author    = {Uri Zwick},
  title     = {The Smallest Networks on Which the Ford-Fulkerson Maximum Flow Procedure
               may Fail to Terminate},
  journal   = {Theor. Comput. Sci.},
  volume    = {148},
  number    = {1},
  pages     = {165--170},
  year      = {1995},
  url       = {https://doi.org/10.1016/0304-3975(95)00022-O},
  doi       = {10.1016/0304-3975(95)00022-O},
  timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/Zwick95.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ZwickP95,
  author    = {Uri Zwick and
               Mike Paterson},
  editor    = {Ding{-}Zhu Du and
               Ming Li},
  title     = {The Complexity of Mean Payoff Games},
  booktitle = {Computing and Combinatorics, First Annual International Conference,
               {COCOON} '95, Xi'an, China, August 24-26, 1995, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {959},
  pages     = {1--10},
  publisher = {Springer},
  year      = {1995},
  url       = {https://doi.org/10.1007/BFb0030814},
  doi       = {10.1007/BFb0030814},
  timestamp = {Tue, 14 May 2019 10:00:35 +0200},
  biburl    = {https://dblp.org/rec/conf/cocoon/ZwickP95.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/PatersonTZ95,
  author    = {Mike Paterson and
               Shlomit Tassa and
               Uri Zwick},
  editor    = {P. S. Thiagarajan},
  title     = {Looking for {MUM} and {DAD:} Text-Text Comparisons Do Help},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science,
               15th Conference, Bangalore, India, December 18-20, 1995, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1026},
  pages     = {1--10},
  publisher = {Springer},
  year      = {1995},
  url       = {https://doi.org/10.1007/3-540-60692-0\_36},
  doi       = {10.1007/3-540-60692-0\_36},
  timestamp = {Tue, 14 May 2019 10:00:51 +0200},
  biburl    = {https://dblp.org/rec/conf/fsttcs/PatersonTZ95.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/DorZ95,
  author    = {Dorit Dor and
               Uri Zwick},
  title     = {Finding percentile elements},
  booktitle = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS}
               1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings},
  pages     = {88--97},
  publisher = {{IEEE} Computer Society},
  year      = {1995},
  url       = {https://doi.org/10.1109/ISTCS.1995.377042},
  doi       = {10.1109/ISTCS.1995.377042},
  timestamp = {Wed, 16 Oct 2019 14:14:52 +0200},
  biburl    = {https://dblp.org/rec/conf/istcs/DorZ95.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/GoldbergZ95,
  author    = {Tal Goldberg and
               Uri Zwick},
  title     = {Optimal deterministic approximate parallel prefix sums and their applications},
  booktitle = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS}
               1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings},
  pages     = {220--228},
  publisher = {{IEEE} Computer Society},
  year      = {1995},
  url       = {https://doi.org/10.1109/ISTCS.1995.377028},
  doi       = {10.1109/ISTCS.1995.377028},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/istcs/GoldbergZ95.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DorZ95,
  author    = {Dorit Dor and
               Uri Zwick},
  editor    = {Kenneth L. Clarkson},
  title     = {Selecting the Median},
  booktitle = {Proceedings of the Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
               22-24 January 1995. San Francisco, California, {USA}},
  pages     = {28--37},
  publisher = {{ACM/SIAM}},
  year      = {1995},
  url       = {http://dl.acm.org/citation.cfm?id=313651.313660},
  timestamp = {Thu, 05 Jul 2018 07:29:25 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/DorZ95.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-031,
  author    = {Dorit Dor and
               Uri Zwick},
  title     = {Selecting the Median},
  journal   = {Electron. Colloquium Comput. Complex.},
  volume    = {2},
  number    = {31},
  year      = {1995},
  url       = {http://eccc.hpi-web.de/eccc-reports/1995/TR95-031/index.html},
  timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/ECCC-TR95-031.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR95-040,
  author    = {Uri Zwick and
               Mike Paterson},
  title     = {The Complexity of Mean Payoff Games on Graphs},
  journal   = {Electron. Colloquium Comput. Complex.},
  volume    = {2},
  number    = {40},
  year      = {1995},
  url       = {http://eccc.hpi-web.de/eccc-reports/1995/TR95-040/index.html},
  timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/ECCC-TR95-040.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DubinerZ94,
  author    = {Moshe Dubiner and
               Uri Zwick},
  title     = {How Do Read-Once Formulae Shrink?},
  journal   = {Comb. Probab. Comput.},
  volume    = {3},
  pages     = {455--469},
  year      = {1994},
  url       = {https://doi.org/10.1017/S0963548300001358},
  doi       = {10.1017/S0963548300001358},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cpc/DubinerZ94.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GoldbergZ94,
  author    = {Tal Goldberg and
               Uri Zwick},
  title     = {Faster Parallel String Matching via Larger Deterministic Samples},
  journal   = {J. Algorithms},
  volume    = {16},
  number    = {2},
  pages     = {295--308},
  year      = {1994},
  url       = {https://doi.org/10.1006/jagm.1994.1014},
  doi       = {10.1006/jagm.1994.1014},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jal/GoldbergZ94.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AlonYZ94,
  author    = {Noga Alon and
               Raphael Yuster and
               Uri Zwick},
  editor    = {Jan van Leeuwen},
  title     = {Finding and Counting Given Length Cycles (Extended Abstract)},
  booktitle = {Algorithms - {ESA} '94, Second Annual European Symposium, Utrecht,
               The Netherlands, September 26-28, 1994, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {855},
  pages     = {354--364},
  publisher = {Springer},
  year      = {1994},
  url       = {https://doi.org/10.1007/BFb0049422},
  doi       = {10.1007/BFb0049422},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/esa/AlonYZ94.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/YusterZ94,
  author    = {Raphael Yuster and
               Uri Zwick},
  editor    = {Serge Abiteboul and
               Eli Shamir},
  title     = {Finding Even Cycles Even Faster},
  booktitle = {Automata, Languages and Programming, 21st International Colloquium,
               ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {820},
  pages     = {532--543},
  publisher = {Springer},
  year      = {1994},
  url       = {https://doi.org/10.1007/3-540-58201-0\_96},
  doi       = {10.1007/3-540-58201-0\_96},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/YusterZ94.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/HalperinZ94,
  author    = {Shay Halperin and
               Uri Zwick},
  editor    = {Lawrence Snyder and
               Charles E. Leiserson},
  title     = {An Optimal Randomized Logarithmic Time Connectivity algorithm for
               the {EREW} {PRAM} (Extended Abstract)},
  booktitle = {Proceedings of the 6th Annual {ACM} Symposium on Parallel Algorithms
               and Architectures, {SPAA} '94, Cape May, New Jersey, USA, June 27-29,
               1994},
  pages     = {1--10},
  publisher = {{ACM}},
  year      = {1994},
  url       = {https://doi.org/10.1145/181014.181017},
  doi       = {10.1145/181014.181017},
  timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
  biburl    = {https://dblp.org/rec/conf/spaa/HalperinZ94.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlonYZ94,
  author    = {Noga Alon and
               Raphael Yuster and
               Uri Zwick},
  editor    = {Frank Thomson Leighton and
               Michael T. Goodrich},
  title     = {Color-coding: a new method for finding simple paths, cycles and other
               small subgraphs within large graphs},
  booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
               Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
               Canada},
  pages     = {326--335},
  publisher = {{ACM}},
  year      = {1994},
  url       = {https://doi.org/10.1145/195058.195179},
  doi       = {10.1145/195058.195179},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/AlonYZ94.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR94-009,
  author    = {Noga Alon and
               Raphael Yuster and
               Uri Zwick},
  title     = {Color-Coding},
  journal   = {Electron. Colloquium Comput. Complex.},
  volume    = {1},
  number    = {9},
  year      = {1994},
  url       = {http://eccc.hpi-web.de/eccc-reports/1994/TR94-009/index.html},
  timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/ECCC-TR94-009.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PatersonZ93,
  author    = {Mike Paterson and
               Uri Zwick},
  title     = {Shallow Circuits and Concise Formulae for Multiple Addition and Multiplication},
  journal   = {Comput. Complex.},
  volume    = {3},
  pages     = {262--291},
  year      = {1993},
  url       = {https://doi.org/10.1007/BF01271371},
  doi       = {10.1007/BF01271371},
  timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cc/PatersonZ93.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PatersonZ93,
  author    = {Mike Paterson and
               Uri Zwick},
  title     = {Shrinkage of de Morgan Formulae under Restriction},
  journal   = {Random Struct. Algorithms},
  volume    = {4},
  number    = {2},
  pages     = {135--150},
  year      = {1993},
  url       = {https://doi.org/10.1002/rsa.3240040203},
  doi       = {10.1002/rsa.3240040203},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/rsa/PatersonZ93.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ZwickP93,
  author    = {Uri Zwick and
               Mike Paterson},
  title     = {The Memory Game},
  journal   = {Theor. Comput. Sci.},
  volume    = {110},
  number    = {1},
  pages     = {169--196},
  year      = {1993},
  url       = {https://doi.org/10.1016/0304-3975(93)90355-W},
  doi       = {10.1016/0304-3975(93)90355-W},
  timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/ZwickP93.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/ColeHPZ93,
  author    = {Richard Cole and
               Ramesh Hariharan and
               Mike Paterson and
               Uri Zwick},
  title     = {Which Patterns are Hard to Find?},
  booktitle = {Second Israel Symposium on Theory of Computing Systems, {ISTCS} 1993,
               Natanya, Israel, June 7-9, 1993, Proceedings},
  pages     = {59--68},
  publisher = {{IEEE} Computer Society},
  year      = {1993},
  url       = {https://doi.org/10.1109/ISTCS.1993.253483},
  doi       = {10.1109/ISTCS.1993.253483},
  timestamp = {Wed, 16 Oct 2019 14:14:52 +0200},
  biburl    = {https://dblp.org/rec/conf/istcs/ColeHPZ93.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DubinerZ92,
  author    = {Moshe Dubiner and
               Uri Zwick},
  title     = {Amplification and Percolation},
  booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
               Pennsylvania, USA, 24-27 October 1992},
  pages     = {258--267},
  publisher = {{IEEE} Computer Society},
  year      = {1992},
  url       = {https://doi.org/10.1109/SFCS.1992.267766},
  doi       = {10.1109/SFCS.1992.267766},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/DubinerZ92.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PatersonZ92,
  author    = {Mike Paterson and
               Uri Zwick},
  editor    = {S. Rao Kosaraju and
               Mike Fellows and
               Avi Wigderson and
               John A. Ellis},
  title     = {Shallow Multiplication Circuits and Wise Financial Investments},
  booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
               May 4-6, 1992, Victoria, British Columbia, Canada},
  pages     = {429--437},
  publisher = {{ACM}},
  year      = {1992},
  url       = {https://doi.org/10.1145/129712.129753},
  doi       = {10.1145/129712.129753},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/PatersonZ92.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zwick91,
  author    = {Uri Zwick},
  title     = {An Extension of Khrapchenko's Theorem},
  journal   = {Inf. Process. Lett.},
  volume    = {37},
  number    = {4},
  pages     = {215--217},
  year      = {1991},
  url       = {https://doi.org/10.1016/0020-0190(91)90191-J},
  doi       = {10.1016/0020-0190(91)90191-J},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ipl/Zwick91.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Zwick91,
  author    = {Uri Zwick},
  title     = {A 4n Lower Bound on the Combinational Complexity of Certain Symmetric
               Boolean Functions over the Basis of Unate Dyadic Boolean Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {20},
  number    = {3},
  pages     = {499--505},
  year      = {1991},
  url       = {https://doi.org/10.1137/0220032},
  doi       = {10.1137/0220032},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/Zwick91.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/arith/PatersonZ91,
  author    = {Michael S. Paterson and
               Uri Zwick},
  title     = {Shallow multiplication circuits},
  booktitle = {10th {IEEE} Symposium on Computer Arithmetic, {ARITH} 1991, Grenoble,
               France, June 26-28, 1991},
  pages     = {28--34},
  publisher = {{IEEE}},
  year      = {1991},
  url       = {https://doi.org/10.1109/ARITH.1991.145530},
  doi       = {10.1109/ARITH.1991.145530},
  timestamp = {Wed, 16 Oct 2019 14:14:53 +0200},
  biburl    = {https://dblp.org/rec/conf/arith/PatersonZ91.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatersonZ91,
  author    = {Mike Paterson and
               Uri Zwick},
  title     = {Shrinkage of de{\textasciitilde}Morgan formulae under restriction},
  booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
               Puerto Rico, 1-4 October 1991},
  pages     = {324--333},
  publisher = {{IEEE} Computer Society},
  year      = {1991},
  url       = {https://doi.org/10.1109/SFCS.1991.185385},
  doi       = {10.1109/SFCS.1991.185385},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/PatersonZ91.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatersonPZ90,
  author    = {Mike Paterson and
               Nicholas Pippenger and
               Uri Zwick},
  title     = {Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication
               and Symmetric Boolean Functions},
  booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
               Missouri, USA, October 22-24, 1990, Volume {II}},
  pages     = {642--650},
  publisher = {{IEEE} Computer Society},
  year      = {1990},
  url       = {https://doi.org/10.1109/FSCS.1990.89586},
  doi       = {10.1109/FSCS.1990.89586},
  timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
  biburl    = {https://dblp.org/rec/conf/focs/PatersonPZ90.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlonZ89,
  author    = {Noga Alon and
               Uri Zwick},
  title     = {On Neciporuk's Theorem for Branching Programs},
  journal   = {Theor. Comput. Sci.},
  volume    = {64},
  number    = {3},
  pages     = {331--342},
  year      = {1989},
  url       = {https://doi.org/10.1016/0304-3975(89)90054-6},
  doi       = {10.1016/0304-3975(89)90054-6},
  timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/AlonZ89.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics