The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Conrado Martinez: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Conrado Martinez
    Average-case Analysis of Equality of Binary Trees Under the BST Probability Model. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:350-359 [Conf]
  2. Rafael Casas, Josep Díaz, Conrado Martinez
    Static on Random Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:186-203 [Conf]
  3. Conrado Martinez, Daniel Panario, Alfredo Viola
    Adaptive sampling for quickselect. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:447-455 [Conf]
  4. 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]
  5. 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]
  6. Philippe Flajolet, Xavier Gourdon, Conrado Martinez
    Patterns in random binary search trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:3, pp:223-244 [Journal]
  7. 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]
  8. Ricardo A. Baeza-Yates, Rafael Casas, Josep Díaz, Conrado Martinez
    On the Average Size of the Intersection of Binary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:24-32 [Journal]
  9. Rafael Casas, Josep Díaz, Conrado Martinez
    Average-Case Analysis on Simple Families of Trees Using a Balanced Probability Model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:117, n:1&2, pp:99-112 [Journal]
  10. Joaquim Gabarró, Conrado Martinez, Xavier Messeguer
    A Design of a Parallel Dictionary Using Skip Lists. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:158, n:1&2, pp:1-33 [Journal]
  11. 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]

Search in 0.002secs, Finished in 0.003secs
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