default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLarry J. Stockmeyer
Person information
- award (2007): Dijkstra Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[c34]Miklós Ajtai, Cynthia Dwork, Larry J. Stockmeyer:
An Architecture for Provably Secure Computation. LATIN 2006: 56-67- 2004
- [j51]Ching-Tien Ho, Larry J. Stockmeyer:
A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers. IEEE Trans. Computers 53(4): 427-439 (2004) - 2003
- [j50]Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer:
Magic Functions. J. ACM 50(6): 852-921 (2003) - [j49]Randal C. Burns
, Larry J. Stockmeyer, Darrell D. E. Long:
In-Place Reconstruction of Version Differences. IEEE Trans. Knowl. Data Eng. 15(4): 973-984 (2003) - 2002
- [j48]Miklós Ajtai, Randal C. Burns, Ronald Fagin, Darrell D. E. Long, Larry J. Stockmeyer:
Compactly encoding unstructured inputs with differential compression. J. ACM 49(3): 318-367 (2002) - [j47]Larry J. Stockmeyer, Albert R. Meyer:
Cosmological lower bound on the circuit complexity of a small problem in logic. J. ACM 49(6): 753-784 (2002) - [j46]Larry J. Stockmeyer, Dharmendra S. Modha:
Links between complexity theory and constrained block coding. IEEE Trans. Inf. Theory 48(1): 59-88 (2002) - [c33]Ching-Tien Ho, Larry J. Stockmeyer:
A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers. IPDPS 2002 - [c32]Cynthia Dwork, Larry J. Stockmeyer:
2-round zero knowledge and proof auditors. STOC 2002: 322-331 - 2001
- [j45]Randal C. Burns, Robert M. Rees, Larry J. Stockmeyer, Darrell D. E. Long:
Scalable Session Locking for a Distributed File System. Clust. Comput. 4(4): 295-306 (2001) - [c31]Larry J. Stockmeyer, Dharmendra S. Modha:
Links Between Complexity Theory and Constrained Block Coding. CCC 2001: 226-243 - 2000
- [j44]Miklós Ajtai, Ronald Fagin, Larry J. Stockmeyer:
The Closure of Monadic NP. J. Comput. Syst. Sci. 60(3): 660-716 (2000)
1990 – 1999
- 1999
- [c30]Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer:
Magic Functions. FOCS 1999: 523-534 - 1998
- [j43]Ronald Fagin, Larry J. Stockmeyer:
Relaxing the Triangle Inequality in Pattern Matching. Int. J. Comput. Vis. 30(3): 219-231 (1998) - [c29]Guillermo A. Alvarez, Walter A. Burkhard, Larry J. Stockmeyer, Flaviu Cristian:
Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism. ISCA 1998: 109-120 - [c28]Miklós Ajtai, Ronald Fagin, Larry J. Stockmeyer:
The Closure of Monadic NP (Extended Abstract). STOC 1998: 309-318 - 1996
- [j42]David M. Choy, Ronald Fagin, Larry J. Stockmeyer:
Efficiently Extendible Mappings for Balanced Data Distribution. Algorithmica 16(2): 215-232 (1996) - [j41]Alain J. Mayer, Larry J. Stockmeyer:
The Complexity of PDL with Interleaving. Theor. Comput. Sci. 161(1&2): 109-122 (1996) - 1995
- [j40]Ronald Fagin, Larry J. Stockmeyer, Moshe Y. Vardi:
On Monadic NP vs. Monadic co-NP. Inf. Comput. 120(1): 78-92 (1995) - [j39]Moni Naor, Larry J. Stockmeyer:
What Can be Computed Locally? SIAM J. Comput. 24(6): 1259-1277 (1995) - [c27]Alain J. Mayer, Moni Naor, Larry J. Stockmeyer:
Local Computations on Static and Dynamic Graphs (Preliminary Version). ISTCS 1995: 268-278 - 1994
- [j38]Alain J. Mayer, Larry J. Stockmeyer:
The Complexity of Word Problems - This Time with Interleaving. Inf. Comput. 115(2): 293-311 (1994) - [j37]Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer:
Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty. J. ACM 41(1): 122-152 (1994) - [j36]Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer:
Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. Theor. Comput. Sci. 130(1): 175-201 (1994) - 1993
- [c26]Ronald Fagin, Larry J. Stockmeyer, Moshe Y. Vardi:
On Monadic NP vs. Monadic co-NP (Extended Abstract). SCT 1993: 19-30 - [c25]Moni Naor, Larry J. Stockmeyer:
What can be computed locally? STOC 1993: 184-193 - 1992
- [j35]Cynthia Dwork, Larry J. Stockmeyer:
Finite State Verifiers I: The Power of Interaction. J. ACM 39(4): 800-828 (1992) - [j34]Cynthia Dwork, Larry J. Stockmeyer:
Finite State Verifiers II: Zero Knowledge. J. ACM 39(4): 829-858 (1992) - [c24]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). FOCS 1992: 334-343 - 1991
- [c23]Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer:
Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty. STOC 1991: 359-369 - 1990
- [j33]Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer:
Flipping Persuasively in Constant Time. SIAM J. Comput. 19(3): 472-499 (1990) - [j32]Cynthia Dwork, Larry J. Stockmeyer:
A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata. SIAM J. Comput. 19(6): 1011-1023 (1990)
1980 – 1989
- 1989
- [j31]Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer:
The Distributed Firing Squad Problem. SIAM J. Comput. 18(5): 990-1012 (1989) - [c22]Cynthia Dwork, Larry J. Stockmeyer:
On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract). FOCS 1989: 480-485 - 1988
- [j30]Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer:
Consensus in the presence of partial synchrony. J. ACM 35(2): 288-323 (1988) - [j29]Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer:
Parallel Algorithms for Term Matching. SIAM J. Comput. 17(4): 711-731 (1988) - [c21]Cynthia Dwork, Larry J. Stockmeyer:
Zero-Knowledge With Finite State Verifiers. CRYPTO 1988: 71-75 - 1987
- [j28]Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer:
On the minimal synchronism needed for distributed consensus. J. ACM 34(1): 77-97 (1987) - [j27]Larry J. Stockmeyer:
Classifying the Computational Complexity of Problems. J. Symb. Log. 52(1): 1-43 (1987) - 1986
- [c20]Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer:
Parallel Algorithms for Term Matching. CADE 1986: 416-430 - [c19]Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer:
Flipping Persuasively in Constant Expected Time (Preliminary Version). FOCS 1986: 222-232 - 1985
- [j26]Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer:
Pseudorandom Number Generation and Space Complexity. Inf. Control. 64(1-3): 43-51 (1985) - [j25]Larry J. Stockmeyer:
On Approximation Algorithms for #P. SIAM J. Comput. 14(4): 849-861 (1985) - [j24]Ronald Fagin, Maria M. Klawe, Nicholas Pippenger, Larry J. Stockmeyer:
Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions. Theor. Comput. Sci. 36: 239-250 (1985) - [c18]Moshe Y. Vardi, Larry J. Stockmeyer:
Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report. STOC 1985: 240-251 - [c17]Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer:
The Distributed Firing Squad Problem (Preliminary Version). STOC 1985: 335-345 - [c16]Larry Carter, Larry J. Stockmeyer, Mark N. Wegman:
The Complexity of Backtrack Searches (Preliminary Version). STOC 1985: 449-457 - 1984
- [j23]Richard E. Ladner, Larry J. Stockmeyer, Richard J. Lipton:
Alternation Bounded Auxiliary Pushdown Automata. Inf. Control. 62(2/3): 93-108 (1984) - [j22]Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin:
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. J. ACM 31(3): 459-473 (1984) - [j21]Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer:
Alternating Pushdown and Stack Automata. SIAM J. Comput. 13(1): 135-155 (1984) - [j20]Larry J. Stockmeyer, Uzi Vishkin:
Simulation of Parallel Random Access Machines by Circuits. SIAM J. Comput. 13(2): 409-422 (1984) - [j19]Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin:
Constant Depth Reducibility. SIAM J. Comput. 13(2): 423-439 (1984) - [c15]Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer:
Consensus in the Presence of Partial Synchrony (Preliminary Version). PODC 1984: 103-118 - 1983
- [j18]Larry J. Stockmeyer:
Optimal Orientations of Cells in Slicing Floorplan Designs. Inf. Control. 57(2/3): 91-101 (1983) - [c14]Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer:
Pseudorandom Number Generation and Space Complexity. FCT 1983: 171-176 - [c13]Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer:
On the Minimal Synchronism Needed for Distributed Consensus. FOCS 1983: 393-402 - [c12]Larry J. Stockmeyer:
The Complexity of Approximate Counting (Preliminary Version). STOC 1983: 118-126 - 1982
- [j17]Larry J. Stockmeyer, Vijay V. Vazirani:
NP-Completeness of Some Generalizations of the Maximum Matching Problem. Inf. Process. Lett. 15(1): 14-19 (1982) - [j16]Thomas Ottmann, Arnold L. Rosenberg, Larry J. Stockmeyer:
A Dictionary Machine (for VLSI). IEEE Trans. Computers 31(9): 892-897 (1982) - [c11]Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin:
A Complexity Theory for Unbounded Fan-In Parallelism. FOCS 1982: 1-13 - 1981
- [j15]Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer:
Alternation. J. ACM 28(1): 114-133 (1981) - 1980
- [j14]Arnold L. Rosenberg, Larry J. Stockmeyer, Lawrence Snyder:
Uniform Data Encodings. Theor. Comput. Sci. 11: 145-165 (1980)
1970 – 1979
- 1979
- [j13]Larry J. Stockmeyer, Ashok K. Chandra:
Provably Difficult Combinatorial Games. SIAM J. Comput. 8(2): 151-174 (1979) - [j12]Larry J. Stockmeyer, C. K. Wong:
On the Number of Comparisons to Find the Intersection of Two Relations. SIAM J. Comput. 8(3): 388-404 (1979) - 1978
- [j11]Lawrence T. Kou, Larry J. Stockmeyer, C. K. Wong:
Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs. Commun. ACM 21(2): 135-139 (1978) - [j10]Richard J. Lipton, Larry J. Stockmeyer:
Evaluation of Polynomials with Super-Preconditioning. J. Comput. Syst. Sci. 16(2): 124-139 (1978) - [c10]Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer:
Alternating Pushdown Automata (Preliminary Report). FOCS 1978: 92-106 - 1977
- [j9]Arnold L. Rosenberg, Larry J. Stockmeyer:
Storage Schemes for Boundedly Extendible Arrays. Acta Informatica 7: 289-303 (1977) - [j8]Arnold L. Rosenberg, Larry J. Stockmeyer:
Hashing Schemes for Extendible Arrays. J. ACM 24(2): 199-221 (1977) - [j7]Larry J. Stockmeyer:
On the Combinational Complexity of Certain Symmetric Boolean Functions. Math. Syst. Theory 10: 323-336 (1977) - 1976
- [j6]Vaughan R. Pratt, Larry J. Stockmeyer:
A Characterization of the Power of Vector Machines. J. Comput. Syst. Sci. 12(2): 198-221 (1976) - [j5]M. R. Garey, David S. Johnson, Larry J. Stockmeyer:
Some Simplified NP-Complete Graph Problems. Theor. Comput. Sci. 1(3): 237-267 (1976) - [j4]Larry J. Stockmeyer:
The Polynomial-Time Hierarchy. Theor. Comput. Sci. 3(1): 1-22 (1976) - [c9]Ashok K. Chandra, Larry J. Stockmeyer:
Alternation. FOCS 1976: 98-108 - [c8]Richard J. Lipton, Larry J. Stockmeyer:
Evaluation of Polynomials with Super-Preconditioning. STOC 1976: 174-180 - 1975
- [c7]Arnold L. Rosenberg, Larry J. Stockmeyer:
Hashing Schemes for Extendible Arrays (Extended Arrays). STOC 1975: 159-166 - 1974
- [b1]Larry J. Stockmeyer:
The complexity of decision problems in automata theory and logic. Massachusetts Institute of Technology, USA, 1974 - [j3]Michael J. Fischer, Larry J. Stockmeyer:
Fast On-Line Integer Multiplication. J. Comput. Syst. Sci. 9(3): 317-331 (1974) - [c6]M. R. Garey, David S. Johnson, Larry J. Stockmeyer:
Some Simplified NP-Complete Problems. STOC 1974: 47-63 - [c5]Vaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer:
A Characterization of the Power of Vector Machines. STOC 1974: 122-134 - 1973
- [j2]Mike Paterson, Larry J. Stockmeyer:
On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials. SIAM J. Comput. 2(1): 60-66 (1973) - [j1]Larry J. Stockmeyer:
Planar 3-colorability is polynomial complete. SIGACT News 5(3): 19-25 (1973) - [c4]Larry J. Stockmeyer, Albert R. Meyer:
Word Problems Requiring Exponential Time: Preliminary Report. STOC 1973: 1-9 - [c3]Michael J. Fischer, Larry J. Stockmeyer:
Fast On-Line Integer Multiplication. STOC 1973: 67-72 - 1972
- [c2]Albert R. Meyer, Larry J. Stockmeyer:
The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space. SWAT 1972: 125-129 - 1971
- [c1]Mike Paterson, Larry J. Stockmeyer:
Bounds on the Evaluation Time for Rational Polynomials. SWAT 1971: 140-143
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-30 20:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
