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

• All-pairs min-cut in sparse networks
  Srinivasa R. Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
  Lecture Notes in Computer Science 1026, 1995, pp. 363-376
• Minimizing space usage in evaluation of expression trees
  Sandip K. Biswas, Sampath Kannan
  Lecture Notes in Computer Science 1026, 1995, pp. 377-390
• Smooth surfaces for multi-scale shape representation
  Herbert Edelsbrunner
  Lecture Notes in Computer Science 1026, 1995, pp. 391-412
• On parallel complexity of planar triangulations
  Christos Levcopoulos, Andrzej Lingas, Cao Wang
  Lecture Notes in Computer Science 1026, 1995, pp. 413-427
• Computing a largest empty anchored cylinder, and related problems
  Frank Follert, Elmar Schömer, Jürgen Sellen, Michiel Smid, Christian Thiel
  Lecture Notes in Computer Science 1026, 1995, pp. 428-442
• Computing hierarchies of clusters from the Euclidean minimum spanning tree in linear time
  Drago Krznaric, Christos Levcopoulos
  Lecture Notes in Computer Science 1026, 1995, pp. 443-455
• Determinizing Büchi asynchronous automata
  Nils Klarlund, Madhavan Mukund, Milind Sohoni
  Lecture Notes in Computer Science 1026, 1995, pp. 456-470
• Achilles and the tortoise climbing up the arithmetical hierarchy
  Eugene Asarin, Oded Maler
  Lecture Notes in Computer Science 1026, 1995, pp. 471-483
• Generalized temporal verification diagrams
  I.A. Browne, Z. Manna, H.B. Sipma
  Lecture Notes in Computer Science 1026, 1995, pp. 484-498
• Model checking of probabilistic and nondeterministic systems
  Andrea Bianco, Luca de Alfaro
  Lecture Notes in Computer Science 1026, 1995, pp. 499-513