Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Manrique Mata-Montero

dblp:64/4780 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › sequences › sequence design
difference triangle sets
0.112005
Using directed hill-climbing for the construction of difference triangle sets · IEEE Trans. Inf. Theory 2005
Coding theory
upper bounds
0.112005
Using directed hill-climbing for the construction of difference triangle sets · IEEE Trans. Inf. Theory 2005

Methods — techniques the papers use, named apart from their topics

directed hill-climbing · 0.1
YearPublicationVenuePosition
2005 Using directed hill-climbing for the construction of difference triangle sets
abstract
This correspondence describes the use of the directed hill-climbing algorithm for finding improved upper bounds of difference triangle sets.
Sharon Koubi, Manrique Mata-Montero, Nabil Shalaby
IEEE Trans. Inf. Theory2
1994 Serial and Parallel Algorithms for (k, 2)-Partite Graphs
John A. Ellis, Manrique Mata-Montero, Hausi A. Müller
J. Parallel Distributed Comput.2