BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
9 × USA
Collaborated with:
C.Dwork M.Naor M.Y.Vardi ∅ R.J.Lipton A.L.Rosenberg M.J.Fischer A.R.Meyer M.Ajtai R.Fagin P.C.Kanellakis L.Carter M.N.Wegman M.R.Garey D.S.Johnson V.R.Pratt M.O.Rabin H.Attiya N.A.Lynch B.A.Coan D.Dolev
Talks about:
problem (3) time (3) preliminari (2) complex (2) report (2) extend (2) bound (2) array (2) uncertainti (1) precondit (1)

Person: Larry J. Stockmeyer

DBLP DBLP: Stockmeyer:Larry_J=

Contributed to:

STOC 20022002
STOC 19981998
STOC 19931993
STOC 19911991
CADE 19861986
STOC 19851985
STOC 19831983
STOC 19761976
STOC 19751975
STOC 19741974
STOC 19731973

Wrote 15 papers:

STOC-2002-DworkS #proving
2-round zero knowledge and proof auditors (CD, LJS), pp. 322–331.
STOC-1998-AjtaiFS #monad
The Closure of Monadic NP (MA, RF, LJS), pp. 309–318.
STOC-1993-NaorS #question #what
What can be computed locally? (MN, LJS), pp. 184–193.
STOC-1991-AttiyaDLS #bound #nondeterminism
Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty (HA, CD, NAL, LJS), pp. 359–369.
CADE-1986-DworkCKS #algorithm #parallel
Parallel Algorithms for Term Matching (CD, PCK, LJS), pp. 416–430.
STOC-1985-CarterSW #backtracking #complexity
The Complexity of Backtrack Searches (LC, LJS, MNW), pp. 449–457.
STOC-1985-CoanDDS #distributed #problem
The Distributed Firing Squad Problem (BAC, DD, CD, LJS), pp. 335–345.
STOC-1985-VardiS #bound #logic #source code
Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report (MYV, LJS), pp. 240–251.
STOC-1983-Stockmeyer #approximate #complexity
The Complexity of Approximate Counting (LJS), pp. 118–126.
STOC-1976-LiptonS #evaluation
Evaluation of Polynomials with Super-Preconditioning (RJL, LJS), pp. 174–180.
STOC-1975-RosenbergS #array
Hashing Schemes for Extendible Arrays (Extended Arrays) (ALR, LJS), pp. 159–166.
STOC-1974-GareyJS #problem
Some Simplified NP-Complete Problems (MRG, DSJ, LJS), pp. 47–63.
STOC-1974-PrattRS #power of
A Characterization of the Power of Vector Machines (VRP, MOR, LJS), pp. 122–134.
STOC-1973-FischerS #integer #multi #online #performance
Fast On-Line Integer Multiplication (MJF, LJS), pp. 67–72.
STOC-1973-StockmeyerM #exponential #problem #word
Word Problems Requiring Exponential Time: Preliminary Report (LJS, ARM), pp. 1–9.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.