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

• 2012
• 
  Matthias Függer, Ulrich Schmid:
  Reconciling fault-tolerant distributed computing and systems-on-chip. Distributed Comput. 24(6): 323-355 (2012)
• 
  Yong-Jik Kim, James H. Anderson:
  A time complexity lower bound for adaptive mutual exclusion. Distributed Comput. 24(6): 271-297 (2012)
• 
  Josef Widder, Martin Biely, Günther Gridling, Bettina Weiss, Jean-Paul Blanquart:
  Consensus in the presence of mortal Byzantine faulty processes. Distributed Comput. 24(6): 299-321 (2012)
• 2011
• 
  Lorenzo Alvisi:
  Special issue on PODC 2009. Distributed Comput. 24(1): 1 (2011)
• 
  Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
  Parsimonious flooding in dynamic graphs. Distributed Comput. 24(1): 31-44 (2011)
• 
  Zvika Brakerski, Boaz Patt-Shamir:
  Distributed discovery of large near-cliques. Distributed Comput. 24(2): 79-89 (2011)
• 
  Alex Brodsky, Faith Ellen, Philipp Woelfel:
  Fully-adaptive algorithms for long-lived renaming. Distributed Comput. 24(2): 119-134 (2011)
• 
  Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski:
  Derandomizing random walks in undirected graphs using locally fair exploration strategies. Distributed Comput. 24(2): 91-99 (2011)
• 
  Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann:
  The disagreement power of an adversary. Distributed Comput. 24(3-4): 137-147 (2011)
• 
  Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
  The minimum information about failures for solving non-local tasks in message-passing systems. Distributed Comput. 24(5): 255-269 (2011)
• 
  Yuval Emek, Amos Korman:
  New bounds for the controller problem. Distributed Comput. 24(3-4): 177-186 (2011)
• 
  Ittay Eyal, Idit Keidar, Raphael Rom:
  Distributed data clustering in sensor networks. Distributed Comput. 24(5): 207-222 (2011)
• 
  Angelo Fanelli, Luca Moscardelli:
  On best response dynamics in weighted congestion games with polynomial delays. Distributed Comput. 24(5): 245-254 (2011)
• 
  Emanuele G. Fusco, Andrzej Pelc:
  How much memory is needed for leader election. Distributed Comput. 24(2): 65-78 (2011)
• 
  Eli Gafni, Petr Kuznetsov:
  On set consensus numbers. Distributed Comput. 24(3-4): 149-163 (2011)
• 
  Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski:
  Meeting the deadline: on the complexity of fault-tolerant continuous gossip. Distributed Comput. 24(5): 223-244 (2011)
• 
  Danny Hendler, Philipp Woelfel:
  Randomized mutual exclusion with sub-logarithmic RMR-complexity. Distributed Comput. 24(1): 3-19 (2011)
• 
  Idit Keidar:
  Special issue with selected papers from DISC 2009. Distributed Comput. 24(3-4): 135-136 (2011)
• 
  Robert Kleinberg, Georgios Piliouras, Éva Tardos:
  Load balancing without regret in the bulletin board model. Distributed Comput. 24(1): 21-29 (2011)
• 
  Christos Koufogiannakis, Neal E. Young:
  Distributed algorithms for covering, packing and maximum weighted matching. Distributed Comput. 24(1): 45-63 (2011)
• 
  Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
  The abstract MAC layer. Distributed Comput. 24(3-4): 187-206 (2011)
• 
  Henrique Moniz, Nuno Ferreira Neves, Miguel Correia, Paulo Veríssimo:
  Randomization can be a healer: consensus with dynamic omission failures. Distributed Comput. 24(3-4): 165-175 (2011)
• 
  Calvin C. Newport, Nancy A. Lynch:
  Modeling radio networks. Distributed Comput. 24(2): 101-118 (2011)