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

• Computing shortest transversals
  B. Bhattacharya, G. Toussaint
  Lecture Notes in Computer Science 510, 1991, pp. 649-660
• Ray shooting in polygons using geodesic triangulations
  B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, J. Snoeyink
  Lecture Notes in Computer Science 510, 1991, pp. 661-673
• The expected extremes in a Delaunay triangulation
  M. Bern, D. Eppstein, F. Yao
  Lecture Notes in Computer Science 510, 1991, pp. 674-685
• Computational geometry for the gourmet: Old fare and new dishes
  B. Chazelle
  Lecture Notes in Computer Science 510, 1991, pp. 686-696
• On the power of multiple reads in a chip
  P. D̑uris̆, Z. Galil
  Lecture Notes in Computer Science 510, 1991, pp. 697-706
• On linear decision trees computing Boolean functions
  H.D. Gröger, G. Turán
  Lecture Notes in Computer Science 510, 1991, pp. 707-718
• An almost linear-time algorithm for the dense subset-sum problem
  Z. Galil, O. Margalit
  Lecture Notes in Computer Science 510, 1991, pp. 719-727
• On-line algorithms for weighted bipartite matching and stable marriages
  S. Khuller, S.G. Mitchell, V.V. Vazirani
  Lecture Notes in Computer Science 510, 1991, pp. 728-738
• String matching with preprocessing of text and pattern
  M. Naor
  Lecture Notes in Computer Science 510, 1991, pp. 739-750
• Ordering problems approximated: Single-processor scheduling and interval graph completion
  R. Ravi, A. Agrawal, P. Klein
  Lecture Notes in Computer Science 510, 1991, pp. 751-762