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

Stephen Wagner

dblp:30/6739 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

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

Theory of computation · 2Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 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
3 papers
Approximation and online algorithms · 55% Computational complexity · 32% Distributed computing theory · 12%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

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

TopicWeightPapersLastEvidence papers
Approximation and online algorithms
online algorithms		 0.022001
On-line restricted caching · SODA 2001
The k-Client Problem · SODA 1997
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

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

polynomial-time approximation scheme · 0.1competitive analysis · 0.0
YearPublicationVenuePosition
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. Computers2
2001 On-line restricted caching
Mark Brehob, Richard J. Enbody, Eric Torng, Stephen Wagner
 SODA4
1999 A COBRA Object-Based Caching with Consistency
Zahir Tari, Slimane Hammoudi, Stephen Wagner
 DEXA3
1997 The k-Client Problem
Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner
 SODA4