7. STACS 1990: Rouen, France

• Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer:
  A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. 1-11
  
• Jean-Paul Allouche, Jeffrey Shallit:
  The Ring of k-Regular Sequences. 12-23
  
• Klaus Ambos-Spies, Steven Homer, Robert I. Soare:
  Minimal Pairs and Complete Problems. 24-36
  
• Donald Beaver, Joan Feigenbaum:
  Hiding Instances in Multioracle Queries. 37-48
  
• Richard Beigel, John Gill, Ulrich Hertrampf:
  Counting Classes: Thresholds, Parity, Mods, and Fewness. 49-57
  
• Jin-yi Cai, Anne Condon, Richard J. Lipton:
  Playing Games of Incomplete Information. 58-69
  
• Michal Chytil, Burkhard Monien:
  Caterpillars and Context-Free Languages. 70-81
  
• Mireille Clerbout, Yves Roos:
  Semi-Commutations and Algebraic Languages. 82-94
  
• Andrea Corradini, Ugo Montanari:
  Towards a Process Semantics in the Logic Programming Style. 95-108
  
• Maxime Crochemore, Wojciech Rytter:
  Parallel Computations on Strings and Arrays. 109-125
  
• Gautam Das, Deborah Joseph:
  Minimum Vertex Hulls for Polyhedral Domains. 126-137
  
• Volker Diekert:
  Combinatorial Rewriting on Traces. 138-151
  
• Deborah Joseph, Meera Sitharam:
  Kolmogorov Complexity, Restrited Nondeterminism and Generalized Spectra. 152-164
  
• Hans-Jörg Kreowski, Zhenyu Qian:
  Relation-Sorted Algebraic Specifications with Built-in Coercers: Basic Notions and Results. 165-175
  
• Miroslaw Kutylowski:
  Computational Power of One-Way Multihead Finite Automata. 176-187
  
• Tony W. Lai, Derick Wood:
  Updating Almost Complete Trees or One Level Makes All the Difference. 188-194
  
• Jean-Luc Lambert:
  Sorting the Sums (xi+yj) in O(n²) Comparisons. 195-206
  
• Richard J. Lipton:
  Efficient Checking of Computations. 207-215
  
• Luc Longpré, Alan L. Selman:
  Hard Promise Problems and Nonuniform Complexity. 216-226
  
• Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing:
  On the Construction of Abstract Voronoi Diagrams. 227-239
  
• Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl:
  Approximation of Convex Figures by Pairs of Rectangles. 240-249
  
• Andreas Schwill:
  Nonblocking Graphs: Greedy Algorithms to Compute Disjoint Paths. 250-262
  
• Wolfgang Thomas:
  Infinite Trees and Automaton Definable Relations over Omega-Words. 263-277
  
• Xavier Gérard Viennot:
  Enumerative Combinatorics and Computer Science. 278-284
  
• Walter Vogler:
  Failures Semantics Based on Interval Semiwords is a Congruence for Refinement. 285-297
  
• Mihalis Yannakakis:
  The Analysis of Local Search Problems and Their Heuristics. 298-311