7 citations · 7 across the 3 of their papers we have counts for
6 papers
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…
Impartial Redistricting: A Markov Chain Approach
Lucy Chenyun Wu, Jason Xiaotian Dou, Danny Sleator +2
The gerrymandering problem is a worldwide problem which sets great threat to democracy and justice in district based elections. Thanks to partisan redistricting commissions, distri…
Subtraction games with FES sets of size 3
Danny Sleator, Marla Slusky
This paper extends the work done by Angela Siegel on subtraction games in which the subtraction set is N \ X for some finite set X. Siegel proves that for any finite set X, the G-s…
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…
Parsing English with a Link Grammar
Daniel D. K. Sleator, Davy Temperley
We develop a formal grammatical system called a link grammar, show how English grammar can be encoded in such a system, and give algorithms for efficiently parsing with a link gram…
A Robust Parsing Algorithm For Link Grammars
Dennis Grinberg, John Lafferty, Daniel Sleator
In this paper we present a robust parsing algorithm based on the link grammar formalism for parsing natural languages. Our algorithm is a natural extension of the original dynamic…