#### Filter Results:

- Full text PDF available (69)

#### Publication Year

1960

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman
- IEEE Transactions on Information Theory
- 2006

We consider information networks in the absence of interference and noise, and present an upper bound on the rate at which information can be transmitted using network coding. Our upper bound is based on combining properties of entropy with a strong information inequality derived from the structure of the network.The <b>undirected</b> <i>k</i>-<b>pairs… (More)

- Micah Adler, Michael Mitzenmacher
- Data Compression Conference
- 2001

We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently proposed random graph models for describing the Web. The algorithms are based on reducing the compression problem to the problem of finding a minimum spanning tree in a directed graph… (More)

- Abhishek Chandra, Micah Adler, Pawan Goyal, Prashant J. Shenoy
- OSDI
- 2000

In this paper, we present surplus fair scheduling (SFS), a proportional-share CPU scheduler designed for symmetric multiprocessors. We first show that the infeasibility of certain weight assignments in multiprocessor environments results in unfairness or starvation in many existing proportional-share schedulers. We present a novel weight readjustment… (More)

There have been a number of protocols proposed for anonymous network communication. In this paper we investigate attacks by corrupt group members that degrade the anonymity of each protocol over time. We prove that when a particular initiator continues communication with a particular responder across path reformations, existing protocols are subject to the… (More)

- Matthew K. Wright, Micah Adler, Brian Neil Levine, Clay Shields
- ACM Trans. Inf. Syst. Secur.
- 2004

There have been a number of protocols proposed for anonymous network communication. In this paper, we investigate attacks by corrupt group members that degrade the anonymity of each protocol over time. We prove that when a particular initiator continues communication with a particular responder across path reformations, existing protocols are subject to the… (More)

- Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, Lars Eilstrup Rasmussen
- Random Struct. Algorithms
- 1998

It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds Θ(logn/ log logn) balls with high probability. More recently, Azar et al. analyzed the following process: randomly choose d bins for each ball, and then place the balls, one by one, into the least full bin from its d choices [2]. They show… (More)

- Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani
- STOC
- 2003

Consider the following stochastic process executed on a graph <i>G=(V,E)</i> whose nodes are initially uncovered. In each step, pick a node at random and if it is uncovered, cover it. Otherwise, if it has an uncovered neighbor, cover a random uncovered neighbor. Else, do nothing. This can be viewed as a structured coupon collector process. We show that for… (More)

We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter and a rabbit. Let G be any connected, undirected graph with n nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node… (More)

- Micah Adler
- STOC
- 2002

There has been considerable recent interest in probabilistic packet marking schemes for the problem of tracing a sequence of network packets back to an anonymous source. An important consideration for such schemes is the number of packet header bits that need to be allocated to the marking protocol. Let <i>b</i> denote this value. All previous schemes… (More)

This paper provides the rst in depth study of the algorithmic questions involved in the scheduling of space sharing for Internet advertising We consider the scheduling problem where each advertisement is speci ed by a geometry and a display frequency Given a set of ads a schedule of the ads speci es which ads are to be displayed at the same time The… (More)