• 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

• 2007
• 
  Anurag Agarwal, Vijay K. Garg:
  Efficient dependency tracking for relevant events in concurrent systems. Distributed Comput. 19(3): 163-183 (2007)
• 
  James Aspnes:
  Editorial. Distributed Comput. 19(4): 253 (2007)
• 
  Rida A. Bazzi, Goran Konjevod:
  On the establishment of distinct identities in overlay networks. Distributed Comput. 19(4): 267-287 (2007)
• 
  Amos Beimel:
  On private computation in incomplete networks. Distributed Comput. 19(3): 237-252 (2007)
• 
  Partha Dutta, Rachid Guerraoui, Idit Keidar:
  The overhead of consensus failure recovery. Distributed Comput. 19(5-6): 373-386 (2007)
• 
  Jonathan Eisler, Vassos Hadzilacos, Sam Toueg:
  The weakest failure detector to solve nonuniform consensus. Distributed Comput. 19(4): 335-359 (2007)
• 
  Vijay K. Garg, Chakarat Skawratananond, Neeraj Mittal:
  Timestamping messages and events in a distributed system using synchronous communication. Distributed Comput. 19(5-6): 387-402 (2007)
• 
  Leszek Gasieniec, David Peleg, Qin Xin:
  Faster communication in known topology radio networks. Distributed Comput. 19(4): 289-300 (2007)
• 
  Ara Hayrapetyan, Éva Tardos, Tom Wexler:
  A network pricing game for selfish traffic. Distributed Comput. 19(4): 255-266 (2007)
• 
  Kamal Jain, László Lovász, Philip A. Chou:
  Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding. Distributed Comput. 19(4): 301-311 (2007)
• 
  Yong-Jik Kim, James H. Anderson:
  Adaptive mutual exclusion with local spinning. Distributed Comput. 19(3): 197-236 (2007)
• 
  Dariusz R. Kowalski, Andrzej Pelc:
  Optimal Deterministic Broadcasting in Known Topology Radio Networks. Distributed Comput. 19(3): 185-195 (2007)
• 
  Mike Livesey, Ronald Morrison, David S. Munro:
  The Doomsday distributed termination detection protocol. Distributed Comput. 19(5-6): 419-431 (2007)
• 
  Andrzej Pelc:
  Activating anonymous ad hoc radio networks. Distributed Comput. 19(5-6): 361-371 (2007)
• 
  Murali Krishna Ramanathan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama, Wojciech Szpankowski:
  Randomized leader election. Distributed Comput. 19(5-6): 403-418 (2007)
• 
  Aleksandrs Slivkins:
  Distance estimation and object location via rings of neighbors. Distributed Comput. 19(4): 313-333 (2007)
• 2006
• 
  Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
  Searching for a black hole in arbitrary networks: optimal mobile agents protocols. Distributed Comput. 19(1): 1-35 (2006)
• 
  Tetz C. Huang:
  An efficient fault-containing self-stabilizing algorithm for the shortest path problem. Distributed Comput. 19(2): 149-161 (2006)
• 
  Yong-Jik Kim, James H. Anderson:
  Nonatomic mutual exclusion with local spinning. Distributed Comput. 19(1): 19-61 (2006)
• 
  Leslie Lamport:
  Fast Paxos. Distributed Comput. 19(2): 79-103 (2006)
• 
  Leslie Lamport:
  Lower bounds for asynchronous consensus. Distributed Comput. 19(2): 104-125 (2006)
• 
  Xiaozhou Li, Jayadev Misra, C. Greg Plaxton:
  Concurrent Maintenance of Rings. Distributed Comput. 19(2): 126-148 (2006)
• 
  Sasu Tarkoma, Jaakko Kangasharju:
  Optimizing content-based routers: posets and forests. Distributed Comput. 19(1): 62-77 (2006)