The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alois Panholzer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alois Panholzer
    Non-crossing trees revisited: cutting down and spanning subtrees. [Citation Graph (0, 0)][DBLP]
    DRW, 2003, pp:265-276 [Conf]
  2. Conrado Martinez, Alois Panholzer, Helmut Prodinger
    Partial Match Queries in Relaxed Multidimensional Search Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:1, pp:181-204 [Journal]
  3. Alois Panholzer, Helmut Prodinger
    Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:4, pp:600-630 [Journal]
  4. Alois Panholzer
    The Height Distribution of Nodes in Non-Crossing Trees. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:69, n:, pp:- [Journal]
  5. Alois Panholzer, Helmut Prodinger
    Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1998, v:41, n:3, pp:201-204 [Journal]
  6. Conrado Martinez, Alois Panholzer, Helmut Prodinger
    On the Number of Descendants and Ascendants in Random Search Trees. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  7. Kate Morris, Alois Panholzer, Helmut Prodinger
    On Some Parameters in Heap Ordered Trees. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:4-5, pp:677-696 [Journal]
  8. Alois Panholzer
    Distribution of the Steiner Distance in Generalized M-ary Search Trees. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:4-5, pp:717-733 [Journal]
  9. Alois Panholzer, Helmut Prodinger
    Bijections for ternary trees and non-crossing trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:181-195 [Journal]
  10. Alois Panholzer, Helmut Prodinger
    Descendants and ascendants in binary trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 1997, v:1, n:2, pp:247-266 [Journal]
  11. Alois Panholzer, Helmut Prodinger, Marko Riedel
    Permuting in place: analysis of two stopping rules. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:51, n:2, pp:170-184 [Journal]
  12. Alois Panholzer
    The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:2, pp:179-207 [Journal]
  13. Alois Panholzer
    The climbing depth of random trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:1-2, pp:84-109 [Journal]
  14. Alois Panholzer, Helmut Prodinger
    A generating functions approach for the analysis of grand averages for multiple QUICKSELECT. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:189-209 [Journal]
  15. Jean-François Marckert, Alois Panholzer
    Noncrossing trees are almost conditioned Galton-Watson trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:1, pp:115-125 [Journal]
  16. Alois Panholzer
    Analysis of multiple quickselect variants. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:45-91 [Journal]
  17. Markus Kuba, Alois Panholzer
    The left-right-imbalance of binary search trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:370, n:1-3, pp:265-278 [Journal]
  18. James Allen Fill, Nevin Kapur, Alois Panholzer
    Destruction of Very Simple Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:3-4, pp:345-366 [Journal]
  19. Alois Panholzer, Helmut Prodinger
    Analysis of some statistics for increasing tree families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:437-460 [Journal]
  20. Markus Kuba, Alois Panholzer
    On the degree distribution of the nodes in increasing trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2007, v:114, n:4, pp:597-618 [Journal]

  21. Descendants in Increasing Trees. [Citation Graph (, )][DBLP]


  22. A distributional study of the path edge-covering numbers for random trees. [Citation Graph (, )][DBLP]


  23. On the distribution of distances between specified nodes in increasing trees. [Citation Graph (, )][DBLP]


  24. On edge-weighted recursive trees and inversions in random permutations. [Citation Graph (, )][DBLP]


  25. Analysis of Some Parameters for Random Nodes in Priority Trees. [Citation Graph (, )][DBLP]


  26. Enumeration results for alternating tree families. [Citation Graph (, )][DBLP]


Search in 0.147secs, Finished in 0.148secs
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