STACS 90 : 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22 24, 1990 : proceedings
The Symposium on Theoretical Aspects of Computer Science is 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 Inform...
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
415 |
| Sujets: | |
| Accès en ligne: | Acce s sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 1990, proceedings, C. Choffrut, T. Lengauer [editors], Berlin, Springer-Verlag, 1990, 1 vol. (VI, 311 p.), Lecture notes in computer science, 0-387-52282-4 • STACS 90, Texte imprimé, 9783662191705 |
Table des matières:
- 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.