Theoretical Computer Science, Volume 106

Volume 106, Number 1, 1992

• Gérard Boudol, Kim Guldstrand Larsen:
  Graphical Versus Logical Specifications. 3-20
  
• Jiazhen Cai, Robert Paige, Robert Endre Tarjan:
  More Efficient Bottom-Up Multi-Pattern Matching in Trees. 21-60
  
• Didier Caucal:
  On the Regular Structure of Prefix Rewriting. 61-86
  
• Emmanuel Kounalis:
  Testing for the Ground (Co-)Reducibility Property in Term-Rewriting Systems. 87-117
  
• Michael I. Schwartzbach:
  Interpretations of Recursively Defined Types. 119-134
  
• Helmut Seidl:
  Single-Valuedness of Tree Transducers is Decidable in Polynomial Time. 135-181
  

Volume 106, Number 2, 1992

• Christiane Frougny:
  Confluent Linear Numeration Systems. 183-219
  
• Pascal Michel:
  Complexity of Logical Theories Involving Coprimality. 221-241
  
• Muhammad El-Taha, Shaler Stidham Jr.:
  Deterministic Analysis of Queueing Systems with Heterogeneous Servers. 243-264
  
• Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber:
  Fast Geometric Approximation Techniques and Geometric Embedding Problems. 265-281
  
• Roland Hausser:
  Complexity in Left-Associative Grammar. 283-308
  
• Hans L. Bodlaender, Dieter Kratsch:
  The Complexity of Coloring Games on Perfect Graphs. 309-326
  
• J. M. Robson:
  More Languages of Generalised Star Height 1. 327-335
  
• Roger Villemaire:
  The Theory of (N, +, Vk, V1) is Undecidable. 337-349
  
• Carsten Damm, Christoph Meinel:
  Separating Complexity Classes Related to Omega-Decision Trees. 351-360
  
• Shou-Hsuan Stephen Huang, Hongfei Liu, Venkatraman Viswanathan:
  A Sublinear Parallel Algorithm for Some Dynamic Programming Problems. 361-371
  
• K. G. Subramanian, Rani Siromoney, Lisa Mathew:
  Lyndon Trees. 373-383
  
• Alexander A. Razborov:
  On the Distributional Complexity of Disjointness. 385-390
  
• Arne Andersson:
  Comments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint". 391-393
  
• Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
  Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter. 395-400
  

Last update Tue May 21 19:43:47 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page