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

Suche: Series=LNCS AND YEAR=1990

• 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
• Structural complexity theory: Recent surprises
  Juris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi
  Lecture Notes in Computer Science 447, 1990, pp. 1-12
• Approximating maximum independent sets by excluding subgraphs
  Ravi Boppana, Magnús M. Halldórsson
  Lecture Notes in Computer Science 447, 1990, pp. 13-25
• Generating sparse spanners for weighted graphs
  Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph
  Lecture Notes in Computer Science 447, 1990, pp. 26-37
• Finding the k smallest spanning trees
  David Eppstein
  Lecture Notes in Computer Science 447, 1990, pp. 38-47
• The file distribution problem for processor networks
  Goos Kant, Jan van Leeuwen
  Lecture Notes in Computer Science 447, 1990, pp. 48-59
• Translating polygons with applications to hidden surface removal
  Mark de Berg
  Lecture Notes in Computer Science 447, 1990, pp. 60-70
• Output-sensitive generation of the perspective view of isothetic parallelepipeds
  Franco P. Preparata, Jeffrey Scott Vitter, Mariette Yvinec
  Lecture Notes in Computer Science 447, 1990, pp. 71-84
• Graphics in flatland revisited
  Michel Pocchiola
  Lecture Notes in Computer Science 447, 1990, pp. 85-96
• The visibility diagram: A data structure for visibility problems and motion planning
  Gert Vegter
  Lecture Notes in Computer Science 447, 1990, pp. 97-110
• Fast updating of well-balanced trees
  Arne Andersson, Tony W. Lai
  Lecture Notes in Computer Science 447, 1990, pp. 111-121