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

• Model checking and satisfiability for sabotage modal logic
  Christof Löding, Philipp Rohde
  Lecture Notes in Computer Science 2914, 2003, pp. 302-313
• Merging and sorting by strip moves
  Meena Mahajan, Raghavan Rama, Venkatesh Raman, S. Vijayakumar
  Lecture Notes in Computer Science 2914, 2003, pp. 314-325
• The macro tree transducer hierarchy collapses for functions of linear size increase
  Sebastian Maneth
  Lecture Notes in Computer Science 2914, 2003, pp. 326-337
• Distributed games
  Swarup Mohalik, Igor Walukiewicz
  Lecture Notes in Computer Science 2914, 2003, pp. 338-351
• Maintenance of multidimensional histograms
  S. Muthukrishnan, Martin Strauss
  Lecture Notes in Computer Science 2914, 2003, pp. 352-362
• Tagging makes secrecy decidable with unbounded nonces as well
  R. Ramanujam, S.P. Suresh
  Lecture Notes in Computer Science 2914, 2003, pp. 363-374
• Quantum and classical complexity classes: Separations, collapses, and closure properties
  Holger Spakowski, Mayur Thakur, Rahul Tripathi
  Lecture Notes in Computer Science 2914, 2003, pp. 375-386
• On the greedy superstring conjecture
  Maik Weinard, Georg Schnitger
  Lecture Notes in Computer Science 2914, 2003, pp. 387-398
• Reasoning about infinite state systems using Boolean methods
  Randal E. Bryant
  Lecture Notes in Computer Science 2914, 2003, pp. 399-407
• Stringent relativization
  Jin-Yi Cai, Osamu Watanabe
  Lecture Notes in Computer Science 2914, 2003, pp. 408-419
• Component-based construction of deadlock-free systems
  Gregor Gössler, Joseph Sifakis
  Lecture Notes in Computer Science 2914, 2003, pp. 420-433
• Moderately hard functions: From complexity to spam fighting
  Moni Naor
  Lecture Notes in Computer Science 2914, 2003, pp. 434-442
• Zigzag products, expander constructions, connections, and applications
  Avi Wigderson
  Lecture Notes in Computer Science 2914, 2003, pp. 443-443