#### Filter Results:

- Full text PDF available (94)

#### Publication Year

1986

2017

- This year (7)
- Last 5 years (23)
- Last 10 years (41)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Stefan Savage, David Wetherall, Anna R. Karlin, Thomas E. Anderson
- SIGCOMM
- 2000

This paper describes a technique for tracing anonymous packet flooding attacks in the Internet back towards their source. This work is motivated by the increased frequency and sophistication of denial-of-service attacks and by the difficulty in tracing packets with incorrect, or ``spoofed'', source addresses. In this paper we describe a general purpose… (More)

- Stefan Savage, David Wetherall, Anna R. Karlin, Thomas E. Anderson
- IEEE/ACM Trans. Netw.
- 2001

This paper describes a technique for tracing anonymous packet flooding attacks in the Internet back toward their source. This work is motivated by the increased frequency and sophistication of denial-of-service attacks and by the difficulty in tracing packets with incorrect, or “spoofed,” source addresses. In this paper, we describe a general… (More)

- Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
- SIAM J. Comput.
- 1999

Suppose that we sequentially place n balls into n boxes by putting each ball into a randomly chosen box. It is well known that when we are done, the fullest box has with high probability (1 + o(1)) lnn/ ln lnn balls in it. Suppose instead that for each ball we choose two boxes at random and place the ball into the one which is less full at the time of… (More)

We study the problem of pricing items for sale to consumers so as to maximize the seller's revenue. We assume that for each consumer, we know the maximum amount he would be willing to pay for each bundle of items, and want to find pricings of the items with corresponding allocations that maximize seller profit and at the same time are <i>envy-free</i>,… (More)

- Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks, Andrew Wright
- Games and Economic Behavior
- 2006

We study a class of single-round, sealed-bid auctions for items in unlimited supply, such as digital goods. We introduce the notion of competitive auctions. A competitive auction is truthful (i.e., encourages buyers to bid their utility) and yields profit that is roughly within a constant factor of the profit of optimal fixed pricing for all inputs. We… (More)

Advances in network and processor technology have greatly changed the communication and computational power of local-area workstation clusters. However, operating systems still treat workstation clusters as a collection of loosely-connected processors, where each workstation acts as an autonomous and independent agent. This operating system structure makes… (More)

- Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki
- Algorithmica
- 1990

Competitive analysis is concerned with comparing the performance of on-line algorithms with that of optimal off-line algorithms. In some cases randomization can lead to algorithms with improved performance ratios on worst-case sequences. In this paper we present new randomized on-line algorithms for snoopy caching and the spin-block problem. These… (More)

- Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert E. Tarjan
- SIAM J. Comput.
- 1988

The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a randomized algorithm for the dynamic dictionary problem that takes O(1) worst-case time for lookups and O(1) amortized expected time for insertions and deletions; it… (More)

- Matthew Cary, Aparna Das, +5 authors Michael Schwarz
- EC
- 2007

How should players bid in keyword auctions such as those used by Google, Yahoo! and MSN?allWe consider greedy bidding strategies for a repeated auction on a single keyword, where in each round, each player chooses some optimal bid for the next round, assuming that the other players merely repeat their previous bid. We study the revenue, convergence and… (More)

- Pei Cao, Edward W. Felten, Anna R. Karlin, Kai Li
- SIGMETRICS
- 1995

Prefetching and caching are effective techniques for improving the performance of file systems, but they have not been studied in an integrated fashion. This paper proposes four properties that optimal integrated strategies for prefetching and caching must satisfy, and then presents and studies two such integrated strategies, called <i>aggressive</i> and… (More)