Sleator, Daniel D. (Daniel Dominic) 1953
Overview
Works:  26 works in 45 publications in 1 language and 213 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor 
Classifications:  QA76.55, 004.015118 
Publication Timeline
.
Most widely held works by
Daniel D Sleator
Online algorithms : proceedings of a DIMACS workshop, February 1113, 1991 by DIMACS Workshop on Algorithmic(
Book
)
7 editions published in 1992 in English and held by 115 WorldCat member libraries worldwide
7 editions published in 1992 in English and held by 115 WorldCat member libraries worldwide
Short encodings of evolving structures by
Daniel D Sleator(
Book
)
3 editions published between 1990 and 1991 in English and held by 9 WorldCat member libraries worldwide
We show for example that [omega](nlogn) applications of the associative and commutative laws are required in the worst case to transform an nvariable expression over a binary associative, commutative operation into some other equivalent expression. Similarly, we show that [omega](nlogn) 'diagonal flips' are required in the worst case to transform one nvertex numbered triangulated planar graph into some other one. Both of these lower bounds have matching upper bounds. An O(nlogn) upper bound for associative, commutative operations was known previously, whereas we obtain here an O(nlogn) upper bound for diagonal flips."
3 editions published between 1990 and 1991 in English and held by 9 WorldCat member libraries worldwide
We show for example that [omega](nlogn) applications of the associative and commutative laws are required in the worst case to transform an nvariable expression over a binary associative, commutative operation into some other equivalent expression. Similarly, we show that [omega](nlogn) 'diagonal flips' are required in the worst case to transform one nvertex numbered triangulated planar graph into some other one. Both of these lower bounds have matching upper bounds. An O(nlogn) upper bound for associative, commutative operations was known previously, whereas we obtain here an O(nlogn) upper bound for diagonal flips."
Competitive algorithms for replication and migration problems by
David L Black(
Book
)
2 editions published in 1989 in English and held by 8 WorldCat member libraries worldwide
For interconnection topologies that are complete graphs, or trees we have obtained efficient online algorithms for these problems. Our migration algorithms also extend to interconnections that are products of these topologies (e.g. a hypercube is a product of simple trees). An online algorithm decides how to process each request (which is a read or write request from a processor to a page) without knowing future requests. Our algorithms are also said to be competitive because their performance is within a small constant factor of that of any other algorithm, including algorithms that make use of knowledge of future requests."
2 editions published in 1989 in English and held by 8 WorldCat member libraries worldwide
For interconnection topologies that are complete graphs, or trees we have obtained efficient online algorithms for these problems. Our migration algorithms also extend to interconnections that are products of these topologies (e.g. a hypercube is a product of simple trees). An online algorithm decides how to process each request (which is a read or write request from a processor to a page) without knowing future requests. Our algorithms are also said to be competitive because their performance is within a small constant factor of that of any other algorithm, including algorithms that make use of knowledge of future requests."
Two algorithms for maintaining order in a list by
Paul Frederick Dietz(
Book
)
2 editions published between 1988 and 1989 in English and held by 7 WorldCat member libraries worldwide
2 editions published between 1988 and 1989 in English and held by 7 WorldCat member libraries worldwide
A strongly competitive randomized paging algorithm by
Lyle A McGeoch(
Book
)
2 editions published in 1989 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 7 WorldCat member libraries worldwide
Amortized analysis of a pebble game by
Paul Frederick Dietz(
Book
)
2 editions published in 1990 in English and held by 6 WorldCat member libraries worldwide
2 editions published in 1990 in English and held by 6 WorldCat member libraries worldwide
An O(nm log n) algorithm for maximum network flow by
Daniel D Sleator(
Book
)
6 editions published between 1980 and 1981 in English and held by 6 WorldCat member libraries worldwide
6 editions published between 1980 and 1981 in English and held by 6 WorldCat member libraries worldwide
Competitive algorithms for server problems by
Mark S Manasse(
Book
)
1 edition published in 1988 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 1988 in English and held by 6 WorldCat member libraries worldwide
Competitive snoopy caching by
Anna R Karlin(
Book
)
1 edition published in 1986 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1986 in English and held by 5 WorldCat member libraries worldwide
A robust parsing algorithm for link grammars by
David F Greenberg(
Book
)
1 edition published in 1995 in English and held by 5 WorldCat member libraries worldwide
Abstract: "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 programming recognition algorithm which recursively counts the number of linkages between two words in the input sentence. The modified algorithm uses the notion of a null link in order to allow a connection between any pair of adjacent words, regardless of their dictionary definitions. The algorithm proceeds by making three dynamic programming passes. In the first pass, the input is parsed using the original algorithm which enforces the constraints on links to ensure grammaticality. In the second pass, the total cost of each substring of words is computed, where cost is determined by the number of null links necessary to parse the substring. The final pass counts the total number of parses with minimal cost. All of the original pruning techniques have natural counterparts in the robust algorithm. When used together with memoization [sic], these techniques enable the algorithm to run efficiently with cubic worstcase complexity. We have implemented these ideas and tested them by parsing the Switchboard corpus of conversational English. This corpus is comprised of approximately three million words of text, corresponding to more than 150 hours of transcribed speech collected from telephone conversations restricted to 70 different topics. Although only a small fraction of the sentences in this corpus are 'grammatical' by standard criteria, the robust link grammar parser is able to extract relevant structure for a large portion of the sentences. We present the results of our experiments using this system, including the analyses of selected and random sentences from the corpus. We placed a version of the robust parser on the Word [sic] Wide Web for experimentation. It can be reached at URL http://www.cs.cmu.edu/afs/cs.cmu.edu/project/link/www/robust.html. In this version there are some limitations such as the maximum length of a sentence in words and the maximum amount of memory the parser can use."
1 edition published in 1995 in English and held by 5 WorldCat member libraries worldwide
Abstract: "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 programming recognition algorithm which recursively counts the number of linkages between two words in the input sentence. The modified algorithm uses the notion of a null link in order to allow a connection between any pair of adjacent words, regardless of their dictionary definitions. The algorithm proceeds by making three dynamic programming passes. In the first pass, the input is parsed using the original algorithm which enforces the constraints on links to ensure grammaticality. In the second pass, the total cost of each substring of words is computed, where cost is determined by the number of null links necessary to parse the substring. The final pass counts the total number of parses with minimal cost. All of the original pruning techniques have natural counterparts in the robust algorithm. When used together with memoization [sic], these techniques enable the algorithm to run efficiently with cubic worstcase complexity. We have implemented these ideas and tested them by parsing the Switchboard corpus of conversational English. This corpus is comprised of approximately three million words of text, corresponding to more than 150 hours of transcribed speech collected from telephone conversations restricted to 70 different topics. Although only a small fraction of the sentences in this corpus are 'grammatical' by standard criteria, the robust link grammar parser is able to extract relevant structure for a large portion of the sentences. We present the results of our experiments using this system, including the analyses of selected and random sentences from the corpus. We placed a version of the robust parser on the Word [sic] Wide Web for experimentation. It can be reached at URL http://www.cs.cmu.edu/afs/cs.cmu.edu/project/link/www/robust.html. In this version there are some limitations such as the maximum length of a sentence in words and the maximum amount of memory the parser can use."
Rotation distance, triangulations, and hyperbolic geometry by
Daniel D Sleator(
Book
)
1 edition published in 1988 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1988 in English and held by 5 WorldCat member libraries worldwide
Grammatical trigrams : a probabilistic model of link grammar by
John Lafferty(
Book
)
1 edition published in 1992 in English and held by 5 WorldCat member libraries worldwide
Abstract: "In this paper we present a new class of language models. This class derives from link grammar, a contextfree formalism for the description of natural language. We describe an algorithm for determining maximumlikelihood estimates of the parameters of these models. The language models which we present differ from previous models based on stochastic contextfree grammars in that they are highly lexical. In particular, they include the familiar ngram models as a natural subclass. The motivation for considering this class is to estimate the contribution which grammar can make to reducing the relative entropy of natural language."
1 edition published in 1992 in English and held by 5 WorldCat member libraries worldwide
Abstract: "In this paper we present a new class of language models. This class derives from link grammar, a contextfree formalism for the description of natural language. We describe an algorithm for determining maximumlikelihood estimates of the parameters of these models. The language models which we present differ from previous models based on stochastic contextfree grammars in that they are highly lexical. In particular, they include the familiar ngram models as a natural subclass. The motivation for considering this class is to estimate the contribution which grammar can make to reducing the relative entropy of natural language."
Parsing English with a link grammar by
Daniel D Sleator(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
Abstract: "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 grammar. Although the expressive power of link grammars is equivalent to that of context free grammars, encoding natural language grammars appears to be much easier with the new system. We have written a program for general link parsing and written a link grammar for the English language. The performance of this preliminary system  both in the breadth of English phenomena that it captures and in the computational resources used  indicates that the approach may have practical uses as well as linguistic significance. Our program is written in C and may be obtained through the internet."
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
Abstract: "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 grammar. Although the expressive power of link grammars is equivalent to that of context free grammars, encoding natural language grammars appears to be much easier with the new system. We have written a program for general link parsing and written a link grammar for the English language. The performance of this preliminary system  both in the breadth of English phenomena that it captures and in the computational resources used  indicates that the approach may have practical uses as well as linguistic significance. Our program is written in C and may be obtained through the internet."
Computer analysis of Sprouts by
David L Applegate(
Book
)
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide
But the truly innovative feature is our representation of game positions, which provides enough information to generate moves and has the property that many different planar graphs collapse into the same representation. This has an enormous impact on the speed of the search. The complexity of nspot Sprouts grows extremely rapidly with n. According to Gardner [7, page 7], Conway estimated that analysis of the eightspot game was beyond the reach of presentday computers. Before our program, even the value of the sevenspot game was unknown; we have calculated the value of all games up to and including eleven spots
1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide
But the truly innovative feature is our representation of game positions, which provides enough information to generate moves and has the property that many different planar graphs collapse into the same representation. This has an enormous impact on the speed of the search. The complexity of nspot Sprouts grows extremely rapidly with n. According to Gardner [7, page 7], Conway estimated that analysis of the eightspot game was beyond the reach of presentday computers. Before our program, even the value of the sevenspot game was unknown; we have calculated the value of all games up to and including eleven spots
A tight amortized bound for path reversal by David Ginat(
Book
)
2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
Path reversal is a form of path compression used in a disjoint set union algorithm and a mutual exclusion algorithm. We derive a tight upper bound on the amortized cost of path reversal. (JHD)
2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
Path reversal is a form of path compression used in a disjoint set union algorithm and a mutual exclusion algorithm. We derive a tight upper bound on the amortized cost of path reversal. (JHD)
Fully persistent lists with catenation by James R Driscoll(
Book
)
1 edition published in 1990 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 3 WorldCat member libraries worldwide
Rotation distance by
Daniel D Sleator(
Book
)
1 edition published in 1985 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1985 in English and held by 2 WorldCat member libraries worldwide
Online algorithms : Workshop : Papers(
Book
)
1 edition published in 1992 in English and held by 1 WorldCat member library worldwide
1 edition published in 1992 in English and held by 1 WorldCat member library worldwide
Fully persistent lists with catenation by James R Driscoll(
)
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms by
Daniel D Sleator(
)
1 edition published in 1994 in English and held by 0 WorldCat member libraries worldwide
Annotation
1 edition published in 1994 in English and held by 0 WorldCat member libraries worldwide
Annotation
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 McGeoch, Lyle A. 1959 Author Editor
 DIMACS (Group) Publisher
 Tarjan, Robert E. (Robert Endre) 1948
 Thurston, William P. 19462012
 Dietz, Paul Frederick 1959 Author
 Manasse, Mark S. Author
 Lafferty, John D. Author
 Temperley, Davy
 Black, David L. Author
 Rudolph, Larry
Useful Links
Associated Subjects
Algorithms Cache memory Combinatorial analysis Computer algorithms Computer programming Computer science Data structures (Computer science) Electronic data processing Formal languages Game theory Geometry, Hyperbolic Graph grammars Graph theory List processing (Electronic computers) Mathematical optimization Mathematical recreations Memory Multiprocessors Natural language processing (Computer science) Network analysis (Planning) Online data processing Parsing (Computer grammar) Sorting (Electronic computers) Trees (Graph theory)
Alternative Names
Daniel Sleator American computer scientist
Daniel Sleator Amerikaans informaticus
Daniel Sleator informaticien américain
Daniel Sleator USamerikanischer Informatiker
Sleator, Daniel D.
Sleator, Daniel D. K. 1953
Sleator, Daniel D. K. (Daniel Dominic Kaplan), 1953
ダニエル・スレイター
Languages