• Larry Joseph Stockmeyer (1948 – 31 July 2004) was an American computer scientist. He was one of the pioneers in the field of computational complexity...
    7 KB (545 words) - 06:25, 6 May 2024
  • AFAs: Theorems 23, 24, 25 . Chandra, Ashok K.; Kozen, Dexter C.; Stockmeyer, Larry J. (1981). "Alternation". Journal of the ACM. 28 (1): 114–133. doi:10...
    5 KB (808 words) - 13:07, 22 November 2023
  • include Nancy Lynch, Leonid Levin, Jeanne Ferrante, Charles Rackoff, Larry Stockmeyer, David Harel, Joseph Halpern, and John C. Mitchell. He was the editor-in-chief...
    6 KB (392 words) - 06:25, 6 May 2024
  • Thumbnail for PH (complexity)
    _{k\in \mathbb {N} }\Delta _{k}^{\mathrm {P} }} PH was first defined by Larry Stockmeyer. It is a special case of hierarchy of bounded alternating Turing machine...
    4 KB (427 words) - 07:30, 2 March 2023
  • Turing machines in computational complexity (with Dexter Kozen and Larry Stockmeyer), conjunctive queries in databases (with Philip M. Merlin), computable...
    5 KB (411 words) - 23:17, 1 May 2024
  • machines, which is where the thesis originated. Chandra, Ashok K.; Stockmeyer, Larry J. (1976). "Alternation". FOCS'76: Proceedings of the 17th Annual Symposium...
    3 KB (464 words) - 10:16, 13 August 2023
  • ISSN 0004-5411. S2CID 14352974. Ladner, Richard E.; Lipton, Richard J.; Stockmeyer, Larry J. (1984). "Alternating Pushdown and Stack Automata". SIAM Journal...
    5 KB (376 words) - 03:22, 8 May 2024
  • complexity and beyond. Now Publishers Inc, 2011. Paterson, Michael S.; Stockmeyer, Larry J. (1973). "On the Number of Nonscalar Multiplications Necessary to...
    18 KB (3,448 words) - 18:55, 27 January 2024
  • classes NP and co-NP. The concept of an ATM was set forth by Chandra and Stockmeyer and independently by Kozen in 1976, with a joint journal publication in...
    12 KB (1,963 words) - 12:43, 20 February 2024
  • Thumbnail for Pushdown automaton
    1145/322234.322243. ISSN 0004-5411. Ladner, Richard E.; Lipton, Richard J.; Stockmeyer, Larry J. (1984). "Alternating Pushdown and Stack Automata". SIAM Journal...
    26 KB (4,019 words) - 07:17, 18 April 2024
  • doi:10.1007/11549345_47. Ladner, Richard E.; Lipton, Richard J.; Stockmeyer, Larry J. (1984). "Alternating Pushdown and Stack Automata". SIAM Journal...
    12 KB (1,619 words) - 23:11, 2 December 2023
  • Thumbnail for List of people by Erdős number
    Steinhaus Jacques Stern Shlomo Sternberg Bonnie Stewart Lorna Stewart Larry Stockmeyer Ivan Stojmenović Jorge Stolfi Marshall Harvey Stone Michael Stonebraker...
    59 KB (5,747 words) - 18:21, 2 June 2024
  • Thumbnail for IBM Research
    Barbara Simons, Malcolm Slaney, Arnold Spielberg, Ramakrishnan Srikant, Larry Stockmeyer, Moshe Vardi, Jennifer Widom, Shumin Zhai. IBM Research – Australia...
    45 KB (4,354 words) - 03:04, 25 March 2024
  • doi:10.1145/275487.275515, ISBN 978-0-89791-996-8, S2CID 15631793. Stockmeyer, Larry J. (1974), The Complexity of Decision Problems in Automata Theory and...
    5 KB (458 words) - 05:05, 28 January 2024
  • 1080/00207169008803893. ISSN 0020-7160. Ladner, Richard E.; Lipton, Richard J.; Stockmeyer, Larry J. (1984). "Alternating Pushdown and Stack Automata". SIAM Journal...
    26 KB (3,375 words) - 10:30, 28 April 2024
  • 193–201, CiteSeerX 10.1.1.471.6378, doi:10.1137/0221015. Naor, Moni; Stockmeyer, Larry (1995), "What can be computed locally?" (PDF), SIAM Journal on Computing...
    50 KB (5,601 words) - 01:10, 2 June 2024
  • the input. This appears to have been first demonstrated in Gurevich, Stockmeyer & Vishkin (1984). The first systematic work on parameterized complexity...
    18 KB (2,682 words) - 00:58, 21 December 2023
  • Journal on Discrete Mathematics, 3 (2): 294–310, doi:10.1137/0403025. Stockmeyer, Larry J. (1975), The set basis problem is NP-complete, Technical Report RC-5431...
    14 KB (1,731 words) - 21:30, 13 March 2024
  • the original on 2007-08-23. Retrieved 2007-11-07. Dwork, Cynthia; Stockmeyer, Larry (1990). "A Time Complexity Gap For 2-Way Probabilistic Finite State...
    6 KB (812 words) - 07:01, 25 July 2023
  • TCP/IP Illustrated and Advanced Programming in the Unix Environment Larry Stockmeyer – computational complexity, distributed computing Salvatore Stolfo...
    54 KB (5,147 words) - 22:26, 22 May 2024
  • Thumbnail for Vertex cover
    ISBN 0-7167-1045-5. A1.1: GT1, pg.190. Garey, Michael R.; Johnson, David S.; Stockmeyer, Larry (1974). "Some simplified NP-complete problems". Proceedings of the...
    22 KB (2,542 words) - 14:23, 25 May 2024
  • 1137/S0097539797328847, MR 1756405. Garey, Michael R.; Johnson, David S.; Stockmeyer, Larry (1976), "Some simplified NP-complete graph problems", Theoretical...
    13 KB (1,604 words) - 03:05, 18 March 2024
  • Society. 141: 1–35. doi:10.2307/1995086. ISSN 0002-9947. JSTOR 1995086. Stockmeyer, Larry; Meyer, Albert R. (2002-11-01). "Cosmological lower bound on the circuit...
    11 KB (1,308 words) - 06:51, 8 August 2023
  • 1017/s0022481200051756, JSTOR 2272945, MR 0476480, S2CID 2563318 Fagin, Ronald; Stockmeyer, Larry J.; Vardi, Moshe Y. (1995), "On monadic NP vs monadic co-NP", Information...
    39 KB (4,985 words) - 01:40, 7 November 2023
  • International Joint Conference on Artificial Intelligence. Mayer, A.R.; Stockmeyer, Larry J. (1995). "The Complexity of Word Problems - This Time with Interleaving"...
    29 KB (3,272 words) - 19:20, 7 December 2023
  • Seregni, 87, Uruguayan army officer and politician, pancreatic cancer. Larry Stockmeyer, 56, American computer scientist, pancreatic cancer. Wolfgang Saxon...
    56 KB (4,488 words) - 06:00, 18 May 2024
  • Savage Ravi Sethi Mary M. Shaw Abraham Silberschatz John A. Stankovic Larry Stockmeyer Andrew S. Tanenbaum Mary K. Vernon Uzi Vishkin Jeffrey S. Vitter Anthony...
    37 KB (3,836 words) - 04:39, 17 March 2024