◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Sleator

6 papers hereh-index 3012.8k citations77 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author2
  • last author2

Across the 6 of 6 papers where every author was matched, so the position is known.

fields
  • cmp-lg2
  • cs.DS2
  • cs.CY1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
19952017
most citedCompetitive Paging Algorithms

462 citations · 775 across the 6 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2017

Optimal Offline Dynamic 2,3-Edge/Vertex Connectivity

Richard Peng, Bryce Sandlund, Daniel D. Sleator

We give offline algorithms for processing a sequence of 2 and 3 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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.