The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hosam M. Mahmoud: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rafik Aguech, Nabil Lasmar, Hosam M. Mahmoud
    Distances in random digital search trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2006, v:43, n:4, pp:243-264 [Journal]
  2. Hosam M. Mahmoud
    The size of random bucket trees via urn models. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2002, v:38, n:11/12, pp:813-838 [Journal]
  3. Hosam M. Mahmoud
    Random sprouts as internet models, and Pólya processes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2004, v:41, n:1, pp:1-18 [Journal]
  4. Hosam M. Mahmoud
    Erratum: The size of random bucket trees via urn models. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2004, v:41, n:1, pp:63- [Journal]
  5. Hosam M. Mahmoud
    On the Average Internal Path Length of m -ary Search Trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1986, v:23, n:1, pp:111-117 [Journal]
  6. Hosam M. Mahmoud, Philippe Flajolet, Philippe Jacquet, Mireille Régnier
    Analytic Variations on Bucket Selection and Sorting. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2000, v:36, n:9/10, pp:735-760 [Journal]
  7. Hosam M. Mahmoud, Tatsuie Tsukiji
    Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2004, v:41, n:2-3, pp:99-110 [Journal]
  8. Hosam M. Mahmoud
    The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:3, pp:313-323 [Journal]
  9. Hosam M. Mahmoud, Robert T. Smythe
    Probabilistic Analysis of MULTIPLE QUICK SELECT. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:4, pp:569-584 [Journal]
  10. Tatsuie Tsukiji, Hosam M. Mahmoud
    A Limit Law for Outputs in Random Recursive Circuits. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:3, pp:403-412 [Journal]
  11. Hosam M. Mahmoud
    The Expected Distribution of Degrees in Random Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1986, v:29, n:1, pp:36-37 [Journal]
  12. Mehri Javanian, Hosam M. Mahmoud, Mohammad Vahidi-Asl
    Paths in m-ary interval trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:287, n:1-3, pp:45-53 [Journal]
  13. Ratko Orlandic, Hosam M. Mahmoud
    Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:3, pp:209-226 [Journal]
  14. Hosam M. Mahmoud
    On Rotations in Fringe-Balanced Binary Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:1, pp:41-46 [Journal]
  15. Hosam M. Mahmoud, Reza Modarres, Robert T. Smythe
    Analysis of Quickselect: An Algorithm for Order Statistics. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:4, pp:255-276 [Journal]
  16. Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, Hosam M. Mahmoud, Helmut Prodinger
    A multivariate view of random bucket digital search trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:44, n:1, pp:121-158 [Journal]
  17. Hosam M. Mahmoud, Boris Pittel
    Analysis of the Space of Search Trees under the Random Insertion Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:1, pp:52-75 [Journal]
  18. Yoshiaki Itoh, Hosam M. Mahmoud, Daisuke Takahashi
    A stochastic model for solitons. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:1, pp:51-64 [Journal]
  19. Hosam M. Mahmoud, Robert T. Smythe
    Asymptitic Hoint Normality of Outdegrees of Nodes in Random Recursive Trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:3, pp:255-266 [Journal]
  20. Hosam M. Mahmoud, Robert T. Smythe, Mireille Régnier
    Analysis of Boyer-Moore-Horspool string-matching heuristic. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:1-2, pp:169-186 [Journal]
  21. Hosam M. Mahmoud, Robert T. Smythe, Jerzy Szymanski
    On the Structure of Random Plane-oriented Recursive Trees and Their Branches. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:2, pp:151-176 [Journal]
  22. William Lew, Hosam M. Mahmoud
    The Joint Distribution of Elastic Buckets in Multiway Search Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:1050-1074 [Journal]
  23. Hosam M. Mahmoud, Robert T. Smythe
    Probabilistic Analysis of Bucket Recursive Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:144, n:1&2, pp:221-249 [Journal]

  24. Corrigendum. [Citation Graph (, )][DBLP]


  25. On the joint distribution of the insertion path length and the number of comparisons in search trees. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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