Abstract is missing.
- Beyond nash equilibrium: solution concepts for the 21st centuryJoseph Y. Halpern. 1-10 [doi]
- The internet is flat: a brief history of networking in the next ten yearsDonald F. Towsley. 11-12 [doi]
- Accountability for distributed systemsPeter Druschel. 13-14 [doi]
- Distributed computation of the modeFabian Kuhn, Thomas Locher, Stefan Schmid. 15-24 [doi]
- Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decompositionLeonid Barenboim, Michael Elkin. 25-34 [doi]
- A log-star distributed maximal independent set algorithm for growth-bounded graphsJohannes Schneider, Roger Wattenhofer. 35-44 [doi]
- A jamming-resistant MAC protocol for single-hop wireless networksBaruch Awerbuch, Andréa W. Richa, Christian Scheideler. 45-54 [doi]
- Anti-Omega: the weakest failure detector for set agreementPiotr Zielinski. 55-64 [doi]
- Failure detectors in loosely named systemsYehuda Afek, Israel Nir. 65-74 [doi]
- Every problem has a weakest failure detectorPrasad Jayanti, Sam Toueg. 75-84 [doi]
- Sharing is harder than agreeingCarole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui. 85-94 [doi]
- Collaborative enforcement of firewall policies in virtual private networksAlex X. Liu, Fei Chen. 95-104 [doi]
- Secure communication over radio channelsShlomi Dolev, Seth Gilbert, Rachid Guerraoui, Calvin C. Newport. 105-114 [doi]
- On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversaryB. V. Ashwinkumar, Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan. 115-124 [doi]
- CAR-STM: scheduling-based collision avoidance and resolution for software transactional memoryShlomi Dolev, Danny Hendler, Adi Suissa. 125-134 [doi]
- On the complexity of asynchronous gossipChryssis Georgiou, Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski. 135-144 [doi]
- Brahms: byzantine resilient random membership samplingEdward Bortnikov, Maxim Gurevich, Idit Keidar, Gabriel Kliot, Alexander Shraer. 145-154 [doi]
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systemsPetra Berenbrink, Robert Elsässer, Tom Friedetzky. 155-164 [doi]
- Bounded budget connection (BBC) games or how to make friends and influence people, on a budgetNikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, Shang-Hua Teng. 165-174 [doi]
- On a capacitated multivehicle routing problemXiaojie Gao, Leonard J. Schulman. 175-184 [doi]
- Improved compact routing schemes for dynamic treesAmos Korman. 185-194 [doi]
- Tight bounds for delay-sensitive aggregationYvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer. 195-202 [doi]
- The forgiving tree: a self-healing distributed data structureTom Hayes, Navin Rustagi, Jared Saia, Amitabh Trehan. 203-212 [doi]
- Flooding time in edge-Markovian dynamic graphsAndrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri. 213-222 [doi]
- On the effect of the deployment setting on broadcasting in Euclidean radio networksYuval Emek, Erez Kantor, David Peleg. 223-232 [doi]
- Virtual infrastructure for collision-prone wireless networksGregory Chockler, Seth Gilbert, Nancy A. Lynch. 233-242 [doi]
- Sleeping on the job: energy-efficient and robust broadcast for radio networksValerie King, Cynthia Phillips, Jared Saia, Maxwell Young. 243-252 [doi]
- Distributed algorithms for ultrasparse spanners and linear size skeletonsSeth Pettie. 253-262 [doi]
- Efficient distributed approximation algorithms via probabilistic tree embeddingsMaleq Khan, Fabian Kuhn, Dahlia Malkhi, Gopal Pandurangan, Kunal Talwar. 263-272 [doi]
- On the locality of distributed sparse spanner constructionBilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot. 273-282 [doi]
- The stretched exponential distribution of internet media access patternsLei Guo, Enhua Tan, Songqing Chen, Zhen Xiao, Xiaodong Zhang. 283-294 [doi]
- New combinatorial topology upper and lower bounds for renamingArmando Castañeda, Sergio Rajsbaum. 295-304 [doi]
- Timeliness-based wait-freedom: a gracefully degrading progress conditionMarcos Kawazoe Aguilera, Sam Toueg. 305-314 [doi]
- Lower bounds for randomized consensus under a weak adversaryHagit Attiya, Keren Censor. 315-324 [doi]
- Randomized consensus in expected O(n log n) individual workJames Aspnes, Hagit Attiya, Keren Censor. 325-334 [doi]
- Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuingAlexander Kesselman, Kirill Kogan, Michael Segal. 335-344 [doi]
- The impact of randomization in smoothing networksMarios Mavronicolas, Thomas Sauerwald. 345-354 [doi]
- Optimizing data popularity conscious bloom filtersMing Zhong, Pin Lu, Kai Shen, Joel I. Seiferas. 355-364 [doi]
- Distributed order scheduling and its application to multi-core dram controllersThomas Moscibroda, Onur Mutlu. 365-374 [doi]
- Asynchronous exclusive selectionBogdan S. Chlebus, Dariusz R. Kowalski. 375-384 [doi]
- Fast self-stabilizing byzantine tolerant digital clock synchronizationMichael Ben-Or, Danny Dolev, Ezra N. Hoch. 385-394 [doi]
- OCD: obsessive consensus disorder (or repetitive consensus)Danny Dolev, Ezra N. Hoch. 395-404 [doi]
- An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilienceIttai Abraham, Danny Dolev, Joseph Y. Halpern. 405-414 [doi]
- Forget him and keep on movingAugustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar. 415 [doi]
- Online and dynamic embeddings of approximate ultrametricsMichael Dinitz. 416 [doi]
- Dynamic routing and location services in metrics of low doubling dimensionGoran Konjevod, Andréa W. Richa, Donglin Xia. 417 [doi]
- On ad hoc routing with guaranteed deliveryMark Braverman. 418 [doi]
- On the internet delay space dimensionalityBruno D. Abrahao, Robert D. Kleinberg. 419 [doi]
- Maximizing quorum availability in multi-clustered systemsRoman Vitenberg, Ricardo Jiménez-Peris. 420 [doi]
- BMobi_Causal: a causal broadcast protocol in mobile dynamic groupsChafika Benzaid, Nadjib Badache. 421 [doi]
- Correctness criteria for replicated database systems with snapshot isolation replicasJosé Enrique Armendáriz-Iñigo, José Ramón Juárez-Rodríguez, José Ramón González de Mendívil, Francesc D. Muñoz-Escoí. 422 [doi]
- The asynchronous bounded-cycle modelPeter Robinson, Ulrich Schmid. 423 [doi]
- Model checking transactional memory with spinJohn O Leary, Bratin Saha, Mark R. Tuttle. 424 [doi]
- On the robustness of (semi) fast quorum-based implementations of atomic shared memoryChryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman. 425 [doi]
- Principles of untrusted storage: a new look at consistency conditionsChristian Cachin, Idit Keidar, Alexander Shraer. 426 [doi]
- A fast distributed slicing algorithmVincent Gramoli, Ymir Vigfusson, Ken Birman, Anne-Marie Kermarrec, Robbert van Renesse. 427 [doi]
- A dynamic exchange gameLászló Toka, Pietro Michiardi. 428 [doi]
- Anonymous and censorship resistant content sharing in unstructured overlaysMichael Backes, Marek Hamerlik, Alessandro Linari, Matteo Maffei, Christos Tryfonopoulos, Gerhard Weikum. 429 [doi]
- Our brothers keepersAlex Brodsky. 430 [doi]
- Distributed churn measurement in arbitrary networksVincent Gramoli, Anne-Marie Kermarrec, Erwan Le Merrer. 431 [doi]
- Efficient pipeline configuration in distributed heterogeneous computing environmentsYi Gu, Qishi Wu, Mengxia Zhu, Nageswara S. V. Rao. 432 [doi]
- A tradeoff analysis on message complexity and lifetime optimality for a distributed multicast algorithm in WSNsSong Guo, Minyi Guo, Victor C. M. Leung. 433 [doi]
- Nearest-neighbor graphs on random point sets and their applications to sensor networksAmitabha Bagchi, Sohit Bansal. 434 [doi]
- From anarchy to geometric structuring: the power of virtual coordinatesAnne-Marie Kermarrec, Achour Mostéfaoui, Michel Raynal, Gilles Trédan, Aline Carneiro Viana. 435 [doi]
- Balancing energy consumption for uniform data gathering wireless sensor networksHaibo Zhang, Hong Shen, Yawen Chen, Zonghua Zhang. 436 [doi]
- Scheduling sensors by tilinglatticesAndreas Klappenecker, Hyunyoung Lee, Jennifer L. Welch. 437 [doi]
- Power management of devices: when should i switch off?Ajay Gulati. 438 [doi]
- Greedy distributed optimization of unsplittable multicommodity flowsBaruch Awerbuch, Rohit Khandekar. 439 [doi]
- Stateless distributed algorithms for near optimal maximum multicommodity flowsBaruch Awerbuch, Rohit Khandekar. 440 [doi]
- Distributed averaging in the presence of a sparse cutHariharan Narayanan. 441 [doi]
- Gossip-based aggregate computation: computing faster with non address-oblivious schemesRoberto Di Pietro, Pietro Michiardi. 442 [doi]
- Snap-stabilization in message-passing systemsSylvie Delaët, Stéphane Devismes, Mikhail Nesterenko, Sébastien Tixeuil. 443 [doi]
- Dynamic service assignment in mobile networks: the magma approachEdward Bortnikov, Israel Cidon, Idit Keidar. 444 [doi]
- Quantum distributed consensusLouis K. Helm. 445 [doi]
- Looking for the optimal conditions for solving set agreementFrançois Bonnet, Michel Raynal. 446 [doi]
- Tight RMR lower bounds for mutual exclusion and other problemsHagit Attiya, Danny Hendler, Philipp Woelfel. 447 [doi]
- Closing the complexity gap between mutual exclusion and FCFS mutual exclusionRobert Danek, Wojciech M. Golab. 448 [doi]
- Fault-tolerant implementations of atomic registers by safe registers in networksColette Johnen, Lisa Higham. 449 [doi]
- Optimal failure detection with low sporadic overhead and communication localityAlberto Lafuente, Mikel Larrea, Iratxe Soraluze Arriola, Roberto Cortiñas. 450 [doi]
- Optimizing consistency checking for memory-intensive transactionsJustin Emile Gottschlich, Daniel A. Connors. 451 [doi]
- Wait-free programming for general purpose computations on graphics processorsPhuong Hoai Ha, Philippas Tsigas, Otto J. Anshus. 452 [doi]
- Transactional memory retry mechanismsMichael F. Spear, Andrew Sveikauskas, Michael L. Scott. 453 [doi]
- Scheduling tasks with dependencies on asymmetric multiprocessorsIoannis Chatzigiannakis, Georgios Giannoulis, Paul G. Spirakis. 454 [doi]
- The lotus-eater attackIan A. Kash, Eric J. Friedman, Joseph Y. Halpern. 455 [doi]
- Extracting models from design documents with mapsterDavid James, Tim Leonard, John O Leary, Murali Talupur, Mark R. Tuttle. 456 [doi]
- Efficient single phase unconditionally secure message transmission with optimum communication complexityKannan Srinathan, Ashish Choudhary, Arpita Patra, C. Pandu Rangan. 457 [doi]
- Mobile proactive secret sharingDavid A. Schultz, Barbara Liskov, Moses Liskov. 458 [doi]
- Evolution of distributed computing theory: from concurrency to networks and beyondMichael J. Fischer. 460 [doi]
- A world of (Im) possibilitiesHagit Attiya, Jennifer L. Welch. 461 [doi]
- The power of simulation relationsRoberto Segala. 462 [doi]
- On fault tolerance and wireless networksSeth Gilbert. 463 [doi]
- The future of distributed computing: renaissance or reformation?Maurice Herlihy. 464 [doi]