nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Almost global problems in the LOCAL model
|
Balliu, Alkida |
|
|
|
4 |
p. 259-281 |
artikel |
2 |
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts
|
Anagnostides, Ioannis |
|
|
|
4 |
p. 475-499 |
artikel |
3 |
A nearly optimal upper bound for the self-stabilization time in Herman’s algorithm
|
Feng, Yuan |
|
2015 |
|
4 |
p. 233-244 |
artikel |
4 |
An efficient distributed algorithm for constructing small dominating sets
|
Jia, Lujun |
|
2002 |
|
4 |
p. 193-205 |
artikel |
5 |
A network pricing game for selfish traffic
|
Hayrapetyan, Ara |
|
2007 |
|
4 |
p. 255-266 |
artikel |
6 |
An improved lower bound for the time complexity of mutual exclusion
|
Anderson, James H. |
|
2002 |
|
4 |
p. 221-253 |
artikel |
7 |
A simple and fast asynchronous consensus protocol based on a weak failure detector
|
Hurfin, Michel |
|
1999 |
|
4 |
p. 209-223 |
artikel |
8 |
Asynchronous approach in the plane: a deterministic polynomial algorithm
|
Bouchard, Sébastien |
|
2018 |
|
4 |
p. 317-337 |
artikel |
9 |
A taxonomy of process calculi for distribution and mobility
|
Gorla, Daniele |
|
2010 |
|
4 |
p. 273-299 |
artikel |
10 |
Beeping a maximal independent set
|
Afek, Yehuda |
|
2012 |
|
4 |
p. 195-208 |
artikel |
11 |
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
|
Mashreghi, Ali |
|
|
|
4 |
p. 283-299 |
artikel |
12 |
Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding
|
Jain, Kamal |
|
2006 |
|
4 |
p. 301-311 |
artikel |
13 |
Coloring unstructured radio networks
|
Moscibroda, Thomas |
|
2008 |
|
4 |
p. 271-284 |
artikel |
14 |
Comments on deriving protocol specifications from service specifications written in LOTOS
|
Kapus-Kolar, Monika |
|
1999 |
|
4 |
p. 175-177 |
artikel |
15 |
Common2 extended to stacks and unbounded concurrency
|
Afek, Yehuda |
|
2007 |
|
4 |
p. 239-252 |
artikel |
16 |
Computation in networks of passively mobile finite-state sensors
|
Angluin, Dana |
|
|
|
4 |
p. 235-253 |
artikel |
17 |
Correction to: Distributed computations in fully-defective networks
|
Censor-Hillel, Keren |
|
|
|
4 |
p. 529 |
artikel |
18 |
Defending non-Bayesian learning against adversarial attacks
|
Su, Lili |
|
2018 |
|
4 |
p. 277-289 |
artikel |
19 |
Distance estimation and object location via rings of neighbors
|
Slivkins, Aleksandrs |
|
2006 |
|
4 |
p. 313-333 |
artikel |
20 |
Distributed algorithms for the Lovász local lemma and graph coloring
|
Chung, Kai-Min |
|
2016 |
|
4 |
p. 261-280 |
artikel |
21 |
Distributed computations in fully-defective networks
|
Censor-Hillel, Keren |
|
|
|
4 |
p. 501-528 |
artikel |
22 |
Distributed verification of minimum spanning trees
|
Korman, Amos |
|
2007 |
|
4 |
p. 253-266 |
artikel |
23 |
Eclecticism shrinks even small worlds
|
Fraigniaud, Pierre |
|
|
|
4 |
p. 279-291 |
artikel |
24 |
Editorial
|
Aspnes, James |
|
2006 |
|
4 |
p. 253 |
artikel |
25 |
Editorial: Time for Change
|
, |
|
2000 |
|
4 |
p. 187 |
artikel |
26 |
Election in partially anonymous networks with arbitrary knowledge in message passing systems
|
Chalopin, Jérémie |
|
2012 |
|
4 |
p. 297-311 |
artikel |
27 |
Embedded pattern formation by asynchronous robots without chirality
|
Cicerone, Serafino |
|
2018 |
|
4 |
p. 291-315 |
artikel |
28 |
Extending the wait-free hierarchy to multi-threaded systems
|
Perrin, Matthieu |
|
|
|
4 |
p. 375-398 |
artikel |
29 |
Failure detectors encapsulate fairness
|
Pike, Scott M. |
|
2012 |
|
4 |
p. 313-333 |
artikel |
30 |
Fast and compact self-stabilizing verification, computation, and fault detection of an MST
|
Korman, Amos |
|
2015 |
|
4 |
p. 253-295 |
artikel |
31 |
Fast and scalable rendezvousing
|
Afek, Yehuda |
|
2013 |
|
4 |
p. 243-269 |
artikel |
32 |
Faster communication in known topology radio networks
|
Gąsieniec, Leszek |
|
2006 |
|
4 |
p. 289-300 |
artikel |
33 |
Fast primal-dual distributed algorithms for scheduling and matching problems
|
Panconesi, Alessandro |
|
2010 |
|
4 |
p. 269-283 |
artikel |
34 |
Fault tolerance in distributed systems using fused state machines
|
Balasubramanian, Bharath |
|
2014 |
|
4 |
p. 287-311 |
artikel |
35 |
Fault-tolerant aggregation: Flow-Updating meets Mass-Distribution
|
Almeida, Paulo Sérgio |
|
2016 |
|
4 |
p. 281-291 |
artikel |
36 |
Four shades of deterministic leader election in anonymous networks
|
Gorain, Barun |
|
|
|
4 |
p. 419-449 |
artikel |
37 |
Gathering on rings under the Look–Compute–Move model
|
D’Angelo, Gianlorenzo |
|
2014 |
|
4 |
p. 255-285 |
artikel |
38 |
Genuinely distributed Byzantine machine learning
|
El-Mhamdi, El-Mahdi |
|
|
|
4 |
p. 305-331 |
artikel |
39 |
Geometric and combinatorial views on asynchronous computability
|
Goubault, Éric |
|
2018 |
|
4 |
p. 289-316 |
artikel |
40 |
Greedy routing in small-world networks with power-law degrees
|
Fraigniaud, Pierre |
|
2014 |
|
4 |
p. 231-253 |
artikel |
41 |
Improved distributed Δ-coloring
|
Ghaffari, Mohsen |
|
|
|
4 |
p. 239-258 |
artikel |
42 |
Introduction
|
Shavit, Nir |
|
2002 |
|
4 |
p. 191 |
artikel |
43 |
Introduction to the special issue of papers from DISC 2015
|
Moses, Yoram |
|
2018 |
|
4 |
p. 255 |
artikel |
44 |
Knowledge, level of symmetry, and time of leader election
|
Fusco, Emanuele G. |
|
2014 |
|
4 |
p. 221-232 |
artikel |
45 |
Locality and checkability in wait-free computing
|
Fraigniaud, Pierre |
|
2013 |
|
4 |
p. 223-242 |
artikel |
46 |
Localization for a system of colliding robots
|
Czyzowicz, Jurek |
|
2014 |
|
4 |
p. 245-252 |
artikel |
47 |
Lock-free reference counting
|
Detlefs, David L. |
|
2002 |
|
4 |
p. 255-271 |
artikel |
48 |
Lower and upper bounds for single-scanner snapshot implementations
|
Fatourou, Panagiota |
|
2016 |
|
4 |
p. 231-260 |
artikel |
49 |
Lower bound for scalable Byzantine Agreement
|
Holtby, Dan |
|
2008 |
|
4 |
p. 239-248 |
artikel |
50 |
Lower bounds for searching robots, some faulty
|
Kupavskii, Andrey |
|
|
|
4 |
p. 229-237 |
artikel |
51 |
Misleading stars: what cannot be measured in the internet?
|
Pignolet, Yvonne-Anne |
|
2013 |
|
4 |
p. 209-222 |
artikel |
52 |
Modelling and verifying the AODV routing protocol
|
Glabbeek, Rob van |
|
2016 |
|
4 |
p. 279-315 |
artikel |
53 |
Multi-shot distributed transaction commit
|
Chockler, Gregory |
|
|
|
4 |
p. 301-318 |
artikel |
54 |
Nearly optimal perfectly periodic schedules
|
Bar-Noy, Amotz |
|
2002 |
|
4 |
p. 207-220 |
artikel |
55 |
Near-optimal self-stabilising counting and firing squads
|
Lenzen, Christoph |
|
2018 |
|
4 |
p. 339-360 |
artikel |
56 |
Node and edge averaged complexities of local graph problems
|
Balliu, Alkida |
|
|
|
4 |
p. 451-473 |
artikel |
57 |
Noisy rumor spreading and plurality consensus
|
Fraigniaud, Pierre |
|
2018 |
|
4 |
p. 257-276 |
artikel |
58 |
On implementing omega in systems with weak reliability and synchrony assumptions
|
Aguilera, Marcos K. |
|
2008 |
|
4 |
p. 285-314 |
artikel |
59 |
On spectrum sharing games
|
Halldórsson, Magnús M. |
|
2010 |
|
4 |
p. 235-248 |
artikel |
60 |
On the establishment of distinct identities in overlay networks
|
Bazzi, Rida A. |
|
2007 |
|
4 |
p. 267-287 |
artikel |
61 |
On the inherent weakness of conditional primitives
|
Fich, Faith Ellen |
|
|
|
4 |
p. 267-277 |
artikel |
62 |
On the optimal space complexity of consensus for anonymous processes
|
Gelashvili, Rati |
|
2018 |
|
4 |
p. 317-326 |
artikel |
63 |
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
|
Fernández Anta, Antonio |
|
2012 |
|
4 |
p. 279-296 |
artikel |
64 |
Peer counting and sampling in overlay networks based on random walks
|
Ganesh, A. J. |
|
2007 |
|
4 |
p. 267-278 |
artikel |
65 |
Plausible clocks: constant size logical clocks for distributed systems
|
Torres-Rojas, Francisco J. |
|
1999 |
|
4 |
p. 179-195 |
artikel |
66 |
Progress under bounded fairness
|
Hesselink, Wim H. |
|
1999 |
|
4 |
p. 197-207 |
artikel |
67 |
Proof labeling schemes
|
Korman, Amos |
|
2010 |
|
4 |
p. 215-233 |
artikel |
68 |
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
|
Gilbert, Seth |
|
2010 |
|
4 |
p. 225-272 |
artikel |
69 |
Restoration by path concatenation: fast recovery of MPLS paths
|
Afek, Yehuda |
|
2002 |
|
4 |
p. 273-283 |
artikel |
70 |
Revisiting asynchronous fault tolerant computation with optimal resilience
|
Abraham, Ittai |
|
|
|
4 |
p. 333-355 |
artikel |
71 |
Sequentially consistent versus linearizable counting networks
|
Mavronicolas, Marios |
|
2008 |
|
4 |
p. 249-269 |
artikel |
72 |
Signed quorum systems
|
Yu, Haifeng |
|
|
|
4 |
p. 307-323 |
artikel |
73 |
Simple dynamics for plurality consensus
|
Becchetti, Luca |
|
2016 |
|
4 |
p. 293-306 |
artikel |
74 |
Single-source shortest paths in the CONGEST model with improved bounds
|
Chechik, Shiri |
|
|
|
4 |
p. 357-374 |
artikel |
75 |
Smoothed analysis of dynamic networks
|
Dinitz, Michael |
|
2017 |
|
4 |
p. 273-287 |
artikel |
76 |
Special issue on DISC 2011
|
Peleg, David |
|
2013 |
|
4 |
p. 193 |
artikel |
77 |
Special issue on PODC 2020
|
Attiya, Hagit |
|
|
|
4 |
p. 303 |
artikel |
78 |
Special issue on PODC 2018 and DISC 2018
|
Attiya, Hagit |
|
|
|
4 |
p. 227 |
artikel |
79 |
Stable leader election in population protocols requires linear time
|
Doty, David |
|
2016 |
|
4 |
p. 257-271 |
artikel |
80 |
The computational power of population protocols
|
Angluin, Dana |
|
2007 |
|
4 |
p. 279-304 |
artikel |
81 |
The Forgiving Graph: a distributed data structure for low stretch under adversarial attack
|
Hayes, Thomas P. |
|
2012 |
|
4 |
p. 261-278 |
artikel |
82 |
The weakest failure detector to solve nonuniform consensus
|
Eisler, Jonathan |
|
2007 |
|
4 |
p. 335-359 |
artikel |
83 |
Towards worst-case churn resistant peer-to-peer systems
|
Kuhn, Fabian |
|
2010 |
|
4 |
p. 249-267 |
artikel |
84 |
Universal constructions that ensure disjoint-access parallelism and wait-freedom
|
Ellen, Faith |
|
2016 |
|
4 |
p. 251-277 |
artikel |
85 |
Upper and lower bounds for deterministic broadcast in powerline communication networks
|
Pignolet, Yvonne Anne |
|
2016 |
|
4 |
p. 239-250 |
artikel |