#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1997

2013

- This year (0)
- Last five years (2)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Russell Impagliazzo, Ramamohan Paturi, Francis Zane
- FOCS
- 1998

For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper, we address the relative likelihood of sub-exponential algorithms for these problems. We introduce a generalized reduction that we call Sub-exponential Reduction Family (SERF) that preserves sub-exponential complexity. We show that… (More)

- Girija J. Narlikar, Anindya Basu, Francis Zane
- INFOCOM
- 2003

— Ternary Content-Addressable Memories (TCAMs) are becoming very popular for designing high-throughput forwarding engines on routers: they are fast, cost-effective and simple to manage. However, a major drawback of TCAMs is their high power consumption. This paper presents architectures and algorithms for making TCAM-based routing tables more power… (More)

- Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
- J. ACM
- 1998

We propose and analyze a simple new randomized algorithm, called ResolveSat, for finding satisfying assignments of Boolean formulas in conjunctive normal form. The algorithm consists of two stages: a preprocessing stage in which resolution is applied to enlarge the set of clauses of the formula, followed by a search stage that uses a simple randomized… (More)

- Ramamohan Paturi, Pavel Pudlák, Francis Zane
- Chicago J. Theor. Comput. Sci.
- 1997

We present and analyze two simple algorithms for finding satisfying assignments of ¢-CNFs (Boolean formu-lae in conjunctive normal form with at most ¢ liter-als per clause). The first is a randomized algorithm which, with probability approaching 1, finds a satisfying assignment of a satisfiable ¢

UCSD 5 and InterTrust STAR Lab 2 In digital watermarking also called digital ngerprinting, extra information is embedded imperceptibly into digital content such as an audio track, a still image, or a movie. This extra information can be read by authorized parties, and other users attempting to remove the watermark cannot do so without destroying the value… (More)

- Marcus K. Weldon, Francis Zane
- Bell Labs Technical Journal
- 2003

- Girija J. Narlikar, Francis Zane
- SIGMETRICS/Performance
- 2001

In this paper, we examine algorithms and data structures for the longest prefix match operation required for routing IP packets. Previous work, aimed at hardware implementations, has focused on quantifying worst case lookup time and memory usage. With the advent of fast programmable platforms, whether network processor or PC-based, metrics which look… (More)

- Ramamohan Paturi, Francis Zane
- SIAM J. Discrete Math.
- 1998

A projection is a subset of {0, 1} n given by equations of the form x i = x j , x i = ¯ x j , x i = 0, and x i = 1, where for 1 ≤ i ≤ n, x i are Boolean variables and ¯ x i are their complements. We study monochromatic projections in 2-colorings of an n-dimensional Boolean cube. We also study the dimension of the largest projection contained in a set… (More)

- Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane
- INFOCOM
- 2002

— We consider the problem of client assignment in a distributed system of content servers. We present a system called Webmapper for clustering IP addresses and assigning each cluster to an optimal content server. The system is passive in that the only information it uses comes from monitoring the TCP connections between the clients and the servers. It is… (More)

- Francis Zane
- Financial Cryptography
- 2000