Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDistributed Computing, Volume 36
Volume 36, Number 1, March 2023
- Hagit Attiya:
Special issue on DISC 2019. 1 - Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak
, Rafael Pass, Ling Ren, Elaine Shi:
Communication complexity of byzantine agreement, revisited. 3-28 - Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers:
Long-lived counters with polylogarithmic amortized step complexity. 29-43 - Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, Gregory Schwartzman:
Optimal distributed covering algorithms. 45-55 - Orr Fischer, Rotem Oshman:
A distributed algorithm for directed minimum-weight spanning tree. 57-87
Volume 36, Number 2, June 2023
- Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity. 89-106 - Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, Sara Rizzo:
Phase transition of the k-majority dynamics in biased communication models. 107-135 - Rob van Glabbeek, Vincent Gramoli, Pierre Tholoniat:
Cross-chain payment protocols with success guarantees. 137-157 - Joshua J. Daymude, Andréa W. Richa, Christian Scheideler:
The canonical amoebot model: algorithms and concurrency control. 159-192 - Walter Hussak, Amitabh Trehan:
Termination of amnesiac flooding. 193-207
Volume 36, Number 3, September 2023
- Philipp Czerner, Javier Esparza, Jérôme Leroux:
Lower bounds on the state complexity of population protocols. 209-218 - Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu:
Reaching consensus for asynchronous distributed key generation. 219-252 - Guy Goren, Shay Vargaftik, Yoram Moses:
Stochastic coordination in heterogeneous load balancing systems. 253-275 - Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, Jukka Suomela, Aleksandr Tereshchenko:
Locally checkable problems in rooted trees. 277-311 - Thorsten Götte, Kristian Hinnenthal, Christian Scheideler, Julian Werthmann:
Time-optimal construction of overlay networks. 313-347 - Petr Kuznetsov, Yvonne-Anne Pignolet, Pavel Ponomarev, Andrei Tonkikh:
Permissionless and asynchronous asset transfer. 349-371 - Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie:
Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks. 373-384 - Michael Elkin, Yuval Gitlitz, Ofer Neiman:
Improved weighted additive spanners. 385-394 - Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami:
The splay-list: a distribution-adaptive concurrent skip-list. 395-418
Volume 36, Number 4, December 2023
- Barun Gorain, Avery Miller, Andrzej Pelc:
Four shades of deterministic leader election in anonymous networks. 419-449 - Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti:
Node and edge averaged complexities of local graph problems. 451-473 - Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. 475-499 - Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
Distributed computations in fully-defective networks. 501-528 - Keren Censor-Hillel, Shir Cohen, Ran Gelles, Gal Sela:
Correction to: Distributed computations in fully-defective networks. 529
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
