Bibliograph.
Daten | Hertrampf, Ulrich; Bergen, Andreas: 32. Workshop ueber Komplexitaetstheorie, Datenstrukturen und effiziente Algorithmen.
Universität Stuttgart, Fakultät Informatik, Fakultätsbericht Nr. 1997/04.
17 Seiten, deutsch.
|
|---|
| CR-Klassif. | E.1 (Data Structures)
F.1.3 (Complexity Classes)
F.2 (Analysis of Algorithms and Problem Complexity)
|
|---|
| Kurzfassung | This report contains the abstracts of all talks that were presented at the 32nd Workshop on Complexity Theory, Data Structures, and Efficient Algorithms held on June 17th, 1997, at the computer-science department of the University of Stuttgart, Germany. This so-called "Theorietag" is a joint event of the working groups 0.1.4 ("Complexity") and 0.1.3 ("Parallel and distributed algorithms") of the German Association for Computer Science (GI).
|
|---|
Volltext und
andere Links | HTML (aus PostScript generiert)
|
|---|
| Abteilung(en) | Universität Stuttgart, Institut für Informatik, Theoretische Informatik
|
|---|
| Eingabedatum | 18. Juni 1997 |
|---|