STACS 85 2nd Annual Symposium on Theoretical Aspects of Computer Science, Saarbrücken, January 3-5, 1985
| Other Authors: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1985, 1985
|
| Edition: | 1st ed. 1985 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- The volume of the union of many spheres and point inclusion problems
- Combined simplicity and immunity in relativized NP
- Groups, codes and unambiguous automata
- Reduced memory space for multi-dimensional search trees (extended abstract)
- On the relative complexity of subproblems of intractable problems
- On Lovász' lattice reduction and the nearest lattice point problem
- Layouts with wires of balanced length
- On the single-operation worst-case time complexity of the disjoint set union problem
- Deterministic languages and non-generators
- Simulation of large networks on smaller networks
- Petri nets and algebraic calculi of processes
- Non-deterministic two-tape automata are more powerful than deterministic ones
- Construction of a family of factorizing codes
- On hotz groups and homomorphic images of sentential form languages
- Using domain algebras to prove the correctness of a compiler
- Sorting and recognition problems for ordered sets
- Tree automata and logic programs
- Structure of relations satisfying certain families of dependencies
- A single source shortest path algorithm for a planar distributed network
- An algorithm for two-layer channel routing
- New algorithms for special cases of the hidden line elimination problem
- An algorithm to construct Minkowski-reduced lattice-bases
- Base Non Finie de Varietes
- Proximity on a grid
- An O(N1.5+?) expected time algorithm for canonization and isomorphism testing of trivalent graphs
- On the complexity of deadlock recovery
- On the planar monotone computation of threshold functions
- Planar circuits have short specifications
- Shortest paths on polyhedral surfaces
- Fairness in context Free grammars under canonical derivations
- Distributed termination in CSP symmetric solutions with minimal storage
- A dynamization of the All Pairs Least Cost Path Problem
- Boundedness, empty channel detection and synchronization for communicating finite state machines
- Deriving stack semantics congruent to standard denotational semantics
- Translatingpolygons in the plane
- Geometric containment is not reducible to Pareto dominance