PODC '95 agenda and technical program PODC '95 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.
Results by Algorithmic Reasoning
Fundamental challenges in mobile computing
10:20 Universal fault-local mending
10:45 Sub-linear distributed algorithms for sparse certificates and biconnected components
11:10 Faster computation on directed networks of automata
11:35 Distributed dynamic
channel allocation for mobile computing
2:00 A modular measure of competitiveness for distributed algorithms
2:10 Randomized competitive algorithms for admission control in general networks
2:20 Log-space polynomial end-to-end communication
2:30 SuperStabilizing protocols for dynamic distributed systems
2:40 Self-stabilizing clock synchronization in the presence of Byzantine faults
Securing the internet
3:00 The RAPID C++ environment
3:10 Architecture decisions for wide-area applications
3:20 A sequencing service for group communication
3:50
Collecting Cyclic Distributed Garbage Using Heuristics to Control Migration
This paper won the best student paper award
4:15 On distributed object checkpointing and recovery
4:40 On the
Relevance of Communication Costs of Rollback-Recovery Protocols
5:05 A
Framework for Protocol Composition in Horus
9:00 Algebraic spans
9:25 Failure detectors
and the wait-free hierarchy
9:50 More on t-resilience vs. wait-freedom
10:45 Crumbling walls: a class of practical and efficient quorum systems
11:10 Achieving independence
efficiently and securely
11:35
Lower Bounds for Convergence Function Based Clock
Synchronization
1:30 Prediction based task scheduling in distributed computing
1:40 Scheduling in client-server systems
1:50 Deriving optimal checkpoint protocols for distributed shared memory architectures
2:00 Active client primary-backup protocols
2:10 A
View-Based Approach to Relaxing Global Serializability in a Multidatabase System
2:20 Constraint-based structuring of distributed protocols
2:30 Generalizing fair reachability analysis to protocols with arbitrary topology
2:40 Compiling knowledge-based programs
2:50 A calculus for concurrent update
3:20 Reasoning about Meta Level
Activities in Open Distributed Systems
3:45 Knowledge-Based Programs
4:10 Formal semantics for expressing optimism: the meaning of HOPE
4:35 Formal verification of timed properties for randomized distributed algorithms
Atomicity and electronic commerce
10:20 Universal
Constructions for Multi-Object Operations
10:45 Long-lived renaming made fast
11:10
Software transactional memory
11:35 Lock-free linked lists using compare-and-swap
2:00 Lazy-writer multivalued registers
2:10 3-processor tasks are undecidable
2:20 Using Lock-Free Objects in Hard Real-Time Applications
2:30 Complete implementations for shared memory consistency conditions
2:40 Load balancing networks
2:50 A logarithmic depth counting network
3:20 Memory
requirement for universal routing schemes
3:45
Optimal distributed algorithm for minimum spanning trees revisited
4:10 Fast distributed construction of k-dominating sets and applications