Conrado Martinez Parra

Conrado Martinez Parra is a Professor in the Department of Computer Science at the Faculty of Computer Science, Universitat Politècnica de Catalunya (UPC). He is a core member of the ALBCOM research group, which focuses on Algorithmics, Bioinformatics, Complexity, and Formal Methods.

• Affiliation: Department of Computer Science, Faculty of Computer Science (FIB), UPC
• Research Group: ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals
• Email: conrado@cs.upc.edu
• ORCID: 0000-0003-1302-9067
• Researcher ID: G-4629-2015

His research spans theoretical computer science with a strong emphasis on the design and analysis of algorithms and data structures. His work includes average-case analysis of algorithms, combinatorial generation, probabilistic methods in algorithmics, and applications in information retrieval and data stream processing. He has extensively studied multidimensional data structures such as quadtrees, K-d trees, and skip lists, analyzing their performance under various query models including partial match and orthogonal range searches.

His recent publications reveal a sustained focus on algorithmic efficiency, sampling techniques, and probabilistic modeling in data structures. Trends indicate a deep engagement with randomized algorithms, unbiased estimation, and cache-efficient selection methods, reflecting both theoretical rigor and practical applicability in modern computing environments.

Scientific Contributions

• Extensive publication record spanning over three decades, from 1989 to 2024.
• Active in major algorithmic conferences such as ANALCO, AofA, and AAAI.
• Contributions to foundational algorithm analysis including Hoare’s FIND, Quickselect variants, and deletion in binary search trees.
• Collaborative research with prominent figures in theoretical computer science across Europe.

Professor Martinez Parra has advised or collaborated with several doctoral students, including Gustavo Lau, whose thesis on partial match queries he supervised. He has participated in numerous competitive R&D projects funded by national and regional programs, focusing on large-scale information processing and graph-based computing models. His work is supported by long-standing grants from Spanish and Catalan research councils.

He is affiliated with the ALBCOM research group, a leading team in algorithmic research at UPC, contributing to both theoretical advances and practical implementations in combinatorics and data structure optimization.