7. STACS 1990: Rouen, France

Christian Choffrut, Thomas Lengauer (Eds.): STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings. Lecture Notes in Computer Science 415 Springer 1990, ISBN 3-540-52282-4 BibTeX

@proceedings{DBLP:conf/stacs/1990,
  editor    = {Christian Choffrut and
               Thomas Lengauer},
  title     = {STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer
               Science, Rouen, France, February 22-24, 1990, Proceedings},
  booktitle = {STACS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {415},
  year      = {1990},
  isbn      = {3-540-52282-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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