The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized...
12 KB (1,162 words) - 05:39, 15 September 2024
FOCS and its annual Association for Computing Machinery counterpart STOC (the Symposium on Theory of Computing) are considered the two top conferences...
13 KB (534 words) - 00:13, 25 February 2025
of the IEEE Annual Symposium on Foundations of Computer Science (FOCS) and the Annual ACM Symposium on Theory of Computing (STOC), where about 15% of...
2 KB (154 words) - 17:03, 2 May 2024
(2014-05-31). "Computing with a full memory: Catalytic space". Proceedings of the forty-sixth annual ACM symposium on Theory of computing. STOC '14. New...
6 KB (679 words) - 01:38, 9 June 2025
most lattice problems based on voronoi cell computations". Proceedings of the forty-second ACM symposium on Theory of computing. STOC '10. New York, NY,...
28 KB (3,660 words) - 00:27, 24 May 2025
Cryptographic limitations on learning boolean formulae and finite automata. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 433–444...
8 KB (865 words) - 00:46, 24 March 2025
Graph isomorphism problem (category Computational problems in graph theory)
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, Association for computing machinery...
41 KB (4,223 words) - 04:39, 9 June 2025
Theoretical computer science (redirect from Computer science theory)
(1971). "The complexity of theorem-proving procedures". Proceedings of the third annual ACM symposium on Theory of computing - STOC '71. pp. 151–158....
42 KB (4,803 words) - 23:57, 1 June 2025
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 computer...
31 KB (2,200 words) - 01:40, 9 June 2025
Proceedings of the forty-third annual ACM symposium on Theory of computing. San Jose, California: Association for Computing Machinery. pp. 333–342. arXiv:1011...
113 KB (12,430 words) - 14:39, 13 June 2025
Verifiable computing (or verified computation or verified computing) enables a computer to offload the computation of some function, to other perhaps untrusted...
14 KB (1,887 words) - 03:39, 2 January 2024
Ryan Williams (computer scientist) (category Massachusetts Institute of Technology faculty)
faculty at MIT. Williams has been a member of the program committee for the Symposium on Theory of Computing in 2011 and various other conferences. He...
8 KB (731 words) - 06:16, 19 June 2025
"Classical hardness of learning with errors". Proceedings of the 45th annual ACM symposium on Symposium on theory of computing – STOC '13. ACM. pp. 575–584...
24 KB (2,853 words) - 16:44, 3 June 2025
Maze generation algorithm (redirect from Procedural generation of mazes)
cover time". Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. Symposium on Theory of Computing. Philadelphia: ACM. pp. 296–303...
19 KB (2,447 words) - 11:38, 22 April 2025
Sheila Greibach (category University of California, Los Angeles faculty)
annual ACM symposium on Theory of computing, April 1974 The effect of some restrictions on W-grammars (the formalization of the syntax of ALGOL 68) are...
11 KB (1,353 words) - 00:43, 18 March 2025
Steiner tree problem (category Trees (graph theory))
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (PDF). STOC 2017. New York, NY, USA: Association for Computing Machinery. pp...
36 KB (4,424 words) - 10:14, 13 June 2025
Mihalis Yannakakis (category 1998 fellows of the Association for Computing Machinery)
presented a number of findings regarding the hardness of computing approximations at the Annual ACM Symposium on Theory of Computing of 1993. These findings...
12 KB (1,448 words) - 21:55, 24 October 2024
vector problem: extended abstract,” in Proceedings of the 41st annual ACM symposium on Theory of computing (Bethesda, MD, USA: ACM, 2009), 333–342, http://portal...
20 KB (3,411 words) - 20:37, 24 May 2025
Christofides algorithm (category 1976 in computing)
'21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, Association for Computing Machinery, pp. 32–45, arXiv:2007...
12 KB (1,404 words) - 12:14, 6 June 2025
Locality-sensitive hashing (redirect from Applications of locality-sensitive hashing)
Neighbors: Towards Removing the Curse of Dimensionality.". Proceedings of 30th Symposium on Theory of Computing. Charikar, Moses S. (2002). "Similarity...
31 KB (4,202 words) - 22:41, 1 June 2025
Dana Angluin (category University of California, Berkeley alumni)
emeritus of computer science at Yale University. She is known for foundational work in computational learning theory and distributed computing. Angluin...
14 KB (1,235 words) - 17:12, 12 May 2025
diameter and radius of sparse graphs", in Boneh, Dan; Roughgarden, Tim; Feigenbaum, Joan (eds.), Symposium on Theory of Computing Conference, STOC'13...
9 KB (1,082 words) - 03:47, 2 June 2025
complexity of dynamic data structures". Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 345–354. doi:10.1145/73007...
35 KB (4,910 words) - 08:40, 20 June 2025
NP-complete". Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. STOC '02. New York, NY, USA: Association for Computing Machinery. pp. 761–766...
29 KB (2,746 words) - 00:31, 24 April 2025
Set cover problem (category Families of sets)
problems on bounded degree instances", Proceedings of the thirty-third annual ACM symposium on Theory of computing, Association for Computing Machinery...
21 KB (3,011 words) - 15:31, 10 June 2025
L (complexity) (redirect from L (complexity theory))
"Pseudorandom walks on regular digraphs and the RL vs. L problem". Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing. STOC '06. New...
12 KB (1,503 words) - 00:41, 16 June 2025
"Algorithmic mechanism design", Proceedings of the 31st ACM Symposium on Theory of Computing (STOC '99), pp. 129–140, doi:10.1145/301250.301287, ISBN 978-1581130676...
14 KB (1,514 words) - 07:32, 11 May 2025
representations via sampling". Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. S. Guha, P. Indyk, S. Muthukrishnan, M. Strauss...
12 KB (1,624 words) - 00:16, 18 February 2025
"Not all keys can be hashed in constant time", Proc. 22nd ACM Symposium on Theory of Computing, pp. 244–253, doi:10.1145/100216.100247, S2CID 11943779. Ben-Or...
7 KB (893 words) - 17:33, 22 December 2024
chains: the approximation of permanent resolved". Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88. ACM Press. pp. 235–244...
9 KB (1,428 words) - 07:38, 17 June 2025