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=665

• Parallel architectures: Design and efficient use
  B. Monien, R. Feldmann, R. Klasing, R. Lüling
  Lecture Notes in Computer Science 665, 1993, pp. 247-269
• Weighted closest pairs
  Michael Formann
  Lecture Notes in Computer Science 665, 1993, pp. 270-281
• Rectilinear path queries in a simple rectilinear polygon
  Sven Schuierer
  Lecture Notes in Computer Science 665, 1993, pp. 282-293
• Parallel algorithm for the matrix chain product and the optimal triangulation problems (extended abstract)
  Artur Czumaj
  Lecture Notes in Computer Science 665, 1993, pp. 294-305
• Multi-list ranking: complexity and applications
  Anders Dessmark, Andrzej Lingas, Anil Maheshwari
  Lecture Notes in Computer Science 665, 1993, pp. 306-316
• Exact algorithms for a geometric packing problem (extended abstract)
  L. Kuc̑era, K. Mehlhorn, B. Preis, E. Schwarzenecker
  Lecture Notes in Computer Science 665, 1993, pp. 317-322
• A decomposition theorem for probabilistic transition systems
  Oded Maler
  Lecture Notes in Computer Science 665, 1993, pp. 323-332
• Local automata and completion
  Rosa Montalbano
  Lecture Notes in Computer Science 665, 1993, pp. 333-342
• Efficient compression of wavelet coefficients for smooth and fractal-like data (extended abstract)
  Karel C̑ulik II, Simant Dube
  Lecture Notes in Computer Science 665, 1993, pp. 343-353
• On the equivalence of two-way pushdown automata and counter machines over bounded languages
  Oscar H. Ibarra, Tao Jiang, Nicholas Tran, Hui Wang
  Lecture Notes in Computer Science 665, 1993, pp. 354-364
• Computability properties of low-dimensional dynamical systems
  Michel Cosnard, Max Garzon, Pascal Koiran
  Lecture Notes in Computer Science 665, 1993, pp. 365-373
• Fixed-parameter intractability II (extended abstract)
  Karl A. Abrahamson, Rodney G. Downey, Michael R. Fellows
  Lecture Notes in Computer Science 665, 1993, pp. 374-385
• Limits on the power of parallel random access machines with weak forms of write conflict resolution
  Faith E. Fich, Russell Impagliazzo, Bruce Kapron, Valerie King, Mirosƚaw Kutyƚowski
  Lecture Notes in Computer Science 665, 1993, pp. 386-397
• On using oracles that compute values
  Stephen Fenner, Steve Homer, Mitsunori Ogiwara, Alan L. Selman
  Lecture Notes in Computer Science 665, 1993, pp. 398-407
• Multicounter automata with sublogarithmic reversal bounds
  Romain Gengler
  Lecture Notes in Computer Science 665, 1993, pp. 408-417
• Structured operational semantics for concurrency and hierarchy
  Andrew C. Uselton
  Lecture Notes in Computer Science 665, 1993, pp. 418-427
• The complexity of verifying functional programs
  Hardi Hungar
  Lecture Notes in Computer Science 665, 1993, pp. 428-439
• Towards the formal design of self-stabilizing distributed algorithms
  P.J.A. Lentfert, S.D. Swierstra
  Lecture Notes in Computer Science 665, 1993, pp. 440-451
• Axiomatizations of temporal logics on trace systems
  Wojciech Penczek
  Lecture Notes in Computer Science 665, 1993, pp. 452-462
• Capabilities and complexity of computations with integer division
  Katharina Lürwer-Brüggemeier, Friedhelm Meyer auf der Heide
  Lecture Notes in Computer Science 665, 1993, pp. 463-472
• Extended locally definable acceptance types (extended abstract)
  Rolf Niedermeier, Peter Rossmanith
  Lecture Notes in Computer Science 665, 1993, pp. 473-483
• Gap-definability as a closure property
  Stephen Fenner, Lance Fortnow, Lide Li
  Lecture Notes in Computer Science 665, 1993, pp. 484-493
• On the logical definability of some rational trace languages
  C. Choffrut, L. Guerra
  Lecture Notes in Computer Science 665, 1993, pp. 494-504
• Solving systems of set constraints using tree automata
  Rémi Gilleron, Sophie Tison, Marc Tommasi
  Lecture Notes in Computer Science 665, 1993, pp. 505-514
• Complement problems and tree automata in AC-like theories (extended abstract)
  D. Lugiez, J.L. Moysset
  Lecture Notes in Computer Science 665, 1993, pp. 515-524