( en | de | ru )

 

Disambiguation of "Stockmeyer, Larry J."

Author of the publication

copydeleteadd this publication to your clipboard
The Complexity of Word Problems - This Time with Interleaving

, and . Inf. Comput., 115 (2): 293-311 (December 1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Edgardo Stockmeyer

Larry Lüer

Rolf Stockmeyer

Walter Stockmeyer

Larry Merkle

 

Other publications of authors with the same name

The Complexity of Backtrack Searches (Preliminary Version), , and . STOC, page 449-457. ACM, (1985)On the Number of Comparisons to Find the Intersection of Two Relations., and . SIAM J. Comput., 8 (3): 388-404 (1979)Provably Difficult Combinatorial Games., and . SIAM J. Comput., 8 (2): 151-174 (1979)Fast On-Line Integer Multiplication., and . J. Comput. Syst. Sci., 9 (3): 317-331 (1974)Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling., , , and . Theor. Comput. Sci., 130 (1): 175-201 (1994)Alternation, and . FOCS, page 98-108. IEEE Computer Society, (1976)Uniform Data Encodings., , and . Theor. Comput. Sci., (1980)An Architecture for Provably Secure Computation., , and . LATIN, volume 3887 of Lecture Notes in Computer Science, page 56-67. Springer, (2006)Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty, , , and . STOC, page 359-369. ACM, (1991)Zero-Knowledge With Finite State Verifiers., and . CRYPTO, volume 403 of Lecture Notes in Computer Science, page 71-75. Springer, (1988)