Larry J. Stockmeyer

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2006
c34		Miklós Ajtai, Cynthia Dwork, Larry J. Stockmeyer: An Architecture for Provably Secure Computation. LATIN 2006: 56-67
	2004
j50		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
j49		Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer: Magic Functions. J. ACM 50(6): 852-921 (2003)
j48		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
j47		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)
j46		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)
j45		Larry J. Stockmeyer, Dharmendra S. Modha: Links between complexity theory and constrained block coding. IEEE Transactions on Information 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
j44		Randal C. Burns, Robert M. Rees, Larry J. Stockmeyer, Darrell D. E. Long: Scalable Session Locking for a Distributed File System. Cluster Computing 4(4): 295-306 (2001)
c31		Larry J. Stockmeyer, Dharmendra S. Modha: Links Between Complexity Theory and Constrained Block Coding. IEEE Conference on Computational Complexity 2001: 226-243
	2000
j43		Miklós Ajtai, Ronald Fagin, Larry J. Stockmeyer: The Closure of Monadic NP. J. Comput. Syst. Sci. 60(3): 660-716 (2000)
	1999
c30		Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer: Magic Functions. FOCS 1999: 523-534
	1998
j42		Ronald Fagin, Larry J. Stockmeyer: Relaxing the Triangle Inequality in Pattern Matching. International Journal of Computer Vision 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
j41		David M. Choy, Ronald Fagin, Larry J. Stockmeyer: Efficiently Extendible Mappings for Balanced Data Distribution. Algorithmica 16(2): 215-232 (1996)
j40		Alain J. Mayer, Larry J. Stockmeyer: The Complexity of PDL with Interleaving. Theor. Comput. Sci. 161(1&2): 109-122 (1996)
	1995
j39		Ronald Fagin, Larry J. Stockmeyer, Moshe Y. Vardi: On Monadic NP vs. Monadic co-NP. Inf. Comput. 120(1): 78-92 (1995)
j38		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
j37		Alain J. Mayer, Larry J. Stockmeyer: Word Problems-This Time with Interleaving. Inf. Comput. 115(2): 293-311 (1994)
j36		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)
j35		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). Structure in Complexity Theory Conference 1993: 19-30
c25		Moni Naor, Larry J. Stockmeyer: What can be computed locally? STOC 1993: 184-193
	1992
j34		Cynthia Dwork, Larry J. Stockmeyer: Finite State Verifiers I: The Power of Interaction. J. ACM 39(4): 800-828 (1992)
j33		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
j32		Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer: Flipping Persuasively in Constant Time. SIAM J. Comput. 19(3): 472-499 (1990)
j31		Cynthia Dwork, Larry J. Stockmeyer: A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata. SIAM J. Comput. 19(6): 1011-1023 (1990)
	1989
j30		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
j29		Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer: Consensus in the presence of partial synchrony. J. ACM 35(2): 288-323 (1988)
j28		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
j27		Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer: On the minimal synchronism needed for distributed consensus. J. ACM 34(1): 77-97 (1987)
j26		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
j25		Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer: Pseudorandom Number Generation and Space Complexity. Information and Control 64(1-3): 43-51 (1985)
j24		Larry J. Stockmeyer: On Approximation Algorithms for #P. SIAM J. Comput. 14(4): 849-861 (1985)
j23		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
j22		Richard E. Ladner, Larry J. Stockmeyer, Richard J. Lipton: Alternation Bounded Auxiliary Pushdown Automata. Information and Control 62(2/3): 93-108 (1984)
j21		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)
j20		Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer: Alternating Pushdown and Stack Automata. SIAM J. Comput. 13(1): 135-155 (1984)
j19		Larry J. Stockmeyer, Uzi Vishkin: Simulation of Parallel Random Access Machines by Circuits. SIAM J. Comput. 13(2): 409-422 (1984)
j18		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
j17		Larry J. Stockmeyer: Optimal Orientations of Cells in Slicing Floorplan Designs. Information and 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
j16		Larry J. Stockmeyer, Vijay V. Vazirani: NP-Completeness of Some Generalizations of the Maximum Matching Problem. Inf. Process. Lett. 15(1): 14-19 (1982)
j15		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
j14		Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer: Alternation. J. ACM 28(1): 114-133 (1981)
	1980
j13		Arnold L. Rosenberg, Larry J. Stockmeyer, Lawrence Snyder: Uniform Data Encodings. Theor. Comput. Sci. 11: 145-165 (1980)
	1979
