Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Chakrabarti, Amit - Department of Computer Science, Dartmouth College
1 Motivation Binary search trees (BST) are meant to solve dynamic dictionary problem. n keys are stored in such a
CS 105: Algorithms (Grad) Solving Shortest Superstring via Set Cover
COSC 105 Lectures 1-4: Perfect and Universal Hashing Winter 2005 1.1 On Hashing
CS 105 Winter 2005 4 Minimum Spanning Trees--January 28-February 3, 2005
CS105 Maximum Matching Winter 2005 6 Maximum Matching
CS 105: Algorithms (Grad) Approximation Algorithms (continued) Feb 21, 2005
CS 105: Algorithms (Grad) Solving Set Cover using Linear Programming
Mar 4-7, 2005 String Matching Spring 2004
CS 105: Algorithms (Grad) Linear Programming for Approximation Algorithms(Vertex Cover)
CS 105: Grad. Algorithms Winter 2005 MST VERIFICATION
A Near-Optimal Algorithm for Estimating the Entropy of a Stream
CR-precis: A deterministic summary structure for update data streams
CS85: You Can't Do That (Lower Bounds in Computer Science)
Winter 2004 Discrete Mathematics
CS 105 Lecture 3: MinCut Algorithms Winter 2005 4 MinCut Algorithms
Winter 2004 Discrete Mathematics
CS 105: Algorithms (Grad) Set Cover and Application to Shortest Superstring
CS 105: Algorithms (Grad) Subset Sum Problem
CS49: Data Stream Algorithms Lecture Notes, Fall 2011
Estimating PageRank on Graph Streams ATISH DAS SARMA, Georgia Institute of Technology
The Shifting Sands Algorithm Andrew McGregor
Recognizing well-parenthesized expressions in the streaming model Frederic Magniez
Approximating the Longest Increasing Sequence and Distance from Sortedness in a Data Stream
Sketching Information Divergences Sudipto Guha
Winter 2012 Theory of Computation
