Brief Announcements at PODC 2011

Brief Announcements

Alberto Montresor, Francesco De Pellegrini and Daniele Miorandi.
Brief Announcement: Distributed k-Core Decomposition

Matthias Majuntke, Dan Dobre and Neeraj Suri.
Brief Announcement: Fork-Consistent Constructions From Registers

Antonio Fernandez Anta, Miguel A. Mosteiro and Jorge Ramón Muñoz.
Brief Announcement: Unbounded Contention Resolution in Multiple-Access Channels

Graham Cormode and Ke Yi.
Brief Announcement: Tracking Distributed Aggregates over Time-based Sliding Windows

Bharath Balasubramanian, John Bridgman and Vijay Garg.
Brief Announcement: Accurate Byzantine Agreement with Feedback

Alberto Mozo Velasco, José Luis López-Presa and Antonio Fernandez Anta.
Brief Announcement: B-Neck: A Distributed and Quiescent Max-min Fair Algorithm

Stephan Holzer, Yvonne Anne Pignolet, Jasmin Smula and Roger Wattenhofer.
Brief Announcement: Time-Optimal Information Exchange on Multiple Channels

Cristina Basescu, Christian Cachin, Ittay Eyal, Robert Haas and Marko Vukolić.
Brief Announcement: Robust Data Sharing with Key-Value Stores

Christian Schindelhauer, Zvi Lotker and Johannes Wendeberg.
Brief Announcement: Network Synchronization and Localization based on Stolen Signals

Roberto Baldoni, Silvia Bonomi and Amir Soltani Nezhad.
Brief Announcement: Regular Registers in Dynamic Distributed Systems with Byzantine Processes: Bounds and Performance Analysis

Martin Biely, Peter Robinson and Ulrich Schmid.
Brief Announcement: Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems

Sotirios Kentros and Aggelos Kiayias.
Brief Announcement: Solving the At-Most-Once Problem with Nearly Optimal Effectiveness

Damien Imbs, Sergio Rajsbaum and Michel Raynal.
Brief Announcement: The Universe of Symmetry Breaking Tasks

Shlomi Dolev, Panagiota N. Panagopoulou, Mikael Rabie, Elad Michael Schiller and Paul G. Spirakis.
Brief Announcement: Rationality Authority for Provable Rational Behavior

Tomas Toft.
Brief Announcement: Secure Datastructures based on Multiparty Computation

Seda Davtyan, Kishori Konwar and Alexander Shvartsman.
Brief Announcement: Robust Network Supercomputing Without Centralized Control

Monika Steinová
Brief Announcement: On the Hardness and Approximation of Minimum Topic-Connected Overlay

Gahyun Park.
Brief Announcement: A Generalization of Multiple Choice Balls-into-Bins

Oded Goldreich, Brendan Juba and Madhu Sudan.
Brief Announcement: A Theory of Goal-Oriented Communication

Hannes Payer, Harald Roeck, Christoph Kirsch and Ana Sokolova.
Brief Announcement: Scalability versus Semantics of Concurrent FIFO Queues

Aaron D. Jaggard, Michael Schapira and Rebecca Wright.
Brief Announcement: Distributed Computing with Rules of Thumb

Noam Nisan, Michael Schapira, Gregory Valiant and Aviv Zohar.
Brief Announcement: Incentive-Compatible Distributed Greedy Protocols

Haifeng Yu, Phillip Gibbons and Chenwei Shi.
Brief Announcement: Sustaining Collaboration in Multicast despite Rational Collusion

Brendan Juba.
Brief Announcement: Reliable end-user communication under a changing packet network protocol

Michael Backes, Matteo Maffei and Kim Pecina.
Brief Announcement: Securing Social Networks

Patrick Viry.
Brief Announcement: Parallel and distributed programming extensions for mainstream languages based on pi-calculus primitives

Yujie Liu and Michael Spear.
Brief Announcement: A Nonblocking Set Optimized for Querying the Minimum Value

Jiaqi Wang, Jennifer Welch and Hyunyoung Lee.
Brief Announcement: Time Bounds for Shared Objects in Partially Synchronous Systems

Pramod Koppol, Kedar Namjoshi, Thanos Stathopoulos and Gordon Wilfong.
Brief Announcement: The Inherent Difficulty of Timely Primary-Backup Replication

Goran Konjevod, Andrea Richa, Donglin Xia and Ling Zhou.
Brief Announcement: Randomized Compact Routing in Decomposable Metrics

Tsvetomira Radeva and Nancy Lynch.
Brief Announcement: Partial Reversal Acyclicity