The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nicholas Pippenger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong
    Extendible Hashing - A Fast Access Method for Dynamic Files. [Citation Graph (109, 8)][DBLP]
    ACM Trans. Database Syst., 1979, v:4, n:3, pp:315-344 [Journal]
  2. Raymond E. Miller, Nicholas Pippenger, Arnold L. Rosenberg, Lawrence Snyder
    Optimal 2, 3-Trees. [Citation Graph (5, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:1, pp:42-59 [Journal]
  3. Nicholas Pippenger
    On Simultaneous Resource Bounds (Preliminary Version) [Citation Graph (4, 0)][DBLP]
    FOCS, 1979, pp:307-311 [Conf]
  4. Maria M. Klawe, Wolfgang J. Paul, Nicholas Pippenger, Mihalis Yannakakis
    On Monotone Formulae with Restricted Depth (Preliminary Version) [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:480-487 [Conf]
  5. Mark McCann, Nicholas Pippenger
    SRT Division Algorithms as Dynamical Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Computer Arithmetic, 2003, pp:46-53 [Conf]
  6. Nicholas Pippenger
    Juggling Networks. [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:1-12 [Conf]
  7. Joel Hass, J. C. Lagarias, Nicholas Pippenger
    The Computational Complexity of Knot and Link Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:172-181 [Conf]
  8. Mike Paterson, Nicholas Pippenger, Uri Zwick
    Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:642-650 [Conf]
  9. Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter
    On Determinism versus Non-Determinism and Related Problems (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:429-438 [Conf]
  10. Nicholas Pippenger
    Information Theory and the Complexity of Switching Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:113-118 [Conf]
  11. Nicholas Pippenger
    On the Evaluation of Powers and Related Problems (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1976, pp:258-263 [Conf]
  12. Nicholas Pippenger
    Computational Complexity in Algebraic Function Fields (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:61-65 [Conf]
  13. Nicholas Pippenger
    Parallel Communication with Limited Buffers (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:127-136 [Conf]
  14. Nicholas Pippenger
    On Networks of Noisy Gates [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:30-38 [Conf]
  15. Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger
    Polynomial Hash Functions Are Reliable (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:235-246 [Conf]
  16. Nicholas Pippenger
    Advances in Pebbling (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:407-417 [Conf]
  17. Nicholas Pippenger
    Expected Acceptance Counts for Finite Automata with Almost Uniform Input. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:636-646 [Conf]
  18. Nicholas Pippenger
    Pure versus Impure LISP. [Citation Graph (0, 0)][DBLP]
    POPL, 1996, pp:104-109 [Conf]
  19. Nicholas Pippenger
    Selection Networks. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:2-11 [Conf]
  20. Geng Lin, Nicholas Pippenger
    Parallel Algorithms for Routing in Non-Blocking Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:272-277 [Conf]
  21. Nicholas Pippenger, Geng Lin
    Fault-Tolerant Circuit-Switching Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:229-235 [Conf]
  22. Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson
    Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:42-51 [Conf]
  23. Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
    Fault Tolerance in Networks of Bounded Degree (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:370-379 [Conf]
  24. William S. Evans, Nicholas Pippenger
    Lower Bounds for Noisy Boolean Decision Trees. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:620-628 [Conf]
  25. Paul Feldman, Joel Friedman, Nicholas Pippenger
    Non-Blocking Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:247-254 [Conf]
  26. Nicholas Pippenger
    The Realization of Monotone Boolean Functions (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:204-210 [Conf]
  27. Nicholas Pippenger
    Comparative Schematology and Pebbling with Auxiliary Pushdowns (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:351-356 [Conf]
  28. Nicholas Pippenger
    Probabilistic Simulations (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:17-26 [Conf]
  29. Nicholas Pippenger
    Self-routing superconcentrators. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:355-361 [Conf]
  30. Nicholas Pippenger
    An Elementary Approach to Some Analytic Asymptotics. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:53-61 [Conf]
  31. Joel Friedman, Nicholas Pippenger
    Expanding graphs contain all small trees. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:1, pp:71-76 [Journal]
  32. Alex Brodsky, Nicholas Pippenger
    The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  33. Nicholas Pippenger
    The Asymptotic Optimality of Spider-Web Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:437-450 [Journal]
  34. Nicholas Pippenger
    Galois theory for minors of finite functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:405-419 [Journal]
  35. Allan Borodin, Stephen A. Cook, Nicholas Pippenger
    Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:58, n:1-3, pp:113-136 [Journal]
  36. Nicholas Pippenger
    The Complexity of Computations by Networks. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 1987, v:31, n:2, pp:235-243 [Journal]
  37. Nicholas Pippenger
    Communication: On the Application of Coding Theory to Hashing. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 1979, v:23, n:2, pp:225-226 [Journal]
  38. Nicholas Pippenger
    Algebraic Complexity Theory. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 1981, v:25, n:5, pp:825-832 [Journal]
  39. Joel Hass, J. C. Lagarias, Nicholas Pippenger
    The Computational Complexity of Knot and Link Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:2, pp:185-211 [Journal]
  40. H. James Hoover, Maria M. Klawe, Nicholas Pippenger
    Bounding Fan-out in Logical Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:1, pp:13-18 [Journal]
  41. Nicholas Pippenger
    A Time-Space Trade-Off. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:509-515 [Journal]
  42. Nicholas Pippenger
    Invariance of complexity measures for networks with unreliable gates. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:3, pp:531-539 [Journal]
  43. Nicholas Pippenger, Michael J. Fischer
    Relations Among Complexity Measures. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:2, pp:361-381 [Journal]
  44. Nicholas Pippenger, Leslie G. Valiant
    Shifting Graphs and Their Applications. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:3, pp:423-432 [Journal]
  45. Nicholas Pippenger
    Analysis of Carry Propagation in Addition: An Elementary Approach. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:2, pp:317-333 [Journal]
  46. Nicholas Pippenger
    On Rearrangeable and Non-Blocking Switching Networks. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:17, n:2, pp:145-162 [Journal]
  47. Nicholas Pippenger
    Computational Complexity of Algebraic Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:22, n:3, pp:454-470 [Journal]
  48. Nicholas Pippenger
    Pebbling with an Auxiliary Pushdown. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:23, n:2, pp:151-165 [Journal]
  49. Nicholas Pippenger
    Superconcentrators of Depth 2. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:24, n:1, pp:82-90 [Journal]
  50. Nicholas Pippenger
    Correction to "Computational Complexity of Algebraic Functions". [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:3, pp:395-399 [Journal]
  51. Nicholas Pippenger
    Symmetry in Self-Correcting Cellular Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:1, pp:83-95 [Journal]
  52. Nicholas Pippenger
    Self-Routing Superconcentrators. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:1, pp:53-60 [Journal]
  53. Arnold Schönhage, Mike Paterson, Nicholas Pippenger
    Finding the Median. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:13, n:2, pp:184-199 [Journal]
  54. Nicholas Pippenger
    An Information-Theoretic Method in Combinatorial Theory. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1977, v:23, n:1, pp:99-104 [Journal]
  55. Nicholas Pippenger, Joel H. Spencer
    Asymptotic behavior of the chromatic index for hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:51, n:1, pp:24-42 [Journal]
  56. Geng Lin, Nicholas Pippenger
    Parallel Algorithms for Routing in Nonblocking Networks. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:1, pp:29-40 [Journal]
  57. Nicholas Pippenger
    Information Theory and the Complexity of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1977, v:10, n:, pp:129-167 [Journal]
  58. Nicholas Pippenger
    The Complexity of Monotone Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1978, v:11, n:, pp:289-316 [Journal]
  59. Nicholas Pippenger
    The Minimum Number of Edges in Graphs with Prescribed Paths. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1979, v:12, n:, pp:325-346 [Journal]
  60. Nicholas Pippenger
    Regular Languages and Stone Duality. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:2, pp:121-134 [Journal]
  61. Geng Lin, Nicholas Pippenger
    Routing algorithms for switching networks with probabilistic traffic. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:28, n:1, pp:21-29 [Journal]
  62. Nicholas Pippenger
    Upper and lower bounds for the average-case complexity of path-search. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:33, n:4, pp:249-259 [Journal]
  63. Nicholas Pippenger
    The shortest disjunctive normal form of a random Boolean function. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:22, n:2, pp:161-186 [Journal]
  64. Nicholas Pippenger
    The Blocking Probability of Spider-Web Networks. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:2, pp:121-150 [Journal]
  65. Nicholas Pippenger
    Random interval graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:4, pp:361-380 [Journal]
  66. Nicholas Pippenger, Kristin Schleich
    Topological characteristics of random triangulated surfaces. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:3, pp:247-288 [Journal]
  67. Alex Brodsky, Nicholas Pippenger
    Characterizations of 1-Way Quantum Finite Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1456-1478 [Journal]
  68. Don Coppersmith, Maria M. Klawe, Nicholas Pippenger
    Alphabetic Minimax Trees of Degree at Most t. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:189-192 [Journal]
  69. Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
    Fault Tolerance in Networks of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:5, pp:975-988 [Journal]
  70. William S. Evans, Nicholas Pippenger
    Average-Case Lower Bounds for Noisy Boolean Decision Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:433-446 [Journal]
  71. Mark McCann, Nicholas Pippenger
    SRT Division Algorithms as Dynamical Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:6, pp:1279-1301 [Journal]
  72. Nicholas Pippenger
    Superconcentrators. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:2, pp:298-304 [Journal]
  73. Nicholas Pippenger
    Generalized Connectors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1978, v:7, n:4, pp:510-514 [Journal]
  74. Nicholas Pippenger
    On the Evaluation of Powers and Monomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:2, pp:230-250 [Journal]
  75. Nicholas Pippenger
    Sorting and Selecting in Rounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:6, pp:1032-1038 [Journal]
  76. Nicholas Pippenger
    Selection Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:5, pp:878-887 [Journal]
  77. Paul Feldman, Joel Friedman, Nicholas Pippenger
    Wide-Sense Nonblocking Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:2, pp:158-173 [Journal]
  78. Nicholas Pippenger
    Enumeration of Equicolorable Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:1, pp:93-115 [Journal]
  79. Nicholas Pippenger
    Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:16, n:1, pp:47-64 [Journal]
  80. Nicholas Pippenger
    The Linking Probability of Deep Spider-Web Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2006, v:20, n:1, pp:143-159 [Journal]
  81. Nicholas Pippenger
    Random Sequential Adsorption on Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:393-401 [Journal]
  82. Nicholas Pippenger
    The Expected Capacity of Concentrators. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:121-129 [Journal]
  83. Nicholas Pippenger
    Analysis of a Recurrence Arising from a Construction for Nonblocking Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:2, pp:322-345 [Journal]
  84. Nicholas Pippenger, Geng Lin
    Fault-Tolerant Circuit-Switching Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:108-118 [Journal]
  85. Gavriela Freund Lev, Nicholas Pippenger, Leslie G. Valiant
    A Fast Parallel Algorithm for Routing in Permutation Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:2, pp:93-100 [Journal]
  86. Ronald Fagin, Maria M. Klawe, Nicholas Pippenger, Larry J. Stockmeyer
    Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:36, n:, pp:239-250 [Journal]
  87. Mark Kleiman, Nicholas Pippenger
    An Explicit Construction of Short Monotone Formulae for the Monotone Symmetric Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1978, v:7, n:, pp:325-332 [Journal]
  88. Nicholas Pippenger
    On Another Boolean Matrix. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:49-56 [Journal]
  89. William S. Evans, Nicholas Pippenger
    On the Maximum Tolerable Noise for Reliable Computation by Formulas. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1299-1305 [Journal]
  90. Nicholas Pippenger
    Quantum signal propagation in depolarizing channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:1, pp:276-278 [Journal]
  91. Nicholas Pippenger
    The inequalities of quantum information theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:4, pp:773-789 [Journal]
  92. Nicholas Pippenger
    Entropy and expected acceptance counts for finite automata. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:1, pp:78-88 [Journal]
  93. Nicholas Pippenger
    The average amount of information lost in multiplication. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:2, pp:684-687 [Journal]
  94. Nicholas Pippenger
    Bounds on the performance of protocols for a multiple-access broadcast channel . [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:2, pp:145-151 [Journal]
  95. Nicholas Pippenger
    Reliable computation by formulas in the presence of noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:2, pp:194-197 [Journal]
  96. Nicholas Pippenger
    Entropy and enumeration of boolean functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:2096-2100 [Journal]
  97. Nicholas Pippenger, George D. Stamoulis, John N. Tsitsiklis
    On a lower bound for the redundancy of reliable networks with noisy gates. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:639-0 [Journal]
  98. Nicholas Pippenger
    Pure Versus Impure Lisp. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1997, v:19, n:2, pp:223-238 [Journal]
  99. Krzysztof Majewski, Nicholas Pippenger
    Attribute Estimation and Testing Quasi-Symmetry [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  100. Local versus Global Search in Channel Graphs [Citation Graph (, )][DBLP]


  101. Knots in random walks. [Citation Graph (, )][DBLP]


  102. Parallel selection. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002