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

• Approximation algorithm for maximum independent set in planar triangle-free graphs
  C.E. Veni Madhavan
  Lecture Notes in Computer Science 181, 1984, pp. 381-392
• Grid file algorithms: An analysis in the biased case
  Mireille Regnier
  Lecture Notes in Computer Science 181, 1984, pp. 393-418
• On the mean weight balance factor of binary trees
  A.K. Pal, A. Bagchi
  Lecture Notes in Computer Science 181, 1984, pp. 419-434
• An efficient algorithm for random sampling without replacement
  P. Gupta, G.P. Bhattacharjee
  Lecture Notes in Computer Science 181, 1984, pp. 435-442
• Proof rules for communication abstractions
  Gadi Taubenfeld, Nissim Francez
  Lecture Notes in Computer Science 181, 1984, pp. 443-465