Search results
The page ""ACM Symposium on Theory of Computing" journal" does not exist. You can create a draft and submit it for review or request that a redirect be created, but consider checking the search results below to see whether the topic is already covered.
- on Foundations of Computer Science (FOCS) and the Annual ACM Symposium on Theory of Computing (STOC), where about 15% of papers published in FOCS and STOC...2 KB (154 words) - 17:03, 2 May 2024
- bibliography. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing (May 1992), pages 351–369. http://portal.acm.org/citation...8 KB (845 words) - 12:01, 9 June 2024
theory and about hardness of approximation. In the Annual ACM Symposium on Theory of Computing of 1988, Yannakakis and Christos Papadimitriou introduced...12 KB (1,447 words) - 19:02, 20 May 2024- lattice problems". Proceedings of the Twenty-Eighth annual ACM symposium on Theory of computing. Philadelphia, Pennsylvania, United States: ACM. pp. 99–108...28 KB (3,660 words) - 20:46, 21 April 2024
computer science. In 2004, he received the best paper award in ACM Symposium on Theory of Computing (STOC) for Raz (2004), and the best paper award in IEEE Conference...5 KB (468 words) - 16:11, 11 April 2024- eigenvalue multiplicity", Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pp. 310–324, doi:10.1145/800070.802206, ISBN 0-89791-070-2...39 KB (4,082 words) - 06:01, 18 June 2024
- distributed file allocation", Proceedings of the Twenty-Fifth ACM Symposium on Theory of Computing (STOC '93), pp. 164–173, doi:10.1145/167088.167142, ISBN 978-0897915915...9 KB (900 words) - 05:56, 22 June 2024
at ICALP (even years) and STOC (odd years). STOC is the ACM Symposium on Theory of Computing, one of the main North American conferences in theoretical...30 KB (2,156 words) - 11:47, 2 July 2024- recognition (Extended Abstract)," Proceedings of the fifth annual ACM symposium on Theory of Computing, April 1973 Every deterministic context-free language can...11 KB (1,329 words) - 06:24, 6 May 2024
proofs for random k-CNF formulas", Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 561–571, CiteSeerX 10.1.1.39.213, doi:10.1145/276698...11 KB (899 words) - 04:11, 3 March 2024- polylogarithmic time". Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91. STOC '91. New York, NY, US: ACM. pp. 21–32. CiteSeerX 10...14 KB (1,887 words) - 03:39, 2 January 2024
O(n\log n)} sorting network". Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25–27 April, 1983, Boston, Massachusetts, USA. Association...21 KB (2,565 words) - 22:00, 28 February 2024- problem: extended abstract". Proceedings on 41st Annual ACM Symposium on Theory of Computing (STOC). pp. 333–342. doi:10.1145/1536414.1536461. Ajtai,...27 KB (3,227 words) - 22:38, 20 December 2023
lower bounds for Boolean circuit complexity", Proc. 19th ACM Symposium on Theory of Computing, pp. 77–82, doi:10.1145/28395.28404. Murray, Cody D.; Williams...9 KB (1,042 words) - 06:28, 21 February 2024- 1-round games", Proceedings of the thirty-fourth annual ACM symposium on Theory of computing, pp. 767–775, doi:10.1145/509907.510017, ISBN 1-58113-495-9...24 KB (2,599 words) - 21:29, 2 March 2024
- models of computation", Proceedings of the Fourteenth annual ACM Symposium on Theory of Computing (STOC '82), doi:10.1145/800070.802209 Jean Vuillemin at the...5 KB (364 words) - 17:53, 28 January 2023
- complexity theory", Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 619–626, doi:10.1145/509907.509996, ISBN 1581134959...10 KB (1,450 words) - 06:35, 3 June 2024
- data structures". Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. New York, NY, USA: Association for Computing...7 KB (823 words) - 06:25, 6 May 2024
- NP-completeness in computational complexity theory at the 3rd Annual ACM Symposium on Theory of Computing. Daniel Quillen publishes a proof of the Adams conjecture...10 KB (1,051 words) - 17:06, 16 June 2024
- 96–100 Nisan, Noam (1992), "RL ⊆ SC", Proceedings of the 24th ACM Symposium on Theory of computing (STOC '92), Victoria, British Columbia, Canada, pp. 619–623...7 KB (1,004 words) - 07:33, 26 June 2024
- and M. Ben-Or, in Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (STOC ’97) (ACM, New York, 1997), p. 176. [86] John Preskill