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

• External memory algorithms
  Jeffrey Scott Vitter
  Lecture Notes in Computer Science 1461, 1998, pp. 1-25
• Design and analysis of dynamic processes: A stochastic approach
  Eli Upfal
  Lecture Notes in Computer Science 1461, 1998, pp. 26-34
• Car-pooling as a data structuring device: The soft heap
  Bernard Chazelle
  Lecture Notes in Computer Science 1461, 1998, pp. 35-42
• Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
  Phil Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
  Lecture Notes in Computer Science 1461, 1998, pp. 43-54
• Finding all the best swaps of a minimum diameter spanning tree under transient edge failures
  Enrico Nardelli, Guido Proietti, Peter Widmayer
  Lecture Notes in Computer Science 1461, 1998, pp. 55-66
• Augmenting suffix trees, with applications
  Yossi Matias, S. Muthukrishnan, Süleyman Cenk Ṣahinalp, Jacob Ziv
  Lecture Notes in Computer Science 1461, 1998, pp. 67-78
• Longest common subsequence from fragments via sparse dynamic programming
  Brenda S. Baker, Raffaele Giancarlo
  Lecture Notes in Computer Science 1461, 1998, pp. 79-90
• Computing the edit-distance between unrooted ordered trees
  Philip N. Klein
  Lecture Notes in Computer Science 1461, 1998, pp. 91-102
• Analogs and duals of the MAST problem for sequences and trees
  Michael Fellows, Michael Hallett, Chantal Korostensky, Ulrike Stege
  Lecture Notes in Computer Science 1461, 1998, pp. 103-114
• Complexity estimates depending on condition and round-off error
  Felipe Cucker, Steve Smale
  Lecture Notes in Computer Science 1461, 1998, pp. 115-126
• Intrinsic near quadratic complexity bounds for real multivariate root counting
  J. Maurice Rojas
  Lecture Notes in Computer Science 1461, 1998, pp. 127-138
• Fast algorithms for linear algebra modulo N
  Arne Storjohann, Thom Mulders
  Lecture Notes in Computer Science 1461, 1998, pp. 139-150
• A probabilistic zero-test for expressions involving roots of rational numbers
  Johannes Blömer
  Lecture Notes in Computer Science 1461, 1998, pp. 151-162
• Geometric searching in walkthrough animations with weak spanners in real time
  Matthias Fischer, Tamás Lukovszki, Martin Ziegler
  Lecture Notes in Computer Science 1461, 1998, pp. 163-174
• A robust region approach to the computation of geometric graphs
  Fabrizio d'Amore, Paolo G. Franciosa, Giuseppe Liotta
  Lecture Notes in Computer Science 1461, 1998, pp. 175-186
• Positioning guards at fixed height above a terrain - An optimum inapproximability result
  Stephan Eidenbenz, Christoph Stamm, Peter Widmayer
  Lecture Notes in Computer Science 1461, 1998, pp. 187-198
• Two-center problems for a convex polygon
  Chan-Su Shin, Jung-Hyun Kim, Sung Kwon Kim, Kyung-Yong Chwa
  Lecture Notes in Computer Science 1461, 1998, pp. 199-210
• Constructing binary space partitions for orthogonal rectangles in practice
  T.M. Murali, Pankaj K. Agarwal, Jeffrey Scott Vitter
  Lecture Notes in Computer Science 1461, 1998, pp. 211-222
• A fast random greedy algorithm for the component commonality problem
  Ravi Kannan, Andreas Nolte
  Lecture Notes in Computer Science 1461, 1998, pp. 223-234
• Maximizing job completions online
  Bala Kalyanasundaram, Kirk Pruhs
  Lecture Notes in Computer Science 1461, 1998, pp. 235-246
• A randomized algorithm for two servers on the line
  Yair Bartal, Marek Chrobak, Lawrence L. Larmore
  Lecture Notes in Computer Science 1461, 1998, pp. 247-258
• On nonblocking properties of the Benes̑ network
  Petr Kolman
  Lecture Notes in Computer Science 1461, 1998, pp. 259-270
• Adaptability and the usefulness of hints
  Piotr Berman, Juan A. Garay
  Lecture Notes in Computer Science 1461, 1998, pp. 271-282
• Fault-tolerant broadcasting in radio networks
  Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
  Lecture Notes in Computer Science 1461, 1998, pp. 283-294
• New bounds for oblivious mesh routing
  Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
  Lecture Notes in Computer Science 1461, 1998, pp. 295-306