Travelled to:1 × Belgium
1 × Finland
1 × France
3 × Austria
Collaborated with:P.Kirschenhofer W.Szpankowski ∅ W.Kuich F.J.Urbanek
Talks about:tree (4) analysi (2) count (2) probabilist (1) represent (1) algorithm (1) patricia (1) travers (1) special (1) problem (1)
Person: Helmut Prodinger
DBLP: Prodinger:Helmut
Contributed to:
2001
19921988198619841979Wrote 6 papers:
- DLT-2001-Prodinger #permutation #word
- Words, Permutations, and Representations of Numbers (HP), pp. 81–99.
- ICALP-1992-KirschenhoferPS #analysis #how #probability #problem
- How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems (PK, HP, WS), pp. 211–222.
- ICALP-1988-KirschenhoferPS #question
- Do We Really Need to Balance Patricia Trees? (PK, HP, WS), pp. 302–316.
- ICALP-1986-KirschenhoferP
- Some Further Results on Digital Search Trees (PK, HP), pp. 177–185.
- ICALP-1984-KirschenhoferP #algorithm #analysis #recursion #traversal
- Recursion Depth Analysis for Special Tree Traversal Algorithms (PK, HP), pp. 303–311.
- ICALP-1979-KuichPU #on the
- On the Height of Derivation Trees (WK, HP, FJU), pp. 370–384.