Larry J. Stockmeyer

86 papers A* 25A 3B 2Journal 51Unranked 4

Year	Rank	Type	Title / Venue / Authors
2006	B	`conf`	An Architecture for Provably Secure Computation. LATIN Miklós Ajtai, Cynthia Dwork, Larry J. Stockmeyer
2004	J	`jnl`	A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers. IEEE Trans. Computers Ching-Tien Ho, Larry J. Stockmeyer
2003	J	`jnl`	In-Place Reconstruction of Version Differences. IEEE Trans. Knowl. Data Eng. Randal C. Burns, Larry J. Stockmeyer, Darrell D. E. Long
2003	J	`jnl`	Magic Functions. J. ACM Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
2002	A*	`conf`	2-round zero knowledge and proof auditors. STOC Cynthia Dwork, Larry J. Stockmeyer
2002	A	`conf`	A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers. IPDPS Ching-Tien Ho, Larry J. Stockmeyer
2002	J	`jnl`	Compactly encoding unstructured inputs with differential compression. J. ACM Miklós Ajtai, Randal C. Burns, Ronald Fagin, Darrell D. E. Long, Larry J. Stockmeyer
2002	J	`jnl`	Cosmological lower bound on the circuit complexity of a small problem in logic. J. ACM Larry J. Stockmeyer, Albert R. Meyer
2002	J	`jnl`	Links between complexity theory and constrained block coding. IEEE Trans. Inf. Theory Larry J. Stockmeyer, Dharmendra S. Modha
2001	A	`conf`	Links Between Complexity Theory and Constrained Block Coding. CCC Larry J. Stockmeyer, Dharmendra S. Modha
2001	J	`jnl`	Scalable Session Locking for a Distributed File System. Clust. Comput. Randal C. Burns, Robert M. Rees, Larry J. Stockmeyer, Darrell D. E. Long
2000	J	`jnl`	The Closure of Monadic NP. J. Comput. Syst. Sci. Miklós Ajtai, Ronald Fagin, Larry J. Stockmeyer
1999	A*	`conf`	Magic Functions. FOCS Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer
1998	A*	`conf`	Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism. ISCA Guillermo A. Alvarez, Walter A. Burkhard, Larry J. Stockmeyer, Flaviu Cristian
1998	J	`jnl`	Relaxing the Triangle Inequality in Pattern Matching. Int. J. Comput. Vis. Ronald Fagin, Larry J. Stockmeyer
1998	A*	`conf`	The Closure of Monadic NP (Extended Abstract). STOC Miklós Ajtai, Ronald Fagin, Larry J. Stockmeyer
1996	J	`jnl`	Efficiently Extendible Mappings for Balanced Data Distribution. Algorithmica David M. Choy, Ronald Fagin, Larry J. Stockmeyer
1996	J	`jnl`	The Complexity of PDL with Interleaving. Theor. Comput. Sci. Alain J. Mayer, Larry J. Stockmeyer
1995	—	`conf`	Local Computations on Static and Dynamic Graphs (Preliminary Version). ISTCS Alain J. Mayer, Moni Naor, Larry J. Stockmeyer
1995	J	`jnl`	On Monadic NP vs. Monadic co-NP Inf. Comput. Ronald Fagin, Larry J. Stockmeyer, Moshe Y. Vardi
1995	J	`jnl`	What Can be Computed Locally? SIAM J. Comput. Moni Naor, Larry J. Stockmeyer
1994	J	`jnl`	Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty. J. ACM Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer
1994	J	`jnl`	Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling. Theor. Comput. Sci. Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer
1994	J	`jnl`	The Complexity of Word Problems - This Time with Interleaving Inf. Comput. Alain J. Mayer, Larry J. Stockmeyer
1993	—	`conf`	On Monadic NP vs. Monadic co-NP (Extended Abstract). SCT Ronald Fagin, Larry J. Stockmeyer, Moshe Y. Vardi
1993	A*	`conf`	What can be computed locally? STOC Moni Naor, Larry J. Stockmeyer
1992	J	`jnl`	Finite State Verifiers I: The Power of Interaction. J. ACM Cynthia Dwork, Larry J. Stockmeyer
1992	J	`jnl`	Finite State Verifiers II: Zero Knowledge. J. ACM Cynthia Dwork, Larry J. Stockmeyer
1992	A*	`conf`	Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling (Extended Abstract) FOCS Noga Alon, Gil Kalai, Moty Ricklin, Larry J. Stockmeyer
1991	A*	`conf`	Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty STOC Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer
1990	J	`jnl`	A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata. SIAM J. Comput. Cynthia Dwork, Larry J. Stockmeyer
1990	J	`jnl`	Flipping Persuasively in Constant Time. SIAM J. Comput. Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer
1989	A*	`conf`	On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract) FOCS Cynthia Dwork, Larry J. Stockmeyer
1989	J	`jnl`	The Distributed Firing Squad Problem. SIAM J. Comput. Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer
1988	J	`jnl`	Consensus in the presence of partial synchrony. J. ACM Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer
1988	J	`jnl`	Parallel Algorithms for Term Matching. SIAM J. Comput. Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer
1988	A*	`conf`	Zero-Knowledge With Finite State Verifiers. CRYPTO Cynthia Dwork, Larry J. Stockmeyer
1987	J	`jnl`	Classifying the Computational Complexity of Problems. J. Symb. Log. Larry J. Stockmeyer
1987	J	`jnl`	On the minimal synchronism needed for distributed consensus. J. ACM Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer
1986	A*	`conf`	Flipping Persuasively in Constant Expected Time (Preliminary Version) FOCS Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer
1986	A	`conf`	Parallel Algorithms for Term Matching. CADE Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer
1985	J	`jnl`	Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions. Theor. Comput. Sci. Ronald Fagin, Maria M. Klawe, Nicholas Pippenger, Larry J. Stockmeyer
1985	A*	`conf`	Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report STOC Moshe Y. Vardi, Larry J. Stockmeyer
1985	J	`jnl`	On Approximation Algorithms for #P. SIAM J. Comput. Larry J. Stockmeyer
1985	J	`jnl`	Pseudorandom Number Generation and Space Complexity Inf. Control. Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
1985	A*	`conf`	The Complexity of Backtrack Searches (Preliminary Version) STOC Larry Carter, Larry J. Stockmeyer, Mark N. Wegman
1985	A*	`conf`	The Distributed Firing Squad Problem (Preliminary Version) STOC Brian A. Coan, Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer
1984	J	`jnl`	Alternating Pushdown and Stack Automata. SIAM J. Comput. Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer
1984	J	`jnl`	Alternation Bounded Auxiliary Pushdown Automata Inf. Control. Richard E. Ladner, Larry J. Stockmeyer, Richard J. Lipton
1984	A*	`conf`	Consensus in the Presence of Partial Synchrony (Preliminary Version). PODC Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer
1984	J	`jnl`	Constant Depth Reducibility. SIAM J. Comput. Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
1984	J	`jnl`	Simulation of Parallel Random Access Machines by Circuits. SIAM J. Comput. Larry J. Stockmeyer, Uzi Vishkin
1984	J	`jnl`	Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems. J. ACM Yuri Gurevich, Larry J. Stockmeyer, Uzi Vishkin
1983	A*	`conf`	On the Minimal Synchronism Needed for Distributed Consensus FOCS Danny Dolev, Cynthia Dwork, Larry J. Stockmeyer
1983	J	`jnl`	Optimal Orientations of Cells in Slicing Floorplan Designs Inf. Control. Larry J. Stockmeyer
1983	B	`conf`	Pseudorandom Number Generation and Space Complexity. FCT Merrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer
1983	A*	`conf`	The Complexity of Approximate Counting (Preliminary Version) STOC Larry J. Stockmeyer
1982	A*	`conf`	A Complexity Theory for Unbounded Fan-In Parallelism FOCS Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
1982	J	`jnl`	A Dictionary Machine (for VLSI). IEEE Trans. Computers Thomas Ottmann, Arnold L. Rosenberg, Larry J. Stockmeyer
1982	J	`jnl`	NP-Completeness of Some Generalizations of the Maximum Matching Problem. Inf. Process. Lett. Larry J. Stockmeyer, Vijay V. Vazirani
1981	J	`jnl`	Alternation. J. ACM Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer
1980	J	`jnl`	Uniform Data Encodings. Theor. Comput. Sci. Arnold L. Rosenberg, Larry J. Stockmeyer, Lawrence Snyder
1979	J	`jnl`	On the Number of Comparisons to Find the Intersection of Two Relations. SIAM J. Comput. Larry J. Stockmeyer, C. K. Wong
1979	J	`jnl`	Provably Difficult Combinatorial Games. SIAM J. Comput. Larry J. Stockmeyer, Ashok K. Chandra
1978	A*	`conf`	Alternating Pushdown Automata (Preliminary Report) FOCS Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer
1978	J	`jnl`	Covering Edges by Cliques with Regard to Keyword Conflicts and Intersection Graphs. Commun. ACM Lawrence T. Kou, Larry J. Stockmeyer, C. K. Wong
1978	J	`jnl`	Evaluation of Polynomials with Super-Preconditioning. J. Comput. Syst. Sci. Richard J. Lipton, Larry J. Stockmeyer
1977	J	`jnl`	Hashing Schemes for Extendible Arrays. J. ACM Arnold L. Rosenberg, Larry J. Stockmeyer
1977	J	`jnl`	On the Combinational Complexity of Certain Symmetric Boolean Functions. Math. Syst. Theory Larry J. Stockmeyer
1977	J	`jnl`	Storage Schemes for Boundedly Extendible Arrays. Acta Informatica Arnold L. Rosenberg, Larry J. Stockmeyer
1976	J	`jnl`	A Characterization of the Power of Vector Machines. J. Comput. Syst. Sci. Vaughan R. Pratt, Larry J. Stockmeyer
1976	A*	`conf`	Alternation FOCS Ashok K. Chandra, Larry J. Stockmeyer
1976	A*	`conf`	Evaluation of Polynomials with Super-Preconditioning STOC Richard J. Lipton, Larry J. Stockmeyer
1976	J	`jnl`	Some Simplified NP-Complete Graph Problems. Theor. Comput. Sci. M. R. Garey, David S. Johnson, Larry J. Stockmeyer
1976	J	`jnl`	The Polynomial-Time Hierarchy. Theor. Comput. Sci. Larry J. Stockmeyer
1975	A*	`conf`	Hashing Schemes for Extendible Arrays (Extended Arrays) STOC Arnold L. Rosenberg, Larry J. Stockmeyer
1974	A*	`conf`	A Characterization of the Power of Vector Machines STOC Vaughan R. Pratt, Michael O. Rabin, Larry J. Stockmeyer
1974	J	`jnl`	Fast On-Line Integer Multiplication. J. Comput. Syst. Sci. Michael J. Fischer, Larry J. Stockmeyer
1974	A*	`conf`	Some Simplified NP-Complete Problems STOC M. R. Garey, David S. Johnson, Larry J. Stockmeyer
1974	—	`—`	The complexity of decision problems in automata theory and logic. Larry J. Stockmeyer
1973	A*	`conf`	Fast On-Line Integer Multiplication STOC Michael J. Fischer, Larry J. Stockmeyer
1973	J	`jnl`	On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials. SIAM J. Comput. Mike Paterson, Larry J. Stockmeyer
1973	J	`jnl`	Planar 3-colorability is polynomial complete. SIGACT News Larry J. Stockmeyer
1973	A*	`conf`	Word Problems Requiring Exponential Time: Preliminary Report STOC Larry J. Stockmeyer, Albert R. Meyer
1972	—	`conf`	The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space SWAT Albert R. Meyer, Larry J. Stockmeyer
1971	—	`conf`	Bounds on the Evaluation Time for Rational Polynomials SWAT Mike Paterson, Larry J. Stockmeyer