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

Edward E. Rothberg

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

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 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
Mathematical optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 50% High-performance computing · 50%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization
combinatorial optimization		 0.011996
Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound · SODA 1996
Mathematical optimization › combinatorial optimization › vehicle routing › traveling salesman problem
held-karp bound		 0.011996
Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound · SODA 1996
Mathematical optimization › combinatorial optimization › vehicle routing
traveling salesman problem		 0.011996
Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound · SODA 1996
High-performance computing › numerical linear algebra
blocked algorithms		 0.011991
The Cache Performance and Optimizations of Blocked Algorithms · ASPLOS 1991
Memory systems › memory access optimization
cache blocking		 0.011991
The Cache Performance and Optimizations of Blocked Algorithms · ASPLOS 1991
Memory systems › cache
cache performance		 0.011991
The Cache Performance and Optimizations of Blocked Algorithms · ASPLOS 1991
High-performance computing
performance optimization		 0.011991
The Cache Performance and Optimizations of Blocked Algorithms · ASPLOS 1991

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

asymptotic experimental analysis · 0.0cache simulation · 0.0
YearPublicationVenuePosition
1996 Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound
David S. Johnson 0001, Lyle A. McGeoch, Edward E. Rothberg
 SODA3
1991 The Cache Performance and Optimizations of Blocked Algorithms
abstract
article Free Access Share on The cache performance and optimizations of blocked algorithms Authors: Monica D. Lam View Profile , Edward E. Rothberg View Profile , Michael E. Wolf View Profile Authors Info & Claims ACM SIGOPS Operating Systems ReviewVolume 25Issue Special IssueApr. 1991 pp 63–74https://doi.org/10.1145/106974.106981Published:01 April 1991Publication History 704citation3,371DownloadsMetricsTotal Citations704Total Downloads3,371Last 12 Months344Last 6 weeks57 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Monica S. Lam, Edward E. Rothberg, Michael E. Wolf
 ASPLOS2