%A H. Edelbrunner
%T Key-problems and key-methods in computational geometry
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 1-13

%A J. Berstel
%T Some recent results on squarefree words
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 14-25

%A E.R. Olderog
%A K.R. Apt
%T Transformations realizing fairness assumptions for parallel programs
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 26-42

%A B. Chazelle
%A R.L. Drysdale
%A O.T. Lee
%T Computing the largest empty rectangle
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 43-54

%A D.S. Hochbaum
%A W. Maass
%T Approximation sequences for covering and packing problems in robotics
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 55-62

%A C. Levcopoulos
%A A. Lingas
%T Covering polygons with minimum number of rectangles
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 63-72

%A B. Josko
%T On expressive interpretation of a Hoare-logic for Clarke's language L4
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 73-84

%A R. Drosten
%T Towards executable specifications using conditional axioms
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 85-96

%A H. Perdrix
%T Proprietes Church-Rosser de systemes de reecriture equationnels
ayant la propriete de terminaison faible
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 97-108

%A R. Kemp
%T On a general weight of trees
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 109-120

%A E. Shamir
%T From expanders to better superconcentrators without cascading
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 121-128

%A E.G. Belaga
%T Locally synchronous complexity in the light of the trans-box method
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 129-139

%A G. Winskel
%T A new definition of morphism on Petri nets
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 140-150

%A A. Finkel
%T Blocage et vivacite dans les reseaux a pile-file
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 151-162

%A M. Broy
%T Denonational semantics of concurrent programs with shared memory
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 163-173

%A A. Poigne
%T Higher order data structures - Cartesian closure versus lambda-calculus
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 174-185

%A G. Longo
%A S. Martini
%T Computability in higher types and the universal power domain Pomega
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 186-197

%A K. Ambos-Spies
%T On the structure of polynomial time degrees
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 198-208

%A O. Sykora
%A I. Vrto
%T Optimal layouts of the tree of meshes
with vertices on the perimeter of the bounding convex region
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 209-217

%A F. Meyer
%T Efficient simulations among several models of parallel computers
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 218-229

%A J.J. Pansoit
%T Bornes inferieures sur la complexite des facteurs des mots infinis
engendres par morphismes iteres
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 230-240

%A T. Head
%T Adherence equivalence is decidable for D0L languages
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 241-249

%A J. Gabarro
%T Pushdown space complexity and related ful-AFLs
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 250-259

%A J. Idt
%T Automates a pile sur des alphabets infinis
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 260-273

%A A. Mycroft
%T Logic programming and many-valued logic
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 274-286

%A M. Michel
%T Algebre de machines et logique temporalle
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 287-298

%A J. Rhodes
%T Algebraic and topological theory of languages and computation
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 299-304

%A J. Karhumaki
%T A property of three-element codes
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 305-313

%A K.P. Jantke
%T Polynomial time inference of general pattern languages
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 314-325

%A C. Choffrot
%A K. Culik
%T On extendibility of unavoidable sets
%J Proceedings of the Symposium
on Theoretical Aspects of Computer Science
%C Paris, France
%D April 1984
%E M. Fontet
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 166
by Springer-Verlag
%K stacs stacs1
%P 326-338

%A K. Ambos-Spies
%T On the relative complexity of subproblems of intractable problems
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 1-12

%A L. Babai
%T On Lovasz' lattice reduction and the nearest lattice fixpoint problem
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 13-20

%A B. Becker
%A H.G. Osthof
%T Layout with wires of balanced lenght
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 21-31

%A N. Blum
%T On the single-operation worst-case time complexity
of the disjoint set union problem
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 32-38

%A L. Boasson
%A A. Petit
%T Deterministic languages and noon-generators
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 39-46

%A H.L. Bodlaender
%A J. van\ Leeuwen
%T Simulation of large networks on smaller networks
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 47-58

%A G. Boudol
%A G. Roucairol
%A R. de\ Simone
%T Petri nets and algebraic calculi of processes
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 59-70

%A W. Brauer
%A K.-J. Lange
%T Non-deterministic two-tape automata are more powerful than deterministic ones
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 71-79

%A C. de\ Felice
%T Construction of a family of factorizing codes
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 80-86

%A V. Diekert
%T On Hotz groups and homomorphic images of sentential form languages
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 87-97

%A P. Dybjer
%T Using domain algebras to prove correctness of a compiler
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 98-108

%A U. Faigle
%A G. Turan
%T Sorting and recognition problems for ordered sets
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 109-118

%A G. File
%T Tree automata and logic programs
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 119-130

%A P.C. Fischr
%A D. van\ Gucht
%T Structure of relations satisfying certain families of dependencies
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 131-142

%A G.N. Frederickson
%T A single source shortest path algorithm for a planar distributed network
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 143-150

%A S. Gao
%T An algorithm for two-layer channel routing
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 151-160

%A R.H. Guting
%A Th. Ottman
%T New algorithms for special cases of the hidden line elimination problem
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 161-172

%A B. Helfrich
%T An algorithm to construct Minkowski-reduced lattice-bases
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 173-179

%A C. Irastorta
%T Base non finie de varietes
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 180-186

%A R.G. Karlsson
%A J.I. Munro
%T Proximity on a grid
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 187-196

%A L. Kucera
%T An O(N^1.5+epsilon) expected time algorithm
for canonization and isomorphism testing of trivalent graphs
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 197-207

%A J.Y.-T. Leung
%A B. Monien
%T On the complexity of deadlock recovery
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 208-218

%A W.F. McColl
%T On the planar monotone computation of threshold functions
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 219-230

%A W.F. McColl
%T Planar circuits have short specifications
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 231-242

%A J. O'Rourke
%A S. Suri
%A H. Booth
%T Shortest paths on polyhedral surfaces
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 243-254

