default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th DISC 2012: Salvador, Brazil
- Marcos K. Aguilera:
Distributed Computing - 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012. Proceedings. Lecture Notes in Computer Science 7611, Springer 2012, ISBN 978-3-642-33650-8
Shared Memory I
- Yehuda Afek, Haim Kaplan, Boris Korenfeld, Adam Morrison, Robert Endre Tarjan:
CBTree: A Practical Concurrent Self-Adjusting Search Tree. 1-15 - Faith Ellen, Vijaya Ramachandran, Philipp Woelfel:
Efficient Fetch-and-Increment. 16-30 - Alexey Gotsman, Madanlal Musuvathi, Hongseok Yang:
Show No Weakness: Sequentially Consistent Specifications of TSO Libraries. 31-45
Mobile Agents and Overlay Networks
- Julian Anaya
, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Collecting Information by Power-Aware Mobile Agents. 46-60 - Ofer Feinerman, Amos Korman:
Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology. 61-75 - Chen Chen, Roman Vitenberg, Hans-Arno Jacobsen:
A Generalized Algorithm for Publish/Subscribe Overlay Design and Its Fast Implementation. 76-90
Wireless and Multiple Access Channel Networks
- Keren Censor-Hillel, Bernhard Haeupler, Nancy A. Lynch, Muriel Médard:
Bounded-Contention Coding for Wireless Networks in the High SNR Regime. 91-105 - Tomasz Jurdzinski, Dariusz R. Kowalski:
Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks. 106-120 - Marcin Bienkowski, Tomasz Jurdzinski, Miroslaw Korzeniowski, Dariusz R. Kowalski:
Distributed Online and Stochastic Queuing on a Multiple Access Channel. 121-135
Dynamic Networks
- Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Fast Distributed Computation in Dynamic Networks via Random Walks. 136-150 - Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Dense Subgraphs on Dynamic Networks. 151-165 - Bernhard Haeupler, Fabian Kuhn:
Lower Bounds on Information Dissemination in Dynamic Networks. 166-180
Distributed Graph Algorithms
- Mika Göös, Jukka Suomela:
No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover. 181-194 - Danny Dolev, Christoph Lenzen, Shir Peled:
"Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract). 195-209 - Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak:
Distributed 2-Approximation Algorithm for the Semi-matching Problem. 210-222
Wireless and Loosely Connected Networks
- Mohsen Ghaffari, Bernhard Haeupler, Nancy A. Lynch, Calvin C. Newport:
Bounds on Contention Management in Radio Networks. 223-237 - Sebastian Daum, Fabian Kuhn, Calvin C. Newport:
Efficient Symmetry Breaking in Multi-Channel Radio Networks. 238-252 - Alexandre Maurer, Sébastien Tixeuil:
On Byzantine Broadcast in Loosely Connected Networks. 253-266
Shared Memory II
- Abhijeet Pareek, Philipp Woelfel:
RMR-Efficient Randomized Abortable Mutual Exclusion - (Extended Abstract). 267-281 - Prasad Jayanti, Zhiyu Liu:
Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks. 282-296 - Yehuda Afek, Alexander Matveev, Nir Shavit:
Pessimistic Software Lock-Elision. 297-311
Robots
- Nao Fujinaga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. 312-325 - Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra:
How to Gather Asynchronous Oblivious Robots on Anonymous Rings. 326-340 - Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Oscar Morales-Ponce, Eduardo Pacheco:
Position Discovery for a System of Bouncing Robots. 341-355
Lower Bounds and Separation
- Hagit Attiya, Ami Paz:
Counting-Based Impossibility Proofs for Renaming and Set Agreement. 356-370 - Pierre Fraigniaud, Amos Korman, Merav Parter, David Peleg:
Randomized Distributed Decision. 371-385 - Sotiris Kentros, Chadi Kari, Aggelos Kiayias:
The Strong At-Most-Once Problem. 386-400
Brief Announcements I
- Zohir Bouzid, Shantanu Das, Sébastien Tixeuil:
Brief Announcement: Wait-Free Gathering of Mobile Robots. 401-402 - Lélia Blin, Janna Burman, Nicolas Nisse:
Brief Announcement: Distributed Exclusive and Perpetual Tree Searching. 403-404 - Chuanyou Li, Michel Hurfin, Yun Wang:
Brief Announcement: Reaching Approximate Byzantine Consensus in Partially-Connected Mobile Networks. 405-406 - Guanhong Pei, Anil Kumar S. Vullikanti:
Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model. 407-408 - Maleq Khan, Gopal Pandurangan, Guanhong Pei, Anil Kumar S. Vullikanti:
Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model. 409-410 - Bojun Huang:
Brief Announcement: Deterministic Protocol for the Membership Problem in Beeping Channels. 411-412 - Yukiko Yamauchi, Sébastien Tixeuil, Shuji Kijima, Masafumi Yamashita:
Brief Announcement: Probabilistic Stabilization under Probabilistic Schedulers. 413-414 - Gokarna Sharma, Costas Busch:
Brief Announcement: An Analysis Framework for Distributed Hierarchical Directories. 415-416 - Hervé Baumann, Pierluigi Crescenzi, Pierre Fraigniaud:
Brief Announcement: Flooding in Dynamic Graphs with Arbitrary Degree Sequence. 417-418 - Andrés Sevilla, Alberto Mozo, Antonio Fernández Anta:
Brief Announcement: Node Sampling Using Centrifugal Random Walks. 419-420 - Aravind Natarajan, Lee Savoie, Neeraj Mittal:
Brief Announcement: Concurrent Wait-Free Red-Black Trees. 421-422 - Tyler Crain, Vincent Gramoli, Michel Raynal:
Brief Announcement: A Contention-Friendly, Non-blocking Skip List. 423-424
Brief Announcements II
- Flavio Junqueira, Marco Serafini:
Brief Announcement: Consensus and Efficient Passive Replication. 425-426 - Zohir Bouzid, Corentin Travers:
Brief Announcement: Anonymity, Failures, Detectors and Consensus. 427-428 - Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Brief Announcement: Do VNet Embeddings Leak Information about ISP Topology? 429-430 - Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky:
Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams. 431-432 - Sebastian Ertel, Christof Fetzer, Michael J. Beckerle:
Brief Announcement: Fast Travellers: Infrastructure-Independent Deadlock Resolution in Resource-restricted Distributed Systems. 433-434 - Sebastian Kniesburges, Christian Scheideler:
Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. 435-436 - Othon Michail, Ioannis Chatzigiannakis, Paul G. Spirakis:
Brief Announcement: Naming and Counting in Anonymous Unknown Dynamic Networks. 437-438 - Stefan Schmid, Chen Avin, Christian Scheideler, Bernhard Haeupler, Zvi Lotker:
Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. 439-440 - Annette Bieniusa, Marek Zawirski, Nuno M. Preguiça, Marc Shapiro, Carlos Baquero, Valter Balegas, Sérgio Duarte:
Brief Announcement: Semantics of Eventually Consistent Replicated Sets. 441-442 - Eduardo Adílio Pelinson Alchieri, Alysson Neves Bessani, Fabíola Greve, Joni da Silva Fraga:
Brief Announcement: Decoupled and Consensus-Free Reconfiguration for Fault-Tolerant Storage. 443-444 - Cosmin Arad, Tallat M. Shafaat, Seif Haridi:
Brief Announcement: Atomic Consistency and Partition Tolerance in Scalable Key-Value Stores. 445-446 - William Culhane, K. R. Jayaram, Patrick Eugster:
Brief Announcement: Weighted Partial Message Matching for Implicit Multicast Systems. 447-448
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 2025-01-10 18:42 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:
