International Journal of Foundations of Computer Science, Volume 4

Volume 4, Number 1, March 1993

• Jürgen Dassow, Gheorghe Paun, Arto Salomaa:
  Grammars Based on Patterns. 1-14
  
• Pierluigi Crescenzi, Riccardo Silvestri:
  Average Measure, Descriptive Complexity and Approximation of Maximization Problems. 15-30
  
• Wojciech Penczek:
  Temporal Logics for Trace Systems: On Automated Verification. 31-67
  
• Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
  Multidimensional Digital Searching and Some New Parameters in Tries. 69-84
  
• Alistair Moffat, Ola Petersson:
  Historical Searching. 85-98
  
• Stephen L. Bloom, Zoltán Ésik:
  Erratum: Iteration Algebras. 99
  

Volume 4, Number 2, June 1993

• Shin-Ichi Nakano, Takao Nishizeki:
  Scheduling File Transfers Under Port and Channe; Constraints. 101-115
  
• Iain A. Stewart:
  On Two Approximation Algorithms for the Clique Problem. 117-133
  
• Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang:
  On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages. 135-146
  
• Matthew Dickerson:
  General Polynomial Decomposition and the s-1-Decomposition are NP-Hard. 147-156
  
• Steffen Lange, Thomas Zeugmann:
  Learning Recursive Languages with Bounded Mind Changes. 157-178
  
• Krzysztof Diks, Oscar Garrido, Andrzej Lingas:
  Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings. 179-192
  

Volume 4, Number 3, September 1993

• Stephan Olariu, Iain A. Stewart:
  A New Characterization of Unbreakable Graphs. 193-196
  
• Fairouz Kamareddine, Rob Nederpelt:
  On Stepwise Explicit Substitution. 197-240
  
• Alexei Lisitsa:
  Complexity of Universal Circumscription. 241-244
  
• Lane A. Hemaspaandra, Sanjay Jain, Nikolai K. Vereshchagin:
  Banishing Robust Turing Completeness. 245-265
  
• B. F. Melnikov:
  The Equality Condition for Infinite Catenations of Two Sets of Finite Words. 267-274
  

Volume 4, Number 4, December 1993

• Klaus Jansen:
  Scheduling of Incompatible Jobs on Unrelated Machines. 275-291
  
• Heribert Vollmer, Klaus W. Wagner:
  The Complexity of Finding Middle Elements. 293-307
  
• Tony W. Lai, Derick Wood:
  A Top-Down Updating Algorithm for Weight-Balanced Trees. 309-324
  
• Antonios Symvonis, Spyros Tragoudas:
  Searching a Pseudo 3-Sided Solid Orthoconvex Grid. 325-353
  
• Millist W. Vincent, Bala Srinivasan:
  Redundancy and the Justification for Fourth Normal Form in Relational Databases. 355-365
  

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