The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael Drmota: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Drmota, Hsien-Kuei Hwang, Wojciech Szpankowski
    Precise Average Redundancy Of An Idealized Arithmetic Codin. [Citation Graph (0, 0)][DBLP]
    DCC, 2002, pp:222-0 [Conf]
  2. Michael Drmota
    Discrete Random Walks on One-Sided "Periodic" Graphs. [Citation Graph (0, 0)][DBLP]
    DRW, 2003, pp:83-94 [Conf]
  3. Michael Drmota, Wojciech Szpankowski
    Generalized Shannon Code Minimizes the Maximal Redundancy. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:306-318 [Conf]
  4. Michael Drmota
    The variance of the height of digital search trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2002, v:38, n:4, pp:261-276 [Journal]
  5. F. T. Bruss, Michael Drmota, Guy Louchard
    The Complete Solution of the Competitive Rank Selection Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:4, pp:413-447 [Journal]
  6. Michael Drmota
    An Analytic Approach to the Height of Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:1, pp:89-119 [Journal]
  7. Michael Drmota
    The Asymptotic Number of Leftist Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:3, pp:304-317 [Journal]
  8. Michael Drmota, Danièle Gardy, Bernhard Gittenberger
    A Unified Presentation of Some Urn Models. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:1, pp:120-147 [Journal]
  9. Gerd Baron, Michael Drmota, Ljuben R. Mutafchiev
    Predecessors in Random Mappings. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:317-335 [Journal]
  10. Michael Drmota, Wojciech Szpankowski
    Special Issue on Analysis of Algorithms. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:4-5, pp:415-417 [Journal]
  11. Michael Drmota, Daniel Panario
    A Rigorous Proof of the Waterloo Algorithm for the Discrete Logarithm Problem. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2002, v:26, n:1-3, pp:229-241 [Journal]
  12. Michael Drmota, Helmut Prodinger
    The height of q-Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2002, v:5, n:1, pp:97-108 [Journal]
  13. Michael Drmota, Wojciech Szpankowski
    Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk"). [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:80, n:, pp:61-76 [Journal]
  14. Michael Drmota
    A Bivariate Asymptotic Expansion of Coefficients of Powers of Generating Functions. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1994, v:15, n:2, pp:139-152 [Journal]
  15. Michael Drmota
    An analytic approach to the height of binary search trees II. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:3, pp:333-374 [Journal]
  16. Michael Drmota
    Asymptotic Distributions and a Multivariate Darboux Method in Enumeration Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:67, n:2, pp:169-184 [Journal]
  17. Michael Drmota
    The Instability Time Distribution Behavior of Slotted ALOHA. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:1, pp:33-44 [Journal]
  18. Michael Drmota
    Correlations on the Strata of a Random Mapping. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:357-366 [Journal]
  19. Michael Drmota
    Systems of functional equations. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:1-2, pp:103-124 [Journal]
  20. Michael Drmota, Bernhard Gittenberger
    On the profile of random trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:4, pp:421-451 [Journal]
  21. Michael Drmota, Danièle Gardy, Bernhard Gittenberger
    General urn models with several types of balls and Gaussian limiting fields. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:1, pp:75-103 [Journal]
  22. 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]
  23. Michael Drmota, Hsien-Kuei Hwang
    Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:19-45 [Journal]
  24. Michael Drmota, Michèle Soria
    Images and Preimages in Random Mappings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:2, pp:246-269 [Journal]
  25. Michael Drmota, Helmut Prodinger
    The register function for t-ary trees. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:3, pp:318-334 [Journal]
  26. Michael Drmota
    The Variance of the height of binary search trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:913-919 [Journal]
  27. Michael Drmota
    On Robson's convergence and boundedness conjectures concerning the height of binary search trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:329, n:1-3, pp:47-70 [Journal]
  28. Michael Drmota, Michèle Soria
    Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:144, n:1&2, pp:67-99 [Journal]
  29. Michael Drmota, Wojciech Szpankowski
    Precise minimax redundancy and regret. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2686-2707 [Journal]
  30. Michael Drmota, Ulrich Schmid
    The analysis of the expected successful operation time of slotted Aloha. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:5, pp:1567-1577 [Journal]
  31. Brigitte Chauvin, Michael Drmota
    The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:3-4, pp:299-327 [Journal]
  32. Frédéric Chyzak, Michael Drmota, Thomas Klausner, Gerard Kok
    The Distribution of Patterns in Random Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  33. Michael Drmota, Bernhard Gittenberger
    The Width of Galton-Watson Trees Conditioned by the Size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:387-400 [Journal]

  34. (Un)expected behavior of digital search tree profile. [Citation Graph (, )][DBLP]


  35. Combinatorial Models for Cooperation Networks. [Citation Graph (, )][DBLP]


  36. Embedded Trees and the Support of the ISE. [Citation Graph (, )][DBLP]


  37. The Distribution of Patterns in Random Trees. [Citation Graph (, )][DBLP]


  38. Newman's phenomenon for generalized Thue-Morse sequences. [Citation Graph (, )][DBLP]


  39. The shape of unlabeled rooted random trees. [Citation Graph (, )][DBLP]


Search in 0.221secs, Finished in 0.222secs
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