j12		Larry J. Stockmeyer, Ashok K. Chandra: Provably Difficult Combinatorial Games. SIAM J. Comput. 8(2): 151-174 (1979)
j11		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
j10		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)
j9		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
j8		Arnold L. Rosenberg, Larry J. Stockmeyer: Storage Schemes for Boundedly Extendible Arrays. Acta Inf. 7: 289-303 (1977)
j7		Arnold L. Rosenberg, Larry J. Stockmeyer: Hashing Schemes for Extendible Arrays. J. ACM 24(2): 199-221 (1977)
j6		Larry J. Stockmeyer: On the Combinational Complexity of Certain Symmetric Boolean Functions. Mathematical Systems Theory 10: 323-336 (1977)
	1976
j5		Vaughan R. Pratt, Larry J. Stockmeyer: A Characterization of the Power of Vector Machines. J. Comput. Syst. Sci. 12(2): 198-221 (1976)
j4		M. R. Garey, David S. Johnson, Larry J. Stockmeyer: Some Simplified NP-Complete Graph Problems. Theor. Comput. Sci. 1(3): 237-267 (1976)
j3		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
j2		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
j1		Mike Paterson, Larry J. Stockmeyer: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials. SIAM J. Comput. 2(1): 60-66 (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 (FOCS) 1972: 125-129
	1971
c1		Mike Paterson, Larry J. Stockmeyer: Bounds on the Evaluation Time for Rational Polynomials. SWAT (FOCS) 1971: 140-143

Coauthor Index

1	Miklós Ajtai	[c34] [j47] [j43] [c28]
2	Noga Alon	[j35] [c24]
3	Guillermo A. Alvarez	[c29]
4	Hagit Attiya (Chagit Attiya)	[j36] [c23]
5	Walter A. Burkhard	[c29]
6	Randal C. Burns	[j48] [j47] [j44]
7	Larry Carter	[c16]
8	Ashok K. Chandra	[j18] [c11] [j14] [j12] [c9]
9	David M. Choy	[j41]
10	Brian A. Coan	[j30] [c17]
11	Flaviu Cristian	[c29]
12	Danny Dolev	[j30] [j27] [c17] [c13]
13	Cynthia Dwork	[c34] [j49] [c32] [c30] [j36] [j34] [j33] [c23] [j32] [j31] [j30] [c22] [j29] [j28] [c21] [j27] [c20] [c19] [c17] [c15] [c13]
14	Ronald Fagin	[j47] [j43] [j42] [c28] [j41] [j39] [c26] [j23]
15	Michael J. Fischer	[j2] [c3]
16	Merrick L. Furst	[j25] [c14]
17	M. R. Garey (Michael R. Garey)	[j4] [c6]
18	Yuri Gurevich	[j21]
19	C. T. Howard Ho (Howard Ho, Ching-Tien Ho)	[j50] [c33]
20	David S. Johnson	[j4] [c6]
21	Gil Kalai	[j35] [c24]
22	Paris C. Kanellakis	[j28] [c20]
23	Maria M. Klawe	[j23]
24	Lawrence T. Kou	[j10]
25	Dexter Kozen	[j14]
26	Richard E. Ladner	[j22] [j20] [c10]
27	Richard J. Lipton (Richard Jay Lipton)	[j25] [j22] [j20] [c14] [j9] [c10] [c8]
28	Darrell D. E. Long	[j48] [j47] [j44]
29	Nancy A. Lynch	[j36] [c23] [j29] [c15]
30	Alain J. Mayer	[j40] [c27] [j37]
31	Albert R. Meyer	[j46] [c4] [c2]
32	Dharmendra S. Modha	[j45] [c31]
33	Moni Naor	[j49] [c30] [j38] [c27] [c25]
34	Thomas Ottmann	[j15]
35	Mike Paterson	[j1] [c1]
36	Nicholas Pippenger	[j23]
37	Vaughan R. Pratt	[j5] [c5]
38	Michael O. Rabin	[c5]
39	Robert M. Rees	[j44]
40	Omer Reingold	[j49] [c30]
41	Moty Ricklin	[j35] [c24]
42	Arnold L. Rosenberg	[j15] [j13] [j8] [j7] [c7]
43	David B. Shmoys	[j32] [c19]
44	Lawrence Snyder (Larry Snyder)	[j13]
45	Moshe Y. Vardi	[j39] [c26] [c18]
46	Vijay V. Vazirani	[j16]
47	Uzi Vishkin	[j21] [j19] [j18] [c11]
48	Mark N. Wegman	[c16]
49	Chak-Kuen Wong (C. K. Wong)	[j11] [j10]

Last update Fri May 24 21:45:54 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page