462 citations · 775 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2017
Optimal Offline Dynamic -Edge/Vertex Connectivity
Richard Peng, Bryce Sandlund, Daniel D. Sleator
We give offline algorithms for processing a sequence of and edge and vertex connectivity queries in a fully-dynamic undirected graph. While the current best fully-dynamic o…
cs.DS2002★ 462 cited
Competitive Paging Algorithms
Amos Fiat, Richard Karp, Mike Luby +3
The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. This paper introduces the marking algorithm, a sim…