• 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 30 matches

• 2019
• 
  Manuel Alcantara, Armando Castañeda, David Flores-Peñaloza, Sergio Rajsbaum:
  The topology of look-compute-move robot wait-free algorithms with hard termination. Distributed Comput. 32(3): 235-255 (2019)
• 
  Paulo Sérgio Almeida, Carlos Baquero:
  Scalable eventually consistent counters over unreliable networks. Distributed Comput. 32(1): 69-89 (2019)
• 
  Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
  Reliable communication over highly connected noisy networks. Distributed Comput. 32(6): 505-515 (2019)
• 
  Hagit Attiya:
  Special issue on PODC 2015 and PODC 2016. Distributed Comput. 32(6): 459 (2019)
• 
  Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta:
  Self-stabilizing repeated balls-into-bins. Distributed Comput. 32(1): 59-68 (2019)
• 
  Lucas Boczkowski, Amos Korman, Emanuele Natale:
  Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits. Distributed Comput. 32(3): 173-191 (2019)
• 
  Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, Franck Petit:
  Asynchronous approach in the plane: a deterministic polynomial algorithm. Distributed Comput. 32(4): 317-337 (2019)
• 
  Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
  Fast distributed algorithms for testing graph properties. Distributed Comput. 32(1): 41-57 (2019)
• 
  Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler:
  Making asynchronous distributed computations robust to noise. Distributed Comput. 32(5): 405-421 (2019)
• 
  Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
  Algebraic methods in the congested clique. Distributed Comput. 32(6): 461-478 (2019)
• 
  Ning Chen, Martin Hoefer, Marvin Künnemann, Chengyu Lin, Peihan Miao:
  Secretary markets with local information. Distributed Comput. 32(5): 361-378 (2019)
• 
  Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
  Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach. Distributed Comput. 32(2): 91-132 (2019)
• 
  Serafino Cicerone, Gabriele Di Stefano, Alfredo Navarra:
  Embedded pattern formation by asynchronous robots without chirality. Distributed Comput. 32(4): 291-315 (2019)
• 
  Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny:
  Search on a line with faulty robots. Distributed Comput. 32(6): 493-504 (2019)
• 
  Swan Dubois, Rachid Guerraoui, Petr Kuznetsov, Franck Petit, Pierre Sens:
  The weakest failure detector for eventual consistency. Distributed Comput. 32(6): 479-492 (2019)
• 
  Jeremy T. Fineman, Seth Gilbert, Fabian Kuhn, Calvin Newport:
  Contention resolution on a fading channel. Distributed Comput. 32(6): 517-533 (2019)
• 
  Pierre Fraigniaud, Emanuele Natale:
  Noisy rumor spreading and plurality consensus. Distributed Comput. 32(4): 257-276 (2019)
• 
  Pierre Fraigniaud, Boaz Patt-Shamir, Mor Perry:
  Randomized proof-labeling schemes. Distributed Comput. 32(3): 217-234 (2019)
• 
  George Giakkoupis, Philipp Woelfel:
  Efficient randomized test-and-set implementations. Distributed Comput. 32(6): 565-586 (2019)
• 
  Wojciech M. Golab, Aditya Ramaraju:
  Recoverable mutual exclusion. Distributed Comput. 32(6): 535-564 (2019)
• 
  Magnús M. Halldórsson, Sven Köhler, Dror Rawitz:
  Distributed approximation of k-service assignment. Distributed Comput. 32(1): 27-40 (2019)
• 
  Magnús M. Halldórsson, Yuexuan Wang, Dongxiao Yu:
  Leveraging multiple channels in ad hoc networks. Distributed Comput. 32(2): 159-172 (2019)
• 
  Marek Klonowski, Dariusz R. Kowalski, Jaroslaw Mirek:
  Ordered and delayed adversaries and how to work against them on a shared channel. Distributed Comput. 32(5): 379-403 (2019)
• 
  Christoph Lenzen, Boaz Patt-Shamir, David Peleg:
  Distributed distance computation and routing with small messages. Distributed Comput. 32(2): 133-157 (2019)
• 
  Christoph Lenzen, Joel Rybicki:
  Near-optimal self-stabilising counting and firing squads. Distributed Comput. 32(4): 339-360 (2019)
• 
  Yiyan Lin, Sandeep S. Kulkarni, Arshad Jhumka:
  Automation of fault-tolerant graceful degradation. Distributed Comput. 32(1): 1-25 (2019)
• 
  Niloufar Shafiei:
  Non-blocking Patricia tries with replace operations. Distributed Comput. 32(5): 423-442 (2019)
• 
  Lili Su, Nitin H. Vaidya:
  Defending non-Bayesian learning against adversarial attacks. Distributed Comput. 32(4): 277-289 (2019)
• 
  Nicolas Tabareau, Éric Tanter:
  Chemical foundations of distributed aspects. Distributed Comput. 32(3): 193-216 (2019)
• 
  Kyrill Winkler, Manfred Schwarz, Ulrich Schmid:
  Consensus in rooted dynamic networks with short-lived stability. Distributed Comput. 32(5): 443-458 (2019)