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 [2]	Hilfe

Suche: Series=LNCS AND YEAR=2003

• Linear-time computation of local periods
  Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre
  Lecture Notes in Computer Science 2747, 2003, pp. 388-397
• Two dimensional packing: The power of rotation
  Leah Epstein
  Lecture Notes in Computer Science 2747, 2003, pp. 398-407
• Approximation schemes for the min-max starting time problem
  Leah Epstein, Tamir Tassa
  Lecture Notes in Computer Science 2747, 2003, pp. 408-418
• Quantum testers for hidden group properties
  Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen
  Lecture Notes in Computer Science 2747, 2003, pp. 419-428
• Polarized process algebra and program equivalence
  Jan A. Bergstra, Inge Bethke
  Lecture Notes in Computer Science 2719, 2003, pp. 1-21
• Problems on RNA secondary structure prediction and design
  Anne Condon
  Lecture Notes in Computer Science 2719, 2003, pp. 22-32
• Some issues regarding search, censorship, and anonymity in peer to peer networks
  Amos Fiat
  Lecture Notes in Computer Science 2719, 2003, pp. 33-33
• Generalized framework for selectors with applications in optimal group testing
  Annalisa De Bonis, Leszek Ga̧sieniec, Ugo Vaccaro
  Lecture Notes in Computer Science 2719, 2003, pp. 81-96
• Decoding of interleaved reed Solomon codes over noisy data
  Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung
  Lecture Notes in Computer Science 2719, 2003, pp. 97-108
• On the axiomatizability of ready traces, ready simulation, and failure traces
  Stefan Blom, Wan Fokkink, Sumit Nain
  Lecture Notes in Computer Science 2719, 2003, pp. 109-118
• Replication vs. recursive definitions in channel based calculi
  Nadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro
  Lecture Notes in Computer Science 2719, 2003, pp. 133-144
• Improved combinatorial approximation algorithms for the k-level facility location problem
  Alexander Ageev, Yinyu Ye, Jiawei Zhang
  Lecture Notes in Computer Science 2719, 2003, pp. 145-156
• An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
  Markus Bläser
  Lecture Notes in Computer Science 2719, 2003, pp. 157-163
• Approximation schemes for degree-restricted MST and red-blue separation problem
  Sanjeev Arora, Kevin L. Chang
  Lecture Notes in Computer Science 2719, 2003, pp. 176-188
• Approximating Steiner k-cuts
  Chandra Chekuri, Sudipto Guha, Joseph (Seffi) Naor
  Lecture Notes in Computer Science 2719, 2003, pp. 189-199
• MAX k-CUT and approximating the chromatic number of random graphs
  Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani
  Lecture Notes in Computer Science 2719, 2003, pp. 200-211
• Approximation algorithm for directed telephone multicast problem
  Michael Elkin, Guy Kortsarz
  Lecture Notes in Computer Science 2719, 2003, pp. 212-223
• Mixin modules and computational effects
  Davide Ancona, Sonia Fagorzi, Eugenio Moggi, Elena Zucca
  Lecture Notes in Computer Science 2719, 2003, pp. 224-238
• Generalized rewrite theories
  Roberto Bruni, José Meseguer
  Lecture Notes in Computer Science 2719, 2003, pp. 252-266
• Sophistication revisited
  Luís Antunes, Lance Fortnow
  Lecture Notes in Computer Science 2719, 2003, pp. 267-277
• Optimal cache-oblivious implicit dictionaries
  Gianni Franceschini, Roberto Grossi
  Lecture Notes in Computer Science 2719, 2003, pp. 316-331
• The cell probe complexity of succinct data structures
  Anna Gál, Peter Bro Miltersen
  Lecture Notes in Computer Science 2719, 2003, pp. 332-344
• A simple linear time algorithm for computing a (2k-1)-spanner of O(n^{1+1/k}) size in weighted graphs
  Surender Baswana, Sandeep Sen
  Lecture Notes in Computer Science 2719, 2003, pp. 384-396
• Multicommodity demand flow in a tree
  Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd
  Lecture Notes in Computer Science 2719, 2003, pp. 410-425
• Skew and infinitary formal power series
  Manfred Droste, Dietrich Kuske
  Lecture Notes in Computer Science 2719, 2003, pp. 426-438