Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND YEAR=1985

• On Hotz groups and homomorphic images of sentential form languages
  Volker Diekert
  Lecture Notes in Computer Science 182, 1985, pp. 87-97
• Using domain algebras to prove the correctness of a compiler
  Peter Dybjer
  Lecture Notes in Computer Science 182, 1985, pp. 98-108
• Sorting and recognition problems for ordered sets
  Ulrich Faigle, György Turán
  Lecture Notes in Computer Science 182, 1985, pp. 109-118
• Tree automata and logic programs
  Gilberto Filé
  Lecture Notes in Computer Science 182, 1985, pp. 119-130
• Structure of relations satisfying certain families of dependencies
  P.C. Fischer, Dirk van Gucht
  Lecture Notes in Computer Science 182, 1985, pp. 131-142
• A single source shortest path algorithm for a planar distributed network
  Greg N. Frederickson
  Lecture Notes in Computer Science 182, 1985, pp. 143-150
• An algorithm for two-layer channel routing
  Shaodi Gao
  Lecture Notes in Computer Science 182, 1985, pp. 151-160
• New algorithms for special cases of the hidden line elimination problem
  Ralf Hartmut Güting, Thomas Ottmann
  Lecture Notes in Computer Science 182, 1985, pp. 161-172
• An algorithm to construct Minkowski-reduced lattice-bases
  Bettina Helfrich
  Lecture Notes in Computer Science 182, 1985, pp. 173-179
• Base non finie de variétés
  Christine Irastorza
  Lecture Notes in Computer Science 182, 1985, pp. 180-186
• Proximity on a grid
  Rolf G. Karlsson, J. Ian Munro
  Lecture Notes in Computer Science 182, 1985, pp. 187-196
• An O(N^{1.5+\varepsilon}) expected time algorithm for canonization and isomorphism testing of trivalent graphs
  Ludȇk Kuc̑era
  Lecture Notes in Computer Science 182, 1985, pp. 197-207
• On the complexity of deadlock recovery
  Joseph Y.-T. Leung, B. Monien
  Lecture Notes in Computer Science 182, 1985, pp. 208-218
• On the planar monotone computation of threshold functions
  W.F. McColl
  Lecture Notes in Computer Science 182, 1985, pp. 219-230
• Planar circuits have short specifications
  W.F. McColl
  Lecture Notes in Computer Science 182, 1985, pp. 231-242
• Shortest paths on polyhedral surfaces
  Joseph O'Rourke, Subhash Suri, Heather Booth
  Lecture Notes in Computer Science 182, 1985, pp. 243-254
• Fairness in context-free grammars under canonical derivations
  Sera Porat, Nissim Francez
  Lecture Notes in Computer Science 182, 1985, pp. 255-266
• Distributed termination in CSP: Symmetric solutions with minimal storage
  Jean-Luc Richier
  Lecture Notes in Computer Science 182, 1985, pp. 267-278
• A dynamization of the all pairs least cost path problem
  Hans Rohnert
  Lecture Notes in Computer Science 182, 1985, pp. 279-286
• Boundedness, empty channel detection and synchronization for communicating finite state machines
  Louis E. Rosier, Hsu-Chun Yen
  Lecture Notes in Computer Science 182, 1985, pp. 287-298
• Deriving stack semantics congruent to standard denotational semantics
  Véronique Royer
  Lecture Notes in Computer Science 182, 1985, pp. 299-309
• Translating polygons in the plane
  Jörg R. Sack, Godfried T. Toussaint
  Lecture Notes in Computer Science 182, 1985, pp. 310-321
• Geometric containment is not reducible to Pareto dominance
  N. Santoro, J.B. Sidney, S.J. Sidney, J.B. Urrutia
  Lecture Notes in Computer Science 182, 1985, pp. 322-327
• The volume of the union of many spheres and point inclusion problems
  Paul G. Spirakis
  Lecture Notes in Computer Science 182, 1985, pp. 328-338
• Combined simplicity and immunity in relativized NP
  Leen Torenvliet, Peter van Emde Boas
  Lecture Notes in Computer Science 182, 1985, pp. 339-350