Amazon cover image
Image from Amazon.com

STACS 90 : 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990 : proceedings / C. Choffrut, T. Lengauer (eds.).

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 415.Publication details: Berlin ; New York : Springer-Verlag, ©1990.Description: 1 online resource (vi, 311 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540469452
  • 3540469451
Subject(s): Genre/Form: Additional physical formats: Print version:: STACS 90.DDC classification:
  • 004 20
LOC classification:
  • QA75.5 .S958 1990
Other classification:
  • *00B25
  • 68-06
  • 28
Online resources:
Contents:
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.
Action note:
  • digitized 2011 HathiTrust Digital Library committed to preserve
Summary: 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

"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.

Online resource; title from PDF title page (SpringerLink, viewed September 4, 2013).

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.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2011. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2011 HathiTrust Digital Library committed to preserve pda MiAaHDL

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.

Powered by Koha