default search action
22. SIROCCO 2015: Montserrat, Spain
- Christian Scheideler:
Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings. Lecture Notes in Computer Science 9439, Springer 2015, ISBN 978-3-319-25257-5 - Michel Raynal:
Communication Patterns and Input Patterns in Distributed Computing - (Invited Talk). 1-15 - Ofer Feinerman, Amos Korman:
Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach. 16-30 - Pierre Fraigniaud, Juho Hirvonen, Jukka Suomela
:
Node Labels in Local Decision. 31-45 - Joel Rybicki
Exact Bounds for Distributed Graph Colouring. 46-60 - Patrick Eugster, Alexander Kesselman, Kirill Kogan
Essential Traffic Parameters for Shared Memory Switch Performance. 61-75 - Lukasz Jez, Yishay Mansour, Boaz Patt-Shamir:
Scheduling Multipacket Frames with Frame Deadlines. 76-90 - Marcin Bienkowski
A Randomized Algorithm for Online Scheduling with Interval Conflicts. 91-103 - Tamás Lukovszki
Online Admission Control and Embedding of Service Chains. 104-118 - Gennaro Cordasco
Optimizing Spread of Influence in Social Networks via Partial Incentives. 119-134 - Georgios Stamoulis:
Approximation Algorithms for Multi-budgeted Network Design Problems. 135-148 - Fabian Fuchs, Roman Prutkin:
Simple Distributed Δ + 1 Coloring in the SINR Model. 149-163 - Leonid Barenboim, David Peleg:
Nearly Optimal Local Broadcasting in the SINR Model with Feedback. 164-178 - Sébastien Bouchard, Yoann Dieudonné, Bertrand Ducourthial:
Byzantine Gathering in Networks. 179-193 - Achour Mostéfaoui, Michel Raynal:
Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n2) Messages, and Constant Time. 194-208 - Leonid Barenboim, Michael Elkin, Cyril Gavoille:
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract). 209-223 - Annalisa D'Andrea, Mattia D'Emidio
Path-Fault-Tolerant Approximate Shortest-Path Trees. 224-238 - Davide Bilò
A Faster Computation of All the Best Swap Edges of a Tree Spanner. 239-253 - Marc Bury:
Randomized OBDD-Based Graph Algorithms. 254-269 - Keren Censor-Hillel, Tariq Toukan:
On Fast and Robust Information Spreading in the Vertex-Congest Model. 270-284 - Jurek Czyzowicz, Evangelos Kranakis
Information Spreading by Mobile Particles on a Line. 285-298 - Taisuke Izumi:
On Space and Time Complexity of Loosely-Stabilizing Leader Election. 299-312 - Quentin Bramas
Wait-Free Gathering Without Chirality. 313-327 - Dennis Komm
Treasure Hunt with Advice. 328-341 - Klaus-Tycho Förster
Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond. 342-356 - Shantanu Das, Dariusz Dereniowski
Collaborative Exploration by Energy-Constrained Mobile Robots. 357-369 - Jarkko Kari
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. 370-384 - Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg:
A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling. 385-398 - Yoram Moses, Katia Patkin:
Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority. 399-413 - Nir Shavit, Gadi Taubenfeld:
The Computability of Relaxed Data Structures: Queues and Stacks as Examples. 414-428 - Yuval Carmel, Boaz Patt-Shamir:
Comparison-Based Interactive Collaborative Filtering. 429-443 - Colin Cooper, Tomasz Radzik
Coalescing Walks on Rotor-Router Systems. 444-458 - Mahnush Movahedi, Jared Saia, Mahdi Zamani:
Secure Multi-party Shuffling. 459-473
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-11-25 22:32 CET 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: