Faculty

Institution

Unit

Venue

Daniel Sleator

Professor

Carnegie Mellon University

Affiliations

School of Computer Science

Computer Science Department

Daniel Sleator is currently serving as a Computer Science Professor at Carnegie Mellon University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Daniel Sleator

Carnegie Mellon University

Professor

You can click a keyword to filter the displayed items

computer science combinatorial optimization discrete algorithms applied mathematics computational optimization computational complexity theoretical computer science machine learning mathematics data management formal methods mathematical optimization algorithm design databases systems engineering informatics logic in computer science numerical algorithms combinatorial theory online algorithms competitive algorithms information retrieval language resources programming languages online problem optimization problems randomized algorithms discrete optimization tree language natural language processing scientific computing general linguistics geometric algorithms computational complexity theory models of computation computability theory combinatorial problems algorithmic efficiency tree automaton amortized efficiency data structure rotation distance link grammar grammatical trigrams geometric topology information visualization computational statistics tree physiology caching data compression discrete differential geometry delaunay triangulation order theory sorting algorithms sequential algorithm spatial computing string-searching algorithm graph drawing information processing (psychology) very large database computational game theory repeated games computational paradigm computational model theory orbit determination inclinometer paging rules list update competitive snoopy competitive paging algorithms pairing heap self-adjusting heap paging algorithm probabilistic model self-adjusting heaps self-adjusting binary trees artificial intelligence business intelligence algorithmic library statistical software computer communications information management operating systems analytics data analytics

Notable Scholarly Works

Notable Federal Grants

Collaborators

Skip-Splay: Toward Achieving the Unified Bound in the Bst Model. Lecture notes in computer science (2009)

computer sciencevery large databasecomputer engineeringtheoretical computer sciencedata modelingunified bounddata managementformal methods

A Numerical Optimization Approach to General Graph Drawing. (1999)

Daniel TunkelangDaniel SleatorPaul HeckbertBruce Maggs

graph theoryinformation visualizationgraph drawingcomputational optimizationdata science

A Robust Parsing Algorithm for Link Grammars. arXiv (Cornell University) (1995)

Dennis GrinbergJohn LaffertyDaniel Sleator

robust parsing algorithmlinguisticslink grammarsnatural language processingstring-searching algorithmmachine learning

Grammatical Trigrams: A Probabilistic Model of Link Grammar. (1992)

John LaffertySaniel SleatorDavy Temperley

link grammarlinguisticsprobabilistic modelcomputational linguisticsgrammatical trigramsnatural language processing

Short Encodings of Evolving Structures. SIAM Journal on Discrete Mathematics (1992)

Daniel D. SleatorRobert E. TrajanWilliam P. Thurston

discrete mathematicsshort encodingsmathematics

A Strongly Competitive Randomized Paging Algorithm. Algorithmica (1991)

Lyle A. McGeochDaniel D. Sleator

computer sciencepaging algorithmrandomized algorithmsonline algorithms

Competitive Paging Algorithms. Journal of Algorithms (1991)

Amos FiatRichard M KarpMichael LubyLyle A McGeochDaniel D SleatorNeal E Young

computer sciencecompetitive paging algorithmsalgorithm designmachine learning

Amortized Analysis of a Pebble Game. (1990)

game designamortized analysiscombinatorial optimizationgame theoryapplied mathematicscomputational game theoryrepeated games

A Tight Amortized Bound for Path Reversal. Information Processing Letters (1989)

David GinatDaniel D SleatorRobert E Tarjan

computer sciencesystems engineeringinformation processing (psychology)path reversalinformation retrieval

Competitive Algorithms for Replication and Migration Problems. (1989)

David L. BlackDaniel D. Sleator

replicationmigration problemscompetitive algorithmsapplied mathematics

1
2
3
4
5
8
10 / page

Daniel Sleator

Professor

Carnegie Mellon University

Affiliations

School of Computer Science

Computer Science Department

Daniel Sleator is currently serving as a Computer Science Professor at Carnegie Mellon University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Daniel Sleator

