Larry J. Stockmeyer

Available identifiers

zbMath Open stockmeyer.larry-jDBLP40/805WikidataQ6491172 ScholiaQ6491172MaRDI QIDQ1134519

List of research outcomes

Publication	Date of Publication	Type
Compactly encoding unstructured inputs with differential compression	2015-12-07	Paper
Cosmological lower bound on the circuit complexity of a small problem in logic	2015-12-07	Paper
Magic Functions	2015-11-12	Paper
What can be computed locally?	2015-05-07	Paper
2-round zero knowledge and proof auditors	2010-08-05	Paper
An Architecture for Provably Secure Computation	2008-09-18	Paper
Links between complexity theory and constrained block coding	2002-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4542549	2002-08-01	Paper
The closure of monadic NP	2000-08-27	Paper
https://portal.mardi4nfdi.de/entity/Q4230357	1999-04-22	Paper
The complexity of PDL with interleaving	1997-02-27	Paper
What Can be Computed Locally?	1996-09-15	Paper
Efficiently extendible mappings for balanced data distribution	1996-08-12	Paper
On monadic NP vs monadic co-NP	1995-09-17	Paper
Finite state verifiers I	1994-11-13	Paper
Finite state verifiers II	1994-11-13	Paper
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling	1994-08-29	Paper
Bounds on the time to reach agreement in the presence of timing uncertainty	1994-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q4694140	1993-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q3204032	1990-01-01	Paper
Flipping Persuasively in Constant Time	1990-01-01	Paper
A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata	1990-01-01	Paper
The Distributed Firing Squad Problem	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4733859	1989-01-01	Paper
Parallel Algorithms for Term Matching	1988-01-01	Paper
On the minimal synchronism needed for distributed consensus	1987-01-01	Paper
Classifying the computational complexity of problems	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3786016	1986-01-01	Paper
Bounded-depth, polynomial-size circuits for symmetric functions	1985-01-01	Paper
Pseudorandom number generation and space complexity	1985-01-01	Paper
On Approximation Algorithms for # P	1985-01-01	Paper
Simulation of Parallel Random Access Machines by Circuits	1984-01-01	Paper
Constant Depth Reducibility	1984-01-01	Paper
Alternating Pushdown and Stack Automata	1984-01-01	Paper
Alternation bounded auxiliary pushdown automata	1984-01-01	Paper
Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems	1984-01-01	Paper
Optimal orientations of cells in slicing floorplan designs	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3341893	1983-01-01	Paper
NP-completeness of some generalizations of the maximum matching problem	1982-01-01	Paper
Alternation	1981-01-01	Paper
Uniform data encodings	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3922172	1980-01-01	Paper
Provably Difficult Combinatorial Games	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3888985	1979-01-01	Paper
Evaluation of polynomials with super-preconditioning	1978-01-01	Paper
The polynomial-time hierarchy	1977-01-01	Paper
Storage schemes for boundedly extendible arrays	1977-01-01	Paper
Hashing Schemes for Extendible Arrays	1977-01-01	Paper
On the combinational complexity of certain symmetric Boolean functions	1977-01-01	Paper
Some simplified NP-complete graph problems	1976-01-01	Paper
A characterization of the power of vector machines	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4158480	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4133106	1975-01-01	Paper
Fast on-line integer multiplication	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4162478	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4131648	1973-01-01	Paper
On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials	1973-01-01	Paper
Fast on-line integer multiplication	1973-01-01	Paper

Research outcomes over time

This page was built for person: Larry J. Stockmeyer