The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Peter Kirschenhofer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  27. On the variance of the external path length in a symmetric digital trie. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002