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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Adriano M. Garsia

dblp:50/4349 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

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

Theory of computation · 2 · 1 first-author

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
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › tree data structures
binary trees		 0.011977
A New Algorithm for Minimum Cost Binary Trees · SIAM J. Comput. 1977
Algorithms and data structures
dynamic programming		 0.011977
A New Algorithm for Minimum Cost Binary Trees · SIAM J. Comput. 1977
Algorithms and data structures › data structure design › search structures › search trees
optimal binary search tree		 0.011977
A New Algorithm for Minimum Cost Binary Trees · SIAM J. Comput. 1977

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

linear time implementation · 0.0finite variational methods · 0.0
YearPublicationVenuePosition
2013 Explicit formulas for a sequence of binary tree polynomials
Michele D'Adderio, Adriano M. Garsia
 Theor. Comput. Sci.2
1977 A New Algorithm for Minimum Cost Binary Trees
abstract
A new algorithm for constructing minimum cost binary trees in $O(n \log n)$ time is presented. The algorithm is similar to the well-known Hu-Tucker algorithm. Our proof of validity is based on finite variational methods and is therefore quite different and somewhat simpler than the proof for the Hu-Tucker algorithm. Our proof also yields some additional information about the structure of minimum cost binary trees. This permits a linear time implementation of our algorithm in a special case.
Adriano M. Garsia, Michelle L. Wachs
 SIAM J. Comput.1