#### Filter Results:

- Full text PDF available (87)

#### Publication Year

1975

2017

- This year (2)
- Last 5 years (23)
- Last 10 years (40)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alex Brodsky, Nicholas Pippenger
- SIAM J. Comput.
- 2002

The 2-way quantum finite automaton introduced by Kondacs and Watrous[KW97] can accept non-regular languages with bounded error in polynomial time. If we restrict the head of the automaton to moving classically and to moving only in one direction, the acceptance power of this 1-way quantum finite automaton is reduced to a proper subset of the regularā¦ (More)

- Ronald Fagin, JĆ¼rg Nievergelt, Nicholas Pippenger, H. Raymond Strong
- ACM Trans. Database Syst.
- 1979

Extendible hashing is a new access technique, in which the user is guaranteed no more than two page faults to locate the data associated with a given unique identifier, or key. Unlike conventional hashing, extendible hashing has a dynamic structure that grows and shrinks gracefully as the database grows and shrinks. This approach simultaneously solves theā¦ (More)

- Nicholas Pippenger, Joel H. Spencer
- J. Comb. Theory, Ser. A
- 1989

- Nicholas Pippenger, Michael J. Fischer
- J. ACM
- 1979

Various computational models (such as machines and combinational logic networks) induce various and, m general, different computational complexity measures Relations among these measures are established by studying the ways m which one model can "simulate" another It ts shown that a machine with k-dimensional storage tapes (respectively, withā¦ (More)

- Joel Hass, Jeffrey C. Lagarias, Nicholas Pippenger
- FOCS
- 1997

We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, ie., capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, UNKNOTTING PROBLEM is in NP. We also consider the problem, SPLITTING PROBLEM of determining whether two or more such polygonsā¦ (More)

- Joel Friedman, Nicholas Pippenger
- Combinatorica
- 1987

- Nicholas Pippenger
- IEEE Trans. Information Theory
- 1988

It is shown that if formulas are used to compute Boolean functions in the presence of randomly occurring failures (as has been suggested by von Neumann and others), then 1) there is a limit shictly less than 1/2 to the failure probability per gate that can be tolerated, and 2) formulas that tolerate failures must be deeper (and, therefore, compute moreā¦ (More)

- Nicholas Pippenger
- Discrete Mathematics
- 2002

- Nicholas Pippenger
- 26th Annual Symposium on Foundations of Computerā¦
- 1985

We show that many Boolean functions (including, in a certain sense, "almost all" Boolean functions) have the property that the number of noisy gates needed to compute them differs from the number of noiseless gates by at most a constant factor. This may be contrasted with results of von Neumann, Dobrushin and Ortyukov to the effect that (1) for everyā¦ (More)