Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Nicholas Pippenger" ( http://dblp.L3S.de/Authors/Nicholas_Pippenger )

URL (Homepage):  http://www.cs.princeton.edu/~njp/  Author page on DBLP  Author page in RDF  Community of Nicholas Pippenger in ASPL-2

Publication years (Num. hits)
1975-1979 (20) 1980-1984 (17) 1985-1989 (16) 1990-1994 (18) 1995-1999 (15) 2001-2006 (16) 2007-2011 (11)
Publication types (Num. hits)
article(83) book(1) incollection(1) inproceedings(28)
Venues (Conferences, Journals, ...)
SIAM J. Comput.(11) FOCS(9) IEEE Transactions on Informati...(9) J. Comput. Syst. Sci.(9) STOC(9) SIAM J. Discrete Math.(8) CoRR(6) J. ACM(6) Random Struct. Algorithms(5) Mathematical Systems Theory(4) Discrete Applied Mathematics(3) IBM Journal of Research and De...(3) Theor. Comput. Sci.(3) ICALP(2) IEEE Trans. Computers(2) J. Comb. Theory, Ser. A(2) More (+10 of total 35)
Authors
Nicholas Pippenger(113) Geng Lin(5) Maria M. Klawe(4) Ben Gross(3) Cynthia Dwork(3) Joel Friedman(3) Mark McCann(3) Patrick Eschenfeldt(3) William S. Evans(3) Alex Brodsky(2) David Peleg(2) Eli Upfal(2) J. C. Lagarias(2) Joel Hass(2) Krzysztof Majewski(2) Leslie G. Valiant(2) More (+10 of total 52)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 20 occurrences of 19 keywords
Results
Found 113 publication records. Showing 113 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Nicholas Pippenger On-the-Fly Algorithms and Sequential Machines. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 2011 DBLP  DOI  BibTeX  RDF Finite automata, reversal, regular language
1Alice Paul, Nicholas Pippenger A Census of Vertices by Generations in Regular Tessellations of the Plane. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2011 DBLP  BibTeX  RDF
1Alexander Izsak, Nicholas Pippenger Carry propagation in multiplication by constants. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger The M/M/Infinity Service System with Ranked Servers in Heavy Traffic Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger Stochastic Service Systems, Random Interval Graphs and Search Algorithms Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger Analysis of an M/M/1 Queue Using Fixed Order of Search for Arrivals and Service Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Kevin Fleming, Nicholas Pippenger Large deviations and moments for the Euler characteristic of a random surface. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1A. H. Hunter, Nicholas Pippenger Local versus Global Search in Channel Graphs Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Krzysztof Majewski, Nicholas Pippenger Attribute estimation and testing quasi-symmetry. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mark McCann, Nicholas Pippenger Fault tolerance in cellular automata at high fault rates. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Krzysztof Majewski, Nicholas Pippenger Attribute Estimation and Testing Quasi-Symmetry Search on Bibsonomy CoRR The full citation details ... 2007 DBLP  BibTeX  RDF
1Nicholas Pippenger, Kristin Schleich Topological characteristics of random triangulated surfaces. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger The Linking Probability of Deep Spider-Web Networks. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Mark McCann, Nicholas Pippenger SRT Division Algorithms as Dynamical Systems. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger The average amount of information lost in multiplication. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Entropy and expected acceptance counts for finite automata. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger The shortest disjunctive normal form of a random Boolean function. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Alex Brodsky, Nicholas Pippenger The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Nicholas Pippenger The inequalities of quantum information theory. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Mark McCann, Nicholas Pippenger SRT Division Algorithms as Dynamical Systems. Search on Bibsonomy IEEE Symposium on Computer Arithmetic The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Galois theory for minors of finite functions. Search on Bibsonomy Discrete Mathematics The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Analysis of Carry Propagation in Addition: An Elementary Approach. Search on Bibsonomy J. Algorithms The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2002 DBLP  BibTeX  RDF
1Alex Brodsky, Nicholas Pippenger Characterizations of 1-Way Quantum Finite Automata. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Quantum signal propagation in depolarizing channels. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Expected Acceptance Counts for Finite Automata with Almost Uniform Input. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Enumeration of Equicolorable Trees. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Upper and lower bounds for the average-case complexity of path-search. Search on Bibsonomy Networks The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Joel Hass, J. C. Lagarias, Nicholas Pippenger The Computational Complexity of Knot and Link Problems. Search on Bibsonomy J. ACM The full citation details ... 1999 DBLP  DOI  BibTeX  RDF three-dimensional topology, computational complexity, knot theory
1Nicholas Pippenger Entropy and enumeration of boolean functions. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Random interval graphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1William S. Evans, Nicholas Pippenger Average-Case Lower Bounds for Noisy Boolean Decision Trees. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1William S. Evans, Nicholas Pippenger On the Maximum Tolerable Noise for Reliable Computation by Formulas. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Pure Versus Impure Lisp. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF schematology, LISP, online computation
1Nicholas Pippenger Regular Languages and Stone Duality. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Theories of computability. Search on Bibsonomy 1997   RDF
1Joel Hass, J. C. Lagarias, Nicholas Pippenger The Computational Complexity of Knot and Link Problems. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Geng Lin, Nicholas Pippenger Routing algorithms for switching networks with probabilistic traffic. Search on Bibsonomy Networks The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Self-Routing Superconcentrators. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Pure versus Impure LISP. Search on Bibsonomy POPL The full citation details ... 1996 DBLP  DOI  BibTeX  RDF LISP
1William S. Evans, Nicholas Pippenger Lower Bounds for Noisy Boolean Decision Trees. Search on Bibsonomy STOC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Analysis of a Recurrence Arising from a Construction for Nonblocking Networks. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger, Geng Lin Fault-Tolerant Circuit-Switching Networks. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Geng Lin, Nicholas Pippenger Parallel Algorithms for Routing in Nonblocking Networks. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Symmetry in Self-Correcting Cellular Automata. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Juggling Networks. Search on Bibsonomy Canada-France Conference on Parallel and Distributed Computing The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Self-routing superconcentrators. Search on Bibsonomy STOC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger The Asymptotic Optimality of Spider-Web Networks. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger Polynomial Hash Functions Are Reliable (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger An Elementary Approach to Some Analytic Asymptotics. Search on Bibsonomy SWAT The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger, Geng Lin Fault-Tolerant Circuit-Switching Networks. Search on Bibsonomy SPAA The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger The Blocking Probability of Spider-Web Networks. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger The Expected Capacity of Concentrators. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Selection Networks. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger, George D. Stamoulis, John N. Tsitsiklis On a lower bound for the redundancy of reliable networks with noisy gates. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Geng Lin, Nicholas Pippenger Parallel Algorithms for Routing in Non-Blocking Networks. Search on Bibsonomy SPAA The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Yossi Azar, Nicholas Pippenger Parallel selection. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Communication Networks. Search on Bibsonomy Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) The full citation details ... 1990 DBLP  BibTeX  RDF
1Nicholas Pippenger Selection Networks. Search on Bibsonomy SIGAL International Symposium on Algorithms The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Mike Paterson, Nicholas Pippenger, Uri Zwick Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF multiplication circuits, multiple addition, shallowest possible circuits, shortest possible formulas, occurrence matrix, shortest multiple carry-save addition formulas, delay matrix, multiple carry-save adders, multiplication, symmetric Boolean functions, carry-save addition
1Nicholas Pippenger, Joel H. Spencer Asymptotic behavior of the chromatic index for hypergraphs. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Invariance of complexity measures for networks with unreliable gates. Search on Bibsonomy J. ACM The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Random Sequential Adsorption on Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Knots in random walks. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Paul Feldman, Joel Friedman, Nicholas Pippenger Wide-Sense Nonblocking Networks. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Correction to "Computational Complexity of Algebraic Functions". Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal Fault Tolerance in Networks of Bounded Degree. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Reliable computation by formulas in the presence of noise. Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1Joel Friedman, Nicholas Pippenger Expanding graphs contain all small trees. Search on Bibsonomy Combinatorica The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger The Complexity of Computations by Networks. Search on Bibsonomy IBM Journal of Research and Development The full citation details ... 1987 DBLP  BibTeX  RDF
1Nicholas Pippenger Sorting and Selecting in Rounds. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1Don Coppersmith, Maria M. Klawe, Nicholas Pippenger Alphabetic Minimax Trees of Degree at Most t. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal Fault Tolerance in Networks of Bounded Degree (Preliminary Version) Search on Bibsonomy STOC The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Paul Feldman, Joel Friedman, Nicholas Pippenger Non-Blocking Networks (Preliminary Version) Search on Bibsonomy STOC The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
1Ronald Fagin, Maria M. Klawe, Nicholas Pippenger, Larry J. Stockmeyer Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger On Networks of Noisy Gates Search on Bibsonomy FOCS The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
1H. James Hoover, Maria M. Klawe, Nicholas Pippenger Bounding Fan-out in Logical Networks. Search on Bibsonomy J. ACM The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Parallel Communication with Limited Buffers (Preliminary Version) Search on Bibsonomy FOCS The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
1Maria M. Klawe, Wolfgang J. Paul, Nicholas Pippenger, Mihalis Yannakakis On Monotone Formulae with Restricted Depth (Preliminary Version) Search on Bibsonomy STOC The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
1Allan Borodin, Stephen A. Cook, Nicholas Pippenger Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines Search on Bibsonomy Information and Control The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
1Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter On Determinism versus Non-Determinism and Related Problems (Preliminary Version) Search on Bibsonomy FOCS The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
1Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version) Search on Bibsonomy STOC The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Superconcentrators of Depth 2. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Advances in Pebbling (Preliminary Version). Search on Bibsonomy ICALP The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Probabilistic Simulations (Preliminary Version) Search on Bibsonomy STOC The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
1Gavriela Freund Lev, Nicholas Pippenger, Leslie G. Valiant A Fast Parallel Algorithm for Routing in Permutation Networks. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1981 DBLP  BibTeX  RDF
1Nicholas Pippenger Algebraic Complexity Theory. Search on Bibsonomy IBM Journal of Research and Development The full citation details ... 1981 DBLP  BibTeX  RDF
1Nicholas Pippenger Computational Complexity of Algebraic Functions. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Pebbling with an Auxiliary Pushdown. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Bounds on the performance of protocols for a multiple-access broadcast channel . Search on Bibsonomy IEEE Transactions on Information Theory The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger On Another Boolean Matrix. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger On the Evaluation of Powers and Monomials. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Comparative Schematology and Pebbling with Auxiliary Pushdowns (Preliminary Version) Search on Bibsonomy STOC The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
1Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong Extendible Hashing - A Fast Access Method for Dynamic Files. Search on Bibsonomy ACM Trans. Database Syst. The full citation details ... 1979 DBLP  DOI  BibTeX  RDF external hashing, radix search, searching, hashing, access method, B-tree, index, file organization, directory, trie, extendible hashing
1Nicholas Pippenger, Michael J. Fischer Relations Among Complexity Measures. Search on Bibsonomy J. ACM The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Communication: On the Application of Coding Theory to Hashing. Search on Bibsonomy IBM Journal of Research and Development The full citation details ... 1979 DBLP  BibTeX  RDF
1Nicholas Pippenger The Minimum Number of Edges in Graphs with Prescribed Paths. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
1Raymond E. Miller, Nicholas Pippenger, Arnold L. Rosenberg, Lawrence Snyder Optimal 2, 3-Trees. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger On Simultaneous Resource Bounds (Preliminary Version) Search on Bibsonomy FOCS The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
1Nicholas Pippenger Computational Complexity in Algebraic Function Fields (Preliminary Version) Search on Bibsonomy FOCS The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 113 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.