Folgen
Nicholas Pippenger
Nicholas Pippenger
Emeritus Professor of Mathematics, Harvey Mudd College
Bestätigte E-Mail-Adresse bei math.hmc.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Extendible hashing—a fast access method for dynamic files
R Fagin, J Nievergelt, N Pippenger, HR Strong
ACM Transactions on Database Systems (TODS) 4 (3), 315-344, 1979
10371979
Relations among complexity measures
N Pippenger, MJ Fischer
Journal of the ACM (JACM) 26 (2), 361-381, 1979
4641979
On simultaneous resource bounds
N Pippenger
20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 307-311, 1979
4241979
A fast parallel algorithm for routing in permutation networks
GF Lev, N Pippenger, LG Valiant
IEEE transactions on Computers 100 (2), 93-100, 1981
3961981
The computational complexity of knot and link problems
J Hass, JC Lagarias, N Pippenger
Journal of the ACM (JACM) 46 (2), 185-211, 1999
2901999
Finding the median
A Schönhage, MS Paterson, N Pippenger
University of Warwick. Department of Computer Science, 1975
2631975
Asymptotic behavior of the chromatic index for hypergraphs
N Pippenger, J Spencer
Journal of combinatorial theory, Series A 51 (1), 24-42, 1989
2621989
Superconcentrators
N Pippenger
SIAM Journal on Computing 6 (2), 298-304, 1977
2571977
Characterizations of 1-way quantum finite automata
A Brodsky, N Pippenger
SIAM Journal on Computing 31 (5), 1456-1478, 2002
2312002
On networks of noisy gates
N Pippenger
26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 30-38, 1985
2301985
Parallel computation for well-endowed rings and space-bounded probabilistic machines
A Borodin, S Cook, N Pippenger
Information and control 58 (1-3), 113-136, 1983
2091983
Knots in random walks
N Pippenger
Discrete Applied Mathematics 25 (3), 273-278, 1989
2081989
Expanding graphs contain all small trees
J Friedman, N Pippenger
Combinatorica 7, 71-76, 1987
2051987
Fault tolerance in networks of bounded degree
C Dwork, D Peleg, N Pippenger, E Upfal
Proceedings of the eighteenth annual ACM symposium on Theory of computing …, 1986
2031986
On determinism versus non-determinism and related problems
WJ Paul, N Pippenger, E Szemeredi, WT Trotter
24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 429-438, 1983
1981983
On the evaluation of powers and monomials
N Pippenger
SIAM Journal on Computing 9 (2), 230-250, 1980
1921980
Theories of computability
N Pippenger
Cambridge University Press, 1997
1711997
Polynomial hash functions are reliable
M Dietzfelbinger, J Gil, Y Matias, N Pippenger
Automata, Languages and Programming: 19th International Colloquium Wien …, 1992
1521992
Reliable computation by formulas in the presence of noise
N Pippenger
IEEE Transactions on Information Theory 34 (2), 194-197, 1988
1471988
An optimal brain can be composed of conflicting agents
A Livnat, N Pippenger
Proceedings of the National Academy of Sciences 103 (9), 3198-3202, 2006
1422006
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20