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

Suche: Series=LNCS AND YEAR=1997

• Constructing a strongly convex superhull of points
  Wei Chen, Xiao Wen Deng, Koichi Wada, Kimio Kawaguchi
  Lecture Notes in Computer Science 1276, 1997, pp. 42-51
• Resolution of Hartmanis' conjecture for NL-hard sparse sets
  Jin-Yi Cai, D. Sivakumar
  Lecture Notes in Computer Science 1276, 1997, pp. 62-71
• The performance of neighbor-joining algorithms of phylogeny reconstruction
  Kevin Atteson
  Lecture Notes in Computer Science 1276, 1997, pp. 101-110
• Inferring evolutionary trees with strong combinatorial evidence
  Vincent Berry, Olivier Gascuel
  Lecture Notes in Computer Science 1276, 1997, pp. 111-123
• Computable invariance
  Vasco Brattka
  Lecture Notes in Computer Science 1276, 1997, pp. 146-155
• A Rabin-type scheme based on y^2 \equiv x^3+bx^2 mod n
  Seng Kiat Chua, San Ling
  Lecture Notes in Computer Science 1276, 1997, pp. 186-191
• A selected tour of the theory of identification matrices
  Lin Chen
  Lecture Notes in Computer Science 1276, 1997, pp. 222-231
• Fast algorithms for aligning sequences with restricted affine gap penalties
  Kun-Mao Chao
  Lecture Notes in Computer Science 1276, 1997, pp. 264-273
• Construction of nearly optimal multiway trees
  Peter Becker
  Lecture Notes in Computer Science 1276, 1997, pp. 294-303
• On the 100\% rule of sensitivity analysis in linear programming
  Pu Cai, Jin-Yi Cai
  Lecture Notes in Computer Science 1276, 1997, pp. 460-469
• They are just butterflies
  Yonghong Chen, Qiao Li
  Lecture Notes in Computer Science 1276, 1997, pp. 512-513
• Discrepancy theory and computational geometry
  Bernard Chazelle
  Lecture Notes in Computer Science 1272, 1997, pp. 1-2
• Dynamic motion planning in low obstacle density environments
  Robert-Paul Berretty, Mark Overmars, A. Frank van der Stappen
  Lecture Notes in Computer Science 1272, 1997, pp. 3-16
• Maintaining the extent of a moving point set
  Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach
  Lecture Notes in Computer Science 1272, 1997, pp. 31-44
• Finding cores of limited length
  Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup
  Lecture Notes in Computer Science 1272, 1997, pp. 45-54
• Constrained TSP and low-power computing
  Moses Charikar, Rajeev Motwani, Prabhakar Raghavan, Craig Silverstein
  Lecture Notes in Computer Science 1272, 1997, pp. 104-115
• On-line load balancing for related machines
  Piotr Berman, Moses Charikar, Marek Karpinski
  Lecture Notes in Computer Science 1272, 1997, pp. 116-125
• Pattern matching in hypertext
  Amihood Amir, Moshe Lewenstein, Noa Lewenstein
  Lecture Notes in Computer Science 1272, 1997, pp. 160-173
• Multiple approximate string matching
  Ricardo Baeza-Yates, Gonzalo Navarro
  Lecture Notes in Computer Science 1272, 1997, pp. 174-184
• Applied computational Geometry
  David P. Dobkin
  Lecture Notes in Computer Science 1272, 1997, pp. 185-185
• Checking the convexity of polytopes and the planarity of subdivisions
  O. Devillers, G. Liotta, F.P. Preparata, R. Tamassia
  Lecture Notes in Computer Science 1272, 1997, pp. 186-199
• Voronoi diagrams for polygon-offset distance functions
  Gill Barequet, Matthew T. Dickerson, Michael T. Goodrich
  Lecture Notes in Computer Science 1272, 1997, pp. 200-209
• On geometric path query problems
  Danny Z. Chen, Ovidiu Daescu, Kevin S. Klenk
  Lecture Notes in Computer Science 1272, 1997, pp. 248-257
• Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
  Sajal K. Das, M. Cristina Pinotti
  Lecture Notes in Computer Science 1272, 1997, pp. 272-281
• Computing orthogonal drawings with the minimum number of bends
  Paola Bertolazzi, Giuseppe di Battista, Walter Didimo
  Lecture Notes in Computer Science 1272, 1997, pp. 331-344