Theoretical Computer Science, Volume 181

Volume 181, Number 1, 15 July 1997

• Ricardo A. Baeza-Yates, Eric Goles Ch.:
  Preface to the Special Issue on the 1995 Latin American Theoretical Informatics Symposium. 1-2
  
• Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer:
  Space-Filling Curves and Their Use in the Design of Geometric Data Structures. 3-15
  
• Véronique Bruyère, Georges Hansel:
  Bertrand Numeration Systems and Recognizability. 17-43
  
• Shiva Chaudhuri, Devdatt P. Dubhashi:
  Probabilistic Recurrence Relations Revisited. 45-56
  
• David Fernández-Baca, Giora Slutzki:
  Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs. 57-74
  
• Esteban Feuerstein:
  Paging More than One Page. 75-90
  
• Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello:
  On Edge-Colouring Indifference Graphs. 91-106
  
• Giulia Galbiati, Angelo Morzenti, Francesco Maffioli:
  On the Approximability of Some Maximum Spanning Tree Problems. 107-118
  
• William I. Gasarch, Katia S. Guimarães:
  Binary Search and Recursive Graph Problems. 119-139
  
• Christian Herzog:
  Pushdown Automata with Bounded Nondeterminism and Bounded Ambiguity. 141-157
  
• Daniel P. Lopresti, Andrew Tomkins:
  Block Edit Models for Approximate String Matching. 159-179
  
• Helmut Prodinger:
  On a Problem of Yekutieli and Mandelbrot about the Bifurcation Ratio of Binary Trees. 181-194
  
• Farn Wang:
  A Temporal Logic for Real-Time Partial Ordering with Named Transactions. 195-225
  

Volume 181, Number 2, 30 July 1997

• Ding-Zhu Du, Ming Li:
  Foreword (COCOON'95). 227
  
• Jay Belanger, Jie Wang:
  No NP Problems Averaging Over Ranking of Distributions are Harder. 229-245
  
• Jianer Chen:
  Algorithmic Graph Embeddings. 247-266
  
• Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán:
  Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. 267-287
  
• Kojiro Kobayashi:
  Transformations that Preserve Malignness of Universal Distributions. 289-306
  
• Andrzej Lingas:
  Maximum Tree-Packing in Time O(n^5/2). 307-316
  
• Kouichi Sakurai:
  Practical Proofs of Knowledge without Relying on Theoretical Proofs of Membership on Languages. 317-335
  
• John Tromp, Louxin Zhang, Ying Zhao:
  Small Weight Bases for Hamming Codes. 337-345
  
• Peng-Jun Wan, Qifan Yang, Dean Kelley:
  A 3/2 log 3-Competitive Algorithm for the Counterfeit Coin Problem. 347-356
  
• Xiangdong Yu, Moti Yung:
  Scheduling Task-Trees with Additive Scales on Parallel/Distributed Machines. 357-378
  
• Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz:
  Compact Location Problems. 379-404