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

• Localized network representations
  David Peleg
  Lecture Notes in Computer Science 2653, 2003, pp. 1-1
• Optimal binary search trees with costs depending on the access paths
  Jayme L. Szwarcfiter
  Lecture Notes in Computer Science 2653, 2003, pp. 2-2
• On the generation of extensions of a partially ordered set
  Jayme L. Szwarcfiter
  Lecture Notes in Computer Science 2653, 2003, pp. 3-3
• Error-correcting codes in complexity theory
  Luca Trevisan
  Lecture Notes in Computer Science 2653, 2003, pp. 4-4
• Cache-oblivious algorithms
  Charles E. Leiserson
  Lecture Notes in Computer Science 2653, 2003, pp. 5-5
• Spanning trees with low maximum/average stretch
  David Peleg
  Lecture Notes in Computer Science 2653, 2003, pp. 6-6
• Hyper encryption and everlasting secrets
  Michael O. Rabin
  Lecture Notes in Computer Science 2653, 2003, pp. 7-10
• Computing with electronic nanotechnologies
  John E. Savage
  Lecture Notes in Computer Science 2653, 2003, pp. 11-11
• Efficient update strategies for geometric computing with uncertainty
  Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman
  Lecture Notes in Computer Science 2653, 2003, pp. 12-23
• Maximizing the guarded boundary of an art gallery is APX-complete
  Euripides Markou, Stathis Zachos, Christodoulos Fragoudakis
  Lecture Notes in Computer Science 2653, 2003, pp. 24-35
• An improved algorithm for point set pattern matching under rigid motion
  Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
  Lecture Notes in Computer Science 2653, 2003, pp. 36-45
• Unlocking the advantages of dynamic service selection and pricing
  Bala Kalyanasundaram, Mahe Velauthapillai, John Waclawsky
  Lecture Notes in Computer Science 2653, 2003, pp. 46-57
• The relative worst order ratio for on-line algorithms
  Joan Boyar, Lene M. Favrholdt
  Lecture Notes in Computer Science 2653, 2003, pp. 58-69
• On-line stream merging, max span, and min coverage
  Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, Prudence W.H. Wong
  Lecture Notes in Computer Science 2653, 2003, pp. 70-82
• Randomised algorithms for finding small weakly-connected dominating sets of regular graphs
  William Duckworth, Bernard Mans
  Lecture Notes in Computer Science 2653, 2003, pp. 83-95
• Additive spanners for k-chordal graphs
  Victor D. Chepoi, Feodor F. Dragan, Chenyu Yan
  Lecture Notes in Computer Science 2653, 2003, pp. 96-107
• Graph-modeled data clustering: Fixed-parameter algorithms for clique generation
  Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier
  Lecture Notes in Computer Science 2653, 2003, pp. 108-119
• Reconciling gene trees to a species tree
  Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi
  Lecture Notes in Computer Science 2653, 2003, pp. 120-131
• Generating all forest extensions of a partially ordered set
  Jayme L. Szwarcfiter
  Lecture Notes in Computer Science 2653, 2003, pp. 132-139
• Indexing structures for approximate string matching
  Alessandra Gabriele, Fillippo Mignosi, Antonio Restivo, Marinella Sciortino
  Lecture Notes in Computer Science 2653, 2003, pp. 140-151
• Approximation hardness for small occurrence instances NP-hard problems
  Miroslav Chlebík, Janka Chlebíková
  Lecture Notes in Computer Science 2653, 2003, pp. 152-164
• Fast approximation of minimum multicast congestion - Implementation versus theory
  Andreas Baltz, Anand Srivastav
  Lecture Notes in Computer Science 2653, 2003, pp. 165-177
• Approximation of a retrieval problem for parallel disks
  Joep Aerts, Jan Korst, Frits Spieksma
  Lecture Notes in Computer Science 2653, 2003, pp. 178-188
• On k-edge-connectivity problems with sharpened triangle inequality
  Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic̑, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
  Lecture Notes in Computer Science 2653, 2003, pp. 189-200
• The complexity of detecting fixed-density clusters
  Klaus Holzapfel, Sven Kosub, Moritz G. MaaMaa{\ss{}, Hanjo Täubig
  Lecture Notes in Computer Science 2653, 2003, pp. 201-212