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

• The head hierarchy for oblivious finite automata with polynomial advice collapses
  Holger Petersen
  Lecture Notes in Computer Science 1450, 1998, pp. 296-304
• The equivalence problem for deterministic pushdown transducers into Abelian groups
  Géraud Sénizergues
  Lecture Notes in Computer Science 1450, 1998, pp. 305-315
• The semi-full closure of pure type systems
  Gilles Barthe
  Lecture Notes in Computer Science 1450, 1998, pp. 316-325
• Predicative polymorphic subtyping
  Marcin Benke
  Lecture Notes in Computer Science 1450, 1998, pp. 326-335
• A computational interpretation of the \lambda\mu-calculus
  G.M. Bierman
  Lecture Notes in Computer Science 1450, 1998, pp. 336-345
• Polymorphic subtyping without distributivity
  Jacek Chrza̧szcz
  Lecture Notes in Computer Science 1450, 1998, pp. 346-355
• A (non-elementary) modular decision procedure for LTrL
  Paul Gastin, Raphaël Meyer, Antoine Petit
  Lecture Notes in Computer Science 1450, 1998, pp. 356-365
• Complete abstract interpretations made constructive
  Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari
  Lecture Notes in Computer Science 1450, 1998, pp. 366-377
• Timed bisimulation and open maps
  Thomas Hune, Mogens Nielsen
  Lecture Notes in Computer Science 1450, 1998, pp. 378-387
• Deadlocking states in context-free process algebra
  Jiȓí Srba
  Lecture Notes in Computer Science 1450, 1998, pp. 388-398
• A superpolynomial lower bound for a circuit computing the clique function with at most (1/6)\log\log n negation gates
  Kazuyuki Amano, Akira Maruoka
  Lecture Notes in Computer Science 1450, 1998, pp. 399-408
• On counting AC^0 circuits with negative constants
  Andris Ambainis, David Mix Barrington, Huong LêThanh
  Lecture Notes in Computer Science 1450, 1998, pp. 409-417
• A second step towards circuit complexity-theoretic analogs of Rice's theorem
  Lane A. Hemaspaandra, Jörg Rothe
  Lecture Notes in Computer Science 1450, 1998, pp. 418-426
• Model checking real-time properties of symmetric systems
  E. Allen Emerson, Richard J. Trefler
  Lecture Notes in Computer Science 1450, 1998, pp. 427-436
• Locality of order-invariant first-order formulas
  Martin Grohe, Thomas Schwentick
  Lecture Notes in Computer Science 1450, 1998, pp. 437-445
• Probabilistic concurrent constraint programming: Towards a fully abstract model
  Alessandra di Pierro, Herbert Wiklicky
  Lecture Notes in Computer Science 1450, 1998, pp. 446-455
• Lazy functional algorithms for exact real functionals
  Alex K. Simpson
  Lecture Notes in Computer Science 1450, 1998, pp. 456-464
• Randomness vs.\ completeness: On the diagonalization strength of resource-bounded random sets
  Klaus Ambos-Spies, Steffen Lempp, Gunter Mainhardt
  Lecture Notes in Computer Science 1450, 1998, pp. 465-473
• Positive Turing and truth-table completeness for NEXP are incomparable
  Levke Bentzien
  Lecture Notes in Computer Science 1450, 1998, pp. 474-482
• Tally NP sets and easy census functions
  Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
  Lecture Notes in Computer Science 1450, 1998, pp. 483-492
• Average-case intractability vs.\ worst-case intractability
  Johannes Köbler, Rainer Schuler
  Lecture Notes in Computer Science 1450, 1998, pp. 493-502
• Shuffle on trajectories: The Schützenberger product and related operations
  Tero Harju, Alexandru Mateescu, Arto Salomaa
  Lecture Notes in Computer Science 1450, 1998, pp. 503-511
• Gaußian elimination and a characterization of algebraic power series
  Werner Kuich
  Lecture Notes in Computer Science 1450, 1998, pp. 512-521
• D0L-systems and surface automorphisms
  Luis-Miguel Lopez, Philippe Narbel
  Lecture Notes in Computer Science 1450, 1998, pp. 522-532
• About synchronization languages
  Isabelle Ryl, Yves Roos, Mireille Clerbout
  Lecture Notes in Computer Science 1450, 1998, pp. 533-542