Volume 47, Number 1, August 1993

• 
  Ashok K. Chandra: Editor's Foreword: Selected Papers of PODS 1989. 1
• 
  Simona Rabinovici-Cohen, Ouri Wolfson: Why a Single Parallelization Strategy Is Not Enough in Knowledge Bases. 2-44
• 
  Theodore Johnson, Dennis Shasha: B-Trees with Inserts and Deletes: Why Free-at-Empty Is Better Than Merge-at-Half. 45-76
• 
  Michael Kifer, James Wu: A Logic Programming with Complex Objects. 77-120
• 
  Richard Hull, Jianwen Su: Algebraic and Calculus Query Languages for Recursively Typed Complex Objects. 121-156
• 
  William E. Weihl: The Impact of Recovery on Concurrency Control. 157-184
• 
  Allen Van Gelder: The Alternating Fixpoint of Logic Programs with Negation. 185-221
• 
  Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi: Logical Query Optimization by Proff-Tree Transformation. 222-248

Volume 47, Number 2, October 1993

• 
  Michael Luby: Removing Randomness in Parallel Computation without a Processor Penalty. 250-286
• 
  David A. McAllester, Prakash Panangaden, Vasant Shanbhogue: Nonexpressibility of Fairness and Signaling. 287-321
• 
  László Lovász, Michael E. Saks: Communication Complexity and Combinatorial Lattice Theory. 322-349
• 
  János Komlós, Ramamohan Paturi: Effect of Connectivity in an Associative Memory Model. 350-373

Volume 47, Number 3, December 1993

• 
  Johan Håstad, A. W. Schrift, Adi Shamir: The Discrete Logarithm Modulo a Composite Hides O(n) Bits. 376-404
• 
  Mario Szegedy: Functions with Bounded Symmetric Communication Complexity, Programs over Commutative Monoids, and ACC. 405-423
• 
  Michael L. Fredman, Dan E. Willard: Surpassing the Information Theoretic Bound with Fusion Trees. 424-436
• 
  Ketan Mulmuley: Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements. 437-458
• 
  Ming-Yang Kao, Philip N. Klein: Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs. 459-500
• 
  Robert Cypher, C. Greg Plaxton: Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. 501-548
• 
  Manuel Blum, Michael Luby, Ronitt Rubinfeld: Self-Testing/Correcting with Applications to Numerical Problems. 549-595

last updated on Sat May 18 06:21:36 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page