| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A coded shared atomic memory algorithm for message passing architectures
|
Cadambe, Viveck R.
|
|
2016
|
|
1 |
p. 49-73
|
artikel
|
| 2 |
A distributed algorithm for directed minimum-weight spanning tree
|
Fischer, Orr
|
|
|
|
1 |
p. 57-87
|
artikel
|
| 3 |
A distributed low tree-depth decomposition algorithm for bounded expansion classes
|
Nešetřil, J.
|
|
2015
|
|
1 |
p. 39-49
|
artikel
|
| 4 |
Announcement: best reviewer award 2011
|
Attiya, Hagit
|
|
2012
|
|
1 |
p. 1
|
artikel
|
| 5 |
Approximate distributed top-k queries
|
Patt-Shamir, Boaz
|
|
2008
|
|
1 |
p. 1-22
|
artikel
|
| 6 |
A self-stabilizing algorithm for bridge finding
|
Karaata, Mehmet Hakan
|
|
1999
|
|
1 |
p. 47-53
|
artikel
|
| 7 |
A spatial equational logic for the applied π-calculus
|
Lozes, Étienne
|
|
2010
|
|
1 |
p. 61-83
|
artikel
|
| 8 |
A study on shuffle, stopwatches and independently evolving clocks
|
Dima, Cătălin
|
|
2011
|
|
1 |
p. 5-33
|
artikel
|
| 9 |
A unified approach for gathering and exclusive searching on rings under weak assumptions
|
D’Angelo, Gianlorenzo
|
|
2016
|
|
1 |
p. 17-48
|
artikel
|
| 10 |
Automation of fault-tolerant graceful degradation
|
Lin, Yiyan
|
|
2017
|
|
1 |
p. 1-25
|
artikel
|
| 11 |
Bounding the locality of distributed routing algorithms
|
Bose, Prosenjit
|
|
2012
|
|
1 |
p. 39-58
|
artikel
|
| 12 |
Choreographies, logically
|
Carbone, Marco
|
|
2017
|
|
1 |
p. 51-67
|
artikel
|
| 13 |
Close to linear space routing schemes
|
Roditty, Liam
|
|
2015
|
|
1 |
p. 65-74
|
artikel
|
| 14 |
Communication complexity of byzantine agreement, revisited
|
Abraham, Ittai
|
|
|
|
1 |
p. 3-28
|
artikel
|
| 15 |
Component stability in low-space massively parallel computation
|
Czumaj, Artur
|
|
|
|
1 |
p. 35-64
|
artikel
|
| 16 |
Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
|
Bilò, Vittorio
|
|
|
|
1 |
p. 1-14
|
artikel
|
| 17 |
Computing large independent sets in a single round
|
Halldórsson, Magnús M.
|
|
2017
|
|
1 |
p. 69-82
|
artikel
|
| 18 |
Concurrency theory: timed automata, testing, program synthesis
|
Sangiorgi, Davide
|
|
2011
|
|
1 |
p. 3-4
|
artikel
|
| 19 |
Consensus and collision detectors in radio networks
|
Chockler, Gregory
|
|
2008
|
|
1 |
p. 55-84
|
artikel
|
| 20 |
Contention-free MAC protocols for asynchronous wireless sensor networks
|
Busch, Costas
|
|
2007
|
|
1 |
p. 23-42
|
artikel
|
| 21 |
Correction to: The consensus number of a cryptocurrency
|
Guerraoui, Rachid
|
|
|
|
1 |
p. 17
|
artikel
|
| 22 |
Determining majority in networks with local interactions and very small local memory
|
Mertzios, George B.
|
|
2016
|
|
1 |
p. 1-16
|
artikel
|
| 23 |
Disk Paxos
|
Gafni, Eli
|
|
2003
|
|
1 |
p. 1-20
|
artikel
|
| 24 |
Distributed algorithms for covering, packing and maximum weighted matching
|
Koufogiannakis, Christos
|
|
2011
|
|
1 |
p. 45-63
|
artikel
|
| 25 |
Distributed approximation of k-service assignment
|
Halldórsson, Magnús M.
|
|
2017
|
|
1 |
p. 27-40
|
artikel
|
| 26 |
Distributed bare-bones communication in wireless networks
|
Chlebus, Bogdan S.
|
|
|
|
1 |
p. 59-80
|
artikel
|
| 27 |
Distributed computing with the cloud
|
Afek, Yehuda
|
|
|
|
1 |
p. 1-18
|
artikel
|
| 28 |
Distributed construction of low-interference spanners
|
Damian, Mirela
|
|
2009
|
|
1 |
p. 15-28
|
artikel
|
| 29 |
Distributed edge coloration for bipartite networks
|
Huang, Shing-Tsaan
|
|
2009
|
|
1 |
p. 3-14
|
artikel
|
| 30 |
Dynamic scheduling in distributed transactional memory
|
Busch, Costas
|
|
|
|
1 |
p. 19-36
|
artikel
|
| 31 |
Editorial: It’s all about change
|
Attiya, Hagit
|
|
2009
|
|
1 |
p. 1
|
artikel
|
| 32 |
Efficient broadcasting in radio networks with long-range interference
|
Galčík, František
|
|
2012
|
|
1 |
p. 59-74
|
artikel
|
| 33 |
Expected linear round synchronization: the missing link for linear Byzantine SMR
|
Naor, Oded
|
|
|
|
1 |
p. 19-33
|
artikel
|
| 34 |
Fair and resilient Incentive Tree mechanisms
|
Lv, Yuezhou
|
|
2015
|
|
1 |
p. 1-16
|
artikel
|
| 35 |
Fast distributed algorithms for testing graph properties
|
Censor-Hillel, Keren
|
|
2018
|
|
1 |
p. 41-57
|
artikel
|
| 36 |
Faster randomized consensus with an oblivious adversary
|
Aspnes, James
|
|
2013
|
|
1 |
p. 21-29
|
artikel
|
| 37 |
Fast flooding over Manhattan
|
Clementi, Andrea
|
|
2012
|
|
1 |
p. 25-38
|
artikel
|
| 38 |
Fast message dissemination in random geometric networks
|
Czumaj, Artur
|
|
2011
|
|
1 |
p. 1-24
|
artikel
|
| 39 |
Fault-containing self-stabilizing distributed protocols
|
Ghosh, Sukumar
|
|
2007
|
|
1 |
p. 53-73
|
artikel
|
| 40 |
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
|
Cicerone, Serafino
|
|
2017
|
|
1 |
p. 1-50
|
artikel
|
| 41 |
Implementation relations and test generation for systems with distributed interfaces
|
Hierons, Robert M.
|
|
2011
|
|
1 |
p. 35-62
|
artikel
|
| 42 |
Information spreading in dynamic graphs
|
Clementi, Andrea
|
|
2014
|
|
1 |
p. 55-73
|
artikel
|
| 43 |
Introduction
|
Arora, Anish
|
|
2007
|
|
1 |
p. 1
|
artikel
|
| 44 |
Leader election for anonymous asynchronous agents in arbitrary networks
|
Dereniowski, Dariusz
|
|
2013
|
|
1 |
p. 21-38
|
artikel
|
| 45 |
Load balancing without regret in the bulletin board model
|
Kleinberg, Robert
|
|
2011
|
|
1 |
p. 21-29
|
artikel
|
| 46 |
Long-lived counters with polylogarithmic amortized step complexity
|
Baig, Mirza Ahad
|
|
|
|
1 |
p. 29-43
|
artikel
|
| 47 |
Low-Congestion shortcuts without embedding
|
Haeupler, Bernhard
|
|
|
|
1 |
p. 79-90
|
artikel
|
| 48 |
Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions
|
Zhao, Yuda
|
|
2015
|
|
1 |
p. 17-38
|
artikel
|
| 49 |
Nonatomic mutual exclusion with local spinning
|
Kim, Yong-Jik
|
|
|
|
1 |
p. 19-61
|
artikel
|
| 50 |
Nonatomic mutual exclusion with local spinning
|
Kim, Yong-Jik
|
|
2006
|
|
1 |
p. 19-61
|
artikel
|
| 51 |
Objects shared by Byzantine processes
|
Malkhi, Dahlia
|
|
2003
|
|
1 |
p. 37-48
|
artikel
|
| 52 |
On atomic registers and randomized consensus in M&M systems
|
Hadzilacos, Vassos
|
|
|
|
1 |
p. 81-103
|
artikel
|
| 53 |
On the performance of Dijkstra’s third self-stabilizing algorithm for mutual exclusion and related algorithms
|
Chernoy, Viacheslav
|
|
2010
|
|
1 |
p. 43-60
|
artikel
|
| 54 |
Optimal distributed covering algorithms
|
Ben-Basat, Ran
|
|
|
|
1 |
p. 45-55
|
artikel
|
| 55 |
Optimal extension protocols for byzantine broadcast and agreement
|
Ganesh, Chaya
|
|
|
|
1 |
p. 59-77
|
artikel
|
| 56 |
Optimizing content-based routers: posets and forests
|
Tarkoma, Sasu
|
|
|
|
1 |
p. 62-77
|
artikel
|
| 57 |
Optimizing content-based routers: posets and forests
|
Tarkoma, Sasu
|
|
2006
|
|
1 |
p. 62-77
|
artikel
|
| 58 |
Overcoming controllability problems in distributed testing from an input output transition system
|
Hierons, Robert M.
|
|
2011
|
|
1 |
p. 63-81
|
artikel
|
| 59 |
Parallel composition for time-to-fault adaptive stabilization
|
Dolev, Shlomi
|
|
2007
|
|
1 |
p. 29-38
|
artikel
|
| 60 |
Parsimonious flooding in dynamic graphs
|
Baumann, Hervé
|
|
2011
|
|
1 |
p. 31-44
|
artikel
|
| 61 |
Property testing of planarity in the CONGEST model
|
Levi, Reut
|
|
|
|
1 |
p. 15-32
|
artikel
|
| 62 |
Protocol synthesis and re-synthesis with optimal allocation of resources based on extended Petri nets
|
Yamaguchi, Hirozumi
|
|
2003
|
|
1 |
p. 21-35
|
artikel
|
| 63 |
Randomized mutual exclusion with sub-logarithmic RMR-complexity
|
Hendler, Danny
|
|
2011
|
|
1 |
p. 3-19
|
artikel
|
| 64 |
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
|
Beauquier, Joffroy
|
|
2007
|
|
1 |
p. 75-93
|
artikel
|
| 65 |
Refined quorum systems
|
Guerraoui, Rachid
|
|
2010
|
|
1 |
p. 1-42
|
artikel
|
| 66 |
Scalable eventually consistent counters over unreliable networks
|
Almeida, Paulo Sérgio
|
|
2017
|
|
1 |
p. 69-89
|
artikel
|
| 67 |
Searching for a black hole in arbitrary networks: optimal mobile agents protocols
|
Dobrev, Stefan
|
|
2006
|
|
1 |
p. 1-99999
|
artikel
|
| 68 |
Self-stabilizing $2^m$-clock for unidirectional rings of odd size
|
Huang, Shing-Tsaan
|
|
1999
|
|
1 |
p. 41-46
|
artikel
|
| 69 |
Self-stabilizing repeated balls-into-bins
|
Becchetti, L.
|
|
2017
|
|
1 |
p. 59-68
|
artikel
|
| 70 |
Snap-stabilization and PIF in tree networks
|
Bui, Alain
|
|
2007
|
|
1 |
p. 3-19
|
artikel
|
| 71 |
Solo-valency and the cost of coordination
|
Hendler, Danny
|
|
2007
|
|
1 |
p. 43-54
|
artikel
|
| 72 |
Special issue on DISC 2019
|
Attiya, Hagit
|
|
|
|
1 |
p. 1
|
artikel
|
| 73 |
Special issue on PODC 2009
|
Alvisi, Lorenzo
|
|
2011
|
|
1 |
p. 1
|
artikel
|
| 74 |
Special issue on PODC 2021 and DISC 2021
|
Attiya, Hagit
|
|
|
|
1 |
p. 65
|
artikel
|
| 75 |
Special issue with selected papers from PODC 2012
|
Panconesi, Alessandro
|
|
2015
|
|
1 |
p. 1
|
artikel
|
| 76 |
Structuring unreliable radio networks
|
Censor-Hillel, Keren
|
|
2013
|
|
1 |
p. 1-19
|
artikel
|
| 77 |
Symbolic synthesis of masking fault-tolerant distributed programs
|
Bonakdarpour, Borzoo
|
|
2011
|
|
1 |
p. 83-108
|
artikel
|
| 78 |
Synthesizing optimal bias in randomized self-stabilization
|
Volk, Matthias
|
|
|
|
1 |
p. 37-57
|
artikel
|
| 79 |
The alternator
|
Gouda, Mohamed G.
|
|
2007
|
|
1 |
p. 21-28
|
artikel
|
| 80 |
The consensus number of a cryptocurrency
|
Guerraoui, Rachid
|
|
|
|
1 |
p. 1-15
|
artikel
|
| 81 |
The Heard-Of model: computing in distributed systems with benign faults
|
Charron-Bost, Bernadette
|
|
2009
|
|
1 |
p. 49-71
|
artikel
|
| 82 |
The Theta-Model: achieving synchrony without clocks
|
Widder, Josef
|
|
2009
|
|
1 |
p. 29-47
|
artikel
|
| 83 |
Time versus cost tradeoffs for deterministic rendezvous in networks
|
Miller, Avery
|
|
2015
|
|
1 |
p. 51-64
|
artikel
|
| 84 |
Tolerating malicious gossip
|
Minsky, Yaron M.
|
|
2003
|
|
1 |
p. 49-68
|
artikel
|
| 85 |
Tolerating permanent and transient value faults
|
Milosevic, Zarko
|
|
2013
|
|
1 |
p. 55-77
|
artikel
|
| 86 |
Tractable low-delay atomic memory
|
Anta, Antonio Fernández
|
|
|
|
1 |
p. 33-58
|
artikel
|
| 87 |
Transient fault detectors
|
Beauquier, Joffroy
|
|
2007
|
|
1 |
p. 39-51
|
artikel
|
| 88 |
Wait-freedom with advice
|
Delporte-Gallet, Carole
|
|
2014
|
|
1 |
p. 3-19
|
artikel
|
| 89 |
Weak models of distributed computing, with connections to modal logic
|
Hella, Lauri
|
|
2013
|
|
1 |
p. 31-53
|
artikel
|
| 90 |
Xheal: a localized self-healing algorithm using expanders
|
Pandurangan, Gopal
|
|
2013
|
|
1 |
p. 39-54
|
artikel
|
Tijdschrift beschrijving