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

• Proving progress properties of non terminating programs under fairness assumptions
  Ricardo Peña, Luis A. Galán
  Lecture Notes in Computer Science 1123, 1996, pp. 775-778
• A simple parallel dictionary matching algorithm
  Paolo Ferragina
  Lecture Notes in Computer Science 1123, 1996, pp. 781-788
• Scalability and granularity issues of the hierarchical radiosity method
  Axel Podehl, Thomas Rauber, Gudula Rünger
  Lecture Notes in Computer Science 1123, 1996, pp. 789-798
• List ranking on interconnection networks
  Jop F. Sibeyn
  Lecture Notes in Computer Science 1123, 1996, pp. 799-808
• Parallel algorithm for computing the fragment vector in Steiner triple systems
  Erik Urland
  Lecture Notes in Computer Science 1123, 1996, pp. 809-812
• Representation of the Gabow algorithm for finding smallest spanning trees with a degree constraint on associative parallel processors
  Ann S. Nepomniaschaya
  Lecture Notes in Computer Science 1123, 1996, pp. 813-817
• Runtime support for replicated parallel simulators of an ATM network on workstation clusters
  Kam Hong Shum, Shuo-Yen Robert Li
  Lecture Notes in Computer Science 1123, 1996, pp. 818-821
• Shared-memory implementation of an irregular particle simulation method
  Thomas Rauber, Gudula Rünger, Carsten Scholtes
  Lecture Notes in Computer Science 1123, 1996, pp. 822-827
• A parallel algorithm for the technology mapping of LUT-based FPGAs
  Vamsi Boppana, Prashant Saxena, Prithviraj Banerjee, W. Kent Fuchs, C.L. Liu
  Lecture Notes in Computer Science 1123, 1996, pp. 828-831
• Distributed string matching algorithm on the N-cube
  Fouzia Moussouni, Christian Lavault
  Lecture Notes in Computer Science 1123, 1996, pp. 832-835