| |
Pippenger, Nicholas |
 |
|
| |
|
Date Reviewed |
|
 |
|
|
|
| |
1 - 5
of 7 reviews |
|
|
|
|
|
|
| |
SRT division algorithms as dynamical systems
McCann M., Pippenger N. SIAM Journal on Computing 34(6): 1279-1301, 2005. Type: Article
This paper investigates a family of division algorithms (referred to as Sweeney-Robertson-Tocher (SRT)) as examples of dynamical systems. Although the main result of the paper can be understood without recourse to the dynamical systems...... |
Feb 23 2006 |
|
|
|
|
|
| |
The computational complexity of knot and link problems
Hass J., Lagarias J., Pippenger N. Journal of the ACM 46(2): 185-211, 1999. Type: Article
For the purposes of this paper, a “knot” is a simple polygon in 3-space. A finite collection of disjoint knots is a “link.” Two knots are “isotopic” if there is a (piecewise-l...... |
Nov 1 1999 |
|
|
|
|
|
| |
Pure versus impure Lisp
Pippenger N. ACM Transactions on Programming Languages and Systems 19(2): 223-238, 1997. Type: Article
Pippenger compares pure to impure LISP with respect to program complexity. Impure LISP is defined as the form of LISP that has rplaca and rplacd primitives (or their equivalents) for destructive replacement of the list he...... |
Apr 1 1998 |
|
|
|
|
|
| |
Theories of computability
Pippenger N., Cambridge University Press, New York, NY, 1997. Type: Book (9780521553803)
I must admit to being taken aback at first by some unusual characteristics of this book. The term Turing machine does not occur in the index and does not seem to appear in the text, but Turing reducibilities are covered in great detail...... |
Mar 1 1998 |
|
|
|
|
|
| |
Selection networks
Pippenger N. SIAM Journal on Computing 20(5): 878-887, 1991. Type: Article
It is well known that the number of comparators needed to design a sorting network for n values is O ( log 2 n ); the constant factor involved is large (1000 or more)....... |
Feb 1 1993 |
|
|
|
|
|
|
|
|
| |
|
|
