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 [1]	Hilfe

Suche: Series=LNCS AND Volume=665

• Transparent (holographic) proofs
  László Babai
  Lecture Notes in Computer Science 665, 1993, pp. 525-534
• Computing symmetric functions with AND/OR circuits and a single MAJORITY gate
  Zhi-Li Zhang, David A. Mix Barrington, Jun Tarui
  Lecture Notes in Computer Science 665, 1993, pp. 535-544
• Threshold circuits for iterated multiplication: Using \mbox{AC}^0 for free
  Alexis Maciel, Denis Thérien
  Lecture Notes in Computer Science 665, 1993, pp. 545-554
• 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
• On syntactic congruences for \omega-languages
  Oded Maler, Ludwig Staiger
  Lecture Notes in Computer Science 665, 1993, pp. 586-594
• A polynomial time algorithm for the equivalence of two morphisms on \omega-regular languages
  Stefano Varricchio
  Lecture Notes in Computer Science 665, 1993, pp. 595-606
• Locally threshold testable languages of infinite words
  Thomas Wilke
  Lecture Notes in Computer Science 665, 1993, pp. 607-616
• Deterministic asynchronous automata for infinite traces (extended abstract)
  Volker Diekert, Anca Muscholl
  Lecture Notes in Computer Science 665, 1993, pp. 617-628
• Recursive automata on infinite words
  Ludwig Staiger
  Lecture Notes in Computer Science 665, 1993, pp. 629-639
• A complexity theoretic approach to incremental computation
  S. Sairam, Jeffrey Scott Vitter, Roberto Tamassia
  Lecture Notes in Computer Science 665, 1993, pp. 640-649
• Precise average case complexity
  Rüdiger Reischuk, Christian Schindelhauer
  Lecture Notes in Computer Science 665, 1993, pp. 650-661
• The bit probe complexity measure revisited
  Peter Bro Miltersen
  Lecture Notes in Computer Science 665, 1993, pp. 662-671
• 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
• 1st grade - A system for implementation, testing and animation of graph algorithms
  Franz Höfting, Egon Wanke, Aurel Balmoŝan, Curd Bergmann
  Lecture Notes in Computer Science 665, 1993, pp. 706-707
• The program verifier Tatzelwurm
  Thomas Käufl
  Lecture Notes in Computer Science 665, 1993, pp. 708-709
• LEDA: A library of efficient data types and algorithms
  Stefan Näher
  Lecture Notes in Computer Science 665, 1993, pp. 710-711
• Defining \lambda-typed \lambda-calculi by axiomatizing the typing relation
  Philippe de Groote
  Lecture Notes in Computer Science 665, 1993, pp. 712-723