The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Larry J. Stockmeyer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Larry J. Stockmeyer
    The Polynomial-Time Hierarchy. [Citation Graph (21, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:3, n:1, pp:1-22 [Journal]
  2. Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer
    Alternation. [Citation Graph (14, 0)][DBLP]
    J. ACM, 1981, v:28, n:1, pp:114-133 [Journal]
  3. M. R. Garey, David S. Johnson, Larry J. Stockmeyer
    Some Simplified NP-Complete Graph Problems. [Citation Graph (8, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:1, n:3, pp:237-267 [Journal]
  4. Ronald Fagin, Larry J. Stockmeyer, Moshe Y. Vardi
    On Monadic NP vs. Monadic co-NP [Citation Graph (6, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:1, pp:78-92 [Journal]
  5. Larry J. Stockmeyer, Albert R. Meyer
    Word Problems Requiring Exponential Time: Preliminary Report [Citation Graph (5, 0)][DBLP]
    STOC, 1973, pp:1-9 [Conf]
  6. Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer
    On the minimal synchronism needed for distributed consensus. [Citation Graph (3, 0)][DBLP]
    J. ACM, 1987, v:34, n:1, pp:77-97 [Journal]
  7. Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer
    Parallel Algorithms for Term Matching. [Citation Graph (2, 0)][DBLP]
    CADE, 1986, pp:416-430 [Conf]
  8. Arnold L. Rosenberg, Larry J. Stockmeyer
    Hashing Schemes for Extendible Arrays. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1977, v:24, n:2, pp:199-221 [Journal]
  9. Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer
    Parallel Algorithms for Term Matching. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:4, pp:711-731 [Journal]
  10. Larry J. Stockmeyer, C. K. Wong
    On the Number of Comparisons to Find the Intersection of Two Relations. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:3, pp:388-404 [Journal]
  11. Ashok K. Chandra, Larry J. Stockmeyer
    Alternation [Citation Graph (1, 0)][DBLP]
    FOCS, 1976, pp:98-108 [Conf]
  12. Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer
    Consensus in the Presence of Partial Synchrony (Preliminary Version). [Citation Graph (1, 0)][DBLP]
    PODC, 1984, pp:103-118 [Conf]
  13. Vaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer
    A Characterization of the Power of Vector Machines [Citation Graph (1, 0)][DBLP]
    STOC, 1974, pp:122-134 [Conf]
  14. Moshe Y. Vardi, Larry J. Stockmeyer
    Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report [Citation Graph (1, 0)][DBLP]
    STOC, 1985, pp:240-251 [Conf]
  15. Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
    Constant Depth Reducibility. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:423-439 [Journal]
  16. Larry J. Stockmeyer, Uzi Vishkin
    Simulation of Parallel Random Access Machines by Circuits. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:409-422 [Journal]
  17. Thomas Ottmann, Arnold L. Rosenberg, Larry J. Stockmeyer
    A Dictionary Machine (for VLSI). [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Computers, 1982, v:31, n:9, pp:892-897 [Journal]
  18. Ronald Fagin, Larry J. Stockmeyer, Moshe Y. Vardi
    On Monadic NP vs. Monadic co-NP (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:19-30 [Conf]
  19. Larry J. Stockmeyer, Dharmendra S. Modha
    Links Between Complexity Theory and Constrained Block Coding. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:226-243 [Conf]
  20. Cynthia Dwork, Larry J. Stockmeyer
    Zero-Knowledge With Finite State Verifiers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:71-75 [Conf]
  21. Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
    Pseudorandom Number Generation and Space Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:171-176 [Conf]
  22. Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer
    Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:334-343 [Conf]
  23. Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
    A Complexity Theory for Unbounded Fan-In Parallelism [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:1-13 [Conf]
  24. Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer
    On the Minimal Synchronism Needed for Distributed Consensus [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:393-402 [Conf]
  25. Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
    Magic Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:523-534 [Conf]
  26. Cynthia Dwork, Larry J. Stockmeyer
    On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:480-485 [Conf]
  27. Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer
    Flipping Persuasively in Constant Expected Time (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:222-232 [Conf]
  28. Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer
    Alternating Pushdown Automata (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:92-106 [Conf]
  29. Albert R. Meyer, Larry J. Stockmeyer
    The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:125-129 [Conf]
  30. Mike Paterson, Larry J. Stockmeyer
    Bounds on the Evaluation Time for Rational Polynomials [Citation Graph (0, 0)][DBLP]
    FOCS, 1971, pp:140-143 [Conf]
  31. Ching-Tien Ho, Larry J. Stockmeyer
    A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  32. Guillermo A. Alvarez, Walter A. Burkhard, Larry J. Stockmeyer, Flaviu Cristian
    Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism. [Citation Graph (0, 0)][DBLP]
    ISCA, 1998, pp:109-120 [Conf]
  33. Alain J. Mayer, Moni Naor, Larry J. Stockmeyer
    Local Computations on Static and Dynamic Graphs (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:268-278 [Conf]
  34. Miklós Ajtai, Cynthia Dwork, Larry J. Stockmeyer
    An Architecture for Provably Secure Computation. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:56-67 [Conf]
  35. Miklós Ajtai, Ronald Fagin, Larry J. Stockmeyer
    The Closure of Monadic NP (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:309-318 [Conf]
  36. Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer
    Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:359-369 [Conf]
  37. Larry Carter, Larry J. Stockmeyer, Mark N. Wegman
    The Complexity of Backtrack Searches (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:449-457 [Conf]
  38. Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer
    The Distributed Firing Squad Problem (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:335-345 [Conf]
  39. Cynthia Dwork, Larry J. Stockmeyer
    2-round zero knowledge and proof auditors. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:322-331 [Conf]
  40. Michael J. Fischer, Larry J. Stockmeyer
    Fast On-Line Integer Multiplication [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:67-72 [Conf]
  41. M. R. Garey, David S. Johnson, Larry J. Stockmeyer
    Some Simplified NP-Complete Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:47-63 [Conf]
  42. Richard J. Lipton, Larry J. Stockmeyer
    Evaluation of Polynomials with Super-Preconditioning [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:174-180 [Conf]
  43. Moni Naor, Larry J. Stockmeyer
    What can be computed locally? [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:184-193 [Conf]
  44. Arnold L. Rosenberg, Larry J. Stockmeyer
    Hashing Schemes for Extendible Arrays (Extended Arrays) [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:159-166 [Conf]
  45. Larry J. Stockmeyer
    The Complexity of Approximate Counting (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:118-126 [Conf]
  46. Arnold L. Rosenberg, Larry J. Stockmeyer
    Storage Schemes for Boundedly Extendible Arrays [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1977, v:7, n:, pp:289-303 [Journal]
  47. David M. Choy, Ronald Fagin, Larry J. Stockmeyer
    Efficiently Extendible Mappings for Balanced Data Distribution. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:2, pp:215-232 [Journal]
  48. Lawrence T. Kou, Larry J. Stockmeyer, C. K. Wong
    Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1978, v:21, n:2, pp:135-139 [Journal]
  49. Randal C. Burns, Robert M. Rees, Larry J. Stockmeyer, Darrell D. E. Long
    Scalable Session Locking for a Distributed File System. [Citation Graph (0, 0)][DBLP]
    Cluster Computing, 2001, v:4, n:4, pp:295-306 [Journal]
  50. Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
    Pseudorandom Number Generation and Space Complexity [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:64, n:1-3, pp:43-51 [Journal]
  51. Richard E. Ladner, Larry J. Stockmeyer, Richard J. Lipton
    Alternation Bounded Auxiliary Pushdown Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:62, n:2/3, pp:93-108 [Journal]
  52. Alain J. Mayer, Larry J. Stockmeyer
    Word Problems-This Time with Interleaving [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:115, n:2, pp:293-311 [Journal]
  53. Larry J. Stockmeyer
    Optimal Orientations of Cells in Slicing Floorplan Designs [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:57, n:2/3, pp:91-101 [Journal]
  54. Larry J. Stockmeyer, Vijay V. Vazirani
    NP-Completeness of Some Generalizations of the Maximum Matching Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:1, pp:14-19 [Journal]
  55. Miklós Ajtai, Randal C. Burns, Ronald Fagin, Darrell D. E. Long, Larry J. Stockmeyer
    Compactly encoding unstructured inputs with differential compression. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:3, pp:318-367 [Journal]
  56. Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer
    Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:1, pp:122-152 [Journal]
  57. Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer
    Consensus in the presence of partial synchrony. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:2, pp:288-323 [Journal]
  58. Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
    Magic Functions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:6, pp:852-921 [Journal]
  59. Cynthia Dwork, Larry J. Stockmeyer
    Finite State Verifiers I: The Power of Interaction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:4, pp:800-828 [Journal]
  60. Cynthia Dwork, Larry J. Stockmeyer
    Finite State Verifiers II: Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:4, pp:829-858 [Journal]
  61. Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin
    Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:3, pp:459-473 [Journal]
  62. Larry J. Stockmeyer, Albert R. Meyer
    Cosmological lower bound on the circuit complexity of a small problem in logic. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:6, pp:753-784 [Journal]
  63. Miklós Ajtai, Ronald Fagin, Larry J. Stockmeyer
    The Closure of Monadic NP. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:3, pp:660-716 [Journal]
  64. Michael J. Fischer, Larry J. Stockmeyer
    Fast On-Line Integer Multiplication. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1974, v:9, n:3, pp:317-331 [Journal]
  65. Richard J. Lipton, Larry J. Stockmeyer
    Evaluation of Polynomials with Super-Preconditioning. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1978, v:16, n:2, pp:124-139 [Journal]
  66. Vaughan R. Pratt, Larry J. Stockmeyer
    A Characterization of the Power of Vector Machines. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:12, n:2, pp:198-221 [Journal]
  67. Larry J. Stockmeyer
    Classifying the Computational Complexity of Problems. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1987, v:52, n:1, pp:1-43 [Journal]
  68. Larry J. Stockmeyer
    On the Combinational Complexity of Certain Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1977, v:10, n:, pp:323-336 [Journal]
  69. Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer
    The Distributed Firing Squad Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:5, pp:990-1012 [Journal]
  70. Cynthia Dwork, Larry J. Stockmeyer
    A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:6, pp:1011-1023 [Journal]
  71. Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer
    Flipping Persuasively in Constant Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:3, pp:472-499 [Journal]
  72. Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer
    Alternating Pushdown and Stack Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:1, pp:135-155 [Journal]
  73. Moni Naor, Larry J. Stockmeyer
    What Can be Computed Locally? [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:6, pp:1259-1277 [Journal]
  74. Mike Paterson, Larry J. Stockmeyer
    On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1973, v:2, n:1, pp:60-66 [Journal]
  75. Larry J. Stockmeyer
    On Approximation Algorithms for #P. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:849-861 [Journal]
  76. Larry J. Stockmeyer, Ashok K. Chandra
    Provably Difficult Combinatorial Games. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:2, pp:151-174 [Journal]
  77. Ching-Tien Ho, Larry J. Stockmeyer
    A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2004, v:53, n:4, pp:427-439 [Journal]
  78. Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer
    Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:175-201 [Journal]
  79. 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]
  80. Alain J. Mayer, Larry J. Stockmeyer
    The Complexity of PDL with Interleaving. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:109-122 [Journal]
  81. Arnold L. Rosenberg, Larry J. Stockmeyer, Lawrence Snyder
    Uniform Data Encodings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:145-165 [Journal]
  82. Larry J. Stockmeyer, Dharmendra S. Modha
    Links between complexity theory and constrained block coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:1, pp:59-88 [Journal]
  83. Randal C. Burns, Larry J. Stockmeyer, Darrell D. E. Long
    In-Place Reconstruction of Version Differences. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2003, v:15, n:4, pp:973-984 [Journal]

Search in 0.109secs, Finished in 0.113secs
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