13. PODC 1994:
Los Angeles, California, USA
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing,
Los Angeles, California, USA, August 14-17, 1994. ACM, ISBN 0-89791-654-9
- Alan J. Demers:
Research Issues in Ubiquitous Computing.
2-8
- Inder S. Gopal:
Multimedia Networking: Applications and Challenges.
9-12
- John H. Howard, Shmuel Katz:
Reconciliations.
14-21
- Robert Cypher, Eric Leu:
Repeatable and Portable Message-Passing Programs.
22-31
- Martha J. Kosa:
Making Operations of Concurrent Data Types Fast.
32-41
- Yehuda Afek, Gideon Stupp:
Delimiting the Power of Bounded Size Synchronization Objects (Extended Abstract).
42-51
- Hagit Brit, Shlomo Moran:
Wait-Freedom vs. Bounded Wait-Freedom in Public Data Structures (Extended Abstract).
52-60
- Rajeev Alur, Gadi Taubenfeld:
Contention-free Complexity of Shared Memory Algorithms.
61-70
- Lily B. Mummert, Jeannette M. Wing, Mahadev Satyanarayanan:
Using Belief to Reason about Cache Coherence.
71-80
- Martín Abadi, Leslie Lamport:
Open Systems in TLA.
81-90
- Hsien-Kuang Chiou, Willard Korfhage:
ENF Event Predicate Detection in Distributed Systems.
91-100
- Divyakant Agrawal, Manhoi Choy, Hong Va Leong, Ambuj K. Singh:
Mixed Consistency: A Model for Parallel Programming (Extended Abstract).
101-110
- Ashwani Gahlot, Mohan Ahuja, Timothy Carlson:
Global Flush Communication Primitive for Inter-process Communication.
111-120
- Nuno Neves, Miguel Castro, Paulo Guedes:
A Checkpoint Protocol for an Entry Consistent Shared Memory System.
121-129
- Anthony LaMarca:
A Performance Evaluation of Lock-Free Synchronization Protocols.
130-140
- James H. Anderson, Mark Moir:
Using k-Exclusion to Implement Resilient, Scalable Shared Objects (Extended Abstract).
141-150
- Amos Israeli, Lihu Rappoport:
Disjoint-Access-Parallel Implementations of Strong Shared Memory Primitives.
151-160
- Roberto De Prisco, Alain J. Mayer, Moti Yung:
Time-Optimal Message-Efficient Work Performance in the Presence of Faults (Extended Summary).
161-172
- Benny Chor, Lee-Bath Nelson:
Resilience of General Interactive Tasks.
173-182
- Michael Ben-Or, Boaz Kelmer, Tal Rabin:
Asynchronous Secure Computations with Optimal Resilience (Extended Abstract).
183-192
- William Aiello, Ramarathnam Venkatesan, Moti Yung:
Coins, Weights and Contention in Balancing Networks.
193-205
- Costas Busch, Marios Mavronicolas:
A Combinatorial Treatment of Balancing Networks.
206-215
- Pierre Fraigniaud, Cyril Gavoille:
A Characterization of Networks Supporting Linear Interval Routing.
216-224
- Amir Ben-Dor, Shai Halevi, Assaf Schuster:
Potential Function Analysis of Greedy Hot-Potato Routing.
225-234
- Ornan Ori Gerstel, Shmuel Zaks:
The Virtual Path Layout Problem in Fast Networks (Extended Abstract).
235-243
- George Varghese:
Self-Stabilization by Counter Flushing.
244-253
- Baruch Awerbuch, Rafail Ostrovsky:
Memory-Efficient and Self-Stabilizing Network {RESET} (Extended Abstract).
254-263
- Jeffery Westbrook, Lenore D. Zuck:
Adaptive Algorithms for PASO Systems.
264-273
- Dalia Malki, Kenneth P. Birman, Aleta Ricciardi, André Schiper:
Uniform Actions in Asynchronous Distributed Systems (Extended Abstract).
274-283
- Danny Dolev, Rüdiger Reischuk, H. Raymond Strong:
Observable Clock Synchronization (Extended Abstract).
284-293
- Yoram Moses, Ben Bloom:
Knowledge, Timed Precedence and Clocks (Preliminary Report).
294-303
- John M. Rushby:
A Formally Verifiable Algorithm for Clock Synchronization under a Hybrid Fault Model.
304-313
- Nancy A. Lynch, Isaac Saias, Roberto Segala:
Proving Time Bounds for Randomized Distributed Algorithms.
314-323
- Maurice Herlihy, Sergio Rajsbaum:
Set Consensus Using Arbitrary Objects (Preliminary Version).
324-333
- Tushar Deepak Chandra, Vassos Hadzilacos, Prasad Jayanti, Sam Toueg:
Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies.
334-343
- Rida A. Bazzi, Gary L. Peterson:
A Gap Theorem for Consensus Types (Extended Abstract).
344-353
- Rida A. Bazzi, Gary L. Peterson:
On the Use of Registers in Achieving Wait-Free Consensus.
354-362
- Elizabeth Borowsky, Eli Gafni, Yehuda Afek:
Consensus Power Makes (Some) Sense! (Extended Abstract).
363-372
- Mehmet Hakan Karaata, Sriram V. Pemmaraju, Steven C. Bruell, Sukumar Ghosh:
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees.
374
- Gurdip Singh:
Leader Election in the Presence of Link Failures (Abstract).
375
- Jeffery C. Line, Sukumar Ghosh:
Stabilizing Algorithms for Diagnosing Crash Failures.
376
- Claude Jard, Guy-Vincent Jourdan:
On the Coding of Dependencies in Distributed Computations (Abstract).
377
- Joffroy Beauquier, Sylvie Delaët:
Probabilistic Self-Stabilizing Mutual Exclusion in Uniform Rings.
378
- Marios Mavronicolas:
The Impact of Synchronization on the Session Problem.
379
- Injong Rhee:
A Fault-Tolerant Dynamic Resource Allocation Algorithm (Short Abstract).
380
- Nobuhisa Fujinami:
Implementation of Authenticated Communication Based on Hierarchy-Relative Naming Scheme.
381
- Philippe Quéinnec, Gérard Padiou:
Derivation of Fault Tolerance Properties of Distributed Algorithms.
382
- Matthias Radestock, Susan Eisenbach:
Towards a Minimal Object-Oriented Language for Distributed and Concurrent Programming.
383
- Béat Hirsbrunner, Marc Aguilar, Oliver Krone:
CoLa: A Coordination Language for Massive Parallelism.
384
- Seung Ho Cho, Sang-Yong Han:
Dynamic Load Sharing Algorithm with a Weighted Load Representation.
385
- Alessandro Genco, Giuseppe Lo Re:
A Recognize-and-Accuse Policy to Speed up Distributed Processes.
386
- Martin Adelantado, Frédéric Boniol:
Controlling Real-Time Asynchronous Tasks with ESTEREL Synchronous Language.
387
- Howard Bowman, John Derrick:
Consistency and Conformance in ODP (Abstract).
388
- Sakari Rahkila, Susanne Stenberg:
XMP++: An Object-Oriented Solution for Hiding the Complexity of Network Management Protocols.
389
- Hacène Fouchal, Ana R. Cavalli:
A Compositional Verification Method for LOTOS.
390
- Kaisa Sere, Marina A. Waldén:
Verification of a Distributed Algorithm (Abstract).
391
- Paul Curzon:
The Formal Verification of an ATM Network.
392
- Ulrich Nitsche:
A Verification Method Based on Homomorphic Model Abstractions (Abstract).
393
- Howard Bowman, John Derrick, Richard E. Jones:
Modelling Garbage Collection Algorithms Using CCS and Temporal Logic (Abstract).
394
- Sen Yoshida, Atsushi Togashi, Norio Shiratori:
Integrated Support Environment for Concurrent Process Calculi.
395
- Gil Neiger:
Set-Linearizability.
396
- David C. Steere, Mahadev Satyanarayanan, Jeannette M. Wing:
Dynamic Sets for Search.
397
- Miklós Ajtai, James Aspnes, Cynthia Dwork, Orli Waarts:
Competitiveness in Distributed Algorithms.
398
- Laura S. Sabel, Keith Marzullo:
Simulating Fail-Stop in Asynchronous Distributed Systems.
399
- Jehoshua Bruck, Danny Dolev, Ching-Tien Ho, Rimon Orni, H. Raymond Strong:
PCODE: Efficient Parallel Computing over Distributed Environments.
400
- Lior Shabtay, Adrian Segall:
On the Memory Overhead of Distributed Snapshots.
401
- Sudhanshu Aggarwal, Juan A. Garay, Amir Herzberg:
Adaptive Video on Demand.
402
- Paul G. Spirakis, Basil Tampakas:
Distributed Pursuit-Evasion: Some Aspects of Privacy and Security in Distributed Computing.
403
- Costas Busch, Nikos Hardavellas, Marios Mavronicolas:
Contention in Counting Networks.
404
Copyright © Sun Nov 8 02:56:42 2009
by Michael Ley (ley@uni-trier.de)
