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

• 2024
• 
  Yehuda Afek, Gal Giladi, Boaz Patt-Shamir:
  Distributed computing with the cloud. Distributed Comput. 37(1): 1-18 (2024)
• 
  Timothé Albouy, Davide Frey, Michel Raynal, François Taïani:
  Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case. Distributed Comput. 37(2): 121-143 (2024)
• 
  Orestis Alpos, Christian Cachin, Björn Tackmann, Luca Zanolini:
  Asymmetric distributed trust. Distributed Comput. 37(3): 247-277 (2024)
• 
  Hagit Attiya:
  Special issue on PODC 2021 and DISC 2021. Distributed Comput. 37(1): 65 (2024)
• 
  Petra Berenbrink, Martin Hoefer, Dominik Kaaser, Pascal Lenzner, Malin Rau, Daniel Schmand:
  Asynchronous opinion dynamics in social networks. Distributed Comput. 37(3): 207-224 (2024)
• 
  Manuel Bravo, Gregory V. Chockler, Alexey Gotsman:
  Liveness and latency of Byzantine state-machine replication. Distributed Comput. 37(2): 177-205 (2024)
• 
  Keren Censor-Hillel, Dean Leitersdorf, David Vulakh:
  Deterministic near-optimal distributed listing of cliques. Distributed Comput. 37(4): 363-385 (2024)
• 
  Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira:
  Byzantine consensus is Θ (n²⁾: the Dolev-Reischuk bound is tight even in partial synchrony! Distributed Comput. 37(2): 89-119 (2024)
• 
  Artur Czumaj, Peter Davies-Peck, Merav Parter:
  Component stability in low-space massively parallel computation. Distributed Comput. 37(1): 35-64 (2024)
• 
  Michal Dory, Mohsen Ghaffari, Saeed Ilchi:
  Near-optimal distributed dominating set in bounded arboricity graphs. Distributed Comput. 37(4): 387-398 (2024)
• 
  Xing Hu, Sam Toueg:
  On implementing SWMR registers from SWSR registers in systems with Byzantine failures. Distributed Comput. 37(2): 145-175 (2024)
• 
  David G. Kirkpatrick, Irina Kostitsyna, Alfredo Navarra, Giuseppe Prencipe, Nicola Santoro:
  On the power of bounded asynchrony: convergence by autonomous robots with limited visibility. Distributed Comput. 37(3): 279-308 (2024)
• 
  Amos Korman, Robin Vacus:
  Early adapting to trends: self-stabilizing information spread using passive communication. Distributed Comput. 37(4): 335-362 (2024)
• 
  Hossein Naderibeni, Eric Ruppert:
  A wait-free queue with polylogarithmic step complexity. Distributed Comput. 37(4): 309-334 (2024)
• 
  Oded Naor, Idit Keidar:
  Expected linear round synchronization: the missing link for linear Byzantine SMR. Distributed Comput. 37(1): 19-33 (2024)
• 
  Merav Parter, Asaf Petruschka:
  Near-optimal distributed computation of small vertex cuts. Distributed Comput. 37(2): 67-88 (2024)
• 
  Lewis Tseng, Guanfeng Liang, Nitin H. Vaidya:
  Iterative approximate Byzantine consensus in arbitrary directed graphs. Distributed Comput. 37(3): 225-246 (2024)
• 2023
• 
  Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
  Communication complexity of byzantine agreement, revisited. Distributed Comput. 36(1): 3-28 (2023)
• 
  Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu:
  Reaching consensus for asynchronous distributed key generation. Distributed Comput. 36(3): 219-252 (2023)
• 
  Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami:
  The splay-list: a distribution-adaptive concurrent skip-list. Distributed Comput. 36(3): 395-418 (2023)
• 
  Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
  Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. Distributed Comput. 36(4): 475-499 (2023)
• 
  Hagit Attiya:
  Special issue on DISC 2019. Distributed Comput. 36(1): 1 (2023)
• 
  Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers:
  Long-lived counters with polylogarithmic amortized step complexity. Distributed Comput. 36(1): 29-43 (2023)
• 
  Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko:
  Locally checkable problems in rooted trees. Distributed Comput. 36(3): 277-311 (2023)
• 
  Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti:
  Node and edge averaged complexities of local graph problems. Distributed Comput. 36(4): 451-473 (2023)
• 
  Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
  Optimal distributed covering algorithms. Distributed Comput. 36(1): 45-55 (2023)
• 
  Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
  Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity. Distributed Comput. 36(2): 89-106 (2023)
• 
  Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
  Distributed computations in fully-defective networks. Distributed Comput. 36(4): 501-528 (2023)
• 
  Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
  Correction to: Distributed computations in fully-defective networks. Distributed Comput. 36(4): 529 (2023)
• 
  Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, Sara Rizzo:
  Phase transition of the k-majority dynamics in biased communication models. Distributed Comput. 36(2): 107-135 (2023)

skipping 781 more matches