• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 150 matches

• 2023
• 
  Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran:
  Diagonalization Games. CoRR abs/2301.01924 (2023)
• 
  Noga Alon, Olivier Bousquet, Kasper Green Larsen, Shay Moran, Shlomo Moran:
  Diagonalization Games. Electron. Colloquium Comput. Complex. TR23 (2023)
• 2022
• 
  Pawel Cyprys, Shlomi Dolev, Shlomo Moran:
  Brief Announcement: Self Masking for Hardening Inversions. SSS 2022: 331-334
• 
  Pawel Cyprys, Shlomi Dolev, Shlomo Moran:
  Self Masking for Hardering Inversions. IACR Cryptol. ePrint Arch. 2022: 1274 (2022)
• 2021
• 
  Bernadette Charron-Bost, Shlomo Moran:
  MinMax algorithms for stabilizing consensus. Distributed Comput. 34(3): 195-206 (2021)
• 
  Tomer Moran, Shay Moran, Shlomo Moran:
  Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran's last paper. Am. Math. Mon. 128(8): 726-736 (2021)
• 2020
• 
  Shlomo Moran, Irad Yavneh:
  Adjustable Coins. CoRR abs/2008.03676 (2020)
• 2019
• 
  Bernadette Charron-Bost, Shlomo Moran:
  The firing squad problem revisited. Theor. Comput. Sci. 793: 100-112 (2019)
• 
  Bernadette Charron-Bost, Shlomo Moran:
  MinMax Algorithms for Stabilizing Consensus. CoRR abs/1906.09073 (2019)
• 2018
• 
  Bernadette Charron-Bost, Shlomo Moran:
  The Firing Squad Problem Revisited. STACS 2018: 20:1-20:14
• 2017
• 
  Bernadette Charron-Bost, Shlomo Moran:
  Synchronization in Dynamic Networks. CoRR abs/1706.07831 (2017)
• 2016
• 
  Benjamin Doerr, Carola Doerr, Shay Moran, Shlomo Moran:
  Simple and optimal randomized fault-tolerant rumor spreading. Distributed Comput. 29(2): 89-104 (2016)
• 2012
• 
  Daniel Doerr, Ilan Gronau, Shlomo Moran, Irad Yavneh:
  Stochastic errors vs. modeling errors in distance based phylogenetic reconstructions. Algorithms Mol. Biol. 7: 22 (2012)
• 
  Ilan Gronau, Shlomo Moran, Sagi Snir:
  Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges. Random Struct. Algorithms 40(3): 350-384 (2012)
• 
  Benjamin Doerr, Shay Moran, Shlomo Moran, Carola Winzen:
  Fast Fault Tolerant Rumor Spreading with Minimum Message Complexity. CoRR abs/1209.6158 (2012)
• 2011
• 
  Shlomo Moran, Sagi Snir, Wing-Kin Sung:
  Partial convex recolorings of trees and galled networks: Tight upper and lower bounds. ACM Trans. Algorithms 7(4): 42:1-42:20 (2011)
• 
  Daniel Doerr, Ilan Gronau, Shlomo Moran, Irad Yavneh:
  Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstructions - (Extended Abstract). WABI 2011: 49-60
• 2010
• 
  Ilan Gronau, Shlomo Moran, Irad Yavneh:
  Adaptive Distance Measures for Resolving K2P Quartets: Metric Separation versus Stochastic Noise. J. Comput. Biol. 17(11): 1509-1518 (2010)
• 2008
• 
  Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum:
  Bit complexity of breaking and achieving symmetry in chains and rings. J. ACM 55(1): 3:1-3:28 (2008)
• 
  Shlomo Moran, Sagi Snir:
  Convex recolorings of strings and trees: Definitions, hardness results and algorithms. J. Comput. Syst. Sci. 74(5): 850-869 (2008)
• 
  Ilan Gronau, Shlomo Moran, Sagi Snir:
  Fast and reliable reconstruction of phylogenetic trees with very short edges. SODA 2008: 379-388
• 2007
• 
  Ilan Gronau, Shlomo Moran:
  Optimal implementations of UPGMA and other common clustering algorithms. Inf. Process. Lett. 104(6): 205-210 (2007)
• 
  Ilan Gronau, Shlomo Moran:
  Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances. J. Comput. Biol. 14(1): 1-15 (2007)
• 
  Shlomo Moran, Sagi Snir:
  Efficient approximation of convex recolorings. J. Comput. Syst. Sci. 73(7): 1078-1089 (2007)
• 
  Ilan Gronau, Shlomo Moran:
  On the hardness of inferring phylogenies from triplet-dissimilarities. Theor. Comput. Sci. 389(1-2): 44-55 (2007)
• 2005
• 
  Ronny Lempel, Shlomo Moran:
  Rank-Stability and Rank-Similarity of Link-Based Web Ranking Algorithms in Authority-Connected Graphs. Inf. Retr. 8(2): 245-264 (2005)
• 
  Shlomo Moran, Sagi Snir:
  Efficient Approximation of Convex Recolorings. APPROX-RANDOM 2005: 192-208
• 
  Shlomo Moran, Satish Rao, Sagi Snir:
  Using Semi-definite Programming to Enhance Supertree Resolvability. WABI 2005: 89-103
• 
  Shlomo Moran, Sagi Snir:
  Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms. WADS 2005: 218-232
• 
  Shlomo Moran, Sagi Snir:
  Efficient Approximation of Convex Recolorings. CoRR abs/cs/0505077 (2005)

skipping 120 more matches