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

• Approximation of convex polygons
  Helmut Alt, Johannes Blömer, Michael Godau, Hubert Wagener
  Lecture Notes in Computer Science 443, 1990, pp. 703-716
• On the rectilinear art gallery problem
  Frank Hoffmann
  Lecture Notes in Computer Science 443, 1990, pp. 717-728
• On parallel hashing and integer sorting
  Yossi Matias, Uzi Vishkin
  Lecture Notes in Computer Science 443, 1990, pp. 729-743
• The parallel simplicity of compaction and chaining
  Prabhakar Ragde
  Lecture Notes in Computer Science 443, 1990, pp. 744-751
• The importance of the left merge operator in process algebras
  Faron Moller
  Lecture Notes in Computer Science 443, 1990, pp. 752-764
• Operational and algebraic semantics for Facile
  Sanjiva Prasad, Alessandro Giacalone, Prateek Mishra
  Lecture Notes in Computer Science 443, 1990, pp. 765-780