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

• The multicore revolution - The challenges for theory
  Maurice Herlihy
  Lecture Notes in Computer Science 4855, 2007, pp. 1-8
• Streaming algorithms for selection and approximate sorting
  Richard M. Karp
  Lecture Notes in Computer Science 4855, 2007, pp. 9-20
• Adventures in bidirectional programming
  Benjamin C. Pierce
  Lecture Notes in Computer Science 4855, 2007, pp. 21-22
• Program analysis using weighted pushdown systems
  Thomas Reps, Akash Lal, Nick Kidd
  Lecture Notes in Computer Science 4855, 2007, pp. 23-51
• The complexity of zero knowledge
  Salil Vadhan
  Lecture Notes in Computer Science 4855, 2007, pp. 52-70
• The priority k-median problem
  Amit Kumar, Yogish Sabharwal
  Lecture Notes in Computer Science 4855, 2007, pp. 71-83
• ''Rent-or-Buy'' scheduling and cost coloring problems
  Takuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi
  Lecture Notes in Computer Science 4855, 2007, pp. 84-95
• Order scheduling models: Hardness and algorithms
  Naveen Garg, Amit Kumar, Vinayaka Pandit
  Lecture Notes in Computer Science 4855, 2007, pp. 96-107
• On simulatability soundness and mapping soundness of symbolic cryptography
  Michael Backes, Markus Dürmuth, Ralf Küsters
  Lecture Notes in Computer Science 4855, 2007, pp. 108-120
• Key substitution in the symbolic analysis of cryptographic protocols
  Yannick Chevalier, Mounira Kourjieh
  Lecture Notes in Computer Science 4855, 2007, pp. 121-132
• Symbolic bisimulation for the applied pi calculus
  Stéphanie Delaune, Steve Kremer, Mark Ryan
  Lecture Notes in Computer Science 4855, 2007, pp. 133-145
• Non-mitotic sets
  Christian Glaßer, Alan L. Selman, Stephen Travers, Liyu Zhang
  Lecture Notes in Computer Science 4855, 2007, pp. 146-157
• Reductions to graph isomorphism
  Jacobo Torán
  Lecture Notes in Computer Science 4855, 2007, pp. 158-167
• Strong reductions and isomorphism of complete sets
  Ryan C. Harkins, John M. Hitchcock, A. Pavan
  Lecture Notes in Computer Science 4855, 2007, pp. 168-178
• Probabilistic and topological semantics for timed automata
  Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer
  Lecture Notes in Computer Science 4855, 2007, pp. 179-191
• A theory for game theories
  Michel Hirschowitz, André Hirschowitz, Tom Hirschowitz
  Lecture Notes in Computer Science 4855, 2007, pp. 192-203
• An incremental bisimulation algorithm
  Diptikalyan Saha
  Lecture Notes in Computer Science 4855, 2007, pp. 204-215
• Logspace algorithms for computing shortest and longest paths in series-parallel graphs
  Andreas Jakoby, Till Tantau
  Lecture Notes in Computer Science 4855, 2007, pp. 216-227
• Communication lower bounds via the chromatic number
  Ravi Kumar, D. Sivakumar
  Lecture Notes in Computer Science 4855, 2007, pp. 228-240
• The deduction theorem for strong propositional proof systems
  Olaf Beyersdorff
  Lecture Notes in Computer Science 4855, 2007, pp. 241-252
• Satisfiability of algebraic circuits over sets of natural numbers
  Christian Glaßer, Christian Reitwießner, Stephen Travers, Matthias Waldherr
  Lecture Notes in Computer Science 4855, 2007, pp. 253-264
• Post embedding problem is not primitive recursive, with applications to channel systems
  Pierre Chambart, Philippe Schnoebelen
  Lecture Notes in Computer Science 4855, 2007, pp. 265-276
• Synthesis of safe message-passing systems
  Nicolas Baudru, Rémi Morin
  Lecture Notes in Computer Science 4855, 2007, pp. 277-289
• Automata and logics for timed message sequence charts
  S. Akshay, Benedikt Bollig, Paul Gastin
  Lecture Notes in Computer Science 4855, 2007, pp. 290-302
• Propositional dynamic logic for message-passing systems
  Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
  Lecture Notes in Computer Science 4855, 2007, pp. 303-315