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

• Logspace hierarchies, polynomial time and the complexity of fairness problems concerning \omega-machines
  Louis E. Rosier, Hsu-Chun Yen
  Lecture Notes in Computer Science 210, 1986, pp. 306-320
• On sparse oracles separating feasible complexity classes
  Juris Hartmanis, L. Hemachandra
  Lecture Notes in Computer Science 210, 1986, pp. 321-333
• On generalized Kolmogorov complexity
  José L. Balcázar, Ronald V. Book
  Lecture Notes in Computer Science 210, 1986, pp. 334-340
• Area-time optimal division for T=\Omega((\log n)^{1+e})
  Kurt Mehlhorn, F.P. Preparata
  Lecture Notes in Computer Science 210, 1986, pp. 341-352
• A time-space tradeoff for element distinctness
  A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson
  Lecture Notes in Computer Science 210, 1986, pp. 353-358
• Parallel machines and their communication theoretical limits
  K. Rüdiger Reischuk
  Lecture Notes in Computer Science 210, 1986, pp. 359-368