- CSB - MetaPress - Google - Bing - Yahoo
 | 2004 | |
|---|---|---|
| j23 |      | 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) |
| 2003 | ||
| j22 | | Peter Kirschenhofer, Oliver Pfeiffer: Diophantine equations between polynomials obeying second order recurrences. Periodica Mathematica Hungarica 47(1-2): 119-134 (2003) |
| 2002 | ||
| j21 | | Peter J. Grabner, Peter Kirschenhofer, Robert F. Tichy: Combinatorial and Arithmetical Properties of Linear Numeration Systems. Combinatorica 22(2): 245-267 (2002) |
| 1998 | ||
| j20 | | Peter Kirschenhofer, Helmut Prodinger: Comparisons in Hoare's Find Algorithm. Combinatorics, Probability & Computing 7(1): 111-120 (1998) |
| 1997 | ||
| j19 | | 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 | ||
| j18 | | |
| j17 | | 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 | ||
| j16 | | 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 | ||
| j15 | | Peter Kirschenhofer, Helmut Prodinger: The Path Length of Random Skip Lists. Acta Inf. 31(8): 775-792 (1994) |
| j14 | | Peter Kirschenhofer, Helmut Prodinger: Multidimensional Digital Searching-Alternative Data Structures. Random Struct. Algorithms 5(1): 123-134 (1994) |
| j13 | | Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: Digital Search Trees Again Revisited: The Internal Path Length Perspective. SIAM J. Comput. 23(3): 598-616 (1994) |
| j12 | | 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 | ||
| j11 | | 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 | ||
| j10 | | 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) |
| c5 | | 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 |
| 1991 | ||
| j9 |  | Peter Kirschenhofer, Helmut Prodinger: Approximate counting: an alternative approach. ITA 25: 43-48 (1991) |
| j8 | | Michael Drmota, Peter Kirschenhofer: On Generalized Independent Subsets of Trees. Random Struct. Algorithms 2(2): 187-208 (1991) |
| 1989 | ||
| j7 | | 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) |
| j6 | | 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) |
| c4 | | Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: Digital Search Trees - Further Results on a Fundamental Data Structure. IFIP Congress 1989: 443-447 |
| 1988 | ||
| j5 | | Peter Kirschenhofer, Helmut Prodinger: Further Results on Digital Search Trees. Theor. Comput. Sci. 58: 143-154 (1988) |
| c3 | | Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: Do We Really Need to Balance Patricia Trees? (Extended Abstract). ICALP 1988: 302-316 |
| 1987 | ||
| j4 | | Peter Kirschenhofer, Helmut Prodinger: On the Recursive Depth of Special Tree Traversal Algorithms. Inf. Comput. 74(1): 15-32 (1987) |
| 1986 | ||
| j3 | | Peter Kirschenhofer, Helmut Prodinger: Two selection problems revisited. J. Comb. Theory, Ser. A 42(2): 310-316 (1986) |
| c2 | | Peter Kirschenhofer, Helmut Prodinger: Some Further Results on Digital Search Trees. ICALP 1986: 177-185 |
| 1984 | ||
| j2 | | Peter Kirschenhofer, Helmut Prodinger: A short proof for a partition identity of Hwang and Wei. Discrete Mathematics 52(2-3): 305-306 (1984) |
| c1 | | Peter Kirschenhofer, Helmut Prodinger: Recursion Depth Analysis for Specail Tree Traversal Algorithms. ICALP 1984: 303-311 |
| 1982 | ||
| j1 | | Peter Kirschenhofer, Helmut Prodinger: On the average hyperoscillations of planted plane trees. Combinatorica 2(2): 177-186 (1982) |
| 1 | Michael Drmota | |
| 2 | Philippe Flajolet | |
| 3 | Peter J. Grabner | |
| 4 | Conrado Martínez (Conrado Martinez) | |
| 5 | Oliver Pfeiffer | |
| 6 | Helmut Prodinger | |
| 7 | Wojciech Szpankowski | |
| 8 | Jörg M. Thuswaldner | |
| 9 | Robert F. Tichy |
Data released under the ODC-BY 1.0 license — See also our legal information page