17. PODC 1998: Puerto Vallarta, Mexico

• George Varghese:
  Algorithmic Problems in Internet Research. 3-4
  
• David E. Culler:
  High Performance Clusters: State of the Art and Challenges Ahead. 5
  
• Udi Manber:
  How to Find It: Research Issues in Distributed Search (Abstract). 6
  
• Hector Garcia-Molina, Wilburt Labio, Janet L. Wiener, Yue Zhuge:
  Distributed and Parallel Computing Issues in Data Warehousing (Abstract). 7
  
• Tamar Eilam, Cyril Gavoille, David Peleg:
  Compact Routing Schemes with Low Stretch Factor (Extended Abstract). 11-20
  
• Girish P. Chandranmenon, George Varghese:
  Reconsidering Fragmentation and Reassembly. 21-29
  
• Amotz Bar-Noy, Yishay Mansour, Baruch Schieber:
  Competitive Dynamic Bandwidth Allocation. 31-39
  
• Leonidas Hadjimitsis, Marios Mavronicolas:
  Contention in Balancing Networks Resolved (Extended Abstract). 41-50
  
• Yuh-Jzer Joung:
  Asynchronous Group Mutual Exclusion (Extended Abstract). 51-60
  
• Nir Shavit, Asaph Zemach:
  Combining Funnels: A New Twist on an Old Tale... 61-70
  
• Stephen Menke, Mark Moir, Srikanth Ramamurthy:
  Synchronization Mechanisms for SCRAMNet+ Systems. 71-80
  
• Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén:
  Amortizing Randomness in Private Multiparty Computations. 81-90
  
• Giovanni Di Crescenzo, Yuval Ishai, Rafail Ostrovsky:
  Universal Service-Providers for Database Private Information Retrieval (Extended Abstract). 91-100
  
• Rosario Gennaro, Michael O. Rabin, Tal Rabin:
  Simplified VSS and Fact-Track Multiparty Computations with Applications to Threshold Cryptography. 101-111
  
• Birgit Pfitzmann, Matthias Schunter, Michael Waidner:
  Optimal Efficiency of Optimistic Contract Signing. 113-122
  
• Yoram Moses, Sergio Rajsbaum:
  The Unified Structure of Consensus: A Layered Analysis Approach. 123-132
  
• Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle:
  Unifying Synchronous and Asynchronous Message-Passing Models. 133-142
  
• Eli Gafni:
  Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract). 143-152
  
• Christof Fetzer:
  The Message Classification Model. 153-162
  
• Mark A. Smith:
  Reliable Message Delivery and Conditionally-Fast Transactions are not Possible Without Accurate Clocks. 163-171
  
• Anish Arora, Paul C. Attie, E. Allen Emerson:
  Synthesis of Fault-Tolerant Concurrent Programs. 173-182
  
• Prasad Jayanti:
  A Lower Bound on the Local Time Complexity of Universal Constructions. 183-192
  
• Ziv Bar-Joseph, Michael Ben-Or:
  A Tight Lower Bound for Randomized Synchronous Consensus. 193-199
  
• Prasad Jayanti:
  A Time Complexity Lower Bound for Randomized Implementations of Some Shared Objects. 201-210
  
• Eric Ruppert:
  Consensus Numbers of Multi-Objects. 211-217
  
• David E. Lowell, Peter M. Chen:
  Persistent Messages in Local Transactions. 219-226
  
• Roberto De Prisco, Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman:
  A Dynamic View-Oriented Group Communication Service. 227-236
  
• Gregory Chockler, N. Huleihel, Danny Dolev:
  An Adaptive Totally Ordered Multicast Protocol That Tolerates Partitions. 237-246
  
• Raju Pandey, J. Fritz Barnes, Ronald Ollsson:
  Supporting Quality of Service in HTTP Servers. 247-256
  
• Clay Shields, J. J. Garcia-Luna-Aceves:
  The Protocol for Hierarchical Multicast Routing. 257-266
  
• Randal C. Burns, Darrell D. E. Long:
  In-Place Reconstruction of Delta Compressed Files. 267-275
  
• Hagit Attiya, Arie Fouren:
  Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract). 277-286
  
• Tushar Deepak Chandra, Prasad Jayanti, King Tan:
  A Polylog Time Wait-Free Construction for Closed Objects. 287-296
  
• Jiong Yang, Gil Neiger, Eli Gafni:
  Structured Derivations of Consensus Algorithms for Failure Detectors. 297-306
  
• Paul S. LeMahieu, Jehoshua Bruck:
  A Consistent History Link Connectivity Protocol. 309
  
• Christos Papadopoulos, Guru M. Parulkar, George Varghese:
  An Error Control Scheme for Large-Scale Multicast Applications. 310
  
• Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis:
  The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. 311
  
• Marcel Waldvogel, George Varghese, Jonathan S. Turner, Bernhard Plattner:
  Scalable Best Matching Prefix Lookups. 312
  
• Israel Cidon, Shay Kutten, Ran Soffer:
  Optimal Allocation of Electronic Contect in Networks. 313
  
• Hagit Attiya:
  A Direct Lower Bound for k-Set Consensus. 314
  
• Assia Doudou, André Schiper:
  Muteness Detectors for Consensus with Byzantine Processes. 315
  
• Oleg M. Cheiner, Alexander A. Shvartsman:
  Implementing and Evaluating an Eventualy-Serializable Data Service. 317
  
• Joffroy Beauquier, Christophe Genolini, Shay Kutten:
  k-Stabilization of Reactive Tasks. 318
  
• Shay Kutten, Boaz Patt-Shamir:
  Asynchronous Time-Adaptive Self Stabilization. 319
  
• Yair Frankel, Philip D. MacKenzie, Moti Yung:
  Robust Efficient Distributed RSA-Key Generation. 320
  
• Dahlia Malkhi, Michael K. Reiter, Avishai Wool, Rebecca N. Wright:
  Probabilistic Byzantine Quorum Systems. 321
  
• Ajay D. Kshemkalyani:
  Efficient Evaluation of Causality Relations Between Nonatomic Events. 322
  
• Fernando Bellas, Ramón Juanes, Nieves Rodríguez, Ángel Viña:
  An Agent-Based Architecture for Buildiang CORBA Distributed Systems. 323
  
• Sumeer Bhola, Guruduth Banavar, Mustaque Ahamad:
  Responsiveness and Consistency Tradoffs in Interactive Groupware. 324
  
• Bertrand Ducourthial:
  Properties of the r-Operators to Insure Termination of Distributed Computatioons. 325