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 YEAR=2004

• 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
• Model checking with multi-valued logics
  Glenn Bruns, Patrice Godefroid
  Lecture Notes in Computer Science 3142, 2004, pp. 281-293
• The complexity of partition functions
  Andrei Bulatov, Martin Grohe
  Lecture Notes in Computer Science 3142, 2004, pp. 294-306
• Comparing recursion, replication, and iteration in process calculi
  Nadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro
  Lecture Notes in Computer Science 3142, 2004, pp. 307-319
• Dynamic price sequence and incentive compatibility
  Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao
  Lecture Notes in Computer Science 3142, 2004, pp. 320-331
• The complexity of equivariant unification
  James Cheney
  Lecture Notes in Computer Science 3142, 2004, pp. 332-344
• Coordination mechanisms
  George Christodoulou, Elias Koutsoupias, Akash Nanavati
  Lecture Notes in Computer Science 3142, 2004, pp. 345-357
• Online scheduling of equal-length jobs: Randomization and restarts help
  Marek Chrobak, Wojciech Jawor, Jiȓí Sgall, Tomás̑ Tichý
  Lecture Notes in Computer Science 3142, 2004, pp. 358-370
• Efficient computation of equilibrium prices for markets with Leontief utilities
  Bruno Codenotti, Kasturi Varadarajan
  Lecture Notes in Computer Science 3142, 2004, pp. 371-382
• Coloring semirandom graphs optimally
  Amin Coja-Oghlan
  Lecture Notes in Computer Science 3142, 2004, pp. 383-395
• Sublinear-time approximation for clustering via random sampling
  Artur Czumaj, Christian Sohler
  Lecture Notes in Computer Science 3142, 2004, pp. 396-407
• Solving two-variable word equations
  Robert Da̧browski, Wojtek Plandowski
  Lecture Notes in Computer Science 3142, 2004, pp. 408-419