BibTeX records: Shmuel Zaks

download as .bib file

@article{DBLP:journals/dmaa/GavrilSZ22,
  author       = {Fanica Gavril and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Approximation algorithms for maximum weight k-coverings of graphs
                  by packings},
  journal      = {Discret. Math. Algorithms Appl.},
  volume       = {14},
  number       = {1},
  pages        = {2150099:1--2150099:14},
  year         = {2022},
  url          = {https://doi.org/10.1142/S1793830921500993},
  doi          = {10.1142/S1793830921500993},
  timestamp    = {Tue, 15 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmaa/GavrilSZ22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithms/FlamminiMMSZ21,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {The Traffic Grooming Problem in Optical Networks with Respect to ADMs
                  and OADMs: Complexity and Approximation},
  journal      = {Algorithms},
  volume       = {14},
  number       = {5},
  pages        = {151},
  year         = {2021},
  url          = {https://doi.org/10.3390/a14050151},
  doi          = {10.3390/A14050151},
  timestamp    = {Tue, 13 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithms/FlamminiMMSZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/FlamminiMMSZ21,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {On the Online Coalition Structure Generation Problem},
  journal      = {J. Artif. Intell. Res.},
  volume       = {72},
  pages        = {1215--1250},
  year         = {2021},
  url          = {https://doi.org/10.1613/jair.1.12989},
  doi          = {10.1613/JAIR.1.12989},
  timestamp    = {Fri, 25 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jair/FlamminiMMSZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/EmekKSZ21,
  author       = {Yuval Emek and
                  Shay Kutten and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Multicast Communications with Varying Bandwidth Constraints},
  booktitle    = {40th {IEEE} Conference on Computer Communications, {INFOCOM} 2021,
                  Vancouver, BC, Canada, May 10-13, 2021},
  pages        = {1--10},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.1109/INFOCOM42981.2021.9488869},
  doi          = {10.1109/INFOCOM42981.2021.9488869},
  timestamp    = {Mon, 02 Aug 2021 15:15:40 +0200},
  biburl       = {https://dblp.org/rec/conf/infocom/EmekKSZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/EmekKSZ21,
  author       = {Yuval Emek and
                  Shay Kutten and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Tom{\'{a}}s Bures and
                  Riccardo Dondi and
                  Johann Gamper and
                  Giovanna Guerrini and
                  Tomasz Jurdzinski and
                  Claus Pahl and
                  Florian Sikora and
                  Prudence W. H. Wong},
  title        = {Hierarchical b-Matching},
  booktitle    = {{SOFSEM} 2021: Theory and Practice of Computer Science - 47th International
                  Conference on Current Trends in Theory and Practice of Computer Science,
                  {SOFSEM} 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12607},
  pages        = {189--202},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-67731-2\_14},
  doi          = {10.1007/978-3-030-67731-2\_14},
  timestamp    = {Sun, 25 Jul 2021 11:44:25 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/EmekKSZ21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ShalomWZ20,
  author       = {Mordechai Shalom and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  title        = {Profit Maximization in Flex-Grid All-Optical Networks},
  journal      = {Theory Comput. Syst.},
  volume       = {64},
  number       = {2},
  pages        = {311--326},
  year         = {2020},
  url          = {https://doi.org/10.1007/s00224-019-09943-x},
  doi          = {10.1007/S00224-019-09943-X},
  timestamp    = {Thu, 06 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/ShalomWZ20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ErlebachLLSWZ19,
  author       = {Thomas Erlebach and
                  Fu{-}Hong Liu and
                  Hsiang{-}Hsuan Liu and
                  Mordechai Shalom and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  title        = {Complexity and online algorithms for minimum skyline coloring of intervals},
  journal      = {Theor. Comput. Sci.},
  volume       = {788},
  pages        = {66--78},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.05.007},
  doi          = {10.1016/J.TCS.2019.05.007},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ErlebachLLSWZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-10210,
  author       = {Yuval Emek and
                  Shay Kutten and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Hierarchical b-Matching},
  journal      = {CoRR},
  volume       = {abs/1904.10210},
  year         = {2019},
  url          = {http://arxiv.org/abs/1904.10210},
  eprinttype    = {arXiv},
  eprint       = {1904.10210},
  timestamp    = {Fri, 26 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-10210.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-10215,
  author       = {Yuval Emek and
                  Fanica Gavril and
                  Shay Kutten and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Maximizing Communication Throughput in Tree Networks},
  journal      = {CoRR},
  volume       = {abs/1904.10215},
  year         = {2019},
  url          = {http://arxiv.org/abs/1904.10215},
  eprinttype    = {arXiv},
  eprint       = {1904.10215},
  timestamp    = {Fri, 26 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1904-10215.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BoyaciESZ18,
  author       = {Arman Boyaci and
                  T{\'{\i}}naz Ekim and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations
                  of Holes-Part {II}},
  journal      = {Discret. Math. Theor. Comput. Sci.},
  volume       = {20},
  number       = {1},
  year         = {2018},
  url          = {https://doi.org/10.23638/DMTCS-20-1-2},
  doi          = {10.23638/DMTCS-20-1-2},
  timestamp    = {Tue, 24 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmtcs/BoyaciESZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ShachnaiVZ18,
  author       = {Hadas Shachnai and
                  Ariella Voloshin and
                  Shmuel Zaks},
  title        = {Flexible bandwidth assignment with application to optical networks},
  journal      = {J. Sched.},
  volume       = {21},
  number       = {3},
  pages        = {327--336},
  year         = {2018},
  url          = {https://doi.org/10.1007/s10951-017-0514-4},
  doi          = {10.1007/S10951-017-0514-4},
  timestamp    = {Wed, 01 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/scheduling/ShachnaiVZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/FlamminiMMSZ18,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Elisabeth Andr{\'{e}} and
                  Sven Koenig and
                  Mehdi Dastani and
                  Gita Sukthankar},
  title        = {Online Coalition Structure Generation in Graph Games},
  booktitle    = {Proceedings of the 17th International Conference on Autonomous Agents
                  and MultiAgent Systems, {AAMAS} 2018, Stockholm, Sweden, July 10-15,
                  2018},
  pages        = {1353--1361},
  publisher    = {International Foundation for Autonomous Agents and Multiagent Systems
                  Richland, SC, {USA} / {ACM}},
  year         = {2018},
  url          = {http://dl.acm.org/citation.cfm?id=3237902},
  timestamp    = {Sat, 30 Sep 2023 09:34:53 +0200},
  biburl       = {https://dblp.org/rec/conf/atal/FlamminiMMSZ18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/BoyaciESZ17,
  author       = {Arman Boyaci and
                  T{\'{\i}}naz Ekim and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a
                  Grid},
  journal      = {Discret. Math. Theor. Comput. Sci.},
  volume       = {19},
  number       = {1},
  year         = {2017},
  url          = {https://doi.org/10.23638/DMTCS-19-1-13},
  doi          = {10.23638/DMTCS-19-1-13},
  timestamp    = {Tue, 24 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dmtcs/BoyaciESZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ShachnaiVZ17,
  author       = {Hadas Shachnai and
                  Ariella Voloshin and
                  Shmuel Zaks},
  title        = {Optimizing bandwidth allocation in elastic optical networks with application
                  to scheduling},
  journal      = {J. Discrete Algorithms},
  volume       = {45},
  pages        = {1--13},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jda.2017.07.001},
  doi          = {10.1016/J.JDA.2017.07.001},
  timestamp    = {Fri, 20 Oct 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jda/ShachnaiVZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MertziosSWZ17,
  author       = {George B. Mertzios and
                  Mordechai Shalom and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  title        = {Online Regenerator Placement},
  journal      = {Theory Comput. Syst.},
  volume       = {61},
  number       = {3},
  pages        = {739--754},
  year         = {2017},
  url          = {https://doi.org/10.1007/s00224-016-9711-3},
  doi          = {10.1007/S00224-016-9711-3},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/MertziosSWZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppna/VermaRARAZG17,
  author       = {Kshitiz Verma and
                  Gianluca Rizzo and
                  Antonio Fern{\'{a}}ndez Anta and
                  Rub{\'{e}}n Cuevas Rum{\'{\i}}n and
                  Arturo Azcorra and
                  Shmuel Zaks and
                  Alberto Garc{\'{\i}}a{-}Mart{\'{\i}}nez},
  title        = {Energy-optimal collaborative file distribution in wired networks},
  journal      = {Peer-to-Peer Netw. Appl.},
  volume       = {10},
  number       = {4},
  pages        = {925--944},
  year         = {2017},
  url          = {https://doi.org/10.1007/s12083-016-0453-4},
  doi          = {10.1007/S12083-016-0453-4},
  timestamp    = {Mon, 04 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ppna/VermaRARAZG17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/ErlebachLLSWZ17,
  author       = {Thomas Erlebach and
                  Fu{-}Hong Liu and
                  Hsiang{-}Hsuan Liu and
                  Mordechai Shalom and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  editor       = {Xiaofeng Gao and
                  Hongwei Du and
                  Meng Han},
  title        = {Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals},
  booktitle    = {Combinatorial Optimization and Applications - 11th International Conference,
                  {COCOA} 2017, Shanghai, China, December 16-18, 2017, Proceedings,
                  Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {10628},
  pages        = {317--332},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-71147-8\_22},
  doi          = {10.1007/978-3-319-71147-8\_22},
  timestamp    = {Tue, 14 Jun 2022 14:15:49 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoa/ErlebachLLSWZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MertziosZ16,
  author       = {George B. Mertzios and
                  Shmuel Zaks},
  title        = {On the intersection of tolerance and cocomparability graphs},
  journal      = {Discret. Appl. Math.},
  volume       = {199},
  pages        = {46--88},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.dam.2014.10.025},
  doi          = {10.1016/J.DAM.2014.10.025},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/MertziosZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ShalomWZ16,
  author       = {Mordechai Shalom and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  title        = {On-line maximum matching in complete multi-partite graphs with an
                  application to optical networks},
  journal      = {Discret. Appl. Math.},
  volume       = {199},
  pages        = {123--136},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.dam.2014.10.040},
  doi          = {10.1016/J.DAM.2014.10.040},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/ShalomWZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HartsteinSZ16,
  author       = {Itamar Hartstein and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {On the complexity of the regenerator location problem treewidth and
                  other parameters},
  journal      = {Discret. Appl. Math.},
  volume       = {199},
  pages        = {199--225},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.dam.2015.01.036},
  doi          = {10.1016/J.DAM.2015.01.036},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/HartsteinSZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoyaciESZ16,
  author       = {Arman Boyaci and
                  T{\'{\i}}naz Ekim and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Graphs of edge-intersecting non-splitting paths in a tree: Representations
                  of holes - Part {I}},
  journal      = {Discret. Appl. Math.},
  volume       = {215},
  pages        = {47--60},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.dam.2015.07.024},
  doi          = {10.1016/J.DAM.2015.07.024},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BoyaciESZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GozupekSSZ16,
  author       = {Didem G{\"{o}}z{\"{u}}pek and
                  Hadas Shachnai and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Constructing minimum changeover cost arborescenses in bounded treewidth
                  graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {621},
  pages        = {22--36},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2016.01.022},
  doi          = {10.1016/J.TCS.2016.01.022},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GozupekSSZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyaciESZ16,
  author       = {Arman Boyaci and
                  T{\'{\i}}naz Ekim and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Graphs of edge-intersecting and non-splitting paths},
  journal      = {Theor. Comput. Sci.},
  volume       = {629},
  pages        = {40--50},
  year         = {2016},
  url          = {https://doi.org/10.1016/j.tcs.2015.10.004},
  doi          = {10.1016/J.TCS.2015.10.004},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BoyaciESZ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/twc/SciancaleporeMB16,
  author       = {Vincenzo Sciancalepore and
                  Vincenzo Mancuso and
                  Albert Banchs and
                  Shmuel Zaks and
                  Antonio Capone},
  title        = {Enhanced Content Update Dissemination Through {D2D} in 5G Cellular
                  Networks},
  journal      = {{IEEE} Trans. Wirel. Commun.},
  volume       = {15},
  number       = {11},
  pages        = {7517--7530},
  year         = {2016},
  url          = {https://doi.org/10.1109/TWC.2016.2604300},
  doi          = {10.1109/TWC.2016.2604300},
  timestamp    = {Sun, 06 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/twc/SciancaleporeMB16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aina/VermaZG16,
  author       = {Kshitiz Verma and
                  Shmuel Zaks and
                  Alberto Garc{\'{\i}}a{-}Mart{\'{\i}}nez},
  editor       = {Leonard Barolli and
                  Makoto Takizawa and
                  Tomoya Enokido and
                  Antonio J. Jara and
                  Yann Bocchi},
  title        = {{SLEEPWELL:} Energy Efficient Network Design for the Developing World
                  Using Green Switches},
  booktitle    = {30th {IEEE} International Conference on Advanced Information Networking
                  and Applications, {AINA} 2016, Crans-Montana, Switzerland, 23-25 March,
                  2016},
  pages        = {266--273},
  publisher    = {{IEEE} Computer Society},
  year         = {2016},
  url          = {https://doi.org/10.1109/AINA.2016.98},
  doi          = {10.1109/AINA.2016.98},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/aina/VermaZG16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MertziosSVWZ15,
  author       = {George B. Mertzios and
                  Mordechai Shalom and
                  Ariella Voloshin and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  title        = {Optimizing busy time on parallel machines},
  journal      = {Theor. Comput. Sci.},
  volume       = {562},
  pages        = {524--541},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.tcs.2014.10.033},
  doi          = {10.1016/J.TCS.2014.10.033},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/MertziosSVWZ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/adhoc-now/Zaks15,
  author       = {Shmuel Zaks},
  editor       = {Symeon Papavassiliou and
                  Stefan Ruehrup},
  title        = {Online Lower Bounds and Offline Inapproximability in Optical Networks},
  booktitle    = {Ad-hoc, Mobile, and Wireless Networks - 14th International Conference,
                  {ADHOC-NOW} 2015, Athens, Greece, June 29 - July 1, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9143},
  pages        = {253--270},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-19662-6\_18},
  doi          = {10.1007/978-3-319-19662-6\_18},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/adhoc-now/Zaks15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Zaks15,
  author       = {Shmuel Zaks},
  editor       = {Ernst W. Mayr},
  title        = {On the Complexity of Approximation and Online Scheduling Problems
                  with Applications to Optical Networks},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 41st International
                  Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {9224},
  pages        = {31--46},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-53174-7\_3},
  doi          = {10.1007/978-3-662-53174-7\_3},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/Zaks15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/GozupekSSZ15,
  author       = {Didem G{\"{o}}z{\"{u}}pek and
                  Hadas Shachnai and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Ekrem Duman and
                  Ali Fuat Alkaya},
  title        = {Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth
                  Graphs},
  booktitle    = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization,
                  Istanbul, Turkey, May 26-28, 2015},
  pages        = {201--204},
  year         = {2015},
  timestamp    = {Thu, 02 Feb 2017 18:00:28 +0100},
  biburl       = {https://dblp.org/rec/conf/colognetwente/GozupekSSZ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/VermaZG15,
  author       = {Kshitiz Verma and
                  Shmuel Zaks and
                  Alberto Garc{\'{\i}}a{-}Mart{\'{\i}}nez},
  title        = {Designing Low Cost and Energy Efficient Access Network for the Developing
                  World},
  journal      = {CoRR},
  volume       = {abs/1501.04041},
  year         = {2015},
  url          = {http://arxiv.org/abs/1501.04041},
  eprinttype    = {arXiv},
  eprint       = {1501.04041},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/VermaZG15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyaciESZ15,
  author       = {Arman Boyaci and
                  T{\'{\i}}naz Ekim and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a
                  Grid},
  journal      = {CoRR},
  volume       = {abs/1512.06440},
  year         = {2015},
  url          = {http://arxiv.org/abs/1512.06440},
  eprinttype    = {arXiv},
  eprint       = {1512.06440},
  timestamp    = {Fri, 17 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BoyaciESZ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FlamminiMMSZ14,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {On the Complexity of the Regenerator Cost Problem in General Networks
                  with Traffic Grooming},
  journal      = {Algorithmica},
  volume       = {68},
  number       = {3},
  pages        = {671--691},
  year         = {2014},
  url          = {https://doi.org/10.1007/s00453-012-9693-8},
  doi          = {10.1007/S00453-012-9693-8},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FlamminiMMSZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GozupekSVZ14,
  author       = {Didem G{\"{o}}z{\"{u}}pek and
                  Mordechai Shalom and
                  Ariella Voloshin and
                  Shmuel Zaks},
  title        = {On the complexity of constructing minimum changeover cost arborescences},
  journal      = {Theor. Comput. Sci.},
  volume       = {540},
  pages        = {40--52},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.03.023},
  doi          = {10.1016/J.TCS.2014.03.023},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GozupekSVZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShalomVWYZ14,
  author       = {Mordechai Shalom and
                  Ariella Voloshin and
                  Prudence W. H. Wong and
                  Fencol C. C. Yung and
                  Shmuel Zaks},
  title        = {Online optimization of busy time on parallel machines},
  journal      = {Theor. Comput. Sci.},
  volume       = {560},
  pages        = {190--206},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.07.017},
  doi          = {10.1016/J.TCS.2014.07.017},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ShalomVWYZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/BoyaciESZ14,
  author       = {Arman Boyaci and
                  T{\'{\i}}naz Ekim and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Stefano Bistarelli and
                  Andrea Formisano},
  title        = {Graphs of edge-intersecting and non-splitting paths},
  booktitle    = {Proceedings of the 15th Italian Conference on Theoretical Computer
                  Science, Perugia, Italy, September 17-19, 2014},
  series       = {{CEUR} Workshop Proceedings},
  volume       = {1231},
  pages        = {45--58},
  publisher    = {CEUR-WS.org},
  year         = {2014},
  url          = {https://ceur-ws.org/Vol-1231/long3.pdf},
  timestamp    = {Fri, 10 Mar 2023 16:23:17 +0100},
  biburl       = {https://dblp.org/rec/conf/ictcs/BoyaciESZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/SciancaleporeMBZC14,
  author       = {Vincenzo Sciancalepore and
                  Vincenzo Mancuso and
                  Albert Banchs and
                  Shmuel Zaks and
                  Antonio Capone},
  title        = {Interference coordination strategies for content update dissemination
                  in {LTE-A}},
  booktitle    = {2014 {IEEE} Conference on Computer Communications, {INFOCOM} 2014,
                  Toronto, Canada, April 27 - May 2, 2014},
  pages        = {1797--1805},
  publisher    = {{IEEE}},
  year         = {2014},
  url          = {https://doi.org/10.1109/INFOCOM.2014.6848118},
  doi          = {10.1109/INFOCOM.2014.6848118},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/infocom/SciancaleporeMBZC14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/ShachnaiVZ14,
  author       = {Hadas Shachnai and
                  Ariella Voloshin and
                  Shmuel Zaks},
  title        = {Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with
                  Application to Scheduling},
  booktitle    = {2014 {IEEE} 28th International Parallel and Distributed Processing
                  Symposium, Phoenix, AZ, USA, May 19-23, 2014},
  pages        = {862--871},
  publisher    = {{IEEE} Computer Society},
  year         = {2014},
  url          = {https://doi.org/10.1109/IPDPS.2014.93},
  doi          = {10.1109/IPDPS.2014.93},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ipps/ShachnaiVZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ShachnaiVZ14,
  author       = {Hadas Shachnai and
                  Ariella Voloshin and
                  Shmuel Zaks},
  editor       = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
                  Martin Dietzfelbinger and
                  Zolt{\'{a}}n {\'{E}}sik},
  title        = {Flexible Bandwidth Assignment with Application to Optical Networks
                  - (Extended Abstract)},
  booktitle    = {Mathematical Foundations of Computer Science 2014 - 39th International
                  Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
                  Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {8635},
  pages        = {613--624},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-662-44465-8\_52},
  doi          = {10.1007/978-3-662-44465-8\_52},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/ShachnaiVZ14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/ShalomWZ13,
  author       = {Mordechai Shalom and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  editor       = {Thomas Moscibroda and
                  Adele A. Rescigno},
  title        = {Profit Maximization in Flex-Grid All-Optical Networks},
  booktitle    = {Structural Information and Communication Complexity - 20th International
                  Colloquium, {SIROCCO} 2013, Ischia, Italy, July 1-3, 2013, Revised
                  Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8179},
  pages        = {249--260},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-319-03578-9\_21},
  doi          = {10.1007/978-3-319-03578-9\_21},
  timestamp    = {Tue, 14 May 2019 10:00:55 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/ShalomWZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BoyaciESZ13,
  author       = {Arman Boyaci and
                  T{\'{\i}}naz Ekim and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Andreas Brandst{\"{a}}dt and
                  Klaus Jansen and
                  R{\"{u}}diger Reischuk},
  title        = {Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards
                  Hole Representations - (Extended Abstract)},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 39th International
                  Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
                  Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8165},
  pages        = {115--126},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-45043-3\_11},
  doi          = {10.1007/978-3-642-45043-3\_11},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/BoyaciESZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MertziosSWZ13,
  author       = {George B. Mertzios and
                  Mordechai Shalom and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  title        = {Online Regenerator Placement},
  journal      = {CoRR},
  volume       = {abs/1309.0195},
  year         = {2013},
  url          = {http://arxiv.org/abs/1309.0195},
  eprinttype    = {arXiv},
  eprint       = {1309.0195},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/MertziosSWZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyaciESZ13,
  author       = {Arman Boyaci and
                  T{\'{\i}}naz Ekim and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Towards
                  Hole Representations-Part {I}},
  journal      = {CoRR},
  volume       = {abs/1309.2898},
  year         = {2013},
  url          = {http://arxiv.org/abs/1309.2898},
  eprinttype    = {arXiv},
  eprint       = {1309.2898},
  timestamp    = {Fri, 17 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BoyaciESZ13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyaciESZ13a,
  author       = {Arman Boyaci and
                  T{\'{\i}}naz Ekim and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations
                  of Holes-Part {II}},
  journal      = {CoRR},
  volume       = {abs/1309.6471},
  year         = {2013},
  url          = {http://arxiv.org/abs/1309.6471},
  eprinttype    = {arXiv},
  eprint       = {1309.6471},
  timestamp    = {Fri, 17 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BoyaciESZ13a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/AntaMMZ12,
  author       = {Antonio Fern{\'{a}}ndez Anta and
                  Alessia Milani and
                  Miguel A. Mosteiro and
                  Shmuel Zaks},
  title        = {Opportunistic information dissemination in mobile ad-hoc networks:
                  the profit of global synchrony},
  journal      = {Distributed Comput.},
  volume       = {25},
  number       = {4},
  pages        = {279--296},
  year         = {2012},
  url          = {https://doi.org/10.1007/s00446-012-0165-9},
  doi          = {10.1007/S00446-012-0165-9},
  timestamp    = {Fri, 13 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dc/AntaMMZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/MertziosSSZ12,
  author       = {George B. Mertzios and
                  Ignasi Sau and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Placing regenerators in optical networks to satisfy multiple sets
                  of requests},
  journal      = {{IEEE/ACM} Trans. Netw.},
  volume       = {20},
  number       = {6},
  pages        = {1870--1879},
  year         = {2012},
  url          = {https://doi.org/10.1109/TNET.2012.2186462},
  doi          = {10.1109/TNET.2012.2186462},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ton/MertziosSSZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/MertziosSVWZ12,
  author       = {George B. Mertzios and
                  Mordechai Shalom and
                  Ariella Voloshin and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  title        = {Optimizing Busy Time on Parallel Machines},
  booktitle    = {26th {IEEE} International Parallel and Distributed Processing Symposium,
                  {IPDPS} 2012, Shanghai, China, May 21-25, 2012},
  pages        = {238--248},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/IPDPS.2012.31},
  doi          = {10.1109/IPDPS.2012.31},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ipps/MertziosSVWZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Farach-ColtonAMMZ12,
  author       = {Martin Farach{-}Colton and
                  Antonio Fern{\'{a}}ndez Anta and
                  Alessia Milani and
                  Miguel A. Mosteiro and
                  Shmuel Zaks},
  editor       = {David Fern{\'{a}}ndez{-}Baca},
  title        = {Opportunistic Information Dissemination in Mobile Ad-Hoc Networks:
                  Adaptiveness vs. Obliviousness and Randomization vs. Determinism},
  booktitle    = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
                  Arequipa, Peru, April 16-20, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7256},
  pages        = {303--314},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-29344-3\_26},
  doi          = {10.1007/978-3-642-29344-3\_26},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/Farach-ColtonAMMZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/ShalomVWYZ12,
  author       = {Mordechai Shalom and
                  Ariella Voloshin and
                  Prudence W. H. Wong and
                  Fencol C. C. Yung and
                  Shmuel Zaks},
  editor       = {Manindra Agrawal and
                  S. Barry Cooper and
                  Angsheng Li},
  title        = {Online Optimization of Busy Time on Parallel Machines - (Extended
                  Abstract)},
  booktitle    = {Theory and Applications of Models of Computation - 9th Annual Conference,
                  {TAMC} 2012, Beijing, China, May 16-21, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7287},
  pages        = {448--460},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-29952-0\_43},
  doi          = {10.1007/978-3-642-29952-0\_43},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/tamc/ShalomVWYZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/HartsteinSZ12,
  author       = {Itamar Hartstein and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Thomas Erlebach and
                  Giuseppe Persiano},
  title        = {On the Complexity of the Regenerator Location Problem - Treewidth
                  and Other Parameters - (Extended Abstract)},
  booktitle    = {Approximation and Online Algorithms - 10th International Workshop,
                  {WAOA} 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {7846},
  pages        = {42--55},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-38016-7\_5},
  doi          = {10.1007/978-3-642-38016-7\_5},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/waoa/HartsteinSZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-0552,
  author       = {George B. Mertzios and
                  Shmuel Zaks},
  title        = {On the Intersection of Tolerance and Cocomparability Graphs},
  journal      = {CoRR},
  volume       = {abs/1207.0552},
  year         = {2012},
  url          = {http://arxiv.org/abs/1207.0552},
  eprinttype    = {arXiv},
  eprint       = {1207.0552},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1207-0552.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MertziosSZ11,
  author       = {George B. Mertzios and
                  Ignasi Sau and
                  Shmuel Zaks},
  title        = {The Recognition of Tolerance and Bounded Tolerance Graphs},
  journal      = {{SIAM} J. Comput.},
  volume       = {40},
  number       = {5},
  pages        = {1234--1257},
  year         = {2011},
  url          = {https://doi.org/10.1137/090780328},
  doi          = {10.1137/090780328},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/MertziosSZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FlamminiMMSZ11,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Optimizing regenerator cost in traffic grooming},
  journal      = {Theor. Comput. Sci.},
  volume       = {412},
  number       = {52},
  pages        = {7109--7121},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.tcs.2011.09.023},
  doi          = {10.1016/J.TCS.2011.09.023},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/FlamminiMMSZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/FlamminiMMMZ11,
  author       = {Michele Flammini and
                  Alberto Marchetti{-}Spaccamela and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Shmuel Zaks},
  title        = {On the complexity of the regenerator placement problem in optical
                  networks},
  journal      = {{IEEE/ACM} Trans. Netw.},
  volume       = {19},
  number       = {2},
  pages        = {498--511},
  year         = {2011},
  url          = {https://doi.org/10.1109/TNET.2010.2068309},
  doi          = {10.1109/TNET.2010.2068309},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ton/FlamminiMMMZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/MertziosSWZ11,
  author       = {George B. Mertzios and
                  Mordechai Shalom and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  editor       = {Antonio Fern{\'{a}}ndez Anta and
                  Giuseppe Lipari and
                  Matthieu Roy},
  title        = {Online Regenerator Placement},
  booktitle    = {Principles of Distributed Systems - 15th International Conference,
                  {OPODIS} 2011, Toulouse, France, December 13-16, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7109},
  pages        = {4--17},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-25873-2\_2},
  doi          = {10.1007/978-3-642-25873-2\_2},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/opodis/MertziosSWZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/FlamminiMMSZ11,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Antonio Fern{\'{a}}ndez Anta and
                  Giuseppe Lipari and
                  Matthieu Roy},
  title        = {On the Complexity of the Regenerator Cost Problem in General Networks
                  with Traffic Grooming},
  booktitle    = {Principles of Distributed Systems - 15th International Conference,
                  {OPODIS} 2011, Toulouse, France, December 13-16, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7109},
  pages        = {96--111},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-25873-2\_8},
  doi          = {10.1007/978-3-642-25873-2\_8},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/opodis/FlamminiMMSZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/Farach-ColtonAMMZ11,
  author       = {Martin Farach{-}Colton and
                  Antonio Fern{\'{a}}ndez Anta and
                  Alessia Milani and
                  Miguel A. Mosteiro and
                  Shmuel Zaks},
  editor       = {David Peleg},
  title        = {Brief Announcement: Opportunistic Information Dissemination in Mobile
                  Ad-Hoc Networks: - Adaptiveness vs. Obliviousness and Randomization
                  vs. Determinism},
  booktitle    = {Distributed Computing - 25th International Symposium, {DISC} 2011,
                  Rome, Italy, September 20-22, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6950},
  pages        = {202--204},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-24100-0\_19},
  doi          = {10.1007/978-3-642-24100-0\_19},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/Farach-ColtonAMMZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1105-6151,
  author       = {Martin Farach{-}Colton and
                  Antonio Fern{\'{a}}ndez Anta and
                  Alessia Milani and
                  Miguel A. Mosteiro and
                  Shmuel Zaks},
  title        = {Opportunistic Information Dissemination in Mobile Ad-hoc Networks:
                  adaptiveness vs. obliviousness and randomization vs. determinism},
  journal      = {CoRR},
  volume       = {abs/1105.6151},
  year         = {2011},
  url          = {http://arxiv.org/abs/1105.6151},
  eprinttype    = {arXiv},
  eprint       = {1105.6151},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1105-6151.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/ChernoySZ10,
  author       = {Viacheslav Chernoy and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {On the performance of Dijkstra's third self-stabilizing algorithm
                  for mutual exclusion and related algorithms},
  journal      = {Distributed Comput.},
  volume       = {23},
  number       = {1},
  pages        = {43--60},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00446-010-0104-6},
  doi          = {10.1007/S00446-010-0104-6},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dc/ChernoySZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/ShalomWZ10,
  author       = {Mordechai Shalom and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  title        = {Optimal on-line colorings for minimizing the number of ADMs in optical
                  networks},
  journal      = {J. Discrete Algorithms},
  volume       = {8},
  number       = {2},
  pages        = {174--188},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.jda.2009.02.006},
  doi          = {10.1016/J.JDA.2009.02.006},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jda/ShalomWZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FlamminiMMSSTZ10,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Hadas Shachnai and
                  Mordechai Shalom and
                  Tami Tamir and
                  Shmuel Zaks},
  title        = {Minimizing total busy time in parallel scheduling with application
                  to optical networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {411},
  number       = {40-42},
  pages        = {3553--3562},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.tcs.2010.05.011},
  doi          = {10.1016/J.TCS.2010.05.011},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/FlamminiMMSSTZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MertziosSSZ10,
  author       = {George B. Mertzios and
                  Ignasi Sau and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Samson Abramsky and
                  Cyril Gavoille and
                  Claude Kirchner and
                  Friedhelm Meyer auf der Heide and
                  Paul G. Spirakis},
  title        = {Placing Regenerators in Optical Networks to Satisfy Multiple Sets
                  of Requests},
  booktitle    = {Automata, Languages and Programming, 37th International Colloquium,
                  {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
                  {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6199},
  pages        = {333--344},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14162-1\_28},
  doi          = {10.1007/978-3-642-14162-1\_28},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/MertziosSSZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MertziosZ10,
  author       = {George B. Mertzios and
                  Shmuel Zaks},
  editor       = {Otfried Cheong and
                  Kyung{-}Yong Chwa and
                  Kunsoo Park},
  title        = {On the Intersection of Tolerance and Cocomparability Graphs},
  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        = {230--240},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-17517-6\_22},
  doi          = {10.1007/978-3-642-17517-6\_22},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/MertziosZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/FlamminiMMSZ10,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Chenyang Lu and
                  Toshimitsu Masuzawa and
                  Mohamed Mosbah},
  title        = {Optimizing Regenerator Cost in Traffic Grooming - (Extended Abstract)},
  booktitle    = {Principles of Distributed Systems - 14th International Conference,
                  {OPODIS} 2010, Tozeur, Tunisia, December 14-17, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6490},
  pages        = {443--458},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-17653-1\_32},
  doi          = {10.1007/978-3-642-17653-1\_32},
  timestamp    = {Tue, 11 Oct 2022 14:59:07 +0200},
  biburl       = {https://dblp.org/rec/conf/opodis/FlamminiMMSZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/SauSZ10,
  author       = {Ignasi Sau and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Boaz Patt{-}Shamir and
                  T{\'{\i}}naz Ekim},
  title        = {Traffic Grooming in Star Networks via Matching Techniques},
  booktitle    = {Structural Information and Communication Complexity, 17th International
                  Colloquium, {SIROCCO} 2010, Sirince, Turkey, June 7-11, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6058},
  pages        = {41--56},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13284-1\_5},
  doi          = {10.1007/978-3-642-13284-1\_5},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/SauSZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MertziosSZ10,
  author       = {George B. Mertzios and
                  Ignasi Sau and
                  Shmuel Zaks},
  editor       = {Jean{-}Yves Marion and
                  Thomas Schwentick},
  title        = {The Recognition of Tolerance and Bounded Tolerance Graphs},
  booktitle    = {27th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2010, March 4-6, 2010, Nancy, France},
  series       = {LIPIcs},
  volume       = {5},
  pages        = {585--596},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2010},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2010.2487},
  doi          = {10.4230/LIPICS.STACS.2010.2487},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/MertziosSZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AntaMMZ10,
  author       = {Antonio Fern{\'{a}}ndez Anta and
                  Alessia Milani and
                  Miguel A. Mosteiro and
                  Shmuel Zaks},
  editor       = {Nancy A. Lynch and
                  Alexander A. Shvartsman},
  title        = {Opportunistic Information Dissemination in Mobile Ad-hoc Networks:
                  The Profit of Global Synchrony},
  booktitle    = {Distributed Computing, 24th International Symposium, {DISC} 2010,
                  Cambridge, MA, USA, September 13-15, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6343},
  pages        = {374--388},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-15763-9\_34},
  doi          = {10.1007/978-3-642-15763-9\_34},
  timestamp    = {Sun, 25 Jul 2021 11:53:35 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/AntaMMZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/sp/10/CinklerCFMMMSSZ10,
  author       = {Tibor Cinkler and
                  David Coudert and
                  Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Xavier Mu{\~{n}}oz and
                  Ignasi Sau and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Arie Koster and
                  Xavier Mu{\~{n}}oz},
  title        = {Traffic Grooming: Combinatorial Results and Practical Resolutions},
  booktitle    = {Graphs and Algorithms in Communication Networks: Studies in Broadband,
                  Optical, Wireless and Ad Hoc Networks},
  series       = {Texts in Theoretical Computer Science. An {EATCS} Series},
  pages        = {63--94},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-02250-0\_2},
  doi          = {10.1007/978-3-642-02250-0\_2},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/books/sp/10/CinklerCFMMMSSZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-3251,
  author       = {George B. Mertzios and
                  Ignasi Sau and
                  Shmuel Zaks},
  title        = {The Recognition of Tolerance and Bounded Tolerance Graphs},
  journal      = {CoRR},
  volume       = {abs/1001.3251},
  year         = {2010},
  url          = {http://arxiv.org/abs/1001.3251},
  eprinttype    = {arXiv},
  eprint       = {1001.3251},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1001-3251.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FlamminiSZ09,
  author       = {Michele Flammini and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {On minimizing the number of ADMs in a general topology optical network},
  journal      = {Discret. Appl. Math.},
  volume       = {157},
  number       = {12},
  pages        = {2701--2717},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.dam.2008.08.014},
  doi          = {10.1016/J.DAM.2008.08.014},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/FlamminiSZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DershowitzZ09,
  author       = {Nachum Dershowitz and
                  Shmuel Zaks},
  title        = {More Patterns in Trees: Up and Down, Young and Old, Odd and Even},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {23},
  number       = {1},
  pages        = {447--465},
  year         = {2009},
  url          = {https://doi.org/10.1137/070687475},
  doi          = {10.1137/070687475},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/DershowitzZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MertziosSZ09,
  author       = {George B. Mertzios and
                  Ignasi Sau and
                  Shmuel Zaks},
  title        = {A New Intersection Model and Improved Algorithms for Tolerance Graphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {23},
  number       = {4},
  pages        = {1800--1813},
  year         = {2009},
  url          = {https://doi.org/10.1137/09075994X},
  doi          = {10.1137/09075994X},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/MertziosSZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PrencipeZ09,
  author       = {Giuseppe Prencipe and
                  Shmuel Zaks},
  title        = {Preface},
  journal      = {Theor. Comput. Sci.},
  volume       = {410},
  number       = {14},
  pages        = {1305--1306},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.tcs.2008.12.027},
  doi          = {10.1016/J.TCS.2008.12.027},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/PrencipeZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/FlamminiMMSSTZ09,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Hadas Shachnai and
                  Mordechai Shalom and
                  Tami Tamir and
                  Shmuel Zaks},
  title        = {Minimizing total busy time in parallel scheduling with application
                  to optical networks},
  booktitle    = {23rd {IEEE} International Symposium on Parallel and Distributed Processing,
                  {IPDPS} 2009, Rome, Italy, May 23-29, 2009},
  pages        = {1--12},
  publisher    = {{IEEE}},
  year         = {2009},
  url          = {https://doi.org/10.1109/IPDPS.2009.5161017},
  doi          = {10.1109/IPDPS.2009.5161017},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ipps/FlamminiMMSSTZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/ShalomWZ09,
  author       = {Mordechai Shalom and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  editor       = {Shay Kutten and
                  Janez Zerovnik},
  title        = {On-Line Maximum Matching in Complete Multipartite Graphs with Implications
                  to the Minimum {ADM} Problem on a Star Topology},
  booktitle    = {Structural Information and Communication Complexity, 16th International
                  Colloquium, {SIROCCO} 2009, Piran, Slovenia, May 25-27, 2009, Revised
                  Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5869},
  pages        = {281--294},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-11476-2\_22},
  doi          = {10.1007/978-3-642-11476-2\_22},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/ShalomWZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/FlamminiMMMZ09,
  author       = {Michele Flammini and
                  Alberto Marchetti{-}Spaccamela and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Shmuel Zaks},
  editor       = {Friedhelm Meyer auf der Heide and
                  Michael A. Bender},
  title        = {On the complexity of the regenerator placement problem in optical
                  networks},
  booktitle    = {{SPAA} 2009: Proceedings of the 21st Annual {ACM} Symposium on Parallelism
                  in Algorithms and Architectures, Calgary, Alberta, Canada, August
                  11-13, 2009},
  pages        = {154--162},
  publisher    = {{ACM}},
  year         = {2009},
  url          = {https://doi.org/10.1145/1583991.1584035},
  doi          = {10.1145/1583991.1584035},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/spaa/FlamminiMMMZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/MertziosSZ09,
  author       = {George B. Mertzios and
                  Ignasi Sau and
                  Shmuel Zaks},
  editor       = {Christophe Paul and
                  Michel Habib},
  title        = {A New Intersection Model and Improved Algorithms for Tolerance Graphs},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
                  {WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5911},
  pages        = {285--295},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-11409-0\_25},
  doi          = {10.1007/978-3-642-11409-0\_25},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/MertziosSZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/FlamminiMMSZ08,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Selfishness, collusion and power of local search for the ADMs minimization
                  problem},
  journal      = {Comput. Networks},
  volume       = {52},
  number       = {9},
  pages        = {1721--1731},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.comnet.2008.02.009},
  doi          = {10.1016/J.COMNET.2008.02.009},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cn/FlamminiMMSZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GavrilPZ08,
  author       = {Fanica Gavril and
                  Ron Y. Pinter and
                  Shmuel Zaks},
  title        = {Intersection representations of matrices by subtrees and unicycles
                  on graphs},
  journal      = {J. Discrete Algorithms},
  volume       = {6},
  number       = {2},
  pages        = {216--228},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.jda.2007.08.001},
  doi          = {10.1016/J.JDA.2007.08.001},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/GavrilPZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FlamminiMSZ08,
  author       = {Michele Flammini and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Approximating the traffic grooming problem},
  journal      = {J. Discrete Algorithms},
  volume       = {6},
  number       = {3},
  pages        = {472--479},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.jda.2007.09.001},
  doi          = {10.1016/J.JDA.2007.09.001},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jda/FlamminiMSZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/FlamminiMMSZ08,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Approximating the traffic grooming problem in tree and star networks},
  journal      = {J. Parallel Distributed Comput.},
  volume       = {68},
  number       = {7},
  pages        = {939--948},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.jpdc.2008.01.003},
  doi          = {10.1016/J.JPDC.2008.01.003},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jpdc/FlamminiMMSZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/FlamminiMMSZ08,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Emilio Luque and
                  Tom{\`{a}}s Margalef and
                  Domingo Benitez},
  title        = {Approximating the Traffic Grooming Problem with Respect to ADMs and
                  OADMs},
  booktitle    = {Euro-Par 2008 - Parallel Processing, 14th International Euro-Par Conference,
                  Las Palmas de Gran Canaria, Spain, August 26-29, 2008, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5168},
  pages        = {920--929},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-85451-7\_99},
  doi          = {10.1007/978-3-540-85451-7\_99},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/europar/FlamminiMMSZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/ChernoySZ08,
  author       = {Viacheslav Chernoy and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Alexander A. Shvartsman and
                  Pascal Felber},
  title        = {On the Performance of Beauquier and Debas' Self-stabilizing Algorithm
                  for Mutual Exclusion},
  booktitle    = {Structural Information and Communication Complexity, 15th International
                  Colloquium, {SIROCCO} 2008, Villars-sur-Ollon, Switzerland, June 17-20,
                  2008, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5058},
  pages        = {221--233},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-69355-0\_19},
  doi          = {10.1007/978-3-540-69355-0\_19},
  timestamp    = {Thu, 23 Jun 2022 19:57:45 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/ChernoySZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/ChernoySZ08,
  author       = {Viacheslav Chernoy and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Gadi Taubenfeld},
  title        = {A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion
                  on a Ring},
  booktitle    = {Distributed Computing, 22nd International Symposium, {DISC} 2008,
                  Arcachon, France, September 22-24, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5218},
  pages        = {63--77},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-87779-0\_5},
  doi          = {10.1007/978-3-540-87779-0\_5},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/ChernoySZ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/FlamminiSZ07,
  author       = {Michele Flammini and
                  Mordechai Shalom and
                  Shmuel Zaks},
  title        = {On minimizing the number of ADMs - Tight bounds for an algorithm without
                  preprocessing},
  journal      = {J. Parallel Distributed Comput.},
  volume       = {67},
  number       = {4},
  pages        = {448--455},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.jpdc.2006.12.002},
  doi          = {10.1016/J.JPDC.2006.12.002},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jpdc/FlamminiSZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShalomZ07,
  author       = {Mordechai Shalom and
                  Shmuel Zaks},
  title        = {Minimization of the number of ADMs in {SONET} rings with maximum throughput
                  with implications to the traffic grooming problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {384},
  number       = {2-3},
  pages        = {250--262},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2007.04.021},
  doi          = {10.1016/J.TCS.2007.04.021},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ShalomZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/ShalomZ07,
  author       = {Mordechai Shalom and
                  Shmuel Zaks},
  title        = {A 10/7 + epsilon approximation for minimizing the number of ADMs in
                  {SONET} rings},
  journal      = {{IEEE/ACM} Trans. Netw.},
  volume       = {15},
  number       = {6},
  pages        = {1593--1602},
  year         = {2007},
  url          = {http://doi.acm.org/10.1145/1373476.1373506},
  doi          = {10.1145/1373476.1373506},
  timestamp    = {Mon, 26 May 2008 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ton/ShalomZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/ShalomUZ07,
  author       = {Mordechai Shalom and
                  Walter Unger and
                  Shmuel Zaks},
  editor       = {Pierluigi Crescenzi and
                  Giuseppe Prencipe and
                  Geppino Pucci},
  title        = {On the Complexity of the Traffic Grooming Problem in Optical Networks},
  booktitle    = {Fun with Algorithms, 4th International Conference, {FUN} 2007, Castiglioncello,
                  Italy, June 3-5, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4475},
  pages        = {262--271},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-72914-3\_23},
  doi          = {10.1007/978-3-540-72914-3\_23},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/fun/ShalomUZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sss/ChernoySZ07,
  author       = {Viacheslav Chernoy and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Toshimitsu Masuzawa and
                  S{\'{e}}bastien Tixeuil},
  title        = {On the Performance of Dijkstra's Third Self-stabilizing Algorithm
                  for Mutual Exclusion},
  booktitle    = {Stabilization, Safety, and Security of Distributed Systems, 9th International
                  Symposium, {SSS} 2007, Paris, France, November 14-16, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4838},
  pages        = {114--123},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-76627-8\_11},
  doi          = {10.1007/978-3-540-76627-8\_11},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/sss/ChernoySZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/ShalomWZ07,
  author       = {Mordechai Shalom and
                  Prudence W. H. Wong and
                  Shmuel Zaks},
  editor       = {Andrzej Pelc},
  title        = {Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical
                  Networks},
  booktitle    = {Distributed Computing, 21st International Symposium, {DISC} 2007,
                  Lemesos, Cyprus, September 24-26, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4731},
  pages        = {435--449},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-75142-7\_33},
  doi          = {10.1007/978-3-540-75142-7\_33},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/ShalomWZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/RaynalTZ07,
  author       = {Michel Raynal and
                  Sam Toueg and
                  Shmuel Zaks},
  editor       = {Andrzej Pelc},
  title        = {{DISC} at Its 20th Anniversary (Stockholm, 2006)},
  booktitle    = {Distributed Computing, 21st International Symposium, {DISC} 2007,
                  Lemesos, Cyprus, September 24-26, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4731},
  pages        = {501--503},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-75142-7\_45},
  doi          = {10.1007/978-3-540-75142-7\_45},
  timestamp    = {Fri, 19 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/RaynalTZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/GiannantonioFMMSZ07,
  author       = {Stefania Di Giannantonio and
                  Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Xiaotie Deng and
                  Fan Chung Graham},
  title        = {Selfishness, Collusion and Power of Local Search for the ADMs Minimization
                  Problem},
  booktitle    = {Internet and Network Economics, Third International Workshop, {WINE}
                  2007, San Diego, CA, USA, December 12-14, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4858},
  pages        = {404--411},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-77105-0\_45},
  doi          = {10.1007/978-3-540-77105-0\_45},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/GiannantonioFMMSZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sirocco/2007,
  editor       = {Giuseppe Prencipe and
                  Shmuel Zaks},
  title        = {Structural Information and Communication Complexity, 14th International
                  Colloquium, {SIROCCO} 2007, Castiglioncello, Italy, June 5-8, 2007,
                  Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4474},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-72951-8},
  doi          = {10.1007/978-3-540-72951-8},
  isbn         = {978-3-540-72918-1},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/2007.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caan/FlamminiSZ06,
  author       = {Michele Flammini and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Thomas Erlebach},
  title        = {On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without
                  Preprocessing},
  booktitle    = {Combinatorial and Algorithmic Aspects of Networking, Third Workshop,
                  {CAAN} 2006, Chester, UK, July 2, 2006. Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4235},
  pages        = {72--85},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11922377\_7},
  doi          = {10.1007/11922377\_7},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/caan/FlamminiSZ06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/FlamminiSZ06,
  author       = {Michele Flammini and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Shlomi Dolev},
  title        = {On Minimizing the Number of ADMs in a General Topology Optical Network},
  booktitle    = {Distributed Computing, 20th International Symposium, {DISC} 2006,
                  Stockholm, Sweden, September 18-20, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4167},
  pages        = {459--473},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11864219\_32},
  doi          = {10.1007/11864219\_32},
  timestamp    = {Sat, 19 Oct 2019 20:32:37 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/FlamminiSZ06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FlamminiMMSZ06,
  author       = {Michele Flammini and
                  Gianpiero Monaco and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Fedor V. Fomin},
  title        = {Approximating the Traffic Grooming Problem in Tree and Star Networks},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
                  {WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4271},
  pages        = {147--158},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11917496\_14},
  doi          = {10.1007/11917496\_14},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/FlamminiMMSZ06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FlamminiMFZ05,
  author       = {Michele Flammini and
                  Luca Moscardelli and
                  Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Xiaotie Deng and
                  Ding{-}Zhu Du},
  title        = {Approximating the Traffic Grooming Problem},
  booktitle    = {Algorithms and Computation, 16th International Symposium, {ISAAC}
                  2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3827},
  pages        = {915--924},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11602613\_91},
  doi          = {10.1007/11602613\_91},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/FlamminiMFZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/ShalomZ05,
  author       = {Mordechai Shalom and
                  Shmuel Zaks},
  editor       = {Andrzej Pelc and
                  Michel Raynal},
  title        = {Minimizing the Number of ADMs in {SONET} Rings with Maximum Throughput},
  booktitle    = {Structural Information and Communication Complexity, 12th International
                  Colloquium, {SIROCCO} 2005, Mont Saint-Michel, France, May 24-26,
                  2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3499},
  pages        = {277--291},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11429647\_22},
  doi          = {10.1007/11429647\_22},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/ShalomZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/broadnets/ShalomZ04,
  author       = {Mordechai Shalom and
                  Shmuel Zaks},
  title        = {A 10/7 + varepsilon Approximation for Minimizing the Number of ADMs
                  in {SONET} Rings},
  booktitle    = {1st International Conference on Broadband Networks {(BROADNETS} 2004),
                  25-29 October 2004, San Jose, CA, {USA}},
  pages        = {254--262},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/BROADNETS.2004.1},
  doi          = {10.1109/BROADNETS.2004.1},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/broadnets/ShalomZ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsac/EilamMZ02,
  author       = {Tamar Eilam and
                  Shlomo Moran and
                  Shmuel Zaks},
  title        = {Lightpath arrangement in survivable rings to minimize the switching
                  cost},
  journal      = {{IEEE} J. Sel. Areas Commun.},
  volume       = {20},
  number       = {1},
  pages        = {172--182},
  year         = {2002},
  url          = {https://doi.org/10.1109/49.974671},
  doi          = {10.1109/49.974671},
  timestamp    = {Thu, 02 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jsac/EilamMZ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EilamMZ02,
  author       = {Tamar Eilam and
                  Shlomo Moran and
                  Shmuel Zaks},
  title        = {The complexity of the characterization of networks supporting shortest-path
                  interval routing},
  journal      = {Theor. Comput. Sci.},
  volume       = {289},
  number       = {1},
  pages        = {85--104},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0304-3975(01)00180-3},
  doi          = {10.1016/S0304-3975(01)00180-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EilamMZ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cai/Zaks01,
  author       = {Shmuel Zaks},
  title        = {Design Issues in {ATM} and Optical Networks},
  journal      = {Comput. Artif. Intell.},
  volume       = {20},
  number       = {2},
  pages        = {207--224},
  year         = {2001},
  url          = {http://www.cai.sk/ojs/index.php/cai/article/view/516},
  timestamp    = {Mon, 14 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cai/Zaks01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DinitzEMZ00,
  author       = {Yefim Dinitz and
                  Tamar Eilam and
                  Shlomo Moran and
                  Shmuel Zaks},
  title        = {On the totalk-diameter of connection networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {247},
  number       = {1-2},
  pages        = {213--228},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(98)00348-X},
  doi          = {10.1016/S0304-3975(98)00348-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DinitzEMZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Zaks00,
  author       = {Shmuel Zaks},
  editor       = {Gian Carlo Bongiovanni and
                  Giorgio Gambosi and
                  Rossella Petreschi},
  title        = {Duality in {ATM} Layout Problems},
  booktitle    = {Algorithms and Complexity, 4th Italian Conference, {CIAC} 2000, Rome,
                  Italy, March 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1767},
  pages        = {44--58},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-46521-9\_4},
  doi          = {10.1007/3-540-46521-9\_4},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/ciac/Zaks00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Zaks00,
  author       = {Shmuel Zaks},
  editor       = {Mogens Nielsen and
                  Branislav Rovan},
  title        = {On the Use of Duality and Geometry in Layouts for {ATM} Networks},
  booktitle    = {Mathematical Foundations of Computer Science 2000, 25th International
                  Symposium, {MFCS} 2000, Bratislava, Slovakia, August 28 - September
                  1, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1893},
  pages        = {114--131},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-44612-5\_8},
  doi          = {10.1007/3-540-44612-5\_8},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/Zaks00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/EilamMZ00,
  author       = {Tamar Eilam and
                  Shlomo Moran and
                  Shmuel Zaks},
  editor       = {Maurice Herlihy},
  title        = {Approximation Algorithms for Survivable Optical Networks},
  booktitle    = {Distributed Computing, 14th International Conference, {DISC} 2000,
                  Toledo, Spain, October 4-6, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1914},
  pages        = {104--118},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-40026-5\_7},
  doi          = {10.1007/3-540-40026-5\_7},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/EilamMZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/EilamMZ99,
  author       = {Tamar Eilam and
                  Shlomo Moran and
                  Shmuel Zaks},
  title        = {Lower bounds for linear interval routing},
  journal      = {Networks},
  volume       = {34},
  number       = {1},
  pages        = {37--46},
  year         = {1999},
  url          = {https://doi.org/10.1002/(SICI)1097-0037(199908)34:1\&\#60;37::AID-NET4\&\#62;3.0.CO;2-7},
  doi          = {10.1002/(SICI)1097-0037(199908)34:1\&\#60;37::AID-NET4\&\#62;3.0.CO;2-7},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/EilamMZ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LuiZ99,
  author       = {King{-}Shan Lui and
                  Shmuel Zaks},
  title        = {Scheduling in Synchronous Networks and the Greedy Algorithm},
  journal      = {Theor. Comput. Sci.},
  volume       = {220},
  number       = {1},
  pages        = {157--183},
  year         = {1999},
  url          = {https://doi.org/10.1016/S0304-3975(98)00240-0},
  doi          = {10.1016/S0304-3975(98)00240-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LuiZ99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-SE-9912018,
  author       = {Jan K. Pachl and
                  Shmuel Zaks},
  title        = {Computation in an algebra of test selection criteria},
  journal      = {CoRR},
  volume       = {cs.SE/9912018},
  year         = {1999},
  url          = {https://arxiv.org/abs/cs/9912018},
  timestamp    = {Fri, 10 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/cs-SE-9912018.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChengKZ98,
  author       = {Siu{-}Wing Cheng and
                  Michael Kaminski and
                  Shmuel Zaks},
  title        = {Minimum Dominating Sets of Intervals on Lines},
  journal      = {Algorithmica},
  volume       = {20},
  number       = {3},
  pages        = {294--308},
  year         = {1998},
  url          = {https://doi.org/10.1007/PL00009197},
  doi          = {10.1007/PL00009197},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/ChengKZ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GerstelWZ98,
  author       = {Ornan Ori Gerstel and
                  Avishai Wool and
                  Shmuel Zaks},
  title        = {Optimal layouts on a chain {ATM} network},
  journal      = {Discret. Appl. Math.},
  volume       = {83},
  number       = {1-3},
  pages        = {157--178},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0166-218X(98)80002-4},
  doi          = {10.1016/S0166-218X(98)80002-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/GerstelWZ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/EilamFZ98,
  author       = {Tamar Eilam and
                  Michele Flammini and
                  Shmuel Zaks},
  title        = {A Complete Characterization of the Path Layout Construction Problem
                  for {ATM} Networks with Given Hop Count and Load},
  journal      = {Parallel Process. Lett.},
  volume       = {8},
  number       = {2},
  pages        = {207--220},
  year         = {1998},
  url          = {https://doi.org/10.1142/S0129626498000225},
  doi          = {10.1142/S0129626498000225},
  timestamp    = {Tue, 24 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ppl/EilamFZ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolinZ98,
  author       = {Mordecai J. Golin and
                  Shmuel Zaks},
  title        = {Labelled Trees and Pairs of Input-Output Permutations in Priority
                  Queues},
  journal      = {Theor. Comput. Sci.},
  volume       = {205},
  number       = {1-2},
  pages        = {99--114},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0304-3975(97)00037-6},
  doi          = {10.1016/S0304-3975(97)00037-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GolinZ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/GerstelCZ98,
  author       = {Ornan Ori Gerstel and
                  Israel Cidon and
                  Shmuel Zaks},
  title        = {Efficient support for client/server applications over heterogeneous
                  {ATM} network},
  journal      = {{IEEE/ACM} Trans. Netw.},
  volume       = {6},
  number       = {4},
  pages        = {432--446},
  year         = {1998},
  url          = {https://doi.org/10.1109/90.720878},
  doi          = {10.1109/90.720878},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ton/GerstelCZ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GerstelZ97,
  author       = {Ornan Ori Gerstel and
                  Shmuel Zaks},
  title        = {The Bit Complexity of Distributed Sorting},
  journal      = {Algorithmica},
  volume       = {18},
  number       = {3},
  pages        = {405--416},
  year         = {1997},
  url          = {https://doi.org/10.1007/PL00009163},
  doi          = {10.1007/PL00009163},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/GerstelZ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Zaks97,
  author       = {Shmuel Zaks},
  editor       = {Marios Mavronicolas and
                  Michael Merritt and
                  Nir Shavit},
  title        = {Path layout in {ATM} networks-A survey},
  booktitle    = {Networks in Distributed Computing, Proceedings of a {DIMACS} Workshop,
                  New Brunswick, New Jersey, USA, October 27-29, 1997},
  series       = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
  volume       = {45},
  pages        = {145--160},
  publisher    = {{DIMACS/AMS}},
  year         = {1997},
  url          = {https://doi.org/10.1090/dimacs/045/09},
  doi          = {10.1090/DIMACS/045/09},
  timestamp    = {Mon, 22 May 2023 16:07:35 +0200},
  biburl       = {https://dblp.org/rec/conf/dimacs/Zaks97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EilamFZ97,
  author       = {Tamar Eilam and
                  Michele Flammini and
                  Shmuel Zaks},
  editor       = {Pierpaolo Degano and
                  Roberto Gorrieri and
                  Alberto Marchetti{-}Spaccamela},
  title        = {A Complete Characterization of the Path Layout Construction Problem
                  for {ATM} Networks with Given Hop Count and Load (Extended Abstract)},
  booktitle    = {Automata, Languages and Programming, 24th International Colloquium,
                  ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1256},
  pages        = {527--537},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/3-540-63165-8\_208},
  doi          = {10.1007/3-540-63165-8\_208},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/EilamFZ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/DinitzEMZ97,
  author       = {Yefim Dinitz and
                  Tamar Eilam and
                  Shlomo Moran and
                  Shmuel Zaks},
  title        = {On the total\({}_{\mbox{k}}\)-diameter of connection networks},
  booktitle    = {Fifth Israel Symposium on Theory of Computing and Systems, {ISTCS}
                  1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings},
  pages        = {96--106},
  publisher    = {{IEEE} Computer Society},
  year         = {1997},
  url          = {https://doi.org/10.1109/ISTCS.1997.595161},
  doi          = {10.1109/ISTCS.1997.595161},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/istcs/DinitzEMZ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/EilamMZ97,
  author       = {Tamar Eilam and
                  Shlomo Moran and
                  Shmuel Zaks},
  editor       = {Danny Krizanc and
                  Peter Widmayer},
  title        = {The Complexity of Characterization of Networks Supporting Shortest-Path
                  Interval Routing},
  booktitle    = {SIROCCO'97, 4th International Colloquium on Structural Information
                  {\&} Communication Complexity, Monte Verita, Ascona, Switzerland,
                  July 24-26, 1997},
  pages        = {99--111},
  publisher    = {Carleton Scientific},
  year         = {1997},
  timestamp    = {Fri, 30 Jan 2004 14:02:39 +0100},
  biburl       = {https://dblp.org/rec/conf/sirocco/EilamMZ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/FeighelsteinZ97,
  author       = {Marcelo Feighelstein and
                  Shmuel Zaks},
  editor       = {Danny Krizanc and
                  Peter Widmayer},
  title        = {Duality in Chain {ATM} Virtual Path Layouts},
  booktitle    = {SIROCCO'97, 4th International Colloquium on Structural Information
                  {\&} Communication Complexity, Monte Verita, Ascona, Switzerland,
                  July 24-26, 1997},
  pages        = {228--239},
  publisher    = {Carleton Scientific},
  year         = {1997},
  timestamp    = {Fri, 30 Jan 2004 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sirocco/FeighelsteinZ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/Zaks97,
  author       = {Shmuel Zaks},
  editor       = {Frantisek Pl{\'{a}}sil and
                  Keith G. Jeffery},
  title        = {Path Layout in {ATM} Networks},
  booktitle    = {{SOFSEM} '97: Theory and Practice of Informatics, 24th Seminar on
                  Current Trends in Theory and Practice of Informatics, Milovy, Czech
                  Republic, November 22-29, 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1338},
  pages        = {144--160},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/3-540-63774-5\_103},
  doi          = {10.1007/3-540-63774-5\_103},
  timestamp    = {Mon, 26 Jun 2023 20:44:33 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/Zaks97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/EilamMZ97,
  author       = {Tamar Eilam and
                  Shlomo Moran and
                  Shmuel Zaks},
  editor       = {Marios Mavronicolas and
                  Philippas Tsigas},
  title        = {A Simple DFS-Based Algorithm for Linear Interval Routing},
  booktitle    = {Distributed Algorithms, 11th International Workshop, {WDAG} '97, Saarbr{\"{u}}cken,
                  Germany, September 24-26, 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1320},
  pages        = {37--51},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/BFb0030674},
  doi          = {10.1007/BFB0030674},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/EilamMZ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/LuiZ97,
  author       = {King{-}Shan Lui and
                  Shmuel Zaks},
  editor       = {Marios Mavronicolas and
                  Philippas Tsigas},
  title        = {Scheduling in Synchronous Networks and the Greedy Algorithm (Extended
                  Abstract)},
  booktitle    = {Distributed Algorithms, 11th International Workshop, {WDAG} '97, Saarbr{\"{u}}cken,
                  Germany, September 24-26, 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1320},
  pages        = {66--80},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/BFb0030676},
  doi          = {10.1007/BFB0030676},
  timestamp    = {Fri, 19 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/LuiZ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DinitzFZ97,
  author       = {Yefim Dinitz and
                  Marcelo Feighelstein and
                  Shmuel Zaks},
  editor       = {Rolf H. M{\"{o}}hring},
  title        = {On Optimal Graphs Embedded into Path and Rings, with Analysis Using
                  l\({}_{\mbox{1}}\)-Spheres},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop,
                  {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1335},
  pages        = {171--183},
  publisher    = {Springer},
  year         = {1997},
  url          = {https://doi.org/10.1007/BFb0024497},
  doi          = {10.1007/BFB0024497},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/DinitzFZ97.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/GerstelCZ96,
  author       = {Ornan Ori Gerstel and
                  Israel Cidon and
                  Shmuel Zaks},
  title        = {Optimal Virtual Path Layout in {ATM} Networks With Shared Routing
                  Table Switches},
  journal      = {Chic. J. Theor. Comput. Sci.},
  volume       = {1996},
  year         = {1996},
  url          = {http://cjtcs.cs.uchicago.edu/articles/1996/3/contents.html},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cjtcs/GerstelCZ96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/GerstelCZ96,
  author       = {Ornan Ori Gerstel and
                  Israel Cidon and
                  Shmuel Zaks},
  title        = {The layout of virtual paths in {ATM} networks},
  journal      = {{IEEE/ACM} Trans. Netw.},
  volume       = {4},
  number       = {6},
  pages        = {873--884},
  year         = {1996},
  url          = {https://doi.org/10.1109/90.556344},
  doi          = {10.1109/90.556344},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ton/GerstelCZ96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/GerstelCZ96,
  author       = {Ornan Ori Gerstel and
                  Israel Cidon and
                  Shmuel Zaks},
  title        = {Efficient Support for the Client/Server Paradigm over Heterogeneous
                  {ATM} Networks},
  booktitle    = {Proceedings {IEEE} {INFOCOM} '96, The Conference on Computer Communications,
                  Fifteenth Annual Joint Conference of the {IEEE} Computer and Communications
                  Societies, Networking the Next Generation, San Francisco, CA, USA,
                  March 24-28, 1996},
  pages        = {1294--1301},
  publisher    = {{IEEE} Computer Society},
  year         = {1996},
  url          = {https://doi.org/10.1109/INFCOM.1996.493076},
  doi          = {10.1109/INFCOM.1996.493076},
  timestamp    = {Wed, 16 Oct 2019 14:14:51 +0200},
  biburl       = {https://dblp.org/rec/conf/infocom/GerstelCZ96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/NgokZ96,
  author       = {Derek Hing{-}leung Ngok and
                  Shmuel Zaks},
  editor       = {Nicola Santoro and
                  Paul G. Spirakis},
  title        = {On the Power of Local Information in Scheduling in Synchronous Networks},
  booktitle    = {SIROCCO'96, The 3rd International Colloquium on Structural Information
                  {\&} Communication Complexity, Siena, Italy, June 6-8, 1996},
  pages        = {301--312},
  publisher    = {Carleton Scientific},
  year         = {1996},
  timestamp    = {Fri, 30 Jan 2004 14:17:51 +0100},
  biburl       = {https://dblp.org/rec/conf/sirocco/NgokZ96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/EilamMZ96,
  author       = {Tamar Eilam and
                  Shlomo Moran and
                  Shmuel Zaks},
  editor       = {{\"{O}}zalp Babaoglu and
                  Keith Marzullo},
  title        = {A Lower Bound for Linear Interval Routing},
  booktitle    = {Distributed Algorithms, 10th International Workshop, {WDAG} '96, Bologna,
                  Italy, October 9-11, 1996, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1151},
  pages        = {191--205},
  publisher    = {Springer},
  year         = {1996},
  url          = {https://doi.org/10.1007/3-540-61769-8\_13},
  doi          = {10.1007/3-540-61769-8\_13},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/EilamMZ96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BiranMZ95,
  author       = {Ofer Biran and
                  Shlomo Moran and
                  Shmuel Zaks},
  title        = {Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks},
  journal      = {Theor. Comput. Sci.},
  volume       = {145},
  number       = {1{\&}2},
  pages        = {271--290},
  year         = {1995},
  url          = {https://doi.org/10.1016/0304-3975(94)00157-E},
  doi          = {10.1016/0304-3975(94)00157-E},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BiranMZ95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ChengKZ95,
  author       = {Siu{-}Wing Cheng and
                  Michael Kaminski and
                  Shmuel Zaks},
  editor       = {Ding{-}Zhu Du and
                  Ming Li},
  title        = {Minimum Dominating Sets of Intervals on Lines (Extended Abstract)},
  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        = {520--529},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/BFb0030873},
  doi          = {10.1007/BFB0030873},
  timestamp    = {Tue, 14 May 2019 10:00:35 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/ChengKZ95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GerstelWZ95,
  author       = {Ornan Ori Gerstel and
                  Avishai Wool and
                  Shmuel Zaks},
  editor       = {Paul G. Spirakis},
  title        = {Optimal Layouts on a Chain {ATM} Network (Extended Abstract)},
  booktitle    = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece,
                  September 25-27, 1995, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {979},
  pages        = {508--522},
  publisher    = {Springer},
  year         = {1995},
  url          = {https://doi.org/10.1007/3-540-60313-1\_167},
  doi          = {10.1007/3-540-60313-1\_167},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/GerstelWZ95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GerstelZ94,
  author       = {Ornan Ori Gerstel and
                  Shmuel Zaks},
  title        = {A new characterization of tree medians with applications to distributed
                  sorting},
  journal      = {Networks},
  volume       = {24},
  number       = {1},
  pages        = {23--29},
  year         = {1994},
  url          = {https://doi.org/10.1002/net.3230240104},
  doi          = {10.1002/NET.3230240104},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/GerstelZ94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KozenZ94,
  author       = {Dexter Kozen and
                  Shmuel Zaks},
  title        = {Optimal Bounds for the Change-Making Problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {123},
  number       = {2},
  pages        = {377--388},
  year         = {1994},
  url          = {https://doi.org/10.1016/0304-3975(94)90134-1},
  doi          = {10.1016/0304-3975(94)90134-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KozenZ94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/TelKZ94,
  author       = {Gerard Tel and
                  Ephraim Korach and
                  Shmuel Zaks},
  title        = {Synchronizing {ABD} networks},
  journal      = {{IEEE/ACM} Trans. Netw.},
  volume       = {2},
  number       = {1},
  pages        = {66--69},
  year         = {1994},
  url          = {https://doi.org/10.1109/90.282609},
  doi          = {10.1109/90.282609},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ton/TelKZ94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MolchoZ94,
  author       = {Moshe Molcho and
                  Shmuel Zaks},
  editor       = {Ding{-}Zhu Du and
                  Xiang{-}Sun Zhang},
  title        = {Robust Asynchronous Algorithms in Networks with a Fault Detection
                  Ring},
  booktitle    = {Algorithms and Computation, 5th International Symposium, {ISAAC} '94,
                  Beijing, P. R. China, August 25-27, 1994, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {834},
  pages        = {101--109},
  publisher    = {Springer},
  year         = {1994},
  url          = {https://doi.org/10.1007/3-540-58325-4\_171},
  doi          = {10.1007/3-540-58325-4\_171},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/MolchoZ94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GerstelZ94,
  author       = {Ornan Ori Gerstel and
                  Shmuel Zaks},
  editor       = {James H. Anderson and
                  David Peleg and
                  Elizabeth Borowsky},
  title        = {The Virtual Path Layout Problem in Fast Networks (Extended Abstract)},
  booktitle    = {Proceedings of the Thirteenth Annual {ACM} Symposium on Principles
                  of Distributed Computing, Los Angeles, California, USA, August 14-17,
                  1994},
  pages        = {235--243},
  publisher    = {{ACM}},
  year         = {1994},
  url          = {https://doi.org/10.1145/197917.198100},
  doi          = {10.1145/197917.198100},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/podc/GerstelZ94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/GerstelZ94,
  author       = {Ornan Ori Gerstel and
                  Shmuel Zaks},
  editor       = {Paola Flocchini and
                  Bernard Mans and
                  Nicola Santoro},
  title        = {Path Layout in {ATM} Networks},
  booktitle    = {Structural Information and Communication Complexity, 1st International
                  Colloquium, {SIROCCO} 1994, Carleton University, Ottawa, Canada, May
                  18-20, 1994, Proceedings},
  pages        = {151--166},
  publisher    = {Carleton University Press},
  year         = {1994},
  timestamp    = {Wed, 01 Jun 2005 09:38:33 +0200},
  biburl       = {https://dblp.org/rec/conf/sirocco/GerstelZ94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spdp/GerstelZHPR94,
  author       = {Ornan Ori Gerstel and
                  Shmuel Zaks and
                  Michel Hurfin and
                  No{\"{e}}l Plouzeau and
                  Michel Raynal},
  title        = {On-the-fly replay: a practical paradigm and its implementation for
                  distributed debugging},
  booktitle    = {Proceedings of the Sixth {IEEE} Symposium on Parallel and Distributed
                  Processing, {SPDP} 1994, Dallas, Texas, {USA} , October 26-29, 1994},
  pages        = {266--272},
  publisher    = {{IEEE} Computer Society},
  year         = {1994},
  url          = {https://doi.org/10.1109/SPDP.1994.346158},
  doi          = {10.1109/SPDP.1994.346158},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/spdp/GerstelZHPR94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/CidonGZ94,
  author       = {Israel Cidon and
                  Ornan Ori Gerstel and
                  Shmuel Zaks},
  editor       = {Gerard Tel and
                  Paul M. B. Vit{\'{a}}nyi},
  title        = {A Scalable Approach to Routing in {ATM} Networks},
  booktitle    = {Distributed Algorithms, 8th International Workshop, {WDAG} '94, Terschelling,
                  The Netherlands, September 29 - October 1, 1994, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {857},
  pages        = {209--222},
  publisher    = {Springer},
  year         = {1994},
  url          = {https://doi.org/10.1007/BFb0020435},
  doi          = {10.1007/BFB0020435},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/CidonGZ94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolinZ94,
  author       = {Mordecai J. Golin and
                  Shmuel Zaks},
  editor       = {Ernst W. Mayr and
                  Gunther Schmidt and
                  Gottfried Tinhofer},
  title        = {Labelled Trees and Pairs of Input-Output Permutations in Priority
                  Queues},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop,
                  {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {903},
  pages        = {282--291},
  publisher    = {Springer},
  year         = {1994},
  url          = {https://doi.org/10.1007/3-540-59071-4\_55},
  doi          = {10.1007/3-540-59071-4\_55},
  timestamp    = {Sun, 02 Oct 2022 16:17:33 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/GolinZ94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MalkaMZ93,
  author       = {Yossi Malka and
                  Shlomo Moran and
                  Shmuel Zaks},
  title        = {A Lower Bound on the Period Length of a Distributed Scheduler},
  journal      = {Algorithmica},
  volume       = {10},
  number       = {5},
  pages        = {383--398},
  year         = {1993},
  url          = {https://doi.org/10.1007/BF01769705},
  doi          = {10.1007/BF01769705},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/MalkaMZ93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BitanZ93,
  author       = {Sara Bitan and
                  Shmuel Zaks},
  title        = {Optimal Linear Broadcast},
  journal      = {J. Algorithms},
  volume       = {14},
  number       = {2},
  pages        = {288--315},
  year         = {1993},
  url          = {https://doi.org/10.1006/jagm.1993.1015},
  doi          = {10.1006/JAGM.1993.1015},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BitanZ93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GerstelZ93,
  author       = {Ornan Ori Gerstel and
                  Shmuel Zaks},
  editor       = {Thomas Lengauer},
  title        = {The Bit Complexity of Distributed Sorting (Extended Abstract)},
  booktitle    = {Algorithms - {ESA} '93, First Annual European Symposium, Bad Honnef,
                  Germany, September 30 - October 2, 1993, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {726},
  pages        = {181--191},
  publisher    = {Springer},
  year         = {1993},
  url          = {https://doi.org/10.1007/3-540-57273-2\_54},
  doi          = {10.1007/3-540-57273-2\_54},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/GerstelZ93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KozenZ93,
  author       = {Dexter Kozen and
                  Shmuel Zaks},
  editor       = {Andrzej Lingas and
                  Rolf G. Karlsson and
                  Svante Carlsson},
  title        = {Optimal Bounds for the Change-Making Problem},
  booktitle    = {Automata, Languages and Programming, 20nd International Colloquium,
                  ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {700},
  pages        = {150--161},
  publisher    = {Springer},
  year         = {1993},
  url          = {https://doi.org/10.1007/3-540-56939-1\_69},
  doi          = {10.1007/3-540-56939-1\_69},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/KozenZ93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BitanZ93,
  author       = {Sara Bitan and
                  Shmuel Zaks},
  editor       = {Kam{-}Wing Ng and
                  Prabhakar Raghavan and
                  N. V. Balasubramanian and
                  Francis Y. L. Chin},
  title        = {Optimal Linear Broadcast Routing with Capacity Limitations},
  booktitle    = {Algorithms and Computation, 4th International Symposium, {ISAAC} '93,
                  Hong Kong, December 15-17, 1993, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {762},
  pages        = {287--296},
  publisher    = {Springer},
  year         = {1993},
  url          = {https://doi.org/10.1007/3-540-57568-5\_259},
  doi          = {10.1007/3-540-57568-5\_259},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/BitanZ93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GerstelZ92,
  author       = {Ornan Ori Gerstel and
                  Shmuel Zaks},
  editor       = {Ernst W. Mayr},
  title        = {A New Characterization of Tree Medians with Applications to Distributed
                  Algorithms},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
                  {WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {657},
  pages        = {135--144},
  publisher    = {Springer},
  year         = {1992},
  url          = {https://doi.org/10.1007/3-540-56402-0\_43},
  doi          = {10.1007/3-540-56402-0\_43},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/GerstelZ92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wdag/1992,
  editor       = {Adrian Segall and
                  Shmuel Zaks},
  title        = {Distributed Algorithms, 6th International Workshop, {WDAG} '92, Haifa,
                  Israel, November 2-4, 1992, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {647},
  publisher    = {Springer},
  year         = {1992},
  url          = {https://doi.org/10.1007/3-540-56188-9},
  doi          = {10.1007/3-540-56188-9},
  isbn         = {3-540-56188-9},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/1992.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/DershowitzZ90,
  author       = {Nachum Dershowitz and
                  Shmuel Zaks},
  title        = {The Cycle Lemma and Some Applications},
  journal      = {Eur. J. Comb.},
  volume       = {11},
  number       = {1},
  pages        = {35--40},
  year         = {1990},
  url          = {https://doi.org/10.1016/S0195-6698(13)80053-4},
  doi          = {10.1016/S0195-6698(13)80053-4},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ejc/DershowitzZ90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BiranMZ90,
  author       = {Ofer Biran and
                  Shlomo Moran and
                  Shmuel Zaks},
  title        = {A Combinatorial Characterization of the Distributed 1-Solvable Tasks},
  journal      = {J. Algorithms},
  volume       = {11},
  number       = {3},
  pages        = {420--440},
  year         = {1990},
  url          = {https://doi.org/10.1016/0196-6774(90)90020-F},
  doi          = {10.1016/0196-6774(90)90020-F},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BiranMZ90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcom/ChouCGZ90,
  author       = {Ching{-}Tsun Chou and
                  Israel Cidon and
                  Inder S. Gopal and
                  Shmuel Zaks},
  title        = {Synchronizing asynchronous bounded delay networks},
  journal      = {{IEEE} Trans. Commun.},
  volume       = {38},
  number       = {2},
  pages        = {144--147},
  year         = {1990},
  url          = {https://doi.org/10.1109/26.47845},
  doi          = {10.1109/26.47845},
  timestamp    = {Tue, 01 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcom/ChouCGZ90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tse/ItaiKWZ90,
  author       = {Alon Itai and
                  Shay Kutten and
                  Yaron Wolfstahl and
                  Shmuel Zaks},
  title        = {Optimal Distributed t-Resilient Election in Complete Networks},
  journal      = {{IEEE} Trans. Software Eng.},
  volume       = {16},
  number       = {4},
  pages        = {415--420},
  year         = {1990},
  url          = {https://doi.org/10.1109/32.54293},
  doi          = {10.1109/32.54293},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tse/ItaiKWZ90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigal/BitanZ90,
  author       = {Sara Bitan and
                  Shmuel Zaks},
  editor       = {Tetsuo Asano and
                  Toshihide Ibaraki and
                  Hiroshi Imai and
                  Takao Nishizeki},
  title        = {Optimal Linear Broadcast},
  booktitle    = {Algorithms, International Symposium {SIGAL} '90, Tokyo, Japan, August
                  16-18, 1990, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {450},
  pages        = {368--377},
  publisher    = {Springer},
  year         = {1990},
  url          = {https://doi.org/10.1007/3-540-52921-7\_86},
  doi          = {10.1007/3-540-52921-7\_86},
  timestamp    = {Fri, 17 Jul 2020 16:12:48 +0200},
  biburl       = {https://dblp.org/rec/conf/sigal/BitanZ90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/BiranMZ90,
  author       = {Ofer Biran and
                  Shlomo Moran and
                  Shmuel Zaks},
  editor       = {Jan van Leeuwen and
                  Nicola Santoro},
  title        = {Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks},
  booktitle    = {Distributed Algorithms, 4th International Workshop, {WDAG} '90, Bari,
                  Italy, September 24-26, 1990, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {486},
  pages        = {373--389},
  publisher    = {Springer},
  year         = {1990},
  url          = {https://doi.org/10.1007/3-540-54099-7\_25},
  doi          = {10.1007/3-540-54099-7\_25},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/BiranMZ90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BiranMZ90,
  author       = {Ofer Biran and
                  Shlomo Moran and
                  Shmuel Zaks},
  editor       = {Rolf H. M{\"{o}}hring},
  title        = {Deciding 1-sovability of distributed task is NP-hard},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 16rd International Workshop,
                  {WG} '90, Berlin, Germany, June 20-22, 1990, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {484},
  pages        = {206--220},
  publisher    = {Springer},
  year         = {1990},
  url          = {https://doi.org/10.1007/3-540-53832-1\_44},
  doi          = {10.1007/3-540-53832-1\_44},
  timestamp    = {Fri, 17 Jul 2020 16:12:47 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/BiranMZ90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AttiyaLSZ89,
  author       = {Hagit Attiya and
                  Jan van Leeuwen and
                  Nicola Santoro and
                  Shmuel Zaks},
  title        = {Efficient Elections in Chordal Ring Networks},
  journal      = {Algorithmica},
  volume       = {4},
  number       = {3},
  pages        = {437--446},
  year         = {1989},
  url          = {https://doi.org/10.1007/BF01553900},
  doi          = {10.1007/BF01553900},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AttiyaLSZ89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DershowitzZ89,
  author       = {Nachum Dershowitz and
                  Shmuel Zaks},
  title        = {Patterns in trees},
  journal      = {Discret. Appl. Math.},
  volume       = {25},
  number       = {3},
  pages        = {241--255},
  year         = {1989},
  url          = {https://doi.org/10.1016/0166-218X(89)90003-6},
  doi          = {10.1016/0166-218X(89)90003-6},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/DershowitzZ89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GerstelMZ89,
  author       = {Ornan Ori Gerstel and
                  Yishay Mansour and
                  Shmuel Zaks},
  title        = {Bit Complexity of Order Statistics on a Distributed Star Network},
  journal      = {Inf. Process. Lett.},
  volume       = {30},
  number       = {3},
  pages        = {127--132},
  year         = {1989},
  url          = {https://doi.org/10.1016/0020-0190(89)90130-0},
  doi          = {10.1016/0020-0190(89)90130-0},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/GerstelMZ89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KorachMZ89,
  author       = {Ephraim Korach and
                  Shlomo Moran and
                  Shmuel Zaks},
  title        = {Optimal Lower Bounds for Some Distributed Algorithms for a Complete
                  Network of Processors},
  journal      = {Theor. Comput. Sci.},
  volume       = {64},
  number       = {1},
  pages        = {125--132},
  year         = {1989},
  url          = {https://doi.org/10.1016/0304-3975(89)90103-5},
  doi          = {10.1016/0304-3975(89)90103-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KorachMZ89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ErdosKMSZ88,
  author       = {Paul Erd{\"{o}}s and
                  Israel Koren and
                  Shlomo Moran and
                  Gabriel M. Silberman and
                  Shmuel Zaks},
  title        = {Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto
                  {VLSI} Arrays},
  journal      = {Math. Syst. Theory},
  volume       = {21},
  number       = {2},
  pages        = {85--98},
  year         = {1988},
  url          = {https://doi.org/10.1007/BF02088008},
  doi          = {10.1007/BF02088008},
  timestamp    = {Sun, 17 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/ErdosKMSZ88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/awoc/MalkaMZ88,
  author       = {Yossi Malka and
                  Shlomo Moran and
                  Shmuel Zaks},
  editor       = {John H. Reif},
  title        = {Analysis of a Distributed Scheduler for Communication Networks},
  booktitle    = {{VLSI} Algorithms and Architectures, 3rd Aegean Workshop on Computing,
                  {AWOC} 88, Corfu, Greece, June 28 - July 1, 1988, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {319},
  pages        = {351--360},
  publisher    = {Springer},
  year         = {1988},
  url          = {https://doi.org/10.1007/BFb0040402},
  doi          = {10.1007/BFB0040402},
  timestamp    = {Tue, 14 May 2019 10:00:47 +0200},
  biburl       = {https://dblp.org/rec/conf/awoc/MalkaMZ88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/KorachTZ88,
  author       = {Ephraim Korach and
                  Gerard Tel and
                  Shmuel Zaks},
  editor       = {Friedrich H. Vogt},
  title        = {Optimal Synchronization of {ABD} Networks},
  booktitle    = {Concurrency 88: International Conference on Concurrency, Hamburg,
                  FRG, October 18-19, 1988, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {335},
  pages        = {353--367},
  publisher    = {Springer},
  year         = {1988},
  url          = {https://doi.org/10.1007/3-540-50403-6\_50},
  doi          = {10.1007/3-540-50403-6\_50},
  timestamp    = {Fri, 17 Jul 2020 16:12:46 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/KorachTZ88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BiranMZ88,
  author       = {Ofer Biran and
                  Shlomo Moran and
                  Shmuel Zaks},
  editor       = {Danny Dolev},
  title        = {A Combinatorial Characterization of the Distributed Tasks Which Are
                  Solvable in the Presence of One Faulty Processor},
  booktitle    = {Proceedings of the Seventh Annual {ACM} Symposium on Principles of
                  Distributed Computing, Toronto, Ontario, Canada, August 15-17, 1988},
  pages        = {263--275},
  publisher    = {{ACM}},
  year         = {1988},
  url          = {https://doi.org/10.1145/62546.62590},
  doi          = {10.1145/62546.62590},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/podc/BiranMZ88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/MansourZ87,
  author       = {Yishay Mansour and
                  Shmuel Zaks},
  title        = {On the Bit Complexity of Distributed Computations in a Ring with a
                  Leader},
  journal      = {Inf. Comput.},
  volume       = {75},
  number       = {2},
  pages        = {162--177},
  year         = {1987},
  url          = {https://doi.org/10.1016/0890-5401(87)90056-3},
  doi          = {10.1016/0890-5401(87)90056-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/MansourZ87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KorachMZ87,
  author       = {Ephraim Korach and
                  Shlomo Moran and
                  Shmuel Zaks},
  title        = {The Optimality of Distributive Constructions of Minimum Weight and
                  Degree Restricted Spanning Trees in a Complete Network of Processors},
  journal      = {{SIAM} J. Comput.},
  volume       = {16},
  number       = {2},
  pages        = {231--236},
  year         = {1987},
  url          = {https://doi.org/10.1137/0216019},
  doi          = {10.1137/0216019},
  timestamp    = {Sat, 27 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/KorachMZ87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LeeuwenSUZ87,
  author       = {Jan van Leeuwen and
                  Nicola Santoro and
                  Jorge Urrutia and
                  Shmuel Zaks},
  editor       = {Thomas Ottmann},
  title        = {Guessing Games and Distributed Computations in Synchronous Networks},
  booktitle    = {Automata, Languages and Programming, 14th International Colloquium,
                  ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {267},
  pages        = {347--356},
  publisher    = {Springer},
  year         = {1987},
  url          = {https://doi.org/10.1007/3-540-18088-5\_29},
  doi          = {10.1007/3-540-18088-5\_29},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/LeeuwenSUZ87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Bar-YehudaKWZ87,
  author       = {Reuven Bar{-}Yehuda and
                  Shay Kutten and
                  Yaron Wolfstahl and
                  Shmuel Zaks},
  editor       = {Franz{-}Josef Brandenburg and
                  Guy Vidal{-}Naquet and
                  Martin Wirsing},
  title        = {Making Distributed Spanning Tree Algorithms Fault-Resilient},
  booktitle    = {{STACS} 87, 4th Annual Symposium on Theoretical Aspects of Computer
                  Science, Passau, Germany, February 19-21, 1987, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {247},
  pages        = {432--444},
  publisher    = {Springer},
  year         = {1987},
  url          = {https://doi.org/10.1007/BFb0039625},
  doi          = {10.1007/BFB0039625},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Bar-YehudaKWZ87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/ChouCGZ87,
  author       = {Ching{-}Tsun Chou and
                  Israel Cidon and
                  Inder S. Gopal and
                  Shmuel Zaks},
  editor       = {Jan van Leeuwen},
  title        = {Synchronizing Aysnchronous Bounded Delay Networks},
  booktitle    = {Distributed Algorithms, 2nd International Workshop, Amsterdam, The
                  Netherlands, July 8-10, 1987, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {312},
  pages        = {212--218},
  publisher    = {Springer},
  year         = {1987},
  url          = {https://doi.org/10.1007/BFb0019806},
  doi          = {10.1007/BFB0019806},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/ChouCGZ87.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DershowitzZ86,
  author       = {Nachum Dershowitz and
                  Shmuel Zaks},
  title        = {Ordered trees and non-crossing partitions},
  journal      = {Discret. Math.},
  volume       = {62},
  number       = {2},
  pages        = {215--218},
  year         = {1986},
  url          = {https://doi.org/10.1016/0012-365X(86)90120-2},
  doi          = {10.1016/0012-365X(86)90120-2},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/DershowitzZ86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/MansourZ86,
  author       = {Yishay Mansour and
                  Shmuel Zaks},
  editor       = {Joseph Y. Halpern},
  title        = {On the Bit Complexity of Distributed Computations in a Ring with a
                  Leader},
  booktitle    = {Proceedings of the Fifth Annual {ACM} Symposium on Principles of Distributed
                  Computing, Calgary, Alberta, Canada, August 11-13, 1986},
  pages        = {151--160},
  publisher    = {{ACM}},
  year         = {1986},
  url          = {https://doi.org/10.1145/10590.10603},
  doi          = {10.1145/10590.10603},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/podc/MansourZ86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/Zaks85,
  author       = {Shmuel Zaks},
  title        = {Optimal Distributed Algorithms for Sorting and Ranking},
  journal      = {{IEEE} Trans. Computers},
  volume       = {34},
  number       = {4},
  pages        = {376--379},
  year         = {1985},
  url          = {https://doi.org/10.1109/TC.1985.5009390},
  doi          = {10.1109/TC.1985.5009390},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tc/Zaks85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/KorachMZ85,
  author       = {Ephraim Korach and
                  Shlomo Moran and
                  Shmuel Zaks},
  editor       = {Michael A. Malcolm and
                  H. Raymond Strong},
  title        = {The Optimality of Distributed Constructions of Minimum Weigth and
                  Degree Restricted Spanning Trees in a Complete Network of Processors},
  booktitle    = {Proceedings of the Fourth Annual {ACM} Symposium on Principles of
                  Distributed Computing, Minaki, Ontario, Canada, August 5-7, 1985},
  pages        = {277--286},
  publisher    = {{ACM}},
  year         = {1985},
  url          = {https://doi.org/10.1145/323596.323622},
  doi          = {10.1145/323596.323622},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/podc/KorachMZ85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Zaks84,
  author       = {Shmuel Zaks},
  title        = {A New Algorithm for Generation of Permutations},
  journal      = {{BIT}},
  volume       = {24},
  number       = {2},
  pages        = {196--204},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF01937486},
  doi          = {10.1007/BF01937486},
  timestamp    = {Tue, 22 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/bit/Zaks84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caap/DershowitzZ84,
  author       = {Nachum Dershowitz and
                  Shmuel Zaks},
  editor       = {Bruno Courcelle},
  title        = {Patterns in Trees},
  booktitle    = {CAAP'84, 9th Colloquium on Trees in Algebra and Programming, Bordeaux,
                  France, March 5-7, 1984, Proceedings},
  pages        = {93--102},
  publisher    = {Cambridge University Press},
  year         = {1984},
  timestamp    = {Wed, 30 Mar 2016 16:45:14 +0200},
  biburl       = {https://dblp.org/rec/conf/caap/DershowitzZ84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/KorachMZ84,
  author       = {Ephraim Korach and
                  Shlomo Moran and
                  Shmuel Zaks},
  editor       = {Tiko Kameda and
                  Jayadev Misra and
                  Joseph G. Peters and
                  Nicola Santoro},
  title        = {Tight Lower and Upper Bounds for Some Distributed Algorithms for a
                  Complete Network of Processors},
  booktitle    = {Proceedings of the Third Annual {ACM} Symposium on Principles of Distributed
                  Computing, Vancouver, B. C., Canada, August 27-29, 1984},
  pages        = {199--207},
  publisher    = {{ACM}},
  year         = {1984},
  url          = {https://doi.org/10.1145/800222.806747},
  doi          = {10.1145/800222.806747},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/podc/KorachMZ84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/ChandraKMZ83,
  author       = {Ashok K. Chandra and
                  Lawrence T. Kou and
                  George Markowsky and
                  Shmuel Zaks},
  title        = {On Sets of Boolean \emph{ n } -Projections Surjective},
  journal      = {Acta Informatica},
  volume       = {20},
  pages        = {103--111},
  year         = {1983},
  url          = {https://doi.org/10.1007/BF00264296},
  doi          = {10.1007/BF00264296},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/ChandraKMZ83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ShiloachVZ82,
  author       = {Yossi Shiloach and
                  Uzi Vishkin and
                  Shmuel Zaks},
  title        = {Golden ratios in a pairs covering problem},
  journal      = {Discret. Math.},
  volume       = {41},
  number       = {1},
  pages        = {57--65},
  year         = {1982},
  url          = {https://doi.org/10.1016/0012-365X(82)90082-6},
  doi          = {10.1016/0012-365X(82)90082-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ShiloachVZ82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ZaksFPM82,
  author       = {Sara Porat and
                  Nissim Francez and
                  Shlomo Moran and
                  Shmuel Zaks},
  title        = {Fair Deriviations in Context-Free Grammars},
  journal      = {Inf. Control.},
  volume       = {55},
  number       = {1-3},
  pages        = {108--116},
  year         = {1982},
  url          = {https://doi.org/10.1016/S0019-9958(82)90496-X},
  doi          = {10.1016/S0019-9958(82)90496-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/ZaksFPM82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Zaks82,
  author       = {Shmuel Zaks},
  title        = {Generation and Ranking of k-ary Trees},
  journal      = {Inf. Process. Lett.},
  volume       = {14},
  number       = {1},
  pages        = {44--48},
  year         = {1982},
  url          = {https://doi.org/10.1016/0020-0190(82)90140-5},
  doi          = {10.1016/0020-0190(82)90140-5},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Zaks82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PerlZ82,
  author       = {Yehoshua Perl and
                  Shmuel Zaks},
  title        = {On the Complexity of Edge Labelings for Trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {19},
  pages        = {1--16},
  year         = {1982},
  url          = {https://doi.org/10.1016/0304-3975(82)90011-1},
  doi          = {10.1016/0304-3975(82)90011-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/PerlZ82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/PerlZ81,
  author       = {Yehoshua Perl and
                  Shmuel Zaks},
  title        = {Deficient generalized Fibonacci maximum path graphs},
  journal      = {Discret. Math.},
  volume       = {34},
  number       = {2},
  pages        = {153--164},
  year         = {1981},
  url          = {https://doi.org/10.1016/0012-365X(81)90063-7},
  doi          = {10.1016/0012-365X(81)90063-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/PerlZ81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caap/DershowitzZ81,
  author       = {Nachum Dershowitz and
                  Shmuel Zaks},
  editor       = {Egidio Astesiano and
                  Corrado B{\"{o}}hm},
  title        = {Applied Tree Enumerations},
  booktitle    = {{CAAP} '81, Trees in Algebra and Programming, 6th Colloquium, Genoa,
                  Italy, March 5-7, 1981, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {112},
  pages        = {180--193},
  publisher    = {Springer},
  year         = {1981},
  url          = {https://doi.org/10.1007/3-540-10828-9\_62},
  doi          = {10.1007/3-540-10828-9\_62},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/caap/DershowitzZ81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DershowitzZ80,
  author       = {Nachum Dershowitz and
                  Shmuel Zaks},
  title        = {Enumerations of ordered trees},
  journal      = {Discret. Math.},
  volume       = {31},
  number       = {1},
  pages        = {9--28},
  year         = {1980},
  url          = {https://doi.org/10.1016/0012-365X(80)90168-5},
  doi          = {10.1016/0012-365X(80)90168-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/DershowitzZ80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Zaks80,
  author       = {Shmuel Zaks},
  title        = {Lexicographic Generation of Ordered Trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {10},
  pages        = {63--82},
  year         = {1980},
  url          = {https://doi.org/10.1016/0304-3975(80)90073-0},
  doi          = {10.1016/0304-3975(80)90073-0},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Zaks80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Zaks79,
  author       = {Shmuel Zaks},
  title        = {Studies in Graph Algorithms: Generation and Labeling Problems},
  school       = {University of Illinois Urbana-Champaign, {USA}},
  year         = {1979},
  url          = {https://hdl.handle.net/2142/66436},
  timestamp    = {Mon, 18 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/us/Zaks79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ZaksR79,
  author       = {Shmuel Zaks and
                  D. Richards},
  title        = {Generating Trees and Other Combinatorial Objects Lexicographically},
  journal      = {{SIAM} J. Comput.},
  volume       = {8},
  number       = {1},
  pages        = {73--81},
  year         = {1979},
  url          = {https://doi.org/10.1137/0208006},
  doi          = {10.1137/0208006},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/ZaksR79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics