Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Shlomo Moran
@article{DBLP:journals/corr/abs-2301-01924,
author = {Noga Alon and
Olivier Bousquet and
Kasper Green Larsen and
Shay Moran and
Shlomo Moran},
title = {Diagonalization Games},
journal = {CoRR},
volume = {abs/2301.01924},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.01924},
doi = {10.48550/ARXIV.2301.01924},
eprinttype = {arXiv},
eprint = {2301.01924},
timestamp = {Tue, 10 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-01924.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlonBLMM23,
author = {Noga Alon and
Olivier Bousquet and
Kasper Green Larsen and
Shay Moran and
Shlomo Moran},
title = {Diagonalization Games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-002}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/002},
eprinttype = {ECCC},
eprint = {TR23-002},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/AlonBLMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sss/CyprysDM22,
author = {Pawel Cyprys and
Shlomi Dolev and
Shlomo Moran},
editor = {St{\'{e}}phane Devismes and
Franck Petit and
Karine Altisen and
Giuseppe Antonio Di Luna and
Antonio Fern{\'{a}}ndez Anta},
title = {Brief Announcement: Self Masking for Hardening Inversions},
booktitle = {Stabilization, Safety, and Security of Distributed Systems - 24th
International Symposium, {SSS} 2022, Clermont-Ferrand, France, November
15-17, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13751},
pages = {331--334},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-21017-4\_22},
doi = {10.1007/978-3-031-21017-4\_22},
timestamp = {Fri, 11 Nov 2022 16:53:16 +0100},
biburl = {https://dblp.org/rec/conf/sss/CyprysDM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/CyprysDM22,
author = {Pawel Cyprys and
Shlomi Dolev and
Shlomo Moran},
title = {Self Masking for Hardering Inversions},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1274},
year = {2022},
url = {https://eprint.iacr.org/2022/1274},
timestamp = {Sat, 22 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/CyprysDM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/Charron-BostM21,
author = {Bernadette Charron{-}Bost and
Shlomo Moran},
title = {MinMax algorithms for stabilizing consensus},
journal = {Distributed Comput.},
volume = {34},
number = {3},
pages = {195--206},
year = {2021},
url = {https://doi.org/10.1007/s00446-021-00392-9},
doi = {10.1007/S00446-021-00392-9},
timestamp = {Tue, 13 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dc/Charron-BostM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/MoranMM21,
author = {Tomer Moran and
Shay Moran and
Shlomo Moran},
title = {Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from
Gadi Moran's last paper},
journal = {Am. Math. Mon.},
volume = {128},
number = {8},
pages = {726--736},
year = {2021},
url = {https://doi.org/10.1080/00029890.2021.1949219},
doi = {10.1080/00029890.2021.1949219},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tamm/MoranMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-03676,
author = {Shlomo Moran and
Irad Yavneh},
title = {Adjustable Coins},
journal = {CoRR},
volume = {abs/2008.03676},
year = {2020},
url = {https://arxiv.org/abs/2008.03676},
eprinttype = {arXiv},
eprint = {2008.03676},
timestamp = {Fri, 14 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-03676.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Charron-BostM19,
author = {Bernadette Charron{-}Bost and
Shlomo Moran},
title = {The firing squad problem revisited},
journal = {Theor. Comput. Sci.},
volume = {793},
pages = {100--112},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.07.023},
doi = {10.1016/J.TCS.2019.07.023},
timestamp = {Tue, 15 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Charron-BostM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-09073,
author = {Bernadette Charron{-}Bost and
Shlomo Moran},
title = {MinMax Algorithms for Stabilizing Consensus},
journal = {CoRR},
volume = {abs/1906.09073},
year = {2019},
url = {http://arxiv.org/abs/1906.09073},
eprinttype = {arXiv},
eprint = {1906.09073},
timestamp = {Mon, 24 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-09073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Charron-BostM18,
author = {Bernadette Charron{-}Bost and
Shlomo Moran},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {The Firing Squad Problem Revisited},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {20:1--20:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.20},
doi = {10.4230/LIPICS.STACS.2018.20},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Charron-BostM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Charron-BostM17,
author = {Bernadette Charron{-}Bost and
Shlomo Moran},
title = {Synchronization in Dynamic Networks},
journal = {CoRR},
volume = {abs/1706.07831},
year = {2017},
url = {http://arxiv.org/abs/1706.07831},
eprinttype = {arXiv},
eprint = {1706.07831},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Charron-BostM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/DoerrDMM16,
author = {Benjamin Doerr and
Carola Doerr and
Shay Moran and
Shlomo Moran},
title = {Simple and optimal randomized fault-tolerant rumor spreading},
journal = {Distributed Comput.},
volume = {29},
number = {2},
pages = {89--104},
year = {2016},
url = {https://doi.org/10.1007/s00446-014-0238-z},
doi = {10.1007/S00446-014-0238-Z},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/DoerrDMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/almob/DoerrGMY12,
author = {Daniel Doerr and
Ilan Gronau and
Shlomo Moran and
Irad Yavneh},
title = {Stochastic errors vs. modeling errors in distance based phylogenetic
reconstructions},
journal = {Algorithms Mol. Biol.},
volume = {7},
pages = {22},
year = {2012},
url = {https://doi.org/10.1186/1748-7188-7-22},
doi = {10.1186/1748-7188-7-22},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/almob/DoerrGMY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GronauMS12,
author = {Ilan Gronau and
Shlomo Moran and
Sagi Snir},
title = {Fast and reliable reconstruction of phylogenetic trees with indistinguishable
edges},
journal = {Random Struct. Algorithms},
volume = {40},
number = {3},
pages = {350--384},
year = {2012},
url = {https://doi.org/10.1002/rsa.20372},
doi = {10.1002/RSA.20372},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GronauMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-6158,
author = {Benjamin Doerr and
Shay Moran and
Shlomo Moran and
Carola Winzen},
title = {Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity},
journal = {CoRR},
volume = {abs/1209.6158},
year = {2012},
url = {http://arxiv.org/abs/1209.6158},
eprinttype = {arXiv},
eprint = {1209.6158},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-6158.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/MoranSS11,
author = {Shlomo Moran and
Sagi Snir and
Wing{-}Kin Sung},
title = {Partial convex recolorings of trees and galled networks: Tight upper
and lower bounds},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {4},
pages = {42:1--42:20},
year = {2011},
url = {https://doi.org/10.1145/2000807.2000810},
doi = {10.1145/2000807.2000810},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/MoranSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/DoerrGMY11,
author = {Daniel Doerr and
Ilan Gronau and
Shlomo Moran and
Irad Yavneh},
editor = {Teresa M. Przytycka and
Marie{-}France Sagot},
title = {Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic
Reconstructions - (Extended Abstract)},
booktitle = {Algorithms in Bioinformatics - 11th International Workshop, {WABI}
2011, Saarbr{\"{u}}cken, Germany, September 5-7, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6833},
pages = {49--60},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23038-7\_5},
doi = {10.1007/978-3-642-23038-7\_5},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/DoerrGMY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/GronauMY10,
author = {Ilan Gronau and
Shlomo Moran and
Irad Yavneh},
title = {Adaptive Distance Measures for Resolving {K2P} Quartets: Metric Separation
versus Stochastic Noise},
journal = {J. Comput. Biol.},
volume = {17},
number = {11},
pages = {1509--1518},
year = {2010},
url = {https://doi.org/10.1089/cmb.2009.0236},
doi = {10.1089/CMB.2009.0236},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/GronauMY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DinitzMR08,
author = {Yefim Dinitz and
Shlomo Moran and
Sergio Rajsbaum},
title = {Bit complexity of breaking and achieving symmetry in chains and rings},
journal = {J. {ACM}},
volume = {55},
number = {1},
pages = {3:1--3:28},
year = {2008},
url = {https://doi.org/10.1145/1326554.1326557},
doi = {10.1145/1326554.1326557},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DinitzMR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MoranS08,
author = {Shlomo Moran and
Sagi Snir},
title = {Convex recolorings of strings and trees: Definitions, hardness results
and algorithms},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {5},
pages = {850--869},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2007.10.003},
doi = {10.1016/J.JCSS.2007.10.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MoranS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GronauMS08,
author = {Ilan Gronau and
Shlomo Moran and
Sagi Snir},
editor = {Shang{-}Hua Teng},
title = {Fast and reliable reconstruction of phylogenetic trees with very short
edges},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {379--388},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347124},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GronauMS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GronauM07,
author = {Ilan Gronau and
Shlomo Moran},
title = {Optimal implementations of {UPGMA} and other common clustering algorithms},
journal = {Inf. Process. Lett.},
volume = {104},
number = {6},
pages = {205--210},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2007.07.002},
doi = {10.1016/J.IPL.2007.07.002},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GronauM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/GronauM07,
author = {Ilan Gronau and
Shlomo Moran},
title = {Neighbor Joining Algorithms for Inferring Phylogenies via {LCA} Distances},
journal = {J. Comput. Biol.},
volume = {14},
number = {1},
pages = {1--15},
year = {2007},
url = {https://doi.org/10.1089/cmb.2006.0115},
doi = {10.1089/CMB.2006.0115},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/GronauM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MoranS07,
author = {Shlomo Moran and
Sagi Snir},
title = {Efficient approximation of convex recolorings},
journal = {J. Comput. Syst. Sci.},
volume = {73},
number = {7},
pages = {1078--1089},
year = {2007},
url = {https://doi.org/10.1016/j.jcss.2007.03.006},
doi = {10.1016/J.JCSS.2007.03.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MoranS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GronauM07,
author = {Ilan Gronau and
Shlomo Moran},
title = {On the hardness of inferring phylogenies from triplet-dissimilarities},
journal = {Theor. Comput. Sci.},
volume = {389},
number = {1-2},
pages = {44--55},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.07.048},
doi = {10.1016/J.TCS.2007.07.048},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GronauM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ir/LempelM05,
author = {Ronny Lempel and
Shlomo Moran},
title = {Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms
in Authority-Connected Graphs},
journal = {Inf. Retr.},
volume = {8},
number = {2},
pages = {245--264},
year = {2005},
url = {https://doi.org/10.1007/s10791-005-5661-0},
doi = {10.1007/S10791-005-5661-0},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ir/LempelM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MoranS05,
author = {Shlomo Moran and
Sagi Snir},
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Efficient Approximation of Convex Recolorings},
booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms
and Techniques, 8th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
August 22-24, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3624},
pages = {192--208},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462\_17},
doi = {10.1007/11538462\_17},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/MoranS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/MoranRS05,
author = {Shlomo Moran and
Satish Rao and
Sagi Snir},
editor = {Rita Casadio and
Gene Myers},
title = {Using Semi-definite Programming to Enhance Supertree Resolvability},
booktitle = {Algorithms in Bioinformatics, 5th International Workshop, {WABI} 2005,
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3692},
pages = {89--103},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11557067\_8},
doi = {10.1007/11557067\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/MoranRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/MoranS05,
author = {Shlomo Moran and
Sagi Snir},
editor = {Frank K. H. A. Dehne and
Alejandro L{\'{o}}pez{-}Ortiz and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Convex Recolorings of Strings and Trees: Definitions, Hardness Results
and Algorithms},
booktitle = {Algorithms and Data Structures, 9th International Workshop, {WADS}
2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3608},
pages = {218--232},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11534273\_20},
doi = {10.1007/11534273\_20},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/MoranS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0505077,
author = {Shlomo Moran and
Sagi Snir},
title = {Efficient Approximation of Convex Recolorings},
journal = {CoRR},
volume = {abs/cs/0505077},
year = {2005},
url = {http://arxiv.org/abs/cs/0505077},
eprinttype = {arXiv},
eprint = {cs/0505077},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0505077.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LempelM04,
author = {Ronny Lempel and
Shlomo Moran},
title = {Competitive caching of query results in search engines},
journal = {Theor. Comput. Sci.},
volume = {324},
number = {2-3},
pages = {253--271},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2004.05.018},
doi = {10.1016/J.TCS.2004.05.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LempelM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toit/LempelM04,
author = {Ronny Lempel and
Shlomo Moran},
title = {Optimizing result prefetching in web search engines with segmented
indices},
journal = {{ACM} Trans. Internet Techn.},
volume = {4},
number = {1},
pages = {31--59},
year = {2004},
url = {https://doi.org/10.1145/967030.967032},
doi = {10.1145/967030.967032},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toit/LempelM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DinitzMR03,
author = {Yefim Dinitz and
Shlomo Moran and
Sergio Rajsbaum},
title = {Exact communication costs for consensus and leader in a tree},
journal = {J. Discrete Algorithms},
volume = {1},
number = {2},
pages = {167--183},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00024-8},
doi = {10.1016/S1570-8667(03)00024-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DinitzMR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/LempelM03,
author = {Ronny Lempel and
Shlomo Moran},
editor = {Guszt{\'{a}}v Hencsey and
Bebo White and
Yih{-}Farn Robin Chen and
L{\'{a}}szl{\'{o}} Kov{\'{a}}cs and
Steve Lawrence},
title = {Predictive caching and prefetching of query results in search engines},
booktitle = {Proceedings of the Twelfth International World Wide Web Conference,
{WWW} 2003, Budapest, Hungary, May 20-24, 2003},
pages = {19--28},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/775152.775156},
doi = {10.1145/775152.775156},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/www/LempelM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AttiyaGM02,
author = {Hagit Attiya and
Alla Gorbach and
Shlomo Moran},
title = {Computing in Totally Anonymous Asynchronous Shared Memory Systems},
journal = {Inf. Comput.},
volume = {173},
number = {2},
pages = {162--183},
year = {2002},
url = {https://doi.org/10.1006/inco.2001.3119},
doi = {10.1006/INCO.2001.3119},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AttiyaGM02.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/tcs/BritMT02,
author = {Hagit Brit and
Shlomo Moran and
Gadi Taubenfeld},
title = {Public data structures: counters as a special case},
journal = {Theor. Comput. Sci.},
volume = {289},
number = {1},
pages = {401--423},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00312-7},
doi = {10.1016/S0304-3975(01)00312-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BritMT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asist/LempelM02,
author = {Ronny Lempel and
Shlomo Moran},
title = {Introducing regulated bias into co-citation ranking schemes on the
Web},
booktitle = {Information, Connetcitons and Community - Proceedings of the 65th
ASIS{\&}T Annual Meeting, {ASIST} 2002, Philadelphia, PA, USA,
November 18-21, 2002},
series = {Proc. Assoc. Inf. Sci. Technol.},
volume = {39},
number = {1},
pages = {425--435},
publisher = {Wiley},
year = {2002},
url = {https://doi.org/10.1002/meet.1450390147},
doi = {10.1002/MEET.1450390147},
timestamp = {Fri, 21 Jan 2022 13:55:35 +0100},
biburl = {https://dblp.org/rec/conf/asist/LempelM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vldb/LempelM02,
author = {Ronny Lempel and
Shlomo Moran},
title = {Optimizing Result Prefetching in Web Search Engines with Segmented
Indices},
booktitle = {Proceedings of 28th International Conference on Very Large Data Bases,
{VLDB} 2002, Hong Kong, August 20-23, 2002},
pages = {370--381},
publisher = {Morgan Kaufmann},
year = {2002},
url = {http://www.vldb.org/conf/2002/S11P01.pdf},
doi = {10.1016/B978-155860869-6/50040-8},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/vldb/LempelM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/AlekhnovichBMP01,
author = {Michael Alekhnovich and
Samuel R. Buss and
Shlomo Moran and
Toniann Pitassi},
title = {Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate},
journal = {J. Symb. Log.},
volume = {66},
number = {1},
pages = {171--191},
year = {2001},
url = {https://doi.org/10.2307/2694916},
doi = {10.2307/2694916},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/AlekhnovichBMP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tois/LempelM01,
author = {Ronny Lempel and
Shlomo Moran},
title = {{SALSA:} the stochastic approach for link-structure analysis},
journal = {{ACM} Trans. Inf. Syst.},
volume = {19},
number = {2},
pages = {131--160},
year = {2001},
url = {https://doi.org/10.1145/382979.383041},
doi = {10.1145/382979.383041},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tois/LempelM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cn/LempelM00,
author = {Ronny Lempel and
Shlomo Moran},
title = {The stochastic approach for link-structure analysis {(SALSA)} and
the {TKC} effect},
journal = {Comput. Networks},
volume = {33},
number = {1-6},
pages = {387--401},
year = {2000},
url = {https://doi.org/10.1016/S1389-1286(00)00034-7},
doi = {10.1016/S1389-1286(00)00034-7},
timestamp = {Wed, 19 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cn/LempelM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MoranS00,
author = {Shlomo Moran and
Sagi Snir},
title = {Simple and efficient network decomposition and synchronization},
journal = {Theor. Comput. Sci.},
volume = {243},
number = {1-2},
pages = {217--241},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00206-0},
doi = {10.1016/S0304-3975(98)00206-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MoranS00.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/sirocco/DinitzMR00,
author = {Yefim Dinitz and
Shlomo Moran and
Sergio Rajsbaum},
editor = {Michele Flammini and
Enrico Nardelli and
Guido Proietti and
Paul G. Spirakis},
title = {Exact communication costs for consensus and leader in a tree},
booktitle = {{SIROCCO} 7, Proceedings of the 7th International Colloquium on Structural
Information and Communication Complexity, Laquila, Italy, June 20-22,
2000},
pages = {63--77},
publisher = {Carleton Scientific},
year = {2000},
timestamp = {Thu, 05 Feb 2004 10:15:13 +0100},
biburl = {https://dblp.org/rec/conf/sirocco/DinitzMR00.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}
}
@inproceedings{DBLP:conf/stoc/DinitzMR99,
author = {Yefim Dinitz and
Shlomo Moran and
Sergio Rajsbaum},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings
(Extended Abstract)},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {265--274},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301314},
doi = {10.1145/301250.301314},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DinitzMR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AlekhnovichBMP98,
author = {Michael Alekhnovich and
Samuel R. Buss and
Shlomo Moran and
Toniann Pitassi},
editor = {Lubos Brim and
Jozef Gruska and
Jir{\'{\i}} Zlatuska},
title = {Minimum Propositional Proof Length is NP-Hard to Linearly Approximate},
booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International
Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1450},
pages = {176--184},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055766},
doi = {10.1007/BFB0055766},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AlekhnovichBMP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AttiyaGM98,
author = {Hagit Attiya and
Alla Gorbach and
Shlomo Moran},
editor = {Shay Kutten},
title = {Computing in Totally Anonymous Asynchronous Shared Memory Systems},
booktitle = {Distributed Computing, 12th International Symposium, {DISC} '98, Andros,
Greece, September 24-26, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1499},
pages = {49--61},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0056473},
doi = {10.1007/BFB0056473},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/AttiyaGM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MoranT97,
author = {Shlomo Moran and
Gadi Taubenfeld},
title = {A Lower Bound on Wait-Free Counting},
journal = {J. Algorithms},
volume = {24},
number = {1},
pages = {1--19},
year = {1997},
url = {https://doi.org/10.1006/jagm.1996.0837},
doi = {10.1006/JAGM.1996.0837},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/MoranT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DolevIM97,
author = {Shlomi Dolev and
Amos Israeli and
Shlomo Moran},
title = {Resource Bounds for Self-Stabilizing Message-Driven Protocols},
journal = {{SIAM} J. Comput.},
volume = {26},
number = {1},
pages = {273--290},
year = {1997},
url = {https://doi.org/10.1137/S0097539792235074},
doi = {10.1137/S0097539792235074},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DolevIM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/DolevIM97,
author = {Shlomi Dolev and
Amos Israeli and
Shlomo Moran},
title = {Uniform Dynamic Self-Stabilizing Leader Election},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {8},
number = {4},
pages = {424--440},
year = {1997},
url = {https://doi.org/10.1109/71.588622},
doi = {10.1109/71.588622},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/DolevIM97.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/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}
}
@article{DBLP:journals/acta/TaubenfeldM96,
author = {Gadi Taubenfeld and
Shlomo Moran},
title = {Possibility and Impossibility Results in a Shared Memory Environment},
journal = {Acta Informatica},
volume = {33},
number = {1},
pages = {1--20},
year = {1996},
url = {https://doi.org/10.1007/s002360050034},
doi = {10.1007/S002360050034},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/TaubenfeldM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MoranTY96,
author = {Shlomo Moran and
Gadi Taubenfeld and
Irit Yadin},
title = {Concurrent Counting},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {1},
pages = {61--78},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0049},
doi = {10.1006/JCSS.1996.0049},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MoranTY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jucs/BritM96,
author = {Hagit Brit and
Shlomo Moran},
title = {Wait-Freedom vs. Bounded-Freedom in Public Data Structures},
journal = {J. Univers. Comput. Sci.},
volume = {2},
number = {1},
pages = {2--19},
year = {1996},
url = {https://doi.org/10.3217/jucs-002-01-0002},
doi = {10.3217/JUCS-002-01-0002},
timestamp = {Thu, 07 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jucs/BritM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Allenberg-NavonyIM96,
author = {Nechama Allenberg{-}Navony and
Alon Itai and
Shlomo Moran},
title = {Average and Randomized Complexity of Distributed Problems},
journal = {{SIAM} J. Comput.},
volume = {25},
number = {6},
pages = {1254--1267},
year = {1996},
url = {https://doi.org/10.1137/S0097539793252432},
doi = {10.1137/S0097539793252432},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Allenberg-NavonyIM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FischerMRT96,
author = {Michael J. Fischer and
Shlomo Moran and
Steven Rudich and
Gadi Taubenfeld},
title = {The Wakeup Problem},
journal = {{SIAM} J. Comput.},
volume = {25},
number = {6},
pages = {1331--1332},
year = {1996},
url = {https://doi.org/10.1137/S0097539793254959},
doi = {10.1137/S0097539793254959},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FischerMRT96.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}
}
@inproceedings{DBLP:conf/wdag/MoranR96,
author = {Shlomo Moran and
Lihu Rappoport},
editor = {{\"{O}}zalp Babaoglu and
Keith Marzullo},
title = {On the Robustness of h{\^{}}r{\_}m},
booktitle = {Distributed Algorithms, 10th International Workshop, {WDAG} '96, Bologna,
Italy, October 9-11, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1151},
pages = {344--361},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61769-8\_22},
doi = {10.1007/3-540-61769-8\_22},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/MoranR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/LubitchM95,
author = {Ronit Lubitch and
Shlomo Moran},
title = {Closed Schedulers: {A} Novel Technique for Analyzing Asynchronous
Protocols},
journal = {Distributed Comput.},
volume = {8},
number = {4},
pages = {203--210},
year = {1995},
url = {https://doi.org/10.1007/BF02242738},
doi = {10.1007/BF02242738},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/LubitchM95.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}
}
@article{DBLP:journals/tse/DolevIM95,
author = {Shlomi Dolev and
Amos Israeli and
Shlomo Moran},
title = {Analyzing Expected Time by Scheduler-Luck Games},
journal = {{IEEE} Trans. Software Eng.},
volume = {21},
number = {5},
pages = {429--439},
year = {1995},
url = {https://doi.org/10.1109/32.387472},
doi = {10.1109/32.387472},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tse/DolevIM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/BritMT95,
author = {Hagit Brit and
Shlomo Moran and
Gadi Taubenfeld},
title = {Public Data Structures: Counters as a Special Case (Abridged Version)},
booktitle = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS}
1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings},
pages = {98--110},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/ISTCS.1995.377041},
doi = {10.1109/ISTCS.1995.377041},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/istcs/BritMT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/Moran95,
author = {Shlomo Moran},
title = {Using Approximate Agreement to Obtain Complete Disagreement: The Output
Structure of Input-Free Asynchronous Computations},
booktitle = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS}
1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings},
pages = {251--257},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/ISTCS.1995.377025},
doi = {10.1109/ISTCS.1995.377025},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/istcs/Moran95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BodlaenderMW94,
author = {Hans L. Bodlaender and
Shlomo Moran and
Manfred K. Warmuth},
title = {The Distributed Bit Complexity of the Ring: From the Anonymous to
the Non-anonymous Case},
journal = {Inf. Comput.},
volume = {108},
number = {1},
pages = {34--50},
year = {1994},
url = {https://doi.org/10.1006/inco.1994.1002},
doi = {10.1006/INCO.1994.1002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BodlaenderMW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/TaubenfeldKM94,
author = {Gadi Taubenfeld and
Shmuel Katz and
Shlomo Moran},
title = {Impossibility Results in the Presence of Multiple Faulty Processes},
journal = {Inf. Comput.},
volume = {113},
number = {2},
pages = {173--198},
year = {1994},
url = {https://doi.org/10.1006/inco.1994.1068},
doi = {10.1006/INCO.1994.1068},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/TaubenfeldKM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BritM94,
author = {Hagit Brit and
Shlomo Moran},
editor = {James H. Anderson and
David Peleg and
Elizabeth Borowsky},
title = {Wait-Freedom vs. Bounded Wait-Freedom in Public Data Structures (Extended
Abstract)},
booktitle = {Proceedings of the Thirteenth Annual {ACM} Symposium on Principles
of Distributed Computing, Los Angeles, California, USA, August 14-17,
1994},
pages = {52--60},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/197917.197950},
doi = {10.1145/197917.197950},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/BritM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/CoriM94,
author = {Robert Cori and
Shlomo Moran},
editor = {Gerard Tel and
Paul M. B. Vit{\'{a}}nyi},
title = {Exotic Behaviour of Consensus Numbers},
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 = {101--115},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/BFb0020427},
doi = {10.1007/BFB0020427},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/CoriM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/Allenberg-NavonyIM94,
author = {Nechama Allenberg{-}Navony and
Alon Itai and
Shlomo Moran},
editor = {Gerard Tel and
Paul M. B. Vit{\'{a}}nyi},
title = {Average and Randomized Complexity of Distributed Problems},
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 = {311--325},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/BFb0020442},
doi = {10.1007/BFB0020442},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/Allenberg-NavonyIM94.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/dam/MoranW93,
author = {Shlomo Moran and
Yaron Wolfsthal},
title = {Two-Page Book Embedding of Trees under Vertex-Neighborhood Constraints},
journal = {Discret. Appl. Math.},
volume = {43},
number = {3},
pages = {233--241},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90114-4},
doi = {10.1016/0166-218X(93)90114-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MoranW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/DolevIM93,
author = {Shlomi Dolev and
Amos Israeli and
Shlomo Moran},
title = {Self-Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity},
journal = {Distributed Comput.},
volume = {7},
number = {1},
pages = {3--16},
year = {1993},
url = {https://doi.org/10.1007/BF02278851},
doi = {10.1007/BF02278851},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dc/DolevIM93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FischerMT93,
author = {Michael J. Fischer and
Shlomo Moran and
Gadi Taubenfeld},
title = {Space-Efficient Asynchronous Consensus Without Shared Memory Initialization},
journal = {Inf. Process. Lett.},
volume = {45},
number = {2},
pages = {101--105},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90223-V},
doi = {10.1016/0020-0190(93)90223-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FischerMT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MoranW93,
author = {Shlomo Moran and
Manfred K. Warmuth},
title = {Gap Theorems for Distributed Computation},
journal = {{SIAM} J. Comput.},
volume = {22},
number = {2},
pages = {379--394},
year = {1993},
url = {https://doi.org/10.1137/0222028},
doi = {10.1137/0222028},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MoranW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bar-YehudaEM93,
author = {Reuven Bar{-}Yehuda and
Tuvi Etzion and
Shlomo Moran},
title = {Rotating-Table Games and Derivatives of Words},
journal = {Theor. Comput. Sci.},
volume = {108},
number = {2},
pages = {311--329},
year = {1993},
url = {https://doi.org/10.1016/0304-3975(93)90196-Z},
doi = {10.1016/0304-3975(93)90196-Z},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bar-YehudaEM93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/MoranT92,
author = {Shlomo Moran and
Gadi Taubenfeld},
editor = {Jim Anderson and
Sam Toueg},
title = {A Lower Bound on Wait-Free Counting},
booktitle = {Proceedings of the Twelth Annual {ACM} Symposium on Principles of
Distributed Computing, Ithaca, New York, USA, August 15-18, 1993},
pages = {251--259},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/164051.164079},
doi = {10.1145/164051.164079},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/MoranT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/MoranTY92,
author = {Shlomo Moran and
Gadi Taubenfeld and
Irit Yadin},
editor = {Norman C. Hutchinson},
title = {Concurrent Counting (Extended Abstract)},
booktitle = {Proceedings of the Eleventh Annual {ACM} Symposium on Principles of
Distributed Computing, Vancouver, British Columbia, Canada, August
10-12, 1992},
pages = {59--70},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/135419.135434},
doi = {10.1145/135419.135434},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/MoranTY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/LubitchM92,
author = {Ronit Lubitch and
Shlomo Moran},
editor = {Adrian Segall and
Shmuel Zaks},
title = {Closed Schedulers: Constructions and Applications to Consensus Protocols},
booktitle = {Distributed Algorithms, 6th International Workshop, {WDAG} '92, Haifa,
Israel, November 2-4, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {647},
pages = {11--34},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56188-9\_2},
doi = {10.1007/3-540-56188-9\_2},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/LubitchM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MoranW91,
author = {Shlomo Moran and
Yaron Wolfsthal},
title = {Optimal Covering of Cacti by Vertex-Disjoint Paths},
journal = {Theor. Comput. Sci.},
volume = {84},
number = {2},
pages = {179--197},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90159-Y},
doi = {10.1016/0304-3975(91)90159-Y},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MoranW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/DolevIM91,
author = {Shlomi Dolev and
Amos Israeli and
Shlomo Moran},
editor = {Luigi Logrippo},
title = {Resource Bounds for Self Stabilizing Message Driven Protocols},
booktitle = {Proceedings of the Tenth Annual {ACM} Symposium on Principles of Distributed
Computing, Montreal, Quebec, Canada, August 19-21, 1991},
pages = {281--293},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/112600.112624},
doi = {10.1145/112600.112624},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/DolevIM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AbrahamBM91,
author = {Uri Abraham and
Shai Ben{-}David and
Shlomo Moran},
editor = {Sam Toueg and
Paul G. Spirakis and
Lefteris M. Kirousis},
title = {On the Limitation of the Global Time Assumption in Distributed Systems
(Extended Abstract)},
booktitle = {Distributed Algorithms, 5th International Workshop, {WDAG} '91, Delphi,
Greece, October 7-9, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {579},
pages = {1--8},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/BFb0022434},
doi = {10.1007/BFB0022434},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/AbrahamBM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/DolevIM91,
author = {Shlomi Dolev and
Amos Israeli and
Shlomo Moran},
editor = {Sam Toueg and
Paul G. Spirakis and
Lefteris M. Kirousis},
title = {Uniform Dynamic Self-Stabilizing Leader Election (Extended Absrtact)},
booktitle = {Distributed Algorithms, 5th International Workshop, {WDAG} '91, Delphi,
Greece, October 7-9, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {579},
pages = {167--180},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/BFb0022445},
doi = {10.1007/BFB0022445},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/DolevIM91.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/networks/MoranNW90,
author = {Shlomo Moran and
Ilan Newman and
Yaron Wolfstahl},
title = {Approximation algorithms for covering a graph by vertex-disjoint paths
of maximum total weight},
journal = {Networks},
volume = {20},
number = {1},
pages = {55--64},
year = {1990},
url = {https://doi.org/10.1002/net.3230200106},
doi = {10.1002/NET.3230200106},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/MoranNW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MoranW90,
author = {Shlomo Moran and
Yaron Wolfstahl},
title = {One-Page Book Embedding Under Vertex-Neighborhood Constraints},
journal = {{SIAM} J. Discret. Math.},
volume = {3},
number = {3},
pages = {376--390},
year = {1990},
url = {https://doi.org/10.1137/0403034},
doi = {10.1137/0403034},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MoranW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toplas/KorachKM90,
author = {Ephraim Korach and
Shay Kutten and
Shlomo Moran},
title = {A Modular Technique for the Design of Efficient Distributed Leader
Finding Algorithms},
journal = {{ACM} Trans. Program. Lang. Syst.},
volume = {12},
number = {1},
pages = {84--101},
year = {1990},
url = {https://doi.org/10.1145/77606.77610},
doi = {10.1145/77606.77610},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toplas/KorachKM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcit/MoranW90,
author = {Shlomo Moran and
Yaron Wolfsthal},
editor = {Joshua Maor and
Abraham Peled},
title = {One-page book embedding under vertex-neighborhood constraints},
booktitle = {Next Decade in Information Technology: Proceedings of the 5th Jerusalem
Conference on Information Technology 1990, Jerusalem, October 22-25,
1990},
pages = {436--446},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/JCIT.1990.128314},
doi = {10.1109/JCIT.1990.128314},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/jcit/MoranW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/DolevIM90,
author = {Shlomi Dolev and
Amos Israeli and
Shlomo Moran},
editor = {Cynthia Dwork},
title = {Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity},
booktitle = {Proceedings of the Ninth Annual {ACM} Symposium on Principles of Distributed
Computing, Quebec City, Quebec, Canada, August 22-24, 1990},
pages = {103--117},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/93385.93407},
doi = {10.1145/93385.93407},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/DolevIM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FischerMRT90,
author = {Michael J. Fischer and
Shlomo Moran and
Steven Rudich and
Gadi Taubenfeld},
editor = {Harriet Ortiz},
title = {The Wakeup Problem (Extended Abstract)},
booktitle = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing,
May 13-17, 1990, Baltimore, Maryland, {USA}},
pages = {106--116},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/100216.100228},
doi = {10.1145/100216.100228},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FischerMRT90.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/GoldM89,
author = {Yaron I. Gold and
Shlomo Moran},
title = {A Correction Algorithm for Token-Passing Sequences in Mobile Communication
Networks},
journal = {Algorithmica},
volume = {4},
number = {3},
pages = {329--341},
year = {1989},
url = {https://doi.org/10.1007/BF01553895},
doi = {10.1007/BF01553895},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GoldM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/MoranB89,
author = {L{\'{a}}szl{\'{o}} Babai and
Shlomo Moran},
title = {Proving Properties of Interactive Proofs by a Generalized Counting
Technique},
journal = {Inf. Comput.},
volume = {82},
number = {2},
pages = {185--197},
year = {1989},
url = {https://doi.org/10.1016/0890-5401(89)90053-9},
doi = {10.1016/0890-5401(89)90053-9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/MoranB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijpp/TaubenfeldKM89,
author = {Gadi Taubenfeld and
Shmuel Katz and
Shlomo Moran},
title = {Initial failures in distributed computations},
journal = {Int. J. Parallel Program.},
volume = {18},
number = {4},
pages = {255--276},
year = {1989},
url = {https://doi.org/10.1007/BF01407859},
doi = {10.1007/BF01407859},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijpp/TaubenfeldKM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/SchieberM89,
author = {Baruch Schieber and
Shlomo Moran},
title = {Parallel Algorithms for Maximum Bipartite Matchings and Maximum 0-1
Flows},
journal = {J. Parallel Distributed Comput.},
volume = {6},
number = {1},
pages = {20--38},
year = {1989},
url = {https://doi.org/10.1016/0743-7315(89)90040-3},
doi = {10.1016/0743-7315(89)90040-3},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/SchieberM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Moran89,
author = {Shlomo Moran},
title = {Message complexity versus space complexity in fault tolerant broadcast
protocols},
journal = {Networks},
volume = {19},
number = {5},
pages = {505--519},
year = {1989},
url = {https://doi.org/10.1002/net.3230190503},
doi = {10.1002/NET.3230190503},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Moran89.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}
}
@inproceedings{DBLP:conf/fct/BodlaenderMW89,
author = {Hans L. Bodlaender and
Shlomo Moran and
Manfred K. Warmuth},
editor = {J{\'{a}}nos Csirik and
J{\'{a}}nos Demetrovics and
Ferenc G{\'{e}}cseg},
title = {The Distributed Bit Complexity of the Ring: From the Anonymous to
the Non-anonymous Case},
booktitle = {Fundamentals of Computation Theory, International Conference FCT'89,
Szeged, Hungary, August 21-25, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {380},
pages = {58--67},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51498-8\_6},
doi = {10.1007/3-540-51498-8\_6},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/BodlaenderMW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/TaubenfeldKM89,
author = {Gadi Taubenfeld and
Shmuel Katz and
Shlomo Moran},
editor = {C. E. Veni Madhavan},
title = {Impossibility Results in the Presence of Multiple Faulty Processes
(Preliminary Version)},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {405},
pages = {109--120},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-52048-1\_37},
doi = {10.1007/3-540-52048-1\_37},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/TaubenfeldKM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AggarwalMSS89,
author = {Alok Aggarwal and
Shlomo Moran and
Peter W. Shor and
Subhash Suri},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Computing the Minimum Visible Vertex Distance between Two Polygons
(Preliminary Version)},
booktitle = {Algorithms and Data Structures, Workshop {WADS} '89, Ottawa, Canada,
August 17-19, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {382},
pages = {115--134},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51542-9\_11},
doi = {10.1007/3-540-51542-9\_11},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/wads/AggarwalMSS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/TaubenfeldM89,
author = {Gadi Taubenfeld and
Shlomo Moran},
editor = {Jean{-}Claude Bermond and
Michel Raynal},
title = {Possibility and Impossibility Results in a Shared Memory Environment},
booktitle = {Distributed Algorithms, 3rd International Workshop, Nice, France,
September 26-28, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {392},
pages = {254--267},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51687-5\_48},
doi = {10.1007/3-540-51687-5\_48},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/TaubenfeldM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BabaiM88,
author = {L{\'{a}}szl{\'{o}} Babai and
Shlomo Moran},
title = {Arthur-Merlin Games: {A} Randomized Proof System, and a Hierarchy
of Complexity Classes},
journal = {J. Comput. Syst. Sci.},
volume = {36},
number = {2},
pages = {254--276},
year = {1988},
url = {https://doi.org/10.1016/0022-0000(88)90028-1},
doi = {10.1016/0022-0000(88)90028-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BabaiM88.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}
}
@article{DBLP:journals/tc/GoldM88,
author = {Yaron I. Gold and
Shlomo Moran},
title = {Estimating Metrical Change in Fully Connected Mobile Networks - {A}
Least Upper Bound on the Worst Case},
journal = {{IEEE} Trans. Computers},
volume = {37},
number = {9},
pages = {1156--1162},
year = {1988},
url = {https://doi.org/10.1109/12.2272},
doi = {10.1109/12.2272},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/GoldM88.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/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/algorithmica/AggarwalKMSW87,
author = {Alok Aggarwal and
Maria M. Klawe and
Shlomo Moran and
Peter W. Shor and
Robert E. Wilber},
title = {Geometric Applications of a Matrix-Searching Algorithm},
journal = {Algorithmica},
volume = {2},
pages = {195--208},
year = {1987},
url = {https://doi.org/10.1007/BF01840359},
doi = {10.1007/BF01840359},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AggarwalKMSW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/GoldM87,
author = {Yaron I. Gold and
Shlomo Moran},
title = {Distributed Algorithms for Constructing a Minimum-Weight Spaning Tree
in a Broadcast Network},
journal = {Distributed Comput.},
volume = {2},
number = {3},
pages = {139--148},
year = {1987},
url = {https://doi.org/10.1007/BF01782774},
doi = {10.1007/BF01782774},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/GoldM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ErdosLM87,
author = {Paul Erd{\"{o}}s and
Nathan Linial and
Shlomo Moran},
title = {Extremal problems on permutations under cyclic equivalence},
journal = {Discret. Math.},
volume = {64},
number = {1},
pages = {1--11},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90235-4},
doi = {10.1016/0012-365X(87)90235-4},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ErdosLM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Moran87,
author = {Shlomo Moran},
title = {Generalized Lower Bounds Derived from Hastad's Main Lemma},
journal = {Inf. Process. Lett.},
volume = {25},
number = {6},
pages = {383--388},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90216-X},
doi = {10.1016/0020-0190(87)90216-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Moran87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MoranW87,
author = {Shlomo Moran and
Yaron Wolfstahl},
title = {Extended Impossibility Results for Asynchronous Complete Networks},
journal = {Inf. Process. Lett.},
volume = {26},
number = {3},
pages = {145--151},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90052-4},
doi = {10.1016/0020-0190(87)90052-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MoranW87.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/compgeom/AggarwalKMSW86,
author = {Alok Aggarwal and
Maria M. Klawe and
Shlomo Moran and
Peter W. Shor and
Robert E. Wilber},
editor = {Alok Aggarwal},
title = {Geometric Applications of a Matrix Searching Algorithm},
booktitle = {Proceedings of the Second Annual {ACM} {SIGACT/SIGGRAPH} Symposium
on Computational Geometry, Yorktown Heights, NY, USA, June 2-4, 1986},
pages = {285--292},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/10515.10546},
doi = {10.1145/10515.10546},
timestamp = {Mon, 14 Jun 2021 16:25:08 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AggarwalKMSW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/MoranW86,
author = {Shlomo Moran and
Manfred K. Warmuth},
editor = {Joseph Y. Halpern},
title = {Gap Theorems for Distributed Computation},
booktitle = {Proceedings of the Fifth Annual {ACM} Symposium on Principles of Distributed
Computing, Calgary, Alberta, Canada, August 11-13, 1986},
pages = {131--140},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/10590.10602},
doi = {10.1145/10590.10602},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/MoranW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/SchieberM86,
author = {Baruch Schieber and
Shlomo Moran},
editor = {Joseph Y. Halpern},
title = {Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel
Algorithms: Maximum Matchings},
booktitle = {Proceedings of the Fifth Annual {ACM} Symposium on Principles of Distributed
Computing, Calgary, Alberta, Canada, August 11-13, 1986},
pages = {282--292},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/10590.10615},
doi = {10.1145/10590.10615},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/SchieberM86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MoranSM85,
author = {Shlomo Moran and
Marc Snir and
Udi Manber},
title = {Applications of Ramsey's Theorem to Decision Tree Complexity},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {938--949},
year = {1985},
url = {https://doi.org/10.1145/4221.4259},
doi = {10.1145/4221.4259},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MoranSM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IbarraKM85,
author = {Oscar H. Ibarra and
Sam M. Kim and
Shlomo Moran},
title = {Sequential Machine Characterizations of Trellis and Cellular Automata
and Applications},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {2},
pages = {426--447},
year = {1985},
url = {https://doi.org/10.1137/0214033},
doi = {10.1137/0214033},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/IbarraKM85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/KorachKM85,
author = {Ephraim Korach and
Shay Kutten and
Shlomo Moran},
editor = {Michael A. Malcolm and
H. Raymond Strong},
title = {A Modular Technique for the Design of Efficient Distributed Leader
Finding Algorithms},
booktitle = {Proceedings of the Fourth Annual {ACM} Symposium on Principles of
Distributed Computing, Minaki, Ontario, Canada, August 5-7, 1985},
pages = {163--174},
publisher = {{ACM}},
year = {1985},
url = {https://doi.org/10.1145/323596.323611},
doi = {10.1145/323596.323611},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/KorachKM85.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/dam/Bar-YehudaM84,
author = {Reuven Bar{-}Yehuda and
Shlomo Moran},
title = {On approximation problems related to the independent set and vertex
cover problems},
journal = {Discret. Appl. Math.},
volume = {9},
number = {1},
pages = {1--10},
year = {1984},
url = {https://doi.org/10.1016/0166-218X(84)90086-6},
doi = {10.1016/0166-218X(84)90086-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bar-YehudaM84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Moran84a,
author = {Shlomo Moran},
title = {On the length of optimal {TSP} circuits in sets of bounded diameter},
journal = {J. Comb. Theory, Ser. {B}},
volume = {37},
number = {2},
pages = {113--141},
year = {1984},
url = {https://doi.org/10.1016/0095-8956(84)90067-4},
doi = {10.1016/0095-8956(84)90067-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Moran84a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/EvenGMT84,
author = {Shimon Even and
Oded Goldreich and
Shlomo Moran and
Po Tong},
title = {On the np-completeness of certain network testing problems},
journal = {Networks},
volume = {14},
number = {1},
pages = {1--24},
year = {1984},
url = {https://doi.org/10.1002/net.3230140102},
doi = {10.1002/NET.3230140102},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/EvenGMT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MoranSM84,
author = {Shlomo Moran and
Marc Snir and
Udi Manber},
title = {Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary
Version)},
booktitle = {25th Annual Symposium on Foundations of Computer Science, West Palm
Beach, Florida, USA, 24-26 October 1984},
pages = {332--337},
publisher = {{IEEE} Computer Society},
year = {1984},
url = {https://doi.org/10.1109/SFCS.1984.715933},
doi = {10.1109/SFCS.1984.715933},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MoranSM84.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/jacm/IbarraM83,
author = {Oscar H. Ibarra and
Shlomo Moran},
title = {Probabilistic Algorithms for Deciding Equivalence of Straight-Line
Programs},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {217--228},
year = {1983},
url = {https://doi.org/10.1145/322358.322373},
doi = {10.1145/322358.322373},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/IbarraM83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IbarraM83,
author = {Oscar H. Ibarra and
Shlomo Moran},
title = {Some Time-Space Tradeoff Results Concerning Single-Tape and Offline
TM's},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {2},
pages = {388--394},
year = {1983},
url = {https://doi.org/10.1137/0212025},
doi = {10.1137/0212025},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/IbarraM83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/GoldFM83,
author = {Yaron I. Gold and
William R. Franta and
Shlomo Moran},
title = {A Distributed Channel-Access Protocol for Fully-Connected Networks
with Mobile Nodes},
journal = {{IEEE} Trans. Computers},
volume = {32},
number = {2},
pages = {133--147},
year = {1983},
url = {https://doi.org/10.1109/TC.1983.1676198},
doi = {10.1109/TC.1983.1676198},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/GoldFM83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/IbarraMR83,
author = {Oscar H. Ibarra and
Shlomo Moran and
Louis E. Rosier},
title = {On the Control Power of Integer Division},
journal = {Theor. Comput. Sci.},
volume = {24},
pages = {35--52},
year = {1983},
url = {https://doi.org/10.1016/0304-3975(83)90129-9},
doi = {10.1016/0304-3975(83)90129-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/IbarraMR83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tods/Moran83,
author = {Shlomo Moran},
title = {On the Complexity of Designing Optimal Partial-Match Retrieval Systems},
journal = {{ACM} Trans. Database Syst.},
volume = {8},
number = {4},
pages = {543--551},
year = {1983},
url = {https://doi.org/10.1145/319996.320004},
doi = {10.1145/319996.320004},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tods/Moran83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigcomm/GoldM83,
author = {Yaron I. Gold and
Shlomo Moran},
editor = {Kenneth J. Thurber and
William Lidinsky},
title = {Dynamic selection of a performance-effective transmission sequence
for token-passing networks with mobile nodes},
booktitle = {Proceedings of the Eighth Symposium on Data Communications, {SIGCOMM}
1983, North Falmouth, Massachusetts, USA, October 3-6, 1983},
pages = {177--180},
publisher = {{ACM}},
year = {1983},
url = {https://doi.org/10.1145/800034.800917},
doi = {10.1145/800034.800917},
timestamp = {Wed, 21 Jul 2021 16:09:54 +0200},
biburl = {https://dblp.org/rec/conf/sigcomm/GoldM83.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/jal/IbarraMH82,
author = {Oscar H. Ibarra and
Shlomo Moran and
Roger Hui},
title = {A Generalization of the Fast {LUP} Matrix Decomposition Algorithm
and Applications},
journal = {J. Algorithms},
volume = {3},
number = {1},
pages = {45--56},
year = {1982},
url = {https://doi.org/10.1016/0196-6774(82)90007-4},
doi = {10.1016/0196-6774(82)90007-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/IbarraMH82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/IbarraM82,
author = {Oscar H. Ibarra and
Shlomo Moran},
title = {On Some Decision Problems for {RAM} Programs},
journal = {J. Comput. Syst. Sci.},
volume = {24},
number = {1},
pages = {69--81},
year = {1982},
url = {https://doi.org/10.1016/0022-0000(82)90055-1},
doi = {10.1016/0022-0000(82)90055-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/IbarraM82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Moran82,
author = {Shlomo Moran},
title = {On the Accepting Density Hierarchy in {NP}},
journal = {{SIAM} J. Comput.},
volume = {11},
number = {2},
pages = {344--349},
year = {1982},
url = {https://doi.org/10.1137/0211026},
doi = {10.1137/0211026},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Moran82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/IbarraLM82,
author = {Oscar H. Ibarra and
Brian S. Leininger and
Shlomo Moran},
title = {On the Complexity of Simple Arithmetic Expressions},
journal = {Theor. Comput. Sci.},
volume = {19},
pages = {17--28},
year = {1982},
url = {https://doi.org/10.1016/0304-3975(82)90012-3},
doi = {10.1016/0304-3975(82)90012-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/IbarraLM82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IbarraMR81,
author = {Oscar H. Ibarra and
Shlomo Moran and
Louis E. Rosier},
title = {Probabilistic Algorithms and Straight-Line Programs for Some Rank
Decision Problems},
journal = {Inf. Process. Lett.},
volume = {12},
number = {5},
pages = {227--232},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90019-3},
doi = {10.1016/0020-0190(81)90019-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IbarraMR81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IbarraM81,
author = {Oscar H. Ibarra and
Shlomo Moran},
title = {Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching
Via Fast Matrix Multiplication},
journal = {Inf. Process. Lett.},
volume = {13},
number = {1},
pages = {12--15},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90142-3},
doi = {10.1016/0020-0190(81)90142-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IbarraM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Moran81,
author = {Shlomo Moran},
title = {A Note on 'Is Shortest Path Problem not Harder Than Matrix Multiplication?'},
journal = {Inf. Process. Lett.},
volume = {13},
number = {2},
pages = {85--86},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90039-9},
doi = {10.1016/0020-0190(81)90039-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Moran81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MoranP81,
author = {Shlomo Moran and
Yehoshua Perl},
title = {The Complexity of Identifying Redundant and Essential Elements},
journal = {J. Algorithms},
volume = {2},
number = {1},
pages = {22--30},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90004-3},
doi = {10.1016/0196-6774(81)90004-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/MoranP81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Moran81,
author = {Shlomo Moran},
title = {Some Results on Relativized Deterministic and Nondeterministic Time
Hierarchies},
journal = {J. Comput. Syst. Sci.},
volume = {22},
number = {1},
pages = {1--8},
year = {1981},
url = {https://doi.org/10.1016/0022-0000(81)90017-9},
doi = {10.1016/0022-0000(81)90017-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Moran81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Moran81,
author = {Shlomo Moran},
title = {General Approximation Algorithms for some Arithmetical Combinatorial
Problems},
journal = {Theor. Comput. Sci.},
volume = {14},
pages = {289--303},
year = {1981},
url = {https://doi.org/10.1016/0304-3975(81)90047-5},
doi = {10.1016/0304-3975(81)90047-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Moran81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PazM81,
author = {Azaria Paz and
Shlomo Moran},
title = {Non Deterministic Polynomial Optimization Problems and their Approximations},
journal = {Theor. Comput. Sci.},
volume = {15},
pages = {251--277},
year = {1981},
url = {https://doi.org/10.1016/0304-3975(81)90081-5},
doi = {10.1016/0304-3975(81)90081-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PazM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/IbarraLM81,
author = {Oscar H. Ibarra and
Brian S. Leininger and
Shlomo Moran},
editor = {Shimon Even and
Oded Kariv},
title = {On the Complexity of Simple Arithmetic Expressions},
booktitle = {Automata, Languages and Programming, 8th Colloquium, Acre (Akko),
Israel, July 13-17, 1981, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {115},
pages = {294--304},
publisher = {Springer},
year = {1981},
url = {https://doi.org/10.1007/3-540-10843-2\_24},
doi = {10.1007/3-540-10843-2\_24},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/IbarraLM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/IbarraMR80,
author = {Oscar H. Ibarra and
Shlomo Moran and
Louis E. Rosier},
title = {A Note on the Parallel Complexity of Computing the Rank of Order n
Matrices},
journal = {Inf. Process. Lett.},
volume = {11},
number = {4/5},
pages = {162},
year = {1980},
url = {https://doi.org/10.1016/0020-0190(80)90042-3},
doi = {10.1016/0020-0190(80)90042-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/IbarraMR80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/PazM77,
author = {Azaria Paz and
Shlomo Moran},
editor = {Arto Salomaa and
Magnus Steinby},
title = {Non-Deterministic Polynomial Optimization Problems and Their Approximation},
booktitle = {Automata, Languages and Programming, Fourth Colloquium, University
of Turku, Finland, July 18-22, 1977, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {52},
pages = {370--379},
publisher = {Springer},
year = {1977},
url = {https://doi.org/10.1007/3-540-08342-1\_29},
doi = {10.1007/3-540-08342-1\_29},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/PazM77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