Carnegie Mellon University

Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Skip-Splay: Toward Achieving the Unified Bound in the Bst Model. Lecture notes in computer science (2009)

computer sciencevery large databasecomputer engineeringtheoretical computer sciencedata modelingunified bounddata managementformal methods

A Numerical Optimization Approach to General Graph Drawing. (1999)

Daniel TunkelangDaniel SleatorPaul HeckbertBruce Maggs

graph theoryinformation visualizationgraph drawingcomputational optimizationdata science

A Robust Parsing Algorithm for Link Grammars. arXiv (Cornell University) (1995)

Dennis GrinbergJohn LaffertyDaniel Sleator

robust parsing algorithmlinguisticslink grammarsnatural language processingstring-searching algorithmmachine learning

Grammatical Trigrams: A Probabilistic Model of Link Grammar. (1992)

John LaffertySaniel SleatorDavy Temperley

link grammarlinguisticsprobabilistic modelcomputational linguisticsgrammatical trigramsnatural language processing

Short Encodings of Evolving Structures. SIAM Journal on Discrete Mathematics (1992)

Daniel D. SleatorRobert E. TrajanWilliam P. Thurston

discrete mathematicsshort encodingsmathematics

A Strongly Competitive Randomized Paging Algorithm. Algorithmica (1991)

Lyle A. McGeochDaniel D. Sleator

computer sciencepaging algorithmrandomized algorithmsonline algorithms

Competitive Paging Algorithms. Journal of Algorithms (1991)

Amos FiatRichard M KarpMichael LubyLyle A McGeochDaniel D SleatorNeal E Young

computer sciencecompetitive paging algorithmsalgorithm designmachine learning

Amortized Analysis of a Pebble Game. (1990)

game designamortized analysiscombinatorial optimizationgame theoryapplied mathematicscomputational game theoryrepeated games

A Tight Amortized Bound for Path Reversal. Information Processing Letters (1989)

David GinatDaniel D SleatorRobert E Tarjan

computer sciencesystems engineeringinformation processing (psychology)path reversalinformation retrieval

Competitive Algorithms for Replication and Migration Problems. (1989)

David L. BlackDaniel D. Sleator

replicationmigration problemscompetitive algorithmsapplied mathematics

1
2
3
4
5
8
10 / page

Similar Faculty Members

John Iacono

Institution

New York University

algorithm design

geometry

Benjamin Moseley

Institution

Carnegie Mellon University

numerical mathematics

general systems

Deeparnab Chakrabarty

Institution

Dartmouth College

algorithm design

technological forecasting

Ming-Yang Kao

Institution

Northwestern University

computer science

applied mathematics

Bhaskar DasGupta

Institution

University of Illinois Chicago

network science

philosophy of computer science

K. Subramani

Institution

West Virginia University

computer science

applied mathematics

Steven Skiena

Institution

Stony Brook University

memetic computing

big data

Randal Bryant

Institution

Carnegie Mellon University

reliability

formal verification

Chee K. Yap

Institution

New York University

computational mathematics

numerical robustness issues

Stephen Kobourov

Institution

University of Arizona

algorithm design

discrete algorithm

Similar Faculty Members

John Iacono

Institution

New York University

algorithm design

geometry

Benjamin Moseley

Institution

Carnegie Mellon University

numerical mathematics

general systems

Deeparnab Chakrabarty

Institution

Dartmouth College

algorithm design

technological forecasting

Ming-Yang Kao

Institution

Northwestern University

computer science

applied mathematics

Bhaskar DasGupta

Institution

University of Illinois Chicago

network science

philosophy of computer science

K. Subramani

Institution

West Virginia University

computer science

applied mathematics

Steven Skiena

Institution

Stony Brook University

memetic computing

big data

Randal Bryant

Institution

Carnegie Mellon University

reliability

formal verification

Chee K. Yap

Institution

New York University

computational mathematics

numerical robustness issues

Stephen Kobourov

Institution

University of Arizona

algorithm design

discrete algorithm