#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1997

2013

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### 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 which 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 efficient.… (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 formulae in conjunctive normal form with at most literals per clause). The first is a randomized algorithm which, with probability approaching 1, finds a satisfying assignment of a satisfiable -CNF formula in time . The second algorithm is deterministic, and… (More)

- Anupam Gupta, Francis Zane
- SODA
- 2003

In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream <i>L</i>ε[<i>m</i>]<sup>n</sup> using two passes and <i>O</i>(ε<sup>−1</sup>-√<i>n</i> log <i>n</i>(log <i>m</i> + log <i>n</i>)) space. Here, we present a simple randomized streaming algorithm for the same problem that uses one… (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 also… (More)

- 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)

- Sanjeev Khanna, Francis Zane
- SODA
- 2000

Watermarking has become an important technique for providing copyright protection for images, audio, VLSI designs, and many other types of data. Hidden information is embedded in data which allows the owner of the data to trace pirated copies, identifying a guilty party. We consider here the problem of watermarking maps. Our work is motivated by the… (More)

- Ramamohan Paturi, Michael E. Saks, Francis Zane
- computational complexity
- 2000

We consider the class $ \sum^{k}_{3} $ of unbounded fan-in depth three Boolean circuits, for which the bottom fan-in is limited by k and the top gate is an OR. It is known that the smallest such circuit computing the parity function has $ \Omega(2^{\varepsilon n/k}) $ gates (for k = O(n 1/2)) for some $ \varepsilon > 0 $ , and this was the best lower bound… (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 xi = xj , xi = x̄j , xi = 0, and xi = 1, where for 1 ≤ i ≤ n, xi 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 specified by its… (More)