| 2004 |
|---|
| 27 | EE | Peter Kirschenhofer,
Jörg M. Thuswaldner:
Elements of small norm in Shanks' cubic extensions of imaginary quadratic fields.
J. Symb. Comput. 38(6): 1471-1486 (2004) |
| 2002 |
|---|
| 26 | EE | Peter J. Grabner,
Peter Kirschenhofer,
Robert F. Tichy:
Combinatorial and Arithmetical Properties of Linear Numeration Systems.
Combinatorica 22(2): 245-267 (2002) |
| 1998 |
|---|
| 25 | | Peter Kirschenhofer,
Helmut Prodinger:
Comparisons in Hoare's Find Algorithm.
Combinatorics, Probability & Computing 7(1): 111-120 (1998) |
| 1997 |
|---|
| 24 | | Peter Kirschenhofer,
Helmut Prodinger,
Conrado Martinez:
Analysis of Hoare's FIND algorithm with Median-of-three partition.
Random Struct. Algorithms 10(1-2): 143-156 (1997) |
| 1996 |
|---|
| 23 | EE | Peter Kirschenhofer:
A note on alternating sums.
Electr. J. Comb. 3(2): (1996) |
| 22 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
Analysis of a splitting process arising in probabilistic counting and other related algorithms.
Random Struct. Algorithms 9(4): 379-401 (1996) |
| 1995 |
|---|
| 21 | EE | Peter Kirschenhofer,
Conrado Martinez,
Helmut Prodinger:
Analysis of an Optimized Search Algorithm for Skip Lists.
Theor. Comput. Sci. 144(1&2): 199-220 (1995) |
| 1994 |
|---|
| 20 | | Peter Kirschenhofer,
Helmut Prodinger:
The Path Length of Random Skip Lists.
Acta Inf. 31(8): 775-792 (1994) |
| 19 | | Peter Kirschenhofer,
Helmut Prodinger:
Multidimensional Digital Searching-Alternative Data Structures.
Random Struct. Algorithms 5(1): 123-134 (1994) |
| 18 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
Digital Search Trees Again Revisited: The Internal Path Length Perspective.
SIAM J. Comput. 23(3): 598-616 (1994) |
| 17 | | Philippe Flajolet,
Peter J. Grabner,
Peter Kirschenhofer,
Helmut Prodinger,
Robert F. Tichy:
Mellin Transforms and Asymptotics: Digital Sums.
Theor. Comput. Sci. 123(2): 291-314 (1994) |
| 1993 |
|---|
| 16 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
Multidimensional Digital Searching and Some New Parameters in Tries.
Int. J. Found. Comput. Sci. 4(1): 69-84 (1993) |
| 1992 |
|---|
| 15 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems.
ICALP 1992: 211-222 |
| 14 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter.
Theor. Comput. Sci. 106(2): 395-400 (1992) |
| 1991 |
|---|
| 13 | | Peter Kirschenhofer,
Helmut Prodinger:
Approximate counting: an alternative approach.
ITA 25: 43-48 (1991) |
| 12 | | Michael Drmota,
Peter Kirschenhofer:
On Generalized Independent Subsets of Trees.
Random Struct. Algorithms 2(2): 187-208 (1991) |
| 1989 |
|---|
| 11 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
Digital Search Trees - Further Results on a Fundamental Data Structure.
IFIP Congress 1989: 443-447 |
| 10 | EE | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
On the variance of the external path length in a symmetric digital trie.
Discrete Applied Mathematics 25(1-2): 129-143 (1989) |
| 9 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
On the Balance Property of Patricia Tries: External Path Length Viewpoint.
Theor. Comput. Sci. 68(1): 1-17 (1989) |
| 1988 |
|---|
| 8 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
Do We Really Need to Balance Patricia Trees? (Extended Abstract).
ICALP 1988: 302-316 |
| 7 | | Peter Kirschenhofer,
Helmut Prodinger:
Further Results on Digital Search Trees.
Theor. Comput. Sci. 58: 143-154 (1988) |
| 1987 |
|---|
| 6 | | Peter Kirschenhofer,
Helmut Prodinger:
On the Recursive Depth of Special Tree Traversal Algorithms
Inf. Comput. 74(1): 15-32 (1987) |
| 1986 |
|---|
| 5 | | Peter Kirschenhofer,
Helmut Prodinger:
Some Further Results on Digital Search Trees.
ICALP 1986: 177-185 |
| 4 | EE | Peter Kirschenhofer,
Helmut Prodinger:
Two selection problems revisited.
J. Comb. Theory, Ser. A 42(2): 310-316 (1986) |
| 1984 |
|---|
| 3 | | Peter Kirschenhofer,
Helmut Prodinger:
Recursion Depth Analysis for Specail Tree Traversal Algorithms.
ICALP 1984: 303-311 |
| 2 | EE | Peter Kirschenhofer,
Helmut Prodinger:
A short proof for a partition identity of Hwang and Wei.
Discrete Mathematics 52(2-3): 305-306 (1984) |
| 1982 |
|---|
| 1 | | Peter Kirschenhofer,
Helmut Prodinger:
On the average hyperoscillations of planted plane trees.
Combinatorica 2(2): 177-186 (1982) |
