Scientific Publications
Journal Article (4)
1.
Journal Article
16 (5), pp. 808 - 835 (1987)
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. SIAM Journal on Computing 2.
Journal Article
25 (4), pp. 269 - 273 (1987)
A log log n Data Structure for Three-sided Range Queries. Information Processing Letters 3.
Journal Article
75 (1), pp. 39 - 51 (1987)
Towards Optimal Parallel Bucket Sorting. Information and Computation 4.
Journal Article
72 (3), pp. 270 - 282 (1987)
Area-Time Optimal Division for T=Omega((log n)^1+epsilon). Information and Computation Proceedings (2)
5.
Proceedings
269). International Workshop on Parallel Algorithms and Architectures, Suhl, FRG, May 27, 1987 - May 30, 1987. Springer, Berlin (1987), 205 pp.
Parallel Algorithms and Architectures (Lecture Notes in Computer Science, 6.
Proceedings
87,4). Workshop über Komplexitätstheorie, Effiziente Algorithmen und Datenstrukturen, Frankfurt, Main, Germany, February 03, 1987. Johann Wolfgang Goethe-Universität, Frankfurt/Main (1987), 10 pp.
Workshop über Komplexitätstheorie, Effiziente Algorithmen und Datenstrukturen (Interner Bericht / Fachbereich Informatik, Conference Paper (4)
7.
Conference Paper
Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. In: Parallel Algorithms and Architectures, pp. 11 - 15. International Workshop on Parallel Algorithms and Architectures, Suhl, FRG, May 25, 1987. Springer, Berlin (1987)
8.
Conference Paper
Convergence, Similarity and Symmetries of Geometric Objects. In: Computational geometry (SCG-87): 3rd symposium, pp. 308 - 315. Untitled Event, Waterloo, Canada, June 08, 1987. ACM, New York, USA (1987)
9.
Conference Paper
On Local Routing of Two-Terminal Nets. In: STACS 87, pp. 40 - 52 (Eds. Brandenburg, F. J.; Vidal-Naquet, G.; Wirsing, M.). 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, February 19, 1987 - February 21, 1987. Springer, Berlin, Germany (1987)
10.
Conference Paper
A Lower Bound for the Complexity of the Union-Split-Find Problem. In: Automata, Languages and Programming (ICALP-87): 14th International Colloquium, pp. 479 - 488. Untitled Event, Karlsruhe, Federal Republic of Germany, July 13, 1987. Springer, Berlin, Germany (1987)
Report (3)
11.
Report
Congruence, Similarity and Symmetries of Geometric Objects. Universität des Saarlandes / Fachbereich Informatik, Saarbrücken (1987)
12.
Report
Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees. SFB Sonderforschungsbereich 124, Universität des Saarlandes, Saarbrücken (1987)
13.
Report
A Faster Compaction Algorithm with Automatic Jog Insertion. Fachbereich 10, Informatik, Universität des Saarlandes, Saarbrücken (1987)
Other (1)
14.
Other
A Faster Approximation Algorithm for the Steiner Problem in Graphs, (1987)