default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Kirschenhofer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j27]Peter Kirschenhofer, Mario Weitzer:
A Number Theoretic Problem on the Distribution of Polynomials With Bounded Roots. Integers 15: A10 (2015)
2000 – 2009
- 2004
- [j26]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
- [j25]Peter Kirschenhofer, Oliver Pfeiffer:
Diophantine equations between polynomials obeying second order recurrences. Period. Math. Hung. 47(1-2): 119-134 (2003) - 2002
- [j24]Peter J. Grabner, Peter Kirschenhofer, Robert F. Tichy:
Combinatorial and Arithmetical Properties of Linear Numeration Systems. Comb. 22(2): 245-267 (2002)
1990 – 1999
- 1998
- [j23]Peter Kirschenhofer, Helmut Prodinger:
Comparisons in Hoare's Find Algorithm. Comb. Probab. Comput. 7(1): 111-120 (1998) - 1997
- [j22]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
- [j21]Peter Kirschenhofer:
A note on alternating sums. Electron. J. Comb. 3(2) (1996) - [j20]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
- [j19]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
- [j18]Peter Kirschenhofer, Helmut Prodinger:
The Path Length of Random Skip Lists. Acta Informatica 31(8): 775-792 (1994) - [j17]Peter Kirschenhofer, Helmut Prodinger:
Multidimensional Digital Searching-Alternative Data Structures. Random Struct. Algorithms 5(1): 123-134 (1994) - [j16]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
Digital Search Trees Again Revisited: The Internal Path Length Perspective. SIAM J. Comput. 23(3): 598-616 (1994) - [j15]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
- [j14]Peter Kirschenhofer, Helmut Prodinger:
A result in order statistics related to probabilistic counting. Computing 51(1): 15-27 (1993) - [j13]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
- [j12]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
- [j11]Peter Kirschenhofer, Helmut Prodinger:
Approximate counting: an alternative approach. RAIRO Theor. Informatics Appl. 25: 43-48 (1991) - [j10]Michael Drmota, Peter Kirschenhofer:
On Generalized Independent Subsets of Trees. Random Struct. Algorithms 2(2): 187-208 (1991)
1980 – 1989
- 1989
- [j9]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
On the variance of the external path length in a symmetric digital trie. Discret. Appl. Math. 25(1-2): 129-143 (1989) - [j8]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
- [j7]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
- [j6]Peter Kirschenhofer, Helmut Prodinger:
On the Recursive Depth of Special Tree Traversal Algorithms. Inf. Comput. 74(1): 15-32 (1987) - 1986
- [j5]Peter Kirschenhofer, Helmut Prodinger:
Two selection problems revisited. J. Comb. Theory A 42(2): 310-316 (1986) - [c2]Peter Kirschenhofer, Helmut Prodinger:
Some Further Results on Digital Search Trees. ICALP 1986: 177-185 - 1984
- [j4]Peter Kirschenhofer:
On the average shape of monotonically labelled tree structures. Discret. Appl. Math. 7(2): 161-181 (1984) - [j3]Peter Kirschenhofer, Helmut Prodinger:
A short proof for a partition identity of Hwang and Wei. Discret. Math. 52(2-3): 305-306 (1984) - [c1]Peter Kirschenhofer, Helmut Prodinger:
Recursion Depth Analysis for Specail Tree Traversal Algorithms. ICALP 1984: 303-311 - 1983
- [j2]Peter Kirschenhofer:
On the average shape of simply generated families of trees. J. Graph Theory 7(3): 311-323 (1983) - 1982
- [j1]Peter Kirschenhofer, Helmut Prodinger:
On the average hyperoscillations of planted plane trees. Comb. 2(2): 177-186 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
