TY  - BOOK
AU  - Choffrut,Christian
AU  - Lengauer,T.
ED  - Annual Symposium on Theoretical Aspects of Computer Science
ED  - Association française pour la cybernétique économique et technique.
ED  - Gesellschaft für Informatik.
TI  - STACS 90: 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990 : proceedings 
T2  - Lecture notes in computer science,
SN  - 9783540469452
AV  - QA75.5 .S958 1990
U1  - 004 20
PY  - 1990///
CY  - Berlin, New York
PB  - Springer-Verlag
KW  - Computer science
KW  - Congresses
KW  - Informatique
KW  - Congrès
KW  - Ordinateurs
KW  - fast
KW  - Teoria da computacao
KW  - larpcal
KW  - ram
KW  - Conference papers and proceedings
N1  - "Organized jointly by the special interest group for Applied Mathematics of AFCET (Association française de cybernétique economique et technique), and the Special Interest Group for Theoretical Computer Sciences of GI (Gesellschaft für Informatik)"--Foreword; Includes bibliographical references and index; A note on the almost-everywhere hierarchy for nondeterministic time -- The ring of k-regular sequences -- Minimal pairs and complete problems -- Hiding instances in multioracle queries -- Counting classes: Thresholds, parity, mods, and fewness -- Playing games of incomplete information -- Caterpillars and context-free languages -- Semi-commutations and algebraic languages -- Towards a process semantics in the logic programming style -- Parallel computations on strings and arrays -- Minimum vertex hulls for polyhedral domains -- Combinatorial rewriting on traces -- Kolmogorov complexity, restricted nondeterminism and generalized spectra -- Relation-sorted algebraic specifications with built-in coercers: Basic notions and results -- Computational power of one-way multihead finite automata -- Updating almost complete trees or one level makes all the difference -- Sorting the sums (xi+yj) in O(n2) comparisons -- Efficient checking of computations -- Hard promise problems and nonuniform complexity -- On the construction of abstract voronoi diagrams -- Approximation of convex figures by pairs of rectangles -- Nonblocking graphs: Greedy algorithms to compute disjoint paths -- Infinite trees and automaton definable relations over?-words -- Enumerative Combinatorics and Computer Science -- Failures semantics based on interval semiwords is a congruence for refinement -- The analysis of local search problems and their heuristics; Electronic reproduction; [Place of publication not identified]; HathiTrust Digital Library; 2011
N2  - The Symposium on Theoretical Aspects of Computer Science is organized jointly by the Special Interest Group for Applied Mathematics of AFCET (Association Franaise de Cyberntique Economique et Technique) and the Special Interest Group for Theoretical Computer Sciences of GI (Gesellschaft fr Informatik). It is held alternately in France and in Germany. This volume contains two invited papers, on combinatorial methods in computer science, and on the complexity of local optimization, and 24 contributions on theoretical aspects of computer science. Some software systems are presented showing the possibilities of applying theoretical research to the realization of software tools
UR  - https://link.springer.com/10.1007/3-540-52282-4
ER  -