Volume 44, Number 1, January 1997

• 
  Gary L. Miller, Shang-Hua Teng, William P. Thurston, Stephen A. Vavasis: Separators for sphere-packings and nearest neighbor graphs. 1-29
• 
  Serge Abiteboul, Moshe Y. Vardi, Victor Vianu: Fixpoint logics, relational machines, and computational complexity. 30-56
• 
  Shinichi Morishita: Avoiding Cartesian products for multiple joins. 57-85
• 
  Baruch Awerbuch, Leonard J. Schulman: The maintenance of common data in a distributed system. 86-103
• 
  Richard R. Koch, Frank Thomson Leighton, Bruce M. Maggs, Satish Rao, Arnold L. Rosenberg, Eric J. Schwabe: Work-preserving emulations of fixed-connection networks. 104-147
• 
  Alexander T. Ishii, Charles E. Leiserson, Marios C. Papaefthymiou: Optimizing two-phase, level-clocked circuitry. 148-199

Volume 44, Number 2, March 1997

• 
  Stefano Bistarelli, Ugo Montanari, Francesca Rossi: Semiring-based constraint satisfaction and optimization. 201-236
• 
  Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi: Two heads are better than two tapes. 237-256
• 
  Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum: Dynamic word problems. 257-271
• 
  Jan Van den Bussche, Dirk Van Gucht, Marc Andries, Marc Gyssens: On the completeness of object-creating database transformation languages. 272-319
• 
  Wolfgang Bibel, Elmar Eder: Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution. 320-344
• 
  Robert A. Wagner: Evaluating uniform expressions within two steps of minimum parallel time. 345-361

Volume 44, Number 3, May 1997

• 
  Joseph Y. Halpern: On becoming editor-in-chief of JACM. 363-365
• 
  Zhen Liu, Philippe Nain, Donald F. Towsley: Exponential bounds with applications to call admission. 366-394
• 
  Rolf H. Möhring, Matthias Müller-Hannemann, Karsten Weihe: Mesh refinement via bidirected flows: modeling, complexity, and computational results. 395-426
• 
  Nicolò Cesa-Bianchi, Yoav Freund, David Haussler, David P. Helmbold, Robert E. Schapire, Manfred K. Warmuth: How to use expert advice. 427-485
• 
  James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts: On-line routing of virtual circuits with applications to load balancing and machine scheduling. 486-504
• 
  R. C. Sekar, I. V. Ramakrishnan, Prateek Mishra: On the power and limitations of strictness analysis. 505-525

Volume 44, Number 4, July 1997

• 
  Peter Jeavons, David A. Cohen, Marc Gyssens: Closure properties of constraints. 527-548
• 
  Peter van Beek, Rina Dechter: Constraint tightness and looseness versus local and global consistency. 549-566
• 
  Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan: Approximating shortest paths on a convex polytope in three dimensions. 567-584
• 
  Mechthild Stoer, Frank Wagner: A simple min-cut algorithm. 585-591
• 
  Prasad Jayanti: Robust wait-free hierarchies. 592-614
• 
  Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler: Scale-sensitive dimensions, uniform convergence, and learnability. 615-631
• 
  Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi: Erratum: ``Two heads are better that two tapes''. 632

Volume 44, Number 5, September 1997

• 
  Ronen I. Brafman, Jean-Claude Latombe, Yoram Moses, Yoav Shoham: Applications of a logic of knowledge to motion planning under uncertainty. 633-668
• 
  David Eppstein, Zvi Galil, Giuseppe F. Italiano, Amnon Nissenzweig: Sparsification - a technique for speeding up dynamic graph algorithms. 669-696
• 
  Roni Khardon, Dan Roth: Learning to reason. 697-725
• 
  Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal: How much can hardware help routing? 726-741
• 
  Thomas H. Spencer: Time-work tradeoffs for parallel algorithms. 742-778

Volume 44, Number 6, November 1997

• 
  Cynthia Dwork, Maurice Herlihy, Orli Waarts: Contention in shared memory algorithms. 779-805
• 
  Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. 806-825
• 
  Hal Wasserman, Manuel Blum: Software reliability via run-time result-checking. 826-849
• 
  Manfred Broy: Compositional refinement of interactive systems. 850-891

last updated on Sun May 26 02:56:19 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page