| Bibliography | Hertrampf, Ulrich; Bergen, Andreas: 32. Workshop ueber Komplexitaetstheorie, Datenstrukturen und effiziente Algorithmen.
University of Stuttgart, Faculty of Computer Science, Technical Report No. 1997/04.
17 pages, german.
|
|---|
| CR-Schema | E.1 (Data Structures)
F.1.3 (Complexity Classes)
F.2 (Analysis of Algorithms and Problem Complexity)
|
|---|
| Abstract | 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).
|
|---|
Full text and
other links | HTML (generated from PostScript)
|
|---|
| Department(s) | University of Stuttgart, Institute of Computer Science, Theoretical Computer Science
|
|---|
| Entry date | June 18, 1997 |
|---|