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

Mark Brehob

dblp:86/3146 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2005
—ORCID · none

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

Theory of computation · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorSecurity and privacy · 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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Memory systems · 72% Electronic design automation · 14% Parallel and multicore computing · 14%
Theoretical computer science
2 papers
Approximation and online algorithms · 57% Computational complexity · 43%

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

TopicWeightPapersLastEvidence papers
Memory systems
cache		 0.012004
Optimal Replacement Is NP-Hard for Nonstandard Caches · IEEE Trans. Computers 2004
Memory systems › cache management
cache replacement		 0.012004
Optimal Replacement Is NP-Hard for Nonstandard Caches · IEEE Trans. Computers 2004
Memory systems › cache management › cache replacement
optimal replacement		 0.012004
Optimal Replacement Is NP-Hard for Nonstandard Caches · IEEE Trans. Computers 2004
Approximation and online algorithms › online algorithms
caching		 0.012001
On-line restricted caching · SODA 2001
Approximation and online algorithms
online algorithms		 0.012001
On-line restricted caching · SODA 2001
Parallel and multicore computing
load balancing		 0.012000
Applying extra-resource analysis to load balancing · SODA 2000
Electronic design automation › high-level synthesis
scheduling		 0.012000
Applying extra-resource analysis to load balancing · SODA 2000

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

polynomial-time approximation scheme · 0.1competitive analysis · 0.0extra-resource analysis · 0.0
YearPublicationVenuePosition
2005 Side Channel Analysis, Fault Injection and Applications - A Computationally Feasible SPA Attack on AES via Optimized Search
Joel VanLaven, Mark Brehob, Kevin J. Compton
 SEC2
2004 Optimal Replacement Is NP-Hard for Nonstandard Caches
abstract
When examining a new cache structure or replacement policy, the optimal policy is a useful baseline. We prove that finding the optimal schedule is NP-hard for any but the simplest of caches, and that no polynomial-time approximation scheme exists for this problem unless P=NP.
Mark Brehob, Stephen Wagner, Eric Torng, Richard J. Enbody
 IEEE Trans. Computers1
2001 On-line restricted caching
Mark Brehob, Richard J. Enbody, Eric Torng, Stephen Wagner
 SODA1
2000 Applying extra-resource analysis to load balancing
Mark Brehob, Eric Torng, Patchrawat Uthaisombut
 SODA1