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 Volume=450

• Sublinear merging and natural merge sort
  Svante Carlsson, Christos Levcopoulos, Ola Petersson
  Lecture Notes in Computer Science 450, 1990, pp. 251-260
• Constructing strongly convex approximate hulls with inaccurate primitives
  Leonidas Guibas, David Salesin, Jorge Stolfi
  Lecture Notes in Computer Science 450, 1990, pp. 261-270
• Computing Puiseux-series solutions to determinatal equations via combinatorial relaxation
  Kazuo Murota
  Lecture Notes in Computer Science 450, 1990, pp. 271-280
• A tight lower bound on the size of planar permutation networks
  Maria Klawe, Tom Leighton
  Lecture Notes in Computer Science 450, 1990, pp. 281-287
• Simultaneous solution of families of problems
  Refael Hassin
  Lecture Notes in Computer Science 450, 1990, pp. 288-299
• Algorithms for projecting points to give the most uniform distribution with applications to hashing
  Tetsuo Asano, Takeshi Tokuyama
  Lecture Notes in Computer Science 450, 1990, pp. 300-309
• Topological sweeping in three dimensions
  Efthymios G. Anagnostou, Leonidas J. Guibas, Vassilios G.Polimenis
  Lecture Notes in Computer Science 450, 1990, pp. 310-317
• Finding least-weight subsequences with fewer processors
  Kwong-fai Chan, Tak-wah Lam
  Lecture Notes in Computer Science 450, 1990, pp. 318-327
• Derandomization by exploiting redundancy and mutual independence
  Yijie Han, Yoshihide Igarashi
  Lecture Notes in Computer Science 450, 1990, pp. 328-337
• Planar separators and the Euclidean norm
  Hillel Gazit, Gary L. Miller
  Lecture Notes in Computer Science 450, 1990, pp. 338-347
• On the complexity of isometric embedding in the hypercube
  David Avis
  Lecture Notes in Computer Science 450, 1990, pp. 348-357
• Distributed function evaluation in the presence of transmission faults
  Nicola Santoro, Peter Widmayer
  Lecture Notes in Computer Science 450, 1990, pp. 358-367
• Optimal linear broadcast
  Sara Bitan, Shmuel Zaks
  Lecture Notes in Computer Science 450, 1990, pp. 368-377
• Graph augmentation problems for a specified set of vertices
  Toshimasa Watanabe, Yasuhiko Higashi, Akira Nakamura
  Lecture Notes in Computer Science 450, 1990, pp. 378-387
• A heuristic algorithm for the k-center problem with vertex weight
  Qingzhou Wang, Kam Hoi Cheng
  Lecture Notes in Computer Science 450, 1990, pp. 388-396
• Parallel convexity algorithms for digitized images on a linear array of processors
  Hussein M. Alnuweiri, V.K. Prasanna Kumar
  Lecture Notes in Computer Science 450, 1990, pp. 397-406
• Parallel algorithms for labeling image components
  Wen-Jing Hsu, Xiaola Lin
  Lecture Notes in Computer Science 450, 1990, pp. 407-418
• A hyperplane incidence problem with applications to counting distances
  Herbert Edelsbrunner, Micha Sharir
  Lecture Notes in Computer Science 450, 1990, pp. 419-428
• Splitting a configuration in a simplex
  Kazumiti Numata, Takeshi Tokuyama
  Lecture Notes in Computer Science 450, 1990, pp. 429-438
• Weaving patterns of lines and line segments in space
  J. Pach, R. Pollack, E. Welzl
  Lecture Notes in Computer Science 450, 1990, pp. 439-446
• Efficient parallel algorithms for path problems in planar directed graphs
  Andrezej Lingas
  Lecture Notes in Computer Science 450, 1990, pp. 447-457
• Parallel algorithms for finding Steiner forests in planar graphs
  Hitoshi Suzuki, Chiseko Yamanaka, Takao Nishizeki
  Lecture Notes in Computer Science 450, 1990, pp. 458-467
• Optimally managing the history of an evolving forest
  Vassilis J. Tsotras, B. Gopinath, George W. Hart
  Lecture Notes in Computer Science 450, 1990, pp. 468-478