|
Communication Patterns and Input Patterns in Distributed Computing (Invited Talk) |
|
|
1 | (15) |
|
|
|
Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach |
|
|
16 | (15) |
|
|
|
|
|
Node Labels in Local Decision |
|
|
31 | (15) |
|
|
|
|
|
|
|
Exact Bounds for Distributed Graph Colouring |
|
|
46 | (15) |
|
|
|
|
|
Essential Traffic Parameters for Shared Memory Switch Performance |
|
|
61 | (15) |
|
|
|
|
|
|
|
|
|
|
|
Scheduling Multipacket Frames with Frame Deadlines |
|
|
76 | (15) |
|
|
|
|
|
|
|
A Randomized Algorithm for Online Scheduling with Interval Conflicts |
|
|
91 | (13) |
|
|
|
|
|
|
|
Online Admission Control and Embedding of Service Chains |
|
|
104 | (15) |
|
|
|
|
|
Optimizing Spread of Influence in Social Networks via Partial Incentives |
|
|
119 | (16) |
|
|
|
|
|
|
|
|
|
Approximation Algorithms for Multi-budgeted Network Design Problems |
|
|
135 | (14) |
|
|
|
Simple Distributed Δ + 1 Coloring in the SINR Model |
|
|
149 | (15) |
|
|
|
|
|
Nearly Optimal Local Broadcasting in the SINR Model with Feedback |
|
|
164 | (15) |
|
|
|
|
|
Byzantine Gathering in Networks |
|
|
179 | (15) |
|
|
|
|
|
|
|
Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n2) Messages, and Constant Time |
|
|
194 | (15) |
|
|
|
|
|
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation (Extended Abstract) |
|
|
209 | (15) |
|
|
|
|
|
|
|
Path-Fault-Tolerant Approximate Shortest-Path Trees |
|
|
224 | (15) |
|
|
|
|
|
|
|
|
|
|
|
A Faster Computation of All the Best Swap Edges of a Tree Spanner |
|
|
239 | (15) |
|
|
|
|
|
|
|
|
|
|
|
Randomized OBDD-Based Graph Algorithms |
|
|
254 | (16) |
|
|
|
On Fast and Robust Information Spreading in the Vertex-Congest Model |
|
|
270 | (15) |
|
|
|
|
|
Information Spreading by Mobile Particles on a Line |
|
|
285 | (14) |
|
|
|
|
|
|
|
|
|
On Space and Time Complexity of Loosely-Stabilizing Leader Election |
|
|
299 | (14) |
|
|
|
Wait-Free Gathering Without Chirality |
|
|
313 | (15) |
|
|
|
|
|
Treasure Hunt with Advice |
|
|
328 | (14) |
|
|
|
|
|
|
|
|
|
Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond |
|
|
342 | (15) |
|
|
|
|
|
|
|
|
|
Collaborative Exploration by Energy-Constrained Mobile Robots |
|
|
357 | (13) |
|
|
|
|
|
|
|
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model |
|
|
370 | (15) |
|
|
|
|
|
|
|
|
|
A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling |
|
|
385 | (14) |
|
|
|
|
|
|
|
Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority |
|
|
399 | (15) |
|
|
|
|
|
The Computability of Relaxed Data Structures: Queues and Stacks as Examples |
|
|
414 | (15) |
|
|
|
|
|
Comparison-Based Interactive Collaborative Filtering |
|
|
429 | (15) |
|
|
|
|
|
Coalescing Walks on Rotor-Router Systems |
|
|
444 | (15) |
|
|
|
|
|
|
|
|
|
Secure Multi-party Shuffling |
|
|
459 | (16) |
|
|
|
|
|
|
| Author Index |
|
475 | |
Lisainfo e-raamatute kohta