2. STACS 1985:
Saarbrücken,
Germany
Kurt Mehlhorn (Ed.):
STACS 85, 2nd Symposium of Theoretical Aspects of Computer Science, Saarbrücken, Germany, January 3-5, 1985, Proceedings.
Lecture Notes in Computer Science 182 Springer 1985, ISBN 3-540-13912-5 BibTeX
@proceedings{DBLP:conf/stacs/1985,
editor = {Kurt Mehlhorn},
title = {STACS 85, 2nd Symposium of Theoretical Aspects of Computer Science,
Saarbr{\"u}cken, Germany, January 3-5, 1985, Proceedings},
booktitle = {STACS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {182},
year = {1985},
isbn = {3-540-13912-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Klaus Ambos-Spies:
On the Relative Complexity of Subproblems of Intractable Problems.
1-12 BibTeX
- László Babai:
On Lovász' Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version).
13-20 BibTeX
- Bernd Becker, Hans-Georg Osthof:
Layouts with Wires of Balanced Length.
21-31 BibTeX
- Norbert Blum:
On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union Problem.
32-38 BibTeX
- Luc Boasson, Antoine Petit:
Deterministic Languages and Non-Generators.
39-46 BibTeX
- Hans L. Bodlaender, Jan van Leeuwen:
Simulation of Large Networks on Smaller Networks.
47-58 BibTeX
- Gérard Boudol, Gérard Roucairol, Robert de Simone:
Petri Nets and Algebraic Calculi of Processes.
59-70 BibTeX
- Wilfried Brauer, Klaus-Jörn Lange:
Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones.
71-79 BibTeX
- Clelia de Felice:
Construction of a Family of Factorizing Codes.
80-86 BibTeX
- Volker Diekert:
On Hotz Groups and Homomorphic Images of Sentential Form Languages.
87-97 BibTeX
- Peter Dybjer:
Using Domain Algebras to Prove the Correctness of a Compiler.
98-108 BibTeX
- Ulrich Faigle, György Turán:
Sorting and Recognition Problems for Ordered Sets.
109-118 BibTeX
- Gilberto Filé:
Tree Automata and Logic Programs.
119-130 BibTeX
- Patrick C. Fischer, Dirk Van Gucht:
Structure of Relations Satisfying Certain Families of Dependencies.
131-142 BibTeX
- Greg N. Frederickson:
A Single Source Shortest Path Algorithm for a Planar Distributed Network.
143-150 BibTeX
- Shaodi Gao:
An Algorithm for Two-Layer Channel Routing.
151-160 BibTeX
- Ralf Hartmut Güting, Thomas Ottmann:
New Algorithms for Special Cases of the Hidden Line Elimination Problem.
161-172 BibTeX
- Bettina Helfrich:
An Algorithm to Construct Minkowski-Reduced Lattice-Bases.
173-179 BibTeX
- Christine Irastorza:
Base non finie de varietes.
180-186 BibTeX
- Rolf G. Karlsson, J. Ian Munro:
Proximity of a Grid.
187-196 BibTeX
- Ludek Kucera:
An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs.
197-207 BibTeX
- Joseph Y.-T. Leung, Burkhard Monien:
On the Complexity of Deadlock Recovery.
208-218 BibTeX
- William F. McColl:
On the Planar Monotone Computation of Threshold Functions.
219-230 BibTeX
- William F. McColl:
Planar Circuits Have Short Specifications.
231-242 BibTeX
- Joseph O'Rourke, Subhash Suri, Heather Booth:
Shortest Paths on Polyhedral Surfaces.
243-254 BibTeX
- Sara Porat, Nissim Francez:
Fairness in Context-Free Grammars under Canonical Derivations.
255-266 BibTeX
- Jean-Luc Richier:
Distributed Termination in CSP: Symmetric Solutions with Minimal Storage.
267-278 BibTeX
- Hans Rohnert:
A Dynamization of the All Pairs Least Cost Path Problem.
279-286 BibTeX
- Louis E. Rosier, Hsu-Chun Yen:
Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines.
287-298 BibTeX
- Véronique Royer:
Deriving Stack Semantics Congruent to Standard Denotational Semantics.
299-309 BibTeX
- Jörg-Rüdiger Sack, Godfried T. Toussaint:
Translating Polygons in the Plane.
310-321 BibTeX
- Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia:
Geometric Containment is not Reducible to Pareto Dominance.
322-327 BibTeX
- Paul G. Spirakis:
The Volume of the Union of Many Sheres and Point Inclusion Problems.
328-338 BibTeX
- Leen Torenvliet, Peter van Emde Boas:
Combined Simplicity and Immunity in Relativized NP.
339-350 BibTeX
- Pascal Weil:
Groups, Codes and Unambiguous Automata.
351-362 BibTeX
- Dan E. Willard:
Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract).
363-374 BibTeX
Copyright © Sat May 16 23:43:04 2009
by Michael Ley (ley@uni-trier.de)
