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

• What can we learn about suffix trees from independent tries?
  Philippe Jacquet, Wojciech Szpankowski
  Lecture Notes in Computer Science 519, 1991, pp. 228-239
• Geometric searching and link distance
  Gautam Das, Giri Narasimhan
  Lecture Notes in Computer Science 519, 1991, pp. 261-272
• Planar graph augmentation problems
  Goos Kant, Hans L. Bodlaender
  Lecture Notes in Computer Science 519, 1991, pp. 286-298
• Parametric search and locating supply centers in trees
  Greg N. Frederickson
  Lecture Notes in Computer Science 519, 1991, pp. 299-319
• Computing minimum length paths of a given homotopy class
  John Hershberger, Jack Snoeyink
  Lecture Notes in Computer Science 519, 1991, pp. 331-342
• Approximation algorithms for selecting network centers
  Judit Bar-Ilan, David Peleg
  Lecture Notes in Computer Science 519, 1991, pp. 343-354
• Optimum guard covers and m-watchmen routes for restricted polygons
  Svante Carlsson, Bengt J. Nilsson, Simeon Ntafos
  Lecture Notes in Computer Science 519, 1991, pp. 367-378
• Applications of a new space partitioning technique
  Pankaj K. Agarwal, Micha Sharir
  Lecture Notes in Computer Science 519, 1991, pp. 379-391
• Offline algorithms for dynamic minimum spanning tree problems
  David Eppstein
  Lecture Notes in Computer Science 519, 1991, pp. 392-399
• A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible
  Binary K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint
  Lecture Notes in Computer Science 519, 1991, pp. 412-424
• An optimal algorithm for computing visibility in the plane
  Paul J. Heffernan, Joseph S.B. Mitchell
  Lecture Notes in Computer Science 519, 1991, pp. 437-448
• Fully persistent data structures for disjoint set union problems
  Giuseppe F. Italiano, Neil Sarnak
  Lecture Notes in Computer Science 519, 1991, pp. 449-460
• Algorithms for generating all spanning trees of undirected, directed and weighted graphs
  Sanjiv Kapoor, H. Ramesh
  Lecture Notes in Computer Science 519, 1991, pp. 461-472
• Probabilistic leader election on rings of known size
  Karl Abrahamson, Andrew Adler, Lisa Higham, David Kirkpatrick
  Lecture Notes in Computer Science 519, 1991, pp. 481-495
• On the semantics of logic programs
  M. Gabbrielli, G. Levi
  Lecture Notes in Computer Science 510, 1991, pp. 1-19
• Logic programming with recurrence domains
  Hong Chen, Jieh Hsiang
  Lecture Notes in Computer Science 510, 1991, pp. 20-34
• Extensional embedding of a strongly stable model of PCF
  A. Bucciarelli, T. Ehrhard
  Lecture Notes in Computer Science 510, 1991, pp. 35-46
• Uniform ideals and strictness analysis
  C. Ernoult, A. Mycroft
  Lecture Notes in Computer Science 510, 1991, pp. 47-59
• Logical and computational aspects of programming with sets/bags/lists
  V. Breazu-Tannen, R. Subrahmanyam
  Lecture Notes in Computer Science 510, 1991, pp. 60-75
• Safety for branching time semantics
  A. Bouajjani, J.C. Fernández, S. Graf, C. Rodríguez, J. Sifakis
  Lecture Notes in Computer Science 510, 1991, pp. 76-92
• Program composition and modular verification
  L. Fix, N. Francez, O. Grumberg
  Lecture Notes in Computer Science 510, 1991, pp. 93-114
• Model-checking for probabilistic real-time systems
  R. Alur, C. Courcoubetis, D. Dill
  Lecture Notes in Computer Science 510, 1991, pp. 115-126
• Computing behavioural relations, logically
  R. Cleaveland, B. Steffen
  Lecture Notes in Computer Science 510, 1991, pp. 127-138
• The power of reconfiguration
  Y. Ben-Asher, D. Peleg, R. Ramaswami, A. Schuster
  Lecture Notes in Computer Science 510, 1991, pp. 139-150
• General resolution of Tseitin formulas is hard
  J.-D. Fouks
  Lecture Notes in Computer Science 510, 1991, pp. 151-162