Wissenschaftliche Publikationen
Zeitschriftenartikel (4)
1.
Zeitschriftenartikel
15 (3), S. 135 - 136 (1982)
A Probabilistic Algorithm for Vertex Connectivity of Graphs. Information Processing Letters 2.
Zeitschriftenartikel
55 (1-3), S. 125 - 174 (1982)
The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees. Information and Control 3.
Zeitschriftenartikel
17, S. 157 - 184 (1982)
A New Data Structure for Representing Sorted Lists. Acta Informatica 4.
Zeitschriftenartikel
11 (4), S. 748 - 760 (1982)
A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions. SIAM Journal on Computing Konferenzbeitrag (3)
5.
Konferenzbeitrag
On the Program Size of Perfect and Universal Hash Functions. In: Proceedings of the 23th Annual IEEE Symposium on Foundations of Computer Science, S. 170 - 175. 23th Annual IEEE Symposium on Foundations of Computer Science, Chicago, IL, USA, 03. November 1982 - 05. November 1982. IEEE, New York, NY, USA (1982)
6.
Konferenzbeitrag
Balanced Trees as a Datastructure for Representing Sorted Lists. In: Colloquium Complexiteit en Algoritmen, S. 69 - 91 (Hg. Vitányi, P. M. B.; van Leeuwen, J.; van Emde Boas, P.). Colloquium Complexiteit en Algoritmen, Amsterdam, The Netherlands, 1982. Mathematisch Centrum, Amsterdam (1982)
7.
Konferenzbeitrag
Las Vegas Is better than Determinism in VLSI and Distributed Computing. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), S. 330 - 337. Untitled Event, San Francisco, California, USA, 05. Mai 1982. ACM, Baltimore, MD, USA (1982)
Sonstige (1)
8.
Sonstige
Cost tradeoffs in graph embeddings, with applications, (1982)