The IEEE Annual Symposium on Foundations of Computer Science (FOCS) is an academic conference in the field of theoretical computer science. FOCS is sponsored...
13 KB (534 words) - 00:13, 25 February 2025
counterpart FOCS (the Symposium on Foundations of Computer Science) are considered the two top conferences in theoretical computer science, considered broadly:...
12 KB (1,162 words) - 05:39, 15 September 2024
The ACM–IEEE Symposium on Logic in Computer Science (LICS) is an annual academic conference on the theory and practice of computer science in relation...
6 KB (670 words) - 16:42, 28 October 2024
Shortest path problem (redirect from Applications of shortest path algorithms)
nearly-linear time on moderately dense graphs". In Irani, Sandy (ed.). 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham...
46 KB (4,790 words) - 00:08, 24 June 2025
Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation...
42 KB (4,803 words) - 23:57, 1 June 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
slightly-random sources" (PDF). Proceedings of the 25th IEEE Symposium on Foundations of Computer Science. University of California. pp. 434–440. ISBN 0-8186-0591-X...
8 KB (900 words) - 22:33, 8 June 2025
Galactic algorithm (category Analysis of algorithms)
rectangular matrix multiplication", Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012), pp. 514–523, arXiv:1204.1111...
21 KB (2,636 words) - 17:08, 22 June 2025
Foundations of Computer Science, pp. 436-453. A. Yao (1982). "Protocols for secure computations." In Proceedings of the IEEE Symposium on Foundations...
14 KB (1,887 words) - 03:39, 2 January 2024
topological approach to evasiveness", Symposium on Foundations of Computer Science, Los Alamitos, CA, USA: IEEE Computer Society, pp. 31–33, doi:10.1109/SFCS...
23 KB (2,839 words) - 17:41, 20 March 2025
Edit distance (redirect from Applications of edit distance)
Bounded-Difference Min-Plus Product" (PDF). 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). pp. 375–384. arXiv:1707.05095. doi:10.1109/focs...
19 KB (2,449 words) - 07:20, 17 June 2025
bit-reversal permutation program", Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS), pp. 544–553, CiteSeerX 10.1.1.46.9319...
12 KB (1,557 words) - 01:53, 29 May 2025
International Symposium on Algorithms and Computation MFCS – International Symposium on Mathematical Foundations of Computer Science STACS – Symposium on Theoretical...
14 KB (1,379 words) - 00:05, 12 June 2025
the one-dimensional bin-packing problem". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982). pp. 312–320. doi:10.1109/SFCS.1982.61. S2CID 18583908...
16 KB (2,461 words) - 19:21, 4 June 2025
Conference Symposia on VLSI Technology and Circuits Symposium on Foundations of Computer Science Symposium on Logic in Computer Science Vehicular Technology...
3 KB (313 words) - 13:02, 12 June 2025
(PDF). Proceedings of the 40th IEEE Symposium on Foundations of Computer Science. 40th Annual Symposium on Foundations of Computer Science. pp. 120–130. doi:10...
12 KB (1,501 words) - 13:21, 26 May 2025
International Symposium on Mathematical Foundations of Computer Science is an academic conference organized annually since 1972. The topics of the conference...
4 KB (102 words) - 07:24, 18 November 2024
SL (complexity) (section Consequences of L = SL)
sequences, and the complexity of maze problems", Proceedings of 20th Annual Symposium on Foundations of Computer Science, New York: IEEE, pp. 218–223,...
14 KB (1,793 words) - 15:43, 24 May 2024
PCP theorem (section PCP and hardness of approximation)
interactive protocols", SFCS '90: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, IEEE Computer Society, pp. 16–25, ISBN 978-0-8186-2082-9...
17 KB (2,076 words) - 06:27, 5 June 2025
Socialist millionaire problem (category Theory of cryptography)
"Protocols for secure communications" (PDF). Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS '82). pp. 160–164. doi:10.1109/SFCS.1982.88. Andrew...
8 KB (1,153 words) - 04:01, 10 June 2025
abbreviation for the annual IEEE Symposium on Foundations of Computer Science. It may also refer to: Federation of Old Cornwall Societies Fiber optic...
450 bytes (101 words) - 14:45, 13 July 2022
statistical zero-knowledge". Proceedings 38th Annual Symposium on Foundations of Computer Science. pp. 448–457. CiteSeerX 10.1.1.34.6920. doi:10.1109/SFCS...
4 KB (552 words) - 09:48, 24 May 2025
problems". 16th Annual Symposium on Foundations of Computer Science, Berkeley, California, USA, October 13-15, 1975. IEEE Computer Society. pp. 151–162...
9 KB (1,215 words) - 09:28, 29 December 2024
Point-set triangulation (redirect from Triangulation of point sets)
algorithm for the minmax length triangulation. 32nd Annual Symposium on Foundations of Computer Science. pp. 414–423. CiteSeerX 10.1.1.66.8959. doi:10.1109/SFCS...
12 KB (1,146 words) - 03:30, 25 November 2024
computations: Toward a unified measure of complexity". 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). IEEE. doi:10.1109/SFCS.1977...
45 KB (6,853 words) - 22:08, 19 June 2025
Symposium on Foundations of Computer Science. FOCS'19. arXiv:1909.11123. Potts, Daniel; Volkmer, Toni (2016). "Sparse high-dimensional FFT based on rank-1...
12 KB (1,624 words) - 00:16, 18 February 2025
Knuth Prize (category Theoretical computer science)
alternating years at the ACM Symposium on Theory of Computing and at the IEEE Symposium on Foundations of Computer Science, which are among the most prestigious...
19 KB (794 words) - 14:01, 23 June 2025
Private information retrieval (category Theory of cryptography)
retrieval". Proceedings of the 38th Annual Symposium on Foundations of Computer Science. Miami Beach, Florida, USA: IEEE Computer Society. pp. 364–373....
17 KB (2,184 words) - 18:04, 17 February 2025
Nested radical (redirect from Denesting of radicals)
Landau, Susan (1992). "Simplification of Nested Radicals". 30th Annual Symposium on Foundations of Computer Science. Vol. 21. SIAM. pp. 85–110. CiteSeerX 10...
19 KB (3,440 words) - 00:11, 20 June 2025
Quantum algorithm (category Theoretical computer science)
Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. Proceedings of the 43rd Symposium on Foundations of Computer Science. pp. 513–519...
39 KB (4,560 words) - 20:45, 19 June 2025