%A S. Porat
%A N. Francez
%T Fairness in context-free grammars under canonical derivations
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 255-266

%A J.-L. Richier
%T Distributed termination in CSP: symmetric solutions with minimal storage
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 267-278

%A H. Rohnert
%T A dynamization of the all pairs least cost path problem
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 279-286

%A L.E. Rosier
%A H.-C. Yen
%T Bounded ness, empty channel detection and synchronization
for communicating finite state machines
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 287-298

%A V. Royer
%T Deriving stack semantics congruent to standard denotational semantics
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 299-309

%A J.-R. Sack
%A G.T. Toussaint
%T Translating polygons in the plane
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 310-321

%A N. Santoro
%A J.B. Sidney
%A S.J. Sidney
%A J.B. Urrutia
%T Geometric containment is not reducible to Pareto dominance
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 322-327

%A P.G. Spirakis
%T The volume of the union of many spheres and point inclusion problems
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 328-338

%A L. Torenvliet
%A P. van\ Emde\ Boas
%T Combined simplicity and immunity in relativized NP
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 339-350

%A P. Weil
%T Groupsm codes and unambiguous automata
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 351-362

%A D.E. Willard
%T Reduced memory space for multi-dimensional search trees
%J Proceedings of the Second Annual Symposium
on Theoretical Aspects of Computer Science
%C Saarbrucken, Germany
%D January 1985
%E K. Mehlhorn
%O published as Lecture Notes in Computer Science 182
by Springer-Verlag
%K stacs stacs2
%P 363-374

%A Flemming Nielson
%T Abstract interpretation of denotational definitions
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 1-20

%A E. Allen Emerson
%A Chin-Laung Lei
%T Temporal reasoning under generalized fairness constraints
(extended abstract)
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 21-36

%A D. Caucal
%T Decidabilite de l'egalite des langages algebriques inifinitaires simples
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 37-48

%A D. Frutos Escrig
%T Some probabilistic powerdomains in the category SFP
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 49-59

%A M.A. Nait Abdallah
%T Ions and local definitions in logic programming
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 60-72

%A Paul G. Spirakis
%T Input sensitive, optimal parallel randomized algorithms
for addition and identification
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 73-86

%A E.H.L. Aarts
%A F.M.J. Bont
%A J.H.A. Habers
%A P.J.M. van\ Laarhoven
%T A parallel statistical cooling algorithm
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 87-97

%A Andrzej Lingas
%T Subgraph isomorphism for biconnected outerplanar graphs in cubic time
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 98-103

%A J. hastad
%A B. Helfrich
%A J. Lagarias
%A C.P. Schnorr
%T Polynomial time algorithms for finding integer relations among real numbers
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 105-118

%A H.L. Bodlaender
%A J. van\ Leeuwen
%T New upperbounds for decentralized extrema-finding in a ring of processors
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 119-129

%A Roberto Tamassia
%A Ioannis G. Tollis
%T Algorithms for visibility representations of planar graphs
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 130-141

%A Friedhelm Meyer\ auf\ der\ Heide
%T Speeding up random access machines by few processors
(preliminary version)
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 142-152

%A Thomas Lengauer
%T Efficient algorithms for finding minimum spanning forests
of hierarchically defined graphs
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 153-170

%A Oscar H. Ibarra
%A B. Ravikumar
%T On sparseness, ambiguity and other decision problems
for acceptors and transducers
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 171-179

%A Jean-Pierre Pecuchet
%T Varietes de semigroupes et mots infinis
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 180-191

%A Christine Duboc
%T Equations in free partially commutative monoids
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 192-202

%A Ph. Darondeau
%T Separating and testing
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 203-212

%A C. Choffrot
%A M.P. Schutzenberger
%T Decomposition de fonctions rationelles
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 213-226

%A Ursula Schmidt
%T Long unavoidable patterns
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 227-235

%A Gilles Hernot
%A Michel Bidoit
%A Christine Choppy
%T Abstract implementations and correctness proofs
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 236-251

%A Udo Kelter
%T Strictness and serializability
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 252-261

%A B. Gamatie
%T Towards specification and proof of asynchronous systems
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 262-276

%A H.B. Hunt,\ III
%A R.E. Stearns
%T Monotone boolean formulas, distributive lattices, and the complexities of
logics, algebraic structures, and computation structures (preliminary report)
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 277-290

%A C.M.R. Kintala
%A Detlef Wotschke
%T Concurrent conciseness of degree,
probabilistic, nondeterministic and deterministic finite automata
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 291-305

%A Louis E. Rosier
%A Hsu-Chun Yen
%T Logspace hierarchies, polynomial time
and the complexity of fairness problems concerning omega-machines
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 306-320

%A Juris Hartmanis
%A Lane Hemachandra
%T On sparse oracles separating feasible complexity classes
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 321-333

%A Jose L. Balcazar
%A Ronald V. Book
%T On generalized Kolmogorov complexity
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 334-340

%A K. Mehlhorn
%A F.P. Preparata
%T Area-time optimal division for T = Omega((log n) ^ 1+epsilon)
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 341-352

%A A. Borodin
%A F. Fich
%A F. Meyer
%A F. Meyer\ auf\ der Heide
%A E. Upfal
%A A. Wigderson
%T A time-space tradeoff for element distinctness
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 353-358

%A K. Rudiger Reischuk
%T Parallel machines and their communication theoretical limits
%J Proceedings of the Third Annual Symposium
on Theoretical Aspects of Computer Science
%C Orsay, France
%D January 1986
%E B. Monien
%E G. Vidal-Naquet
%O published as Lecture Notes in Computer Science 210
by Springer-Verlag
%K stacs stacs3
%P 359-368