![]() |
![]() |
Program
|
|
---|---|
(For PDF version of program: click here)Sunday, June 518:00 - 19:15 FCRC Plenary Session2010 ACM Turing Award Winner Leslie G. Valiant (Harvard University) Monday, June 608:00-09:00 Breakfast08:50-09:00 Opening09:00 - 10:00 Session 1 (Consensus and Agreement) chair: Pierre Fraigniaud
Coordinated Consensus in Dynamic Networks
Error-Free Multi-Valued Consensus with Byzantine Failures
Byzantine Agreement with Homonyms
10:00-10:20 Coffee Break10:20 - 11:20 Session 2 (Local Algorithms) chair: Michael Elkin
Distributed Coloring in Few Rounds
MIS on Trees
Toward more Localized Local Algorithms: Removing Assumptions
concerning Global Knowledge
11:30 - 12:30 FCRC Plenary SessionIBM's Watson/DeepQA David A. Ferrucci (IBM) 12:30 - 13:30 Lunch14:00 - 15:20 Session 3 (Reliable and Robust Algorithms) chair: Mark Moir
The Complexity of Robust Atomic Storage
Resilience of Mutual Exclusion Algorithms to Transient Memory Faults
Structuring Unreliable Radio Networks
The Impact of Memory Models on Software Reliability in Multiprocessors
15:30-16:00 Coffee Break16:00 - 17:00 Session 4 (Coherency and Concurrency) chair: Faith Ellen
On The Power of Hardware Transactional Memory to Simplify Memory Management
A Complexity Separation Between Cache-Coherent and Distributed Shared
Memory Models
From Bounded to Unbounded Concurrency Objects and Back
17:00-17:10 Break17:10 - 18:00 Session 5 (Best Papers) chair: Yehuda Afek
Best Student Paper:
Best Paper:
18:00 - 20:00 PODC Business MeetingTuesday, June 708:00-09:00 Breakfast09:00-10:00 Session 6 (Compact or Sparse Distributed Structures) chair: Amos Korman
Compact Policy Routing
Locally checkable proofs
Fault-Tolerant Spanners: Better and Simpler
10:00-10:20 Coffee Break10:20-11:20 Session 7 (Security and Consistency) chair: Dahlia Malkhi
Adaptively Secure Broadcast, Revisited
Scalable Rational Secret Sharing
Analyzing consistency properties for fun and profit
11:30 - 12:30 FCRC Plenary SessionAlgorithms: Recent Highlights and Challenges Ravi Kannan (Microsoft Research) 12:30-13:30 Lunch14:00-15:30 Session 8 (Brief Announcements) chair: Phillip Gibbons
Brief Announcement: Distributed k-Core Decomposition
Brief Announcement: Fork-Consistent Constructions From Registers
Brief Announcement: Tracking Distributed Aggregates over Time-based Sliding
Windows
Brief Announcement: Accurate Byzantine Agreement with Feedback
Brief Announcement: B-Neck: A Distributed and Quiescent Max-min Fair Algorithm
Brief Announcement: Time-Optimal Information Exchange on Multiple Channels
Brief Announcement: Robust Data Sharing with Key-Value Stores
Brief Announcement: Network Synchronization and Localization based on
Stolen Signals
Brief Announcement: Solvability of Regular Registers in Dynamic Distributed Systems
with Byzantine Processes
Brief Announcement: Easy Impossibility Proofs for k-Set Agreement in Message
Passing Systems
Brief Announcement: Solving the At-Most-Once Problem with Nearly Optimal
Effectiveness
15:30-16:00 Coffee Break16:00-17:00 Session 9 (Distributed Algorithms) chair: James Aspnes
Transforming Worst-case Optimal Solutions for Simultaneous Tasks into
All-case Optimal Solutions
Optimal-Time Adaptive Tight Renaming, with Applications to Counting
The Round Complexity of Distributed Sorting
17:00-17:10 Break17:10-18:10 Session 10 (Communication and Congestion) chair: Yoram Moses
A tight unconditional lower bound on distributed random walk computation
Minimum Congestion Mapping in a Cloud
Conflict on a Communication Channel
19:00-22:00 BanquetWednesday, June 808:00-09:00 Breakfast09:00-10:00 Session 11 (Brief Announcements) chair: Jared Saia
Brief Announcement: The Universe of Symmetry Breaking Tasks
Brief Announcement: Rationality Authority for Provable Rational Behavior
Brief Announcement: Secure Datastructures based on Multiparty Computation
Brief Announcement: Robust Network Supercomputing Without Centralized Control
Brief Announcement: On the Hardness and Approximation of Minimum Topic
Connected Overlay
Brief Announcement: A Generalization of Multiple Choice Balls-into-Bins
Brief Announcement: A Theory of Goal-Oriented Communication
10:00-10:20 Coffee Break10:20-11:20 Session 12 (Self-* Systems) chair: Boaz Patt-Shamir
Xheal: Localized Self-Healing Using Expanders
Fast and Compact Self-Stabilizing Verification, Computation, and Fault Detection
of an MST
Stability of a Peer-to-Peer Communication System
11:30-12:30 FCRC Plenary SessionWarehouse-Scale Computing: Entering the Teenage Decade Luiz Andre Barroso (Google) 12:30-13:30 Lunch14:00-15:30 Session 13 (Brief Announcements) chair: Pierre Fraigniaud
Brief Announcement: Scalability versus Semantics of Concurrent FIFO Queues
Brief Announcement: Distributed Computing with Rules of Thumb
Brief Announcement: Incentive-Compatible Distributed Greedy Protocols
Brief Announcement: Sustaining Collaboration in Multicast despite Rational Collusion
Brief Announcement: Reliable end-user communication under a changing packet
network protocol
Brief Announcement: Securing Social Networks
Brief Announcement: Parallel and distributed programming extensions for mainstream
languages based on pi-calculus primitives
Brief Announcement: A Nonblocking Set Optimized for Querying the Minimum Value Yujie Liu and Michael Spear.
Brief Announcement: Time Bounds for Shared Objects in Partially Synchronous
Systems
Brief Announcement: The Inherent Difficulty of Timely Primary-Backup Replication
Brief Announcement: Randomized Compact Routing in Decomposable Metrics
Brief Announcement: Partial Reversal Acyclicity
15:30-16:00 Coffee Break16:00-17:20 Session 14 (Information Dissemination) chair: Fabian Kuhn
Tight Bounds on Information Dissemination in Sparse Mobile Networks
Order Optimal Information Spreading Using Algebraic Gossip
Time-efficient randomized multiple-message broadcast in radio networks
Network Coding: Beating Token Forwarding Lower Bounds in Dynamic Networks
17:20-17:30 Closing17:30 End of Symposium |