Mitzenmacher, Michael - School of Engineering and Applied Sciences, Harvard University

Advanced Search

Mitzenmacher, Michael - School of Engineering and Applied Sciences, Harvard University

May 10, 1994 A Block-sorting Lossless
Best-Order Streaming model Atish Das Sarma, Richard J. Lipton, and Danupon Nanongkai
POWER LAWS FOR MONKEYS TYPINGS RANDOMLY: THE CASE OF UNEQUAL PROBABILITIES
arXiv:cond-mat/0412004v3[cond-mat.stat-mech]29May2006 Power laws, Pareto distributions and Zipf's law
How to read a research paper. Later in the semester, we will talk about how to write a research paper. To begin the course, however, we
Foundations and Trends R Vol. xx, No xx (xxxx) 164
CS 223: Homework 1. Due September 27. Please keep in mind the standard collaboration policy you may talk about problems with others, but you may
Annotations in Data Streams Amit Chakrabarti Graham Cormode Andrew McGregor
The EigenTrust Algorithm for Reputation Management in P2P Networks
CS 223: Homework 1. Due September 27. Please keep in mind the standard collaboration policy --you may talk about problems with others, but you may
The Degree Sequence of a Scale-Free Random Graph Process
Dynamic Models for File Sizes and Double Pareto Distributions Michael Mitzenmacher
Approximation Algorithmsfor Grammar-BasedCompression Eric Lehman Abhi Shelat
SRC Technical Note October 26, 1998
Recent Results in Computational Ramsey Theory A Computing Science 506 Research Project Report
Network Coding for Large Scale Content Distribution
CAPACITY APPROACHING CODES DESIGN AND IMPLEMENTATION SPECIAL SECTION
Aggregating Inconsistent Information: Ranking and Clustering
Graph structure in the web Andrei Broder1, Ravi Kumar2, Farzin Maghoul1
Basic Channels Channels: the construct through which information is passed
arXiv:0706.1062v2[physics.data-an]2Feb2009 POWER-LAW DISTRIBUTIONS IN EMPIRICAL DATA
The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables
CS 223: Homework 8. Due December 6. Please keep in mind the standard collaboration policy you may talk about problems with others, but you may
Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh
Models for the Compressible Web Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan
New Directions in Traffic Measurement and Accounting: Focusing on the Elephants,
CS222: Project Requirements The goal of the final project is for you to initiate new research. The most desirable end result is a conference
CS 222: Homework 1. Due October 21. Please keep in mind the standard collaboration policy. You may use standard mathematical software (Perl,
CS222: Homework 2. Due November 11. 1. Find the best compression utilities you can find you might start with bzip2 and gzip, which you should be
CS222: Homework 3. Due Dec 2. For this assignment, you do not need to do all of the problems. You may choose to do any four. Please list the
CS 222 Lecture 3: September 30, 1999 Fall 99-00 Lecturer: Michael Mitzenmacher Scribe: Eleni Drinea
Improved Algorithms for Topic Distillation in a Hyperlinked Environment
Rank Aggregation Revisited Cynthia Dwork Ravi Kumary
PicASHOW: Pictorial Authority Search by Hyperlinks On the Web
Anatomy of the Long Tail: Ordinary People with Extraordinary Tastes
Introduction to Data Compression Guy E. Blelloch
Data Streams: Algorithms and Applications S. Muthukrishnan
SRC Technical Note May 26, 1998
Mihai Patrascu We can represent an array of n values from {0, 1, 2} us-
An Alternative to Arithmetic Coding with Local Decodability Yevgeniy Dodis
LDPC Codes: An Introduction Amin Shokrollahi
Queuing Delays in Randomized Load Balanced R. Prasad P. J. Winzer, S. C. Borst, M. K. Thottan
Reed-Solomon Codes Reed-Solomon codes
IEEE TRANSACTIONS ON INFORMATION THEORY 1 The Smallest Grammar Problem
A dvances <>"e,the pa,t decade ,n many aspects