Conrado Martı́nez

722 total citations
32 papers, 272 citations indexed

About

Conrado Martı́nez is a scholar working on Artificial Intelligence, Signal Processing and Computer Networks and Communications. According to data from OpenAlex, Conrado Martı́nez has authored 32 papers receiving a total of 272 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Artificial Intelligence, 14 papers in Signal Processing and 11 papers in Computer Networks and Communications. Recurrent topics in Conrado Martı́nez's work include Algorithms and Data Compression (18 papers), Data Management and Algorithms (13 papers) and Advanced Combinatorial Mathematics (5 papers). Conrado Martı́nez is often cited by papers focused on Algorithms and Data Compression (18 papers), Data Management and Algorithms (13 papers) and Advanced Combinatorial Mathematics (5 papers). Conrado Martı́nez collaborates with scholars based in Spain, Austria and South Africa. Conrado Martı́nez's co-authors include Salvador Roura, Helmut Prodinger, Daniel Panario, Brett Stevens, Lucia Moura, Alois Panholzer, Xavier Molinero, Peter Kirschenhofer, Sebastian Wild and Alfredo Viola and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Conrado Martı́nez

31 papers receiving 242 citations

Peers

Conrado Martı́nez

CNC

CTM

SOFTW

Kevin J. Compton United States

Bohdan S. Majewski Australia

Benjamin Rossman United States

Mark R. Brown United States

Richard Statman United States

Markus Lohrey Germany

Vincent Vajnovszki France

Elad Verbin Israel

William A. Martin United States

Robert Rosebrugh Canada

Kevin J. Compton United States

Conrado Martı́nez

215 ×1.5

46 ×0.6

CNC

24 ×0.4

259 ×5.1

CTM

63 ×1.4

SOFTW

Citations per year, relative to Conrado Martı́nez Conrado Martı́nez (= 1×) peers Kevin J. Compton

Countries citing papers authored by Conrado Martı́nez

Since Specialization

Citations

This map shows the geographic impact of Conrado Martı́nez's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Conrado Martı́nez with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Conrado Martı́nez more than expected).

Fields of papers citing papers by Conrado Martı́nez

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Conrado Martı́nez. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Conrado Martı́nez. The network helps show where Conrado Martı́nez may publish in the future.

Co-authorship network of co-authors of Conrado Martı́nez

This figure shows the co-authorship network connecting the top 25 collaborators of Conrado Martı́nez. A scholar is included among the top collaborators of Conrado Martı́nez based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Conrado Martı́nez. Conrado Martı́nez is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Jiménez, Rosa María Rodríguez, et al.. (2012). Selection by rank in K‐dimensional binary search trees. Random Structures and Algorithms. 45(1). 14–37. 2 indexed citations

Helmi, Ahmed M., et al.. (2012). Data Streams as Random Permutations: the Distinct Element Problem. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AQ,...(Proceedings). 3 indexed citations

Martı́nez, Conrado, Daniel Panario, & Alfredo Viola. (2010). Adaptive sampling strategies for quickselects. ACM Transactions on Algorithms. 6(3). 1–45. 7 indexed citations

Martı́nez, Conrado & Uwe Rösler. (2010). Partial Quicksort and Quickpartitionsort. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AM,...(Proceedings). 4 indexed citations

Martı́nez, Conrado & Helmut Prodinger. (2009). Moves and displacements of particular elements in Quicksort. Theoretical Computer Science. 410(21-23). 2279–2284. 7 indexed citations

Martı́nez, Conrado, et al.. (2009). The Hiring Problem and Permutations. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AK,...(Proceedings). 4 indexed citations

Martı́nez, Conrado, et al.. (2009). Updating relaxed K -d trees. ACM Transactions on Algorithms. 6(1). 1–24. 2 indexed citations

Martı́nez, Conrado, Alois Panholzer, & Helmut Prodinger. (2008). Generating Random Derangements. 234–240. 7 indexed citations

Martı́nez, Conrado, et al.. (2007). On the average cost of insertions on random relaxed K-d trees. 194–200. 1 indexed citations

10.

Martı́nez, Conrado & Xavier Molinero. (2005). Efficient iteration in admissible combinatorial classes. Theoretical Computer Science. 346(2-3). 388–417. 2 indexed citations

11.

Martı́nez, Conrado, et al.. (2005). Improving the performance of multidimensional search using fingers. ACM Journal of Experimental Algorithmics. 10. 2 indexed citations

12.

Martı́nez, Conrado, Alois Panholzer, & Helmut Prodinger. (2001). Partial match queries in relaxed multidimensional search trees. Algorithmica. 29(1-2). 181–204. 17 indexed citations

13.

Martı́nez, Conrado & Salvador Roura. (2001). Optimal Sampling Strategies in Quicksort and Quickselect. SIAM Journal on Computing. 31(3). 683–705. 41 indexed citations

14.

Martı́nez, Conrado & Xavier Molinero. (2001). A generic approach for the unranking of labeled combinatorial classes. Random Structures and Algorithms. 19(3-4). 472–497. 11 indexed citations

15.

Martı́nez, Conrado & Salvador Roura. (2000). On the competitiveness of the move-to-front rule. Theoretical Computer Science. 242(1-2). 313–325. 9 indexed citations

16.

Martı́nez, Conrado & Salvador Roura. (1998). Randomized binary search trees. Journal of the ACM. 45(2). 288–323. 40 indexed citations

17.

Martı́nez, Conrado, Alois Panholzer, & Helmut Prodinger. (1998). On the Number of Descendants and Ascendants in Random Search Trees. The Electronic Journal of Combinatorics. 5(1). 5 indexed citations

18.

Prodinger, Helmut, et al.. (1997). Analysis of Hoare's FIND algorithm with Median‐of‐three partition. Random Structures and Algorithms. 10(12). 143–156. 1 indexed citations

19.

Gabarró, Joaquim, Conrado Martı́nez, & Xavier Messeguer. (1996). A design of a parallel dictionary using skip lists. Theoretical Computer Science. 158(1-2). 1–33. 5 indexed citations

20.

Kirschenhofer, Peter, Conrado Martı́nez, & Helmut Prodinger. (1995). Analysis of an optimized search algorithm for skip lists. Theoretical Computer Science. 144(1-2). 199–220. 18 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact