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

• 2017
• 
  Vitor Enes, Carlos Baquero, Paulo Sérgio Almeida, João Leitão:
  Borrowing an Identity for a Distributed Counter: Work in progress report. PaPoC@EuroSys 2017: 4:1-4:3
• 
  Tim Jungnickel, Lennart Oldenburg:
  pluto: The CRDT-Driven IMAP Server. PaPoC@EuroSys 2017: 1:1-1:5
• 
  João Loff, Daniel Porto, Carlos Baquero, João Garcia, Nuno M. Preguiça, Rodrigo Rodrigues:
  Transparent cross-system consistency. PaPoC@EuroSys 2017: 8:1-8:4
• 
  Gonçalo Marcelino, Valter Balegas, Carla Ferreira:
  Bringing Hybrid Consistency Closer to Programmers. PaPoC@EuroSys 2017: 6:1-6:4
• 
  Ali Shoker, Houssam Yactine, Carlos Baquero:
  As Secure as Possible Eventual Consistency: Work in Progress. PaPoC@EuroSys 2017: 5:1-5:5
• 
  Gonçalo Tomás, Peter Zeller, Valter Balegas, Deepthi Devaki Akkoorath, Annette Bieniusa, João Leitão, Nuno M. Preguiça:
  FMKe: a Real-World Benchmark for Key-Value Data Stores. PaPoC@EuroSys 2017: 7:1-7:4
• 
  Georges Younes, Paulo Sérgio Almeida, Carlos Baquero:
  Compact Resettable Counters through Causal Stability. PaPoC@EuroSys 2017: 2:1-2:3
• 
  Peter Zeller:
  Testing properties of weakly consistent programs with Repliss. PaPoC@EuroSys 2017: 3:1-3:5
• 
  Annette Bieniusa, Alexey Gotsman:
  Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data, PaPoC@EuroSys 2017, Belgrade, Serbia, April 23 - 26, 2017. ACM 2017, ISBN 978-1-4503-4933-8 [contents]