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

• Weighted closest pairs
  Michael Formann
  Lecture Notes in Computer Science 665, 1993, pp. 270-281
• 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
• 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
• 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
• 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
• Transparent (holographic) proofs
  László Babai
  Lecture Notes in Computer Science 665, 1993, pp. 525-534
• Circuits with monoidal gates (extended abstract)
  Martin Beaudry, Pierre McKenzie, Pierre Péladeau
  Lecture Notes in Computer Science 665, 1993, pp. 555-565
• A non-probabilistic switching lemma for the Sipser function
  Sorin Istrail, Dejan Zivkovic
  Lecture Notes in Computer Science 665, 1993, pp. 566-575
• Frontiers of feasible and probabilistic feasible boolean manipulation with branching programs
  Jordan Gergov, Christoph Meinel
  Lecture Notes in Computer Science 665, 1993, pp. 576-585
• Deterministic asynchronous automata for infinite traces (extended abstract)
  Volker Diekert, Anca Muscholl
  Lecture Notes in Computer Science 665, 1993, pp. 617-628
• Language learning with some negative information
  Ganesh Baliga, John Case, Sanjay Jain
  Lecture Notes in Computer Science 665, 1993, pp. 672-681
• Language learning with a bounded number of mind changes
  Steffen Lange, Thomas Zeugmann
  Lecture Notes in Computer Science 665, 1993, pp. 682-691
• Efficient sharing of many secrets
  Carlo Blundo, Alfredo de Santis, Ugo Vaccaro
  Lecture Notes in Computer Science 665, 1993, pp. 692-703
• The KIV system: A tool for formal program development
  Rainer Drexler, Wolfgang Reif, Gerhard Schellhorn, Kurt Stenzel, Werner Stephan, Andreas Wolpers
  Lecture Notes in Computer Science 665, 1993, pp. 704-705