PODC '97 agenda and technical program PODC '97 agenda and technical programPlease let me know, if you notice any errors or omissions, or if the link to your PODC paper is incorrect or missing.
All technical sessions, except the tutorials and the rump session, will be held in the multi-cultural center. Meals will be held in De La Guerra commons. Coffee breaks will be held on the Lagoon Plaza.
Internet Support for Wireless and Mobile Networking
Principles and Patterns of High-performance and Real-time Distributed Object Computing
Fault Tolerant Multi Party Computations: Past and Present
10:30
How to maintain authenticated communication in the presence of break-ins
10:55
Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation
11:20
Randomness vs. Fault-Tolerance
11:45
Relative Liveness and Behavior Abstraction
13:45
Specifying and Using a Partitionable Group Communication
Service
14:10
Dynamic Voting for Consistent Primary Components
14:35
Lazy Consistency Using Loosely Synchronized Clocks
15:00
How Useful is Old Information?
15:50
Computing Vector Functions on Anonymous Networks
16:00
A Technique for Partial Broadcasting in Networks
16:10
The Consensus Hierarchy is not Robust
16:20
Space-Optimal Wait-Free Queues
16:30
Leap Forward Virtual Clock
16:40
A Compiler Support for Decoupled Virtual Shared Memory Systems
16:50
Using Broadcast Primitives in Replicated databases
17:00
Competing against Specialists
17:10
Fault Tolerance Bounds for Memory Consistency
17:20
Failure Detectors in Omission Failure Environments
Verification Engineering: A Future Profession
10:30
Determining Consensus Numbers
10:55
On the power of shared object types to implement one-resilient consensus
11:20
Disentangling Multi-Object Operations
11:45
A Wait-Free Sorting Algorithm
14:00
On the Potential of FEC Algorithms in Building Fault-tolerant,
Distributed Applications to Support High QoS Video
Communications
14:25
Efficiency of Oblivious Versus Non-Oblivious Schedulers for
Optimistic, Rate-Based Flow Control
14:50
Time-Adaptive Self Stabilization
15:50
Local Stabilizer
16:00
Memory efficient, self-stabilizing algorithm to construct
BFS spanning trees
16:10
Trade-offs in fault-containing self-stabilization
16:20
On FTSS-Solvable Distributed Problems
16:30
Dynamic Hashing + Quorum = Efficient Location Management for
Mobile Computing Systems
16:40
An Algorithm for Message Delivery to Mobile Nodes
16:50
Wavelength Conversion in All-Optical Ring Networks
17:00
On the relation between bit delay for Slot Reuse
and the number of address
17:10
Automatic Verification of Liveness Properties of Randomized Systems
9:00
An Inherent Bottleneck in Distributed Counting
9:25
An Interval-Based Framework for Clock Rate Synchronization
9:50
The Complexity of Crash Failures
10:45
A Simple Algorithmically Reasoned Characterization of
Wait-Free Computation
11:10
Towards a Topological Characterization of Asynchronous Complexity
11:35
Efficient Asynchronous Consensus with the Weak Adversary
Scheduler
13:45
Practical Implementations of Non-Blocking Synchronization
Primitives
14:10
Implementing Wait-Free Objects on Priority-Based Systems
14:35
Collecting Cyclic Distributed Garbage Using Back Tracing
15:30
The load and availability of Byzantine quorum systems
15:55
Synchronous Byzantine Quorum Systems
16:20
Probabilistic quorum systems