Richard Zippel

According to our database, Richard Zippel authored at least 27 papers between 1975 and 2003.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2003

Set reconciliation with nearly optimal communication complexity.

Yaron Minsky, Ari Trachtenberg, Richard Zippel

IEEE Trans. Inf. Theory, 2003

1997

Zero Testing of Algebraic Functions.

Richard Zippel

Inf. Process. Lett., 1997

1996

Decomposition of Algebraic Functions.

Dexter Kozen, Susan Landau, Richard Zippel

J. Symb. Comput., 1996

Global register allocation for SIMD multiprocessors.

Benjamin Hao, David Pearson, Richard Zippel

J. Comput. Sci. Technol., 1996

On Satisfiability.

Richard Zippel

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995

Matching Data Storage To Application Needs.

Dawson Dean, Richard Zippel

ACM SIGOPS Oper. Syst. Rev., 1995

1994

A new modular interpolation algorithm for factoring multivariate polynominals.

Ronitt Rubinfeld, Richard Zippel

Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993

A Constraint Based Scientific Programming Language.

Richard Zippel

Proceedings of the Principles and Practice of Constraint Programming, 1993

The Weyl Computer Algebra Substrate.

Richard Zippel

Proceedings of the Design and Implementation of Symbolic Computation Systems, 1993

Effective polynomial computation.

Richard E. Zippel

The Kluwer international series in engineering and computer science 241, Kluwer, ISBN: 978-0-7923-9375-7, 1993

1992

Comments on Prolegomena to Any Future Qualitative Physics.

Richard Zippel

Comput. Intell., 1992

1991

Rational Function Decomposition.

Richard Zippel

Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1990

Interpolating Polynomials from Their Values.

Richard Zippel

J. Symb. Comput., 1990

Programming the data structure accelerator.

Richard Zippel

Proceedings of the Next Decade in Information Technology: Proceedings of the 5th Jerusalem Conference on Information Technology 1990, 1990

1989

An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Time.

Richard Zippel

Inf. Process. Lett., 1989

1986

Recent Results in VLSI CAD at MIT.

Richard E. Zippel, Paul Penfield Jr., Lance A. Glasser, Charles E. Leiserson, John L. Wyatt Jr., Jonathan Allen

Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986

1985

Simplification of Expressions Involving Radicals.

Richard Zippel

J. Symb. Comput., 1985

Polynomial Decomposition Algorithms.

David R. Barton, Richard Zippel

J. Symb. Comput., 1985

1984

The future of computer algebra.

Richard Zippel

SIGSAM Bull., 1984

1983

Capsules.

Richard Zippel

Proceedings of the 1983 ACM SIGPLAN Symposium on Programming Language Issues in Software Systems, 1983

1981

Newton's iteration and the sparse Hensel algorithm (Extended Abstract).

Richard Zippel

Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1981

1980

On the security of the Merkle- Hellman cryptographic scheme (Corresp.).

Adi Shamir, Richard Zippel

IEEE Trans. Inf. Theory, 1980

1979

Probabilistic algorithms for sparse polynomials.

Richard Zippel

Proceedings of the Symbolic and Algebraic Computation, 1979

An extension of Liouville's theorem.

Joel Moses, Richard Zippel

Proceedings of the Symbolic and Algebraic Computation, 1979

1976

Univariate power series expansions in algebraic manipulation.

Richard E. Zippel

Proceedings of the third ACM Symposium on Symbolic and Algebraic Manipulation, 1976

A polynomial decomposition algorithm.

David R. Barton, Richard E. Zippel

Proceedings of the third ACM Symposium on Symbolic and Algebraic Manipulation, 1976

1975

A MACSYMA solution to problem 8.

Richard Zippel

SIGSAM Bull., 1975