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 Volume=182

• On the relative complexity of subproblems of intractable problems
  Klaus Ambos-Spies
  Lecture Notes in Computer Science 182, 1985, pp. 1-12
• On Lovász' lattice reduction and the nearest lattice point problem
  László Babai
  Lecture Notes in Computer Science 182, 1985, pp. 13-20
• Layouts with wires of balanced length
  B. Becker, H.G. Osthof
  Lecture Notes in Computer Science 182, 1985, pp. 21-31
• On the single-operation worst-case time complexity of the disjoint set union problem
  Norbert Blum
  Lecture Notes in Computer Science 182, 1985, pp. 32-38
• Deterministic languages and non-generators
  L. Boasson, A. Petit
  Lecture Notes in Computer Science 182, 1985, pp. 39-46
• Simulation of large networks on smaller networks
  H.L. Bodlaender, J. van Leeuwen
  Lecture Notes in Computer Science 182, 1985, pp. 47-58
• Petri nets and algebraic calculi of processes
  Gérard Boudol, Gérard Roucairol, Robert de Simone
  Lecture Notes in Computer Science 182, 1985, pp. 59-70
• Non-deterministic two-tape automata are more powerful than deterministic ones
  W. Brauer, K.-J. Lange
  Lecture Notes in Computer Science 182, 1985, pp. 71-79
• Construction of a family of factorizing codes
  Clelia de Felice
  Lecture Notes in Computer Science 182, 1985, pp. 80-86
• 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