16. PODC 1997: Santa Barbara, California, USA

• Shafi Goldwasser:
  Multi-Party Computations: Past and Present. 1-6
  
• Amir Pnueli:
  Verification Engineering: A Future Profession (A. M. Turing Award Lecture). 7
  
• David B. Johnson:
  Internet Support for Wireless and Mobile Networking. 9-10
  
• Douglas C. Schmidt:
  Principles and Patterns of High-Performance and Real-Time Distributed Object Computing. 11
  
• Ran Canetti, Shai Halevi, Amir Herzberg:
  Maintaining Authenticated Communication in the Presence of Break-ins. 15-24
  
• Martin Hirt, Ueli M. Maurer:
  Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract). 25-34
  
• Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
  Randomness vs. Fault-Tolerance. 35-44
  
• Ulrich Nitsche, Pierre Wolper:
  Relative Liveness and Behavior Abstraction (Extended Abstract). 45-52
  
• Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman:
  Specifying and Using a Partitionable Group Communication Service. 53-62
  
• Esti Yeger Lotem, Idit Keidar, Danny Dolev:
  Dynamic Voting for Consistent Primary Components. 63-71
  
• Atul Adya, Barbara Liskov:
  Lazy Consistency Using Loosely Synchronized Clocks. 73-82
  
• Michael Mitzenmacher:
  How Useful Is Old Information? (Extended Abstract). 83-91
  
• Eric Ruppert:
  Determining Consensus Numbers. 93-99
  
• Wai-Kau Lo, Vassos Hadzilacos:
  On the Power of Shared Object Types to Implement One-Resilient Consensus. 101-110
  
• Yehuda Afek, Michael Merritt, Gadi Taubenfeld, Dan Touitou:
  Disentangling Multi-Object Operations (Extended Abstract). 111-120
  
• Nir Shavit, Eli Upfal, Asaph Zemach:
  A Wait-Free Sorting Algorithm. 121-128
  
• Bernd E. Wolfinger:
  On the Potential of FEC Algorithms in Building Fault-Tolerant Distributed Applications to Support High QoS Video Communications. 129-138
  
• Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
  Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract). 139-148
  
• Shay Kutten, Boaz Patt-Shamir:
  Time-Adaptive Self Stabilization. 149-158
  
• Roger Wattenhofer, Peter Widmayer:
  An Inherent Bottleneck in Distributed Counting. 159-167
  
• Klaus Schossmaier:
  An Interval-Based Framework for Clock Rate Synchronization. 169-178
  
• Mahesh Jayaram, George Varghese:
  The Complexity of Crash Failures. 179-188
  
• Elizabeth Borowsky, Eli Gafni:
  A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract). 189-198
  
• Gunnar Hoest, Nir Shavit:
  Towards a Topological Characterization of Asynchronous Complexity (Preliminary Version). 199-208
  
• Yonatan Aumann:
  Efficient Asynchronous Consensus with the Weak Adversary Scheduler. 209-218
  
• Mark Moir:
  Practical Implementations of Non-Blocking Synchronization Primitives. 219-228
  
• James H. Anderson, Srikanth Ramamurthy, Rohit Jain:
  Implementing Wait-Free Objects on Priority-Based Systems. 229-238
  
• Umesh Maheshwari, Barbara Liskov:
  Collecting Distributed Garbage Cycles by Back Tracing. 239-248
  
• Dahlia Malkhi, Michael K. Reiter, Avishai Wool:
  The Load and Availability of Byzantine Quorum Systems. 249-257
  
• Rida A. Bazzi:
  Synchronous Byzantine Quorum Systems. 259-266
  
• Dahlia Malkhi, Michael K. Reiter, Rebecca N. Wright:
  Probabilistic Quorum Systems. 267-273
  
• Paolo Boldi, Sebastiano Vigna:
  Computing Vector Functions on Anonymous Networks. 277
  
• Gurdip Singh:
  A Technique for Partial Broadcasting in Networks (Abstract). 278
  
• Eric Schenk:
  The Consensus Hierarchy Is Not Robust. 279
  
• Ted Herman, Valeriu Damian-Iordache:
  Space-Optimal Wait-Free Queues. 280
  
• Subhash Suri, George Varghese, Girish P. Chandranmenon:
  Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness. 281
  
• He Zhu, Ian Watson:
  Compiler Support for Decoupled Virtual Shared Memory Systems. 282
  
• Ioana Stanoi, Divyakant Agrawal, Amr El Abbadi:
  Using Broadcast Primitives in Replicated Databases (Abstract). 283
  
• Piotr Berman, Juan A. Garay:
  Competing against Specialists. 284
  
• Jerry James, Ambuj K. Singh:
  Fault Tolerance Bounds for Memory Consistency. 285
  
• Danny Dolev, Roy Friedman, Idit Keidar, Dahlia Malkhi:
  Failure Detectors in Omission Failure Environments. 286
  
• Yehuda Afek, Shlomi Dolev:
  Local Stabilizer (Brief Announcement). 287
  
• Colette Johnen:
  Memory Efficient, Self-Stabilizing Algorithm to Construct BFS Spanning Trees. 288
  
• Sukumar Ghosh, Sriram V. Pemmaraju:
  Trade-offs in Fault-Containing Self-Stabilization. 289
  
• Joffroy Beauquier, Synnöve Kekkonen-Moneta:
  On FTSS-Solvable Distributed Problems. 290
  
• Ravi Prakash, Mukesh Singhal:
  Dynamic Hashing + Quorum = Efficient Location Management for Mobile Computing Systems. 291
  
• Amy L. Murphy, Gruia-Catalin Roman, George Varghese:
  An Algorithm for Message Delivery to Mobile Units. 292
  
• Ornan Ori Gerstel, Galen H. Sasaki, Shay Kutten, Rajiv Ramaswami:
  Dynamic Wavelength Allocation in Optical Networks. 293
  
• Oran Sharon:
  On the Relation between Bit Delay for Slot Reuse and the Number of Address Bits in the Dual Bus Configuration (Brief Announcement). 294
  
• Christel Baier, Marta Z. Kwiatkowska:
  Automatic Verification of Liveness Properties of Randomized Systems. 295
  

Last update Sat May 18 19:35:13 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page