Peter Kirschenhofer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2015

A Number Theoretic Problem on the Distribution of Polynomials With Bounded RootsPeter Kirschenhofer, Mario Weitzer. int, 15, 2015. [doi]

2004

Elements of small norm in Shanks cubic extensions of imaginary quadratic fieldsPeter Kirschenhofer, Jörg M. Thuswaldner. JSC, 38(6):1471-1486, 2004. [doi]

2003

Diophantine equations between polynomials obeying second order recurrencesPeter Kirschenhofer, Oliver Pfeiffer. pmh, 47(1-2):119-134, 2003. [doi]

2002

Combinatorial and Arithmetical Properties of Linear Numeration SystemsPeter J. Grabner, Peter Kirschenhofer, Robert F. Tichy. combinatorica, 22(2):245-267, 2002. [doi]

1998

Comparisons in Hoare s Find AlgorithmPeter Kirschenhofer, Helmut Prodinger. cpc, 7(1):111-120, 1998.

1997

Analysis of Hoare s FIND algorithm with Median-of-three partitionPeter Kirschenhofer, Helmut Prodinger, Conrado Martinez. rsa, 10(1-2):143-156, 1997.

1996

A note on alternating sumsPeter Kirschenhofer. combinatorics, 3(2), 1996. [doi]

Analysis of a splitting process arising in probabilistic counting and other related algorithmsPeter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski. rsa, 9(4):379-401, 1996.

1995

Analysis of an Optimized Search Algorithm for Skip ListsPeter Kirschenhofer, Conrado Martinez, Helmut Prodinger. TCS, 144(1&2):199-220, 1995. [doi]

1994

Mellin Transforms and Asymptotics: Digital SumsPhilippe Flajolet, Peter J. Grabner, Peter Kirschenhofer, Helmut Prodinger, Robert F. Tichy. TCS, 123(2):291-314, 1994.

The Path Length of Random Skip ListsPeter Kirschenhofer, Helmut Prodinger. ACTA, 31(8):775-792, 1994.

Multidimensional Digital Searching-Alternative Data StructuresPeter Kirschenhofer, Helmut Prodinger. rsa, 5(1):123-134, 1994.

Digital Search Trees Again Revisited: The Internal Path Length PerspectivePeter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski. SICOMP, 23(3):598-616, 1994.

1993

A result in order statistics related to probabilistic countingPeter Kirschenhofer, Helmut Prodinger. computing, 51(1):15-27, 1993. [doi]

Multidimensional Digital Searching and Some New Parameters in TriesPeter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski. ijfcs, 4(1):69-84, 1993.

1992

How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related ProblemsPeter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski. icalp 1992: 211-222

Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson s LetterPeter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski. TCS, 106(2):395-400, 1992.

1991

On Generalized Independent Subsets of TreesMichael Drmota, Peter Kirschenhofer. rsa, 2(2):187-208, 1991.

Approximate counting: an alternative approachPeter Kirschenhofer, Helmut Prodinger. ita, 25:43-48, 1991.

1989

Digital Search Trees - Further Results on a Fundamental Data StructurePeter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski. ifip 1989: 443-447

On the variance of the external path length in a symmetric digital triePeter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski. DAM, 25(1-2):129-143, 1989. [doi]

On the Balance Property of Patricia Tries: External Path Length ViewpointPeter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski. TCS, 68(1):1-17, 1989.

1988

Further Results on Digital Search TreesPeter Kirschenhofer, Helmut Prodinger. TCS, 58:143-154, 1988.

Do We Really Need to Balance Patricia Trees? (Extended Abstract)Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski. icalp 1988: 302-316

1987

On the Recursive Depth of Special Tree Traversal AlgorithmsPeter Kirschenhofer, Helmut Prodinger. iandc, 74(1):15-32, July 1987.

1986

Some Further Results on Digital Search TreesPeter Kirschenhofer, Helmut Prodinger. icalp 1986: 177-185

Two selection problems revisitedPeter Kirschenhofer, Helmut Prodinger. JCT, 42(2):310-316, 1986. [doi]

1984

On the average shape of monotonically labelled tree structuresPeter Kirschenhofer. DAM, 7(2):161-181, 1984. [doi]

Recursion Depth Analysis for Specail Tree Traversal AlgorithmsPeter Kirschenhofer, Helmut Prodinger. icalp 1984: 303-311

A short proof for a partition identity of Hwang and WeiPeter Kirschenhofer, Helmut Prodinger. DM, 52(2-3):305-306, 1984. [doi]

1983

On the average shape of simply generated families of treesPeter Kirschenhofer. jgt, 7(3):311-323, 1983. [doi]

1982

On the average hyperoscillations of planted plane treesPeter Kirschenhofer, Helmut Prodinger. combinatorica, 2(2):177-186, 1982.

Sign in or sign up to see more results.

runs on WebDSL