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

• 2014
• 
  Zarko Milosevic, Martin Hutle, André Schiper:
  Tolerating permanent and transient value faults. Distributed Comput. 27(1): 55-77 (2014)
• 
  Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan:
  The CB tree: a practical concurrent self-adjusting search tree. Distributed Comput. 27(6): 393-417 (2014)
• 
  Marcos K. Aguilera:
  Special issue with selected papers from DISC 2012. Distributed Comput. 27(6): 391 (2014)
• 
  Bharath Balasubramanian, Vijay K. Garg:
  Fault tolerance in distributed systems using fused state machines. Distributed Comput. 27(4): 287-311 (2014)
• 
  Leonid Barenboim, Michael Elkin:
  Combinatorial algorithms for distributed graph coloring. Distributed Comput. 27(2): 79-93 (2014)
• 
  Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai:
  Leakage-resilient coin tossing. Distributed Comput. 27(3): 147-164 (2014)
• 
  Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport:
  Structuring unreliable radio networks. Distributed Comput. 27(1): 1-19 (2014)
• 
  Steven Cheng, Lisa Higham, Jalal Kawash:
  Partition consistency - A case study in modeling systems with weak memory consistency and proving correctness of their implementations. Distributed Comput. 27(5): 363-389 (2014)
• 
  Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc:
  Time versus space trade-offs for rendezvous in trees. Distributed Comput. 27(2): 95-109 (2014)
• 
  Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
  Gathering on rings under the Look-Compute-Move model. Distributed Comput. 27(4): 255-285 (2014)
• 
  Dariusz Dereniowski, Andrzej Pelc:
  Leader election for anonymous asynchronous agents in arbitrary networks. Distributed Comput. 27(1): 21-38 (2014)
• 
  Ittay Eyal, Idit Keidar, Raphael Rom:
  LiMoSense: live monitoring in dynamic sensor networks. Distributed Comput. 27(5): 313-328 (2014)
• 
  Pierre Fraigniaud, George Giakkoupis:
  Greedy routing in small-world networks with power-law degrees. Distributed Comput. 27(4): 231-253 (2014)
• 
  Pierre Fraigniaud, Mika Göös, Amos Korman, Merav Parter, David Peleg:
  Randomized distributed decision. Distributed Comput. 27(6): 419-434 (2014)
• 
  Mika Göös, Jukka Suomela:
  No sublogarithmic-time approximation scheme for bipartite vertex cover. Distributed Comput. 27(6): 435-443 (2014)
• 
  Robert M. Hierons, Mercedes G. Merayo, Manuel Núñez:
  Timed implementation relations for the distributed test architecture. Distributed Comput. 27(3): 181-201 (2014)
• 
  Heinrich Moser, Ulrich Schmid:
  Reconciling fault-tolerant distributed algorithms and real-time computing. Distributed Comput. 27(3): 203-230 (2014)
• 
  Gopal Pandurangan, Amitabh Trehan:
  Xheal: a localized self-healing algorithm using expanders. Distributed Comput. 27(1): 39-54 (2014)
• 
  Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
  Asynchronous Byzantine Agreement with optimal resilience. Distributed Comput. 27(2): 111-146 (2014)
• 
  Gokarna Sharma, Costas Busch:
  Distributed transactional memory for general networks. Distributed Comput. 27(5): 329-362 (2014)
• 
  Gadi Taubenfeld:
  Tight space bounds for #8467;-exclusion. Distributed Comput. 27(3): 165-179 (2014)