Vor Ort
Merkzettel Warenkorb
  • Produktbild: STACS 88
  • Produktbild: STACS 88
Band 294

STACS 88 5th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 11-13,1988; Proceedings

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

27.01.1988

Abbildungen

XII, 408 p.

Herausgeber

Robert Cori + weitere

Verlag

Springer Berlin

Seitenzahl

408

Maße (L/B/H)

23,5/15,5/2,3 cm

Gewicht

633 g

Auflage

1988

Sprache

Englisch

ISBN

978-3-540-18834-6

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

27.01.1988

Abbildungen

XII, 408 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

408

Maße (L/B/H)

23,5/15,5/2,3 cm

Gewicht

633 g

Auflage

1988

Sprache

Englisch

ISBN

978-3-540-18834-6

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: STACS 88
  • Produktbild: STACS 88
  • Geometry of numbers and integer programming.- Getting back to the past in the union-find 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 k-colouring of circle-graphs.- 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 speed-up of random access machines with powerful arithmetic instructions.- Characterizing the polynomial Hierarchy by alternating auxiliary pushdown automata.- Hotz-isomorphism theorems in formal language theory.- First-order properties of trees, star-free expressions, and aperiodicity.- Cyclic rational transductions and polynomials of rational functions.- 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 context-free 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 three-dimensional space.- An optimal algorithm fordetecting weak visibility of a polygon.- Polygon placement under translation and rotation.- 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.