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

• Derivability in locally quantified modal logics via translation in set theory
  Angelo Montanari, Alberto Policriti, Matteo Slanina
  Lecture Notes in Computer Science 1893, 2000, pp. 559-568
• \pi-calculus, structured coalgebras and minimal HD-automata
  Ugo Montanari, Marco Pistore
  Lecture Notes in Computer Science 1893, 2000, pp. 569-578
• Informative labeling schemes for graphs
  David Peleg
  Lecture Notes in Computer Science 1893, 2000, pp. 579-588
• Separation results for rebound automata
  Holger Petersen
  Lecture Notes in Computer Science 1893, 2000, pp. 589-598
• Unary pushdown automata and auxiliary space lower bounds
  Giovanni Pighizzini
  Lecture Notes in Computer Science 1893, 2000, pp. 599-608
• Binary decision diagrams by shared rewriting
  Jaco van de Pol, Hans Zantema
  Lecture Notes in Computer Science 1893, 2000, pp. 609-618
• Verifying single and multi-mutator garbage collectors with Owicki-Gries in Isabelle/HOL
  Leonor Prensa Nieto, Javier Esparza
  Lecture Notes in Computer Science 1893, 2000, pp. 619-628
• Why so many temporal logics climb up the trees?
  Alexander Rabinovich, Shahar Maoz
  Lecture Notes in Computer Science 1893, 2000, pp. 629-639
• Optimal satisfiability for propositional calculi and constraint satisfaction problems
  Steffen Reith, Heribert Vollmer
  Lecture Notes in Computer Science 1893, 2000, pp. 640-649
• A hierarchy result for read-once branching programs with restricted parity nondeterminism
  Petr Savický, Detlef Sieling
  Lecture Notes in Computer Science 1893, 2000, pp. 650-659
• On diving in trees
  Thomas Schwentick
  Lecture Notes in Computer Science 1893, 2000, pp. 660-669
• Abstract syntax and variable binding for linear binders
  Miki Tanaka
  Lecture Notes in Computer Science 1893, 2000, pp. 670-679
• Regularity of congruential graphs
  Tanguy Urvoy
  Lecture Notes in Computer Science 1893, 2000, pp. 680-689
• Sublinear ambiguity
  Klaus Wich
  Lecture Notes in Computer Science 1893, 2000, pp. 690-698
• An automata-based recognition algorithm for semi-extended regular expressions
  Hiroaki Yamamoto
  Lecture Notes in Computer Science 1893, 2000, pp. 699-708