



LEADER 
04779nmm a2200421 u 4500 
001 
EB000658426 
003 
EBX01000000000000000511508 
005 
00000000000000.0 
007 
cr 
008 
140122  eng 
020 


a 9783540481904

100 
1 

a Cori, Robert
e [editor]

245 
0 
0 
a STACS 88
h Elektronische Ressource
b 5th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 1113,1988; Proceedings
c edited by Robert Cori, Martin Wirsing

250 


a 1st ed. 1988

260 


a Berlin, Heidelberg
b Springer Berlin Heidelberg
c 1988, 1988

300 


a XII, 408 p
b online resource

505 
0 

a Geometry of numbers and integer programming  Getting back to the past in the unionfind problem  On the construction of optimal time adders  On computations with integer division  Maintaining range trees in secondary memory  Solving parametric problems on trees  On the kcolouring of circlegraphs  Functional equations for data structures  The power of polynomial size ?branching programs  Collapsing oracle hierarchies, census functions and logarithmically many queries  Domino games with an application to the complexity of boolean algebras with bounded quantifier alternations  An automatic speedup of random access machines with powerful arithmetic instructions  Characterizing the polynomial Hierarchy by alternating auxiliary pushdown automata  Hotzisomorphism theorems in formal language theory  Firstorder properties of trees, starfree expressions, and aperiodicity  Cyclic rational transductions and polynomials of rational functions 

505 
0 

a On the existence of the minimum asynchronous automaton and on decision problems for unambiguous regular trace languages  On morphisms of trace monoids  An automaton characterization of fairness in SCCS  A compositional semantics for Concurrent Prolog  Functions and relations: The graal system  LPC: A concurrent programming laboratory  Darwin: Computer algebra and enumerative combinatorics  Some tools for an inference laboratory (ATINF)  Modulog and the Modula workstation  The granules, glutton: An idea, an algorithm to implement on multiprocessor  Prototype de Venus: Un Outil d'Aide a la Verification de Systemes Communicantes  PLEXUS: A system for implementing hierarchical graph algorithms

505 
0 

a Construction of a family of finite maximal codes  Fonctions Generatrices Transcendantes a Coefficients Engendres par Automates  The relation of two patterns with comparable languages  Hierarchical contextual rewriting with several levels  Generalized bisimulation in relational specifications  On polynomial time graph grammars  An axiomatic definition of contextfree rewriting and its application to NLC graph grammars  Efficient distributed algorithms by using the archimedean time assumption  A simple protocol for secure circuit evaluation  Scheduling independent jobs on hypercubes  Voronoi diagrams based on general metrics in the plane  Geometric containment, common roots of polynomials and partial orders  Extension of the notion of map and subdivisions of a threedimensional space  An optimal algorithm fordetecting weak visibility of a polygon  Polygon placement under translation and rotation 

653 


a Microprogramming

653 


a Computer systems

653 


a Computer Science Logic and Foundations of Programming

653 


a Computer science

653 


a Computer System Implementation

653 


a Algorithms

653 


a Formal Languages and Automata Theory

653 


a Control Structures and Microprogramming

653 


a Machine theory

653 


a Discrete Mathematics

653 


a Discrete mathematics

700 
1 

a Wirsing, Martin
e [editor]

041 
0 
7 
a eng
2 ISO 6392

989 


b SBA
a Springer Book Archives 2004

490 
0 

a Lecture Notes in Computer Science

028 
5 
0 
a 10.1007/BFb0035825

856 
4 
0 
u https://doi.org/10.1007/BFb0035825?nosfx=y
x Verlag
3 Volltext

082 
0 

a 004.2

520 


a This volume contains the presentations of the Fifth Symposium on Theoretical Aspects of Computer Science (STACS 88) held at the University of Bordeaux, February 1113, 1988. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: algorithms, complexity, formal languages, rewriting systems and abstract data types, graph grammars, distributed algorithms, geometrical algorithms, trace languages, semantics of parallelism
