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

• Self-adjusting computation
  Robert Harper
  Lecture Notes in Computer Science 3142, 2004, pp. 1-2
• The past, present, and future of web search engines
  Monika Henzinger
  Lecture Notes in Computer Science 3142, 2004, pp. 3-3
• What do program logics and type systems have in common?
  Martin Hofmann
  Lecture Notes in Computer Science 3142, 2004, pp. 4-7
• Feasible proofs and computations: Partnership and fusion
  Alexander A. Razborov
  Lecture Notes in Computer Science 3142, 2004, pp. 8-14
• Grammar compression, LZ-encodings, and string algorithms with implicit input
  Wojciech Rytter
  Lecture Notes in Computer Science 3142, 2004, pp. 15-27
• Testing, optimizaton, and games
  Mihalis Yannakakis
  Lecture Notes in Computer Science 3142, 2004, pp. 28-45
• Deciding knowledge in security protocols under equational theories
  Martín Abadi, Véronique Cortier
  Lecture Notes in Computer Science 3142, 2004, pp. 46-58
• Representing nested inductive types using W-types
  Michael Abbott, Thorsten Altenkirch, Neil Ghani
  Lecture Notes in Computer Science 3142, 2004, pp. 59-71
• Algorithms for multi-product pricing
  Gagan Aggarwal, Tomás Feder, Rajeev Motwani, An Zhu
  Lecture Notes in Computer Science 3142, 2004, pp. 72-83
• Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
  Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson
  Lecture Notes in Computer Science 3142, 2004, pp. 84-96
• Linear and branching metrics for quantitative transition systems
  Luca de Alfaro, Marco Faella, Mariëlle Stoelinga
  Lecture Notes in Computer Science 3142, 2004, pp. 97-109
• Learning a hidden subgraph
  Noga Alon, Vera Asodi
  Lecture Notes in Computer Science 3142, 2004, pp. 110-121
• Optimal reachability for weighted timed games
  Rajeev Alur, Mikhail Bernadsky, P. Madhusudan
  Lecture Notes in Computer Science 3142, 2004, pp. 122-133
• Wavelength assignment in optical networks with fixed fiber capacity
  Matthew Andrews, Lisa Zhang
  Lecture Notes in Computer Science 3142, 2004, pp. 134-145
• External memory algorithms for diameter and all-pairs shortest-paths on sparse graphs
  Lars Arge, Ulrich Meyer, Laura Toma
  Lecture Notes in Computer Science 3142, 2004, pp. 146-157
• A \lambda-calculus for resource separation
  Robert Atkey
  Lecture Notes in Computer Science 3142, 2004, pp. 158-170
• The power of verification for one-parameter agents
  Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
  Lecture Notes in Computer Science 3142, 2004, pp. 171-182
• Group spreading: A protocol for provably secure distributed name service
  Baruch Awerbuch, Christian Scheideler
  Lecture Notes in Computer Science 3142, 2004, pp. 183-195
• Further improvements in competitive guarantees for QoS buffering
  Nikhil Bansal, Lisa K. Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko
  Lecture Notes in Computer Science 3142, 2004, pp. 196-207
• Competition-induced preferential attachment
  N. Berger, C. Borgs, J.T. Chayes, R.M. D'Souza, R.D. Kleinberg
  Lecture Notes in Computer Science 3142, 2004, pp. 208-221
• Approximating longest directed paths and cycles
  Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
  Lecture Notes in Computer Science 3142, 2004, pp. 222-233
• Definitions and bounds for self-healing key distribution schemes
  Carlo Blundo, Paolo D'Arco, Alfredo De Santis
  Lecture Notes in Computer Science 3142, 2004, pp. 234-245
• Tree-walking automata cannot be determinized
  Mikoƚaj Bojańczyk, Thomas Colcombet
  Lecture Notes in Computer Science 3142, 2004, pp. 246-256
• Projecting games on hypercoherences
  Pierre Boudes
  Lecture Notes in Computer Science 3142, 2004, pp. 257-268
• An analog characterization of elementarily computable functions over the real numbers
  Olivier Bournez, Emmanuel Hainry
  Lecture Notes in Computer Science 3142, 2004, pp. 269-280