Result 1 to 20 of 273 total
Reconciling fault-tolerant distributed computing and systems-on-chip. (English)
Distrib. Comput. 24, No. 6, 323-355 (2012).
1
A time complexity lower bound for adaptive mutual exclusion. (English)
Distrib. Comput. 24, No. 6, 271-297 (2012).
2
Consensus in the presence of mortal Byzantine faulty processes. (English)
Distrib. Comput. 24, No. 6, 299-321 (2012).
3
Secure and highly-available aggregation queries in large-scale sensor networks via set sampling. (English)
Distrib. Comput. 23, No. 5-6, 373-394 (2011).
4
Efficient online algorithm for identifying useless states in distributed systems. (English)
Distrib. Comput. 23, No. 5-6, 359-372 (2011).
5
Verification of consensus algorithms using satisfiability solving. (English)
Distrib. Comput. 23, No. 5-6, 341-358 (2011).
6
An optimal bit complexity randomized distributed MIS algorithm. (English)
Distrib. Comput. 23, No. 5-6, 331-340 (2011).
7
Distributed algorithms for QoS load balancing. (English)
Distrib. Comput. 23, No. 5-6, 321-330 (2011).
8
Incentive-compatible interdomain routing. (English)
Distrib. Comput. 23, No. 5-6, 301-319 (2011).
9
The minimum information about failures for solving non-local tasks in message-passing systems. (English)
Distrib. Comput. 24, No. 5, 255-269 (2011).
10
Meeting the deadline: on the complexity of fault-tolerant continuous gossip. (English)
Distrib. Comput. 24, No. 5, 223-244 (2011).
11
Distributed data clustering in sensor networks. (English)
Distrib. Comput. 24, No. 5, 207-222 (2011).
12
The abstract MAC layer. (English)
Distrib. Comput. 24, No. 3-4, 187-206 (2011).
13
New bounds for the controller problem. (English)
Distrib. Comput. 24, No. 3-4, 177-186 (2011).
14
Randomization can be a healer: consensus with dynamic omission failures. (English)
Distrib. Comput. 24, No. 3-4, 165-175 (2011).
15
On set consensus numbers. (English)
Distrib. Comput. 24, No. 3-4, 149-163 (2011).
16
The disagreement power of an adversary. (English)
Distrib. Comput. 24, No. 3-4, 137-147 (2011).
17
Fully-adaptive algorithms for long-lived renaming. (English)
Distrib. Comput. 24, No. 2, 119-134 (2011).
18
Modeling radio networks. (English)
Distrib. Comput. 24, No. 2, 101-118 (2011).
19
Derandomizing random walks in undirected graphs using locally fair exploration strategies. (English)
Distrib. Comput. 24, No. 2, 91-99 (2011).
20
Result 1 to 20 of 273 total