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 YEAR=1991

• Tight bounds for the rectangular art gallery problem
  J. Czyzowicz, E. Rivera-Campo, N. Santoro, J. Urrutia, J. Zaks
  Lecture Notes in Computer Science 570, 1991, pp. 105-112
• Voronoi diagrams of moving points in the plane
  Leonidas J. Guibas, Joseph S.B. Mitchell, Thomas Roos
  Lecture Notes in Computer Science 570, 1991, pp. 113-125
• Fast parallel algorithms for coloring random graphs
  Zvi M. Kedem, Krishna V. Palem, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis
  Lecture Notes in Computer Science 570, 1991, pp. 135-147
• Line digraph iterations and the spread concept - with application to graph theory, fault tolerance, and routing
  Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu
  Lecture Notes in Computer Science 570, 1991, pp. 169-179
• Program checking
  Manuel Blum
  Lecture Notes in Computer Science 560, 1991, pp. 1-9
• Randomizing reductions of search problems
  Andreas Blass, Yuri Gurevich
  Lecture Notes in Computer Science 560, 1991, pp. 10-24
• Failures semantics for a simple process language with refinement
  Luca Aceto, Uffe Engberg
  Lecture Notes in Computer Science 560, 1991, pp. 89-108
• Correctness of programs over poor signatures
  Hardi Hungar
  Lecture Notes in Computer Science 560, 1991, pp. 109-120
• Complexity issues for vacillatory function identification
  John Case, Sanjay Jain, Arun Sharma
  Lecture Notes in Computer Science 560, 1991, pp. 121-140
• The structure and complexity of minimal NFA's over a unary alphabet
  Tao Jiang, Edward McDowell, B. Ravikumar
  Lecture Notes in Computer Science 560, 1991, pp. 152-171
• Computing the order of a locally testable automaton
  Sam Kim, Robert McNaughton
  Lecture Notes in Computer Science 560, 1991, pp. 186-211
• On the structure and complexity of infinite sets with minimal perfect hash functions
  Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen
  Lecture Notes in Computer Science 560, 1991, pp. 212-223
• NP-hard sets and creativeness over constant time languages
  Manindra Agrawal
  Lecture Notes in Computer Science 560, 1991, pp. 224-241
• Contracting planar graphs efficiently in parallel
  Martin Fürer, Balaji Raghavachari
  Lecture Notes in Computer Science 560, 1991, pp. 319-335
• Computing the shortest path tree in a weak visibility polygon
  Subir Kumar Ghosh, Anil Maheshwari, Sudebkumar Prasant Pal, Sanjeev Saluja, C.E. Veni Madhavan
  Lecture Notes in Computer Science 560, 1991, pp. 369-389
• Usefulness of angle-sweep over line-sweep
  Binay K. Bhattacharya
  Lecture Notes in Computer Science 560, 1991, pp. 390-419
• Distributed k-mutual exclusion problem and k-coteries
  Satoshi Fujita, Masafumi Yamashita, Tadashi Ae
  Lecture Notes in Computer Science 557, 1991, pp. 22-31
• Substitution decomposition on chordal graphs and applications
  Wen-Lian Hsu, Tze-Heng Ma
  Lecture Notes in Computer Science 557, 1991, pp. 52-60
• Circuit partitioning algorithms: Graph model versus geometry model
  Tetsuo Asano, Takeshi Tokuyama
  Lecture Notes in Computer Science 557, 1991, pp. 94-103
• Identifying 2-monotonic positive Boolean functions in polynomial time
  E. Boros, P.L. Hammer, T. Ibaraki, K. Kawakami
  Lecture Notes in Computer Science 557, 1991, pp. 104-115
• An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm
  T.H. Hu, C.Y. Tang, R.C.T. Lee
  Lecture Notes in Computer Science 557, 1991, pp. 116-126
• An on-line algorithm for navigating in unknown terrain
  Kwong-fai Chan, Tak Wah Lam
  Lecture Notes in Computer Science 557, 1991, pp. 127-136
• On maintaining the width and diameter of a planar point-set online
  Ravi Janardan
  Lecture Notes in Computer Science 557, 1991, pp. 137-149
• Optimal triangulations by retriangulating
  Herbert Edelsbrunner
  Lecture Notes in Computer Science 557, 1991, pp. 150-150
• Approximating polygons and subdivisions with minimum link paths
  Leonidas J. Guibas, John E. Hershberger, Joseph S.B. Mitchell, Jack Scott Snoeyink
  Lecture Notes in Computer Science 557, 1991, pp. 151-162