Find link

language:

Find link is a tool written by Edward Betts.

searching for Symposium on Foundations of Computer Science 307 found (446 total)

alternate case: symposium on Foundations of Computer Science

Shortest path problem (4,764 words) [view diff] exact match in snippet view article find links to article

unit-capacity graphs". In Irani, Sandy (ed.). 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16–19, 2020. IEEE

Soliton distribution (352 words) [view diff] exact match in snippet view article find links to article

code Luby, M. (2002). LT Codes. The 43rd Annual IEEE Symposium on Foundations of Computer Science. doi:10.1109/SFCS.2002.1181950. Tirronen, Tuomas (2005)

Nonelementary problem (458 words) [view diff] exact match in snippet view article find links to article

Systems is Ackermann-complete. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). arXiv:2104.13866. Brubaker, Ben (4 December 2023)

Sparse Fourier transform (1,624 words) [view diff] exact match in snippet view article find links to article

Fourier sampling in any constant dimension". Annual Symposium on Foundations of Computer Science. FOCS'14: 514–523. arXiv:1403.5804. Kapralov, Michael

Chris Umans (594 words) [view diff] exact match in snippet view article find links to article

approach to fast matrix multiplication", 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings, pp. 438–449, arXiv:math/0307321,

Baruch Awerbuch (398 words) [view diff] exact match in snippet view article find links to article

achieving simultaneity in the presence of faults", 26th IEEE Symposium on Foundations of Computer Science (FOCS '85), pp. 383–395, doi:10.1109/SFCS.1985.64,

Configuration linear program (2,459 words) [view diff] exact match in snippet view article find links to article

the one-dimensional bin-packing problem". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982): 312–320. doi:10.1109/SFCS.1982.61. S2CID 18583908

PCP theorem (1,770 words) [view diff] exact match in snippet view article find links to article

NEXP sound against entangled provers". 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20–23, 2012

Closest pair of points problem (1,215 words) [view diff] exact match in snippet view article find links to article

Hoey, Dan (1975). "Closest-point problems". 16th Annual Symposium on Foundations of Computer Science, Berkeley, California, USA, October 13-15, 1975. IEEE

Baker's technique (875 words) [view diff] exact match in snippet view article find links to article

on planar graphs (preliminary version)", 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona, USA, 7–9 November 1983, IEEE Computer

Henry Cohn (674 words) [view diff] exact match in snippet view article find links to article

fast matrix multiplication". Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 438–449. arXiv:math/0307321. doi:10

Jorge Stolfi (1,077 words) [view diff] exact match in snippet view article find links to article

Annual Symposium on Foundations of Computer Science (SFCS 1983)". Proceedings of the 24th Annual Symposium on Foundations of Computer Science. pp. 100–111

Vector addition system (514 words) [view diff] exact match in snippet view article find links to article

Systems is Ackermann-complete. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). arXiv:2104.13866. Leroux, Jérôme (2021). The

Differentially private analysis of graphs (796 words) [view diff] exact match in snippet view article find links to article

Preserves Differential Privacy". 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science. pp. 410–419. arXiv:1204.2136. Bibcode:2012arXiv1204

Verifiable computing (1,887 words) [view diff] exact match in snippet view article find links to article

Symposium on Foundations of Computer Science, pp. 436-453. A. Yao (1982). "Protocols for secure computations." In Proceedings of the IEEE Symposium on

Adversarial queueing network (198 words) [view diff] exact match in snippet view article find links to article

adversarial queues via fluid models". Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). pp. 60–70. doi:10.1109/SFCS.1998

Parvaresh–Vardy code (81 words) [view diff] exact match in snippet view article find links to article

Guruswami-Sudan Radius in Polynomial Time". 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05). pp. 285–294. doi:10.1109/SFCS.2005.29. ISBN 0-7695-2468-0

WalkSAT (571 words) [view diff] exact match in snippet view article find links to article

satisfying truth assignment", Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pp. 163–169, doi:10.1109/SFCS.1991.185365, ISBN 978-0-8186-2445-2

Martin Dyer (392 words) [view diff] exact match in snippet view article find links to article

rapid mixing in Markov chains". Proceedings 38th Annual Symposium on Foundations of Computer Science. pp. 223–231. CiteSeerX 10.1.1.385.5367. doi:10.1109/SFCS

Color-coding (1,988 words) [view diff] exact match in snippet view article find links to article

near-optimal derandomization. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science (October 23–25, 1995). FOCS. IEEE Computer Society, Washington

Aspect ratio (744 words) [view diff] exact match in snippet view article find links to article

theorems and applications". Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). p. 232. doi:10.1109/sfcs.1998.743449

Device-independent quantum cryptography (907 words) [view diff] exact match in snippet view article find links to article

Quantum Cryptography with Imperfect Apparatus. IEEE Symposium on Foundations of Computer Science (FOCS). arXiv:quant-ph/9809039. Bibcode:1998quant.ph

Unique games conjecture (3,066 words) [view diff] exact match in snippet view article find links to article

Have Near-Perfect Expansion", 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 592–601, doi:10.1109/FOCS.2018.00062,

Peter van Emde Boas (117 words) [view diff] exact match in snippet view article find links to article

than logarithmic time, Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975, S. 75-84 - doi:10.1109/SFCS.1975.26 Homepage v

Reachability problem (887 words) [view diff] exact match in snippet view article find links to article

Nets is Not Primitive Recursive". 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 1241–1252. arXiv:2104.12695. doi:10

Edit distance (2,449 words) [view diff] exact match in snippet view article find links to article

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

Point-set triangulation (1,146 words) [view diff] exact match in snippet view article find links to article

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

Klee–Minty cube (1,613 words) [view diff] exact match in snippet view article find links to article

algorithms on Klee-Minty cubes". Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE. pp. 502–510. CiteSeerX 10.1.1.24.1405. doi:10

Benaloh cryptosystem (751 words) [view diff] exact match in snippet view article find links to article

Secure Election Scheme (PDF). Proceedings of 26th IEEE Symposium on Foundations of Computer Science. pp. 372–382. Benaloh, Josh (1987). Verifiable Secret-Ballot

EXPSPACE (648 words) [view diff] exact match in snippet view article find links to article

Nets is Not Primitive Recursive". 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 1241–1252. arXiv:2104.12695. doi:10

Verifiable random function (1,501 words) [view diff] exact match in snippet view article find links to article

Proceedings of the 40th IEEE Symposium on Foundations of Computer Science. 40th Annual Symposium on Foundations of Computer Science. pp. 120–130. doi:10.1109/SFFCS

Communication complexity (6,853 words) [view diff] exact match in snippet view article find links to article

Toward a unified measure of complexity". 18th Annual Symposium on Foundations of Computer Science (sfcs 1977). IEEE. doi:10.1109/SFCS.1977.24. ISSN 0272-5428

Facility location (competitive game) (766 words) [view diff] exact match in snippet view article

traffic routing and auctions". The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. p. 416. doi:10.1109/SFCS.2002.1181966

Seidel's algorithm (797 words) [view diff] exact match in snippet view article find links to article

and almost exact algorithms". Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). pp. 310–319. doi:10.1109/SFCS.1998

Yao's test (429 words) [view diff] exact match in snippet view article find links to article

Andrew Chi-Chih Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982.

Socialist millionaire problem (1,153 words) [view diff] exact match in snippet view article find links to article

"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

TC0 (4,889 words) [view diff] exact match in snippet view article find links to article

Circuits (Extended Abstract)". 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 104–115. doi:10.1109/FOCS52979.2021

Cryptographically secure pseudorandom number generator (3,633 words) [view diff] exact match in snippet view article find links to article

trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982. Kelsey, John; Schneier, Bruce; Wagner, David;

Computational complexity of matrix multiplication (4,286 words) [view diff] exact match in snippet view article find links to article

complexity of matrix multiplication". Proc. 22nd Annual Symposium on Foundations of Computer Science (FOCS). pp. 82–90. doi:10.1109/SFCS.1981.27. S2CID 206558664

H tree (1,047 words) [view diff] exact match in snippet view article find links to article

(1980), "Area-efficient graph layouts", 21st Annual Symposium on Foundations of Computer Science (FOCS 1980), pp. 270–281, doi:10.1109/SFCS.1980.13, S2CID 15532332

Richard Statman (249 words) [view diff] exact match in snippet view article find links to article

λ-calculus is not elementary recursive". 18th Annual Symposium on Foundations of Computer Science (SFCS 1977). pp. 90–94. doi:10.1109/SFCS.1977.34. Statman

Budget-feasible mechanism (252 words) [view diff] exact match in snippet view article find links to article

"Budget Feasible Mechanisms". 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. pp. 765–774. doi:10.1109/FOCS.2010.78. ISBN 978-1-4244-8525-3

Michael Saks (mathematician) (823 words) [view diff] exact match in snippet view article

the complexity of evaluating game trees". 27th Annual Symposium on Foundations of Computer Science (SFCS 1986). pp. 29–38. doi:10.1109/SFCS.1986.44. ISBN 0-8186-0740-8

Promise problem (552 words) [view diff] exact match in snippet view article find links to article

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

Chvátal graph (806 words) [view diff] exact match in snippet view article find links to article

FOCS '08: Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA: IEEE Computer Society, pp. 677–686

High-multiplicity bin packing (1,647 words) [view diff] exact match in snippet view article find links to article

the one-dimensional bin-packing problem". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982): 312–320. doi:10.1109/SFCS.1982.61. S2CID 18583908

Rotation map (484 words) [view diff] exact match in snippet view article find links to article

constant-degree expanders and extractors". Proceedings 41st Annual Symposium on Foundations of Computer Science. pp. 3–13. arXiv:math/0406038. doi:10.1109/SFCS.2000

Quantum Turing machine (1,105 words) [view diff] exact match in snippet view article find links to article

Yao (1993). Quantum circuit complexity. 34th Annual Symposium on Foundations of Computer Science. pp. 352–361. Abel Molina; John Watrous (2018). "Revisiting

DTIME (858 words) [view diff] exact match in snippet view article find links to article

versus non-determinism and related problems. 24th Annual Symposium on Foundations of Computer Science, 1983. doi:10.1109/SFCS.1983.39 Rahul Santhanam, On separators

Primary clustering (1,272 words) [view diff] exact match in snippet view article find links to article

Demise of Primary Clustering". 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 1171–1182. doi:10.1109/focs52979.2021

Triple product property (177 words) [view diff] exact match in snippet view article find links to article

arXiv:math.GR/0307321. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 11–14 October 2003, Cambridge, MA, IEEE Computer Society

Pairing heap (2,270 words) [view diff] exact match in snippet view article find links to article

analysis of pairing heaps" (PDF), Proc. 46th Annual IEEE Symposium on Foundations of Computer Science (PDF), pp. 174–183, doi:10.1109/SFCS.2005.75, ISBN 0-7695-2468-0

Oded Regev (computer scientist) (815 words) [view diff] exact match in snippet view article

Minkowski-Type Inequalities for Lattices". 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). pp. 447–456. arXiv:1606.06913. doi:10.1109/FOCS

Weighted majority algorithm (machine learning) (302 words) [view diff] exact match in snippet view article

212–261. doi:10.1006/inco.1994.1009. Littlestone, N.; Warmuth, M. (1989). Weighted Majority Algorithm. IEEE Symposium on Foundations of Computer Science.

Bruce Reed (mathematician) (499 words) [view diff] exact match in snippet view article

some (the odds are on his side)", Proc. 33rd Annual Symposium on Foundations of Computer Science, pp. 620–627, doi:10.1109/SFCS.1992.267789, ISBN 978-0-8186-2900-6

Black box group (437 words) [view diff] exact match in snippet view article find links to article

Complexity of Matrix Group Problems I". 25th Annual Symposium on Foundations of Computer Science, 1984. pp. 229–240. doi:10.1109/SFCS.1984.715919. ISBN 0-8186-0591-X

Verifiable secret sharing (1,905 words) [view diff] exact match in snippet view article find links to article

simultaneity in the presence of faults". 26th Annual Symposium on Foundations of Computer Science (SFCS 1985). pp. 383–395. doi:10.1109/SFCS.1985.64. ISBN 0-8186-0644-4

Russell Impagliazzo (820 words) [view diff] exact match in snippet view article find links to article

Randomness Using Few Independent Sources". 45th Annual IEEE Symposium on Foundations of Computer Science. pp. 384–393. doi:10.1109/FOCS.2004.29. ISBN 0-7695-2228-9

Average-case complexity (3,057 words) [view diff] exact match in snippet view article find links to article

and incomplete randomized NP problems". 28th Annual Symposium on Foundations of Computer Science (SFCS 1987): 111–117. doi:10.1109/SFCS.1987.14. ISBN 0-8186-0807-2

Pagh's problem (236 words) [view diff] exact match in snippet view article find links to article

bounds for dynamic problems." 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. IEEE, 2014. Chen, Lijie, et al. "Nearly Optimal Separation

Larry Stockmeyer (545 words) [view diff] exact match in snippet view article find links to article

Ashok K.; Stockmeyer, Larry J. (1976). "17th Annual Symposium on Foundations of Computer Science (SFCS 1976)". Proc. 17th IEEE Symp. on Foundations of

Cut (graph theory) (1,132 words) [view diff] exact match in snippet view article

two-variable CSPs?" (PDF), Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pp. 146–154, archived (PDF) from the original on 2019-07-15

Brodal queue (914 words) [view diff] exact match in snippet view article find links to article

(PDF). FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. pp. 174–183. CiteSeerX 10.1.1.549.471. doi:10.1109/SFCS

Independent set (graph theory) (3,561 words) [view diff] exact match in snippet view article

Bounded Pathwidth Local Search". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 509–518. arXiv:1304.1424. doi:10.1109/FOCS.2013

David Eppstein (841 words) [view diff] exact match in snippet view article find links to article

the k shortest paths" (PDF). Proceedings 35th Annual Symposium on Foundations of Computer Science. pp. 154–165. CiteSeerX 10.1.1.39.3901. doi:10.1109/SFCS

Parallel computation thesis (1,362 words) [view diff] exact match in snippet view article find links to article

"Alternation". FOCS'76: Proceedings of the 17th Annual Symposium on Foundations of Computer Science. pp. 98–108. doi:10.1109/SFCS.1976.4. Blum, Norbert (1983)

Nachum Dershowitz (1,040 words) [view diff] exact match in snippet view article find links to article

"Orderings for Term Rewriting Systems". Proc. 20th Symposium on Foundations of Computer Science (FOCS). pp. 123–131. N. Dershowitz (1981). "Termination

Doubly logarithmic tree (202 words) [view diff] exact match in snippet view article find links to article

Cache-oblivious algorithms. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS 99), p. 285-297. 1999. Extended abstract at IEEE

Private information retrieval (2,184 words) [view diff] exact match in snippet view article find links to article

information retrieval". Proceedings of the 38th Annual Symposium on Foundations of Computer Science. Miami Beach, Florida, USA: IEEE Computer Society. pp

Read-only Turing machine (812 words) [view diff] exact match in snippet view article find links to article

quantum finite state automata". Proceedings 38th Annual Symposium on Foundations of Computer Science. pp. 66–75. CiteSeerX 10.1.1.49.6392. doi:10.1109/SFCS

QIP (complexity) (503 words) [view diff] exact match in snippet view article

FOCS '09: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, pp. 534–543, ISBN 978-0-7695-3850-1

Budget-additive valuation (850 words) [view diff] exact match in snippet view article find links to article

Welfare Maximization and GAP". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE. pp. 687–696. doi:10.1109/focs.2008.47. ISBN 978-0-7695-3436-7

Manfred K. Warmuth (382 words) [view diff] exact match in snippet view article find links to article

212–261, doi:10.1006/inco.1994.1009, MR 1265851; announced at the IEEE Symposium on Foundations of Computer Science (FOCS 1989), doi:10.1109/SFCS.1989.63487

Data stream clustering (1,250 words) [view diff] exact match in snippet view article find links to article

"Clustering data streams". Proceedings 41st Annual Symposium on Foundations of Computer Science. pp. 359–366. CiteSeerX 10.1.1.32.1927. doi:10.1109/SFCS

Galactic algorithm (2,636 words) [view diff] exact match in snippet view article find links to article

multiplication", Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012), pp. 514–523, arXiv:1204.1111, doi:10.1109/FOCS

Graph traversal (1,492 words) [view diff] exact match in snippet view article find links to article

sequences, and the complexity of maze problems". 20th Annual Symposium on Foundations of Computer Science (SFCS 1979): 218–223. doi:10.1109/SFCS.1979.34. S2CID 18719861

Range tree (1,250 words) [view diff] exact match in snippet view article find links to article

structure for orthogonal range queries". 19th Annual Symposium on Foundations of Computer Science (sfcs 1978). pp. 28–21. doi:10.1109/SFCS.1978.1. S2CID 14970942

Ashok K. Chandra (411 words) [view diff] exact match in snippet view article find links to article

Alternation. FOCS '76: Proceedings of the 17th IEEE Symposium on Foundations of Computer Science. Houston, Texas. pp. 98–108. doi:10.1109/SFCS.1976.4

Andrei Broder (844 words) [view diff] exact match in snippet view article find links to article

"Generating random spanning trees" (PDF). 30th Annual Symposium on Foundations of Computer Science. pp. 442–47. doi:10.1109/SFCS.1989.63516. ISBN 0-8186-1982-1

Succinct data structure (2,896 words) [view diff] exact match in snippet view article find links to article

Space-efficient static trees and graphs (PDF). 30th IEEE Symposium on Foundations of Computer Science. doi:10.1109/SFCS.1989.63533. Archived from the original

Alternating-time temporal logic (520 words) [view diff] exact match in snippet view article find links to article

"Alternating-time temporal logic". Proceedings of the 38th Annual Symposium on Foundations of Computer Science. IEEE Computer Society. pp. 100–109. doi:10.1109/SFCS

Kinetic priority queue (622 words) [view diff] exact match in snippet view article find links to article

"Dynamic planar convex hull". Proc. The 43rd Annual IEEE Symposium on Foundations of Computer Science. FCS. pp. 617–626. arXiv:1902.11169. doi:10.1109/SFCS

Quantum coin flipping (3,294 words) [view diff] exact match in snippet view article find links to article

Computer Science, December 4, 2014 50th Annual IEEE Symposium on Foundations of Computer Science, 2009 FOCS '09; 25-27 Oct. 2009, Atlanta, Georgia, USA;

Ramesh Sitaraman (667 words) [view diff] exact match in snippet view article find links to article

Bounded-Degree Networks, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS), October 1992, pp. 542-552". 1992. pp. 542–552

Pseudorandom generators for polynomials (575 words) [view diff] exact match in snippet view article find links to article

Graph Theory and its Applications". 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). pp. 41–51. doi:10.1109/FOCS.2007.56. ISBN 978-0-7695-3010-9

Single-minded agent (551 words) [view diff] exact match in snippet view article find links to article

Problems with Limited Supply". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. pp. 35–44. doi:10.1109/FOCS.2008.15. ISBN 978-0-7695-3436-7

K-means++ (1,403 words) [view diff] exact match in snippet view article find links to article

k-Means Problem". Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). IEEE. pp. 165–174. Drineas, P.; Frieze, A

Chosen-ciphertext attack (1,105 words) [view diff] exact match in snippet view article find links to article

treatment of symmetric encryption". Proceedings 38th Annual Symposium on Foundations of Computer Science. pp. 394–403. doi:10.1109/SFCS.1997.646128. ISBN 0-8186-8197-7

Shai Halevi (786 words) [view diff] exact match in snippet view article find links to article

Encryption for all Circuits". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE. pp. 40–49. CiteSeerX 10.1.1.672.1968. doi:10.1109/FOCS

Envy-free pricing (2,559 words) [view diff] exact match in snippet view article find links to article

Problems with Limited Supply". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. pp. 35–44. doi:10.1109/FOCS.2008.15. ISBN 978-0-7695-3436-7

Linear programming (6,690 words) [view diff] exact match in snippet view article find links to article

multiplication". 30th Annual Symposium on Foundations of Computer Science. 30th Annual Symposium on Foundations of Computer Science. FOCS. pp. 332–337. doi:10

Minimum-weight triangulation (3,289 words) [view diff] exact match in snippet view article find links to article

triangulations of a set of points in the plane", Proc. 18th IEEE Symposium on Foundations of Computer Science, pp. 228–240. Manacher, Glenn K.; Zobrist, Albert L.

Small-bias sample space (2,439 words) [view diff] exact match in snippet view article find links to article

from Algebraic-Geometric Codes". 2009 50th Annual IEEE Symposium on Foundations of Computer Science (PDF). pp. 191–197. CiteSeerX 10.1.1.149.9273. doi:10

Ronald Fagin (1,179 words) [view diff] exact match in snippet view article find links to article

113-150. Preliminary version appeared in Proc. 29th IEEE Symposium on Foundations of Computer Science, 1988, pp. 358-367. Ronald Fagin publications indexed

Unique sink orientation (754 words) [view diff] exact match in snippet view article find links to article

(2001), "Unique sink orientations of cubes", 42nd IEEE Symposium on Foundations of Computer Science (Las Vegas, NV, 2001), Los Alamitos, CA: IEEE Computer

Erdős conjecture on arithmetic progressions (895 words) [view diff] exact match in snippet view article find links to article

"Strong Bounds for 3-Progressions". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 933–973. arXiv:2302.05537. doi:10.1109/FOCS57990

Indistinguishability obfuscation (2,298 words) [view diff] exact match in snippet view article find links to article

Encryption for all Circuits". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE. pp. 40–49. doi:10.1109/focs.2013.13. ISBN 978-0-7695-5135-7

Fiat–Shamir heuristic (1,068 words) [view diff] exact match in snippet view article find links to article

(In)security of the Fiat-Shamir paradigm". 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. pp. 102–113. doi:10.1109/SFCS.2003

Multi-commodity flow problem (1,172 words) [view diff] exact match in snippet view article find links to article

table and multi-commodity flow problems". 16th Annual Symposium on Foundations of Computer Science (SFCS 1975). pp. 184–193. doi:10.1109/SFCS.1975.21. S2CID 18449466

Set intersection oracle (650 words) [view diff] exact match in snippet view article find links to article

beyond the Thorup–Zwick Bound. 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS). p. 815. doi:10.1109/FOCS.2010.83. ISBN 978-1-4244-8525-3

Shuchi Chawla (258 words) [view diff] exact match in snippet view article find links to article

doi:10.1137/050645464, MR 2318723. Previously announced in the Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.

Klee's measure problem (1,126 words) [view diff] exact match in snippet view article find links to article

measure problem made easy", Proceedings of the 54th IEEE Symposium on Foundations of Computer Science (FOCS) (PDF), pp. 410–419, CiteSeerX 10.1.1.643.26, doi:10

Index calculus algorithm (1,720 words) [view diff] exact match in snippet view article find links to article

problem with applications to cryptography, In 20th Annual Symposium on Foundations of Computer Science, 1979 Barbulescu, Razvan (2013). Algorithms for discrete

Fixed point (mathematics) (1,696 words) [view diff] exact match in snippet view article

Recursive Domain Equations" (PDF). Proceedings, 18th IEEE Symposium on Foundations of Computer Science. SIAM Journal of Computing (volume 11). pp. 761–783.

Robert Sedgewick (computer scientist) (1,550 words) [view diff] exact match in snippet view article

Dichromatic Framework for Balanced Trees. 19th Annual Symposium on Foundations of Computer Science, 1980. Ternary Search Trees. Dr. Dobbs Journal, March

Monika Henzinger (596 words) [view diff] exact match in snippet view article find links to article

Biconnectivity and Transitive Closure", 36th Annual Symposium on Foundations of Computer Science (FOCS'95) (PDF), pp. 664–672, doi:10.1109/SFCS.1995.492668

Virginia Vassilevska Williams (673 words) [view diff] exact match in snippet view article find links to article

Bounds for Dynamic Problems", 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 434–443, arXiv:1402.0054, doi:10.1109/FOCS.2014

Gap-Hamming problem (765 words) [view diff] exact match in snippet view article find links to article

for the distinct elements problem". 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. pp. 283–288. doi:10.1109/SFCS.2003

Copying mechanism (1,161 words) [view diff] exact match in snippet view article find links to article

Raghavan, S. Rajagopalan, D. Sivakumar, A. S. Tomkins and E. Upfal, 2000b, Proceedings of the 41st IEEE Symposium on Foundations of Computer Science.

Priority queue (5,009 words) [view diff] exact match in snippet view article find links to article

logarithmic time. In Proceedings of the 16th Annual Symposium on Foundations of Computer Science, pages 75-84. IEEE Computer Society, 1975. Michael L

Victor Pan (759 words) [view diff] exact match in snippet view article find links to article

for matrix operations", Proceedings of the 19th Annual Symposium on Foundations of Computer Science (FOCS 1978), IEEE, pp. 166–176, doi:10.1109/sfcs.1978

Matrix multiplication (6,581 words) [view diff] exact match in snippet view article find links to article

arXiv:math.GR/0511460. Proceedings of the 46th Annual Symposium on Foundations of Computer Science, 23–25 October 2005, Pittsburgh, PA, IEEE Computer Society

Proof complexity (3,754 words) [view diff] exact match in snippet view article find links to article

"Automating resolution is NP-hard". Proceedings of the 60th Symposium on Foundations of Computer Science. pp. 498–509. de Rezende, Susanna; Göös, Mika; Nordström

Probabilistically checkable proof (1,252 words) [view diff] exact match in snippet view article find links to article

interactive protocols", Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS 1990), pp. 16–25, CiteSeerX 10.1.1.130.9311, doi:10

Adiabatic quantum computation (2,010 words) [view diff] exact match in snippet view article find links to article

Quantum Computation?". Proceedings of the 42nd Annual Symposium on Foundations of Computer Science: 279. Kempe, J.; Kitaev, A.; Regev, O. (July 27, 2006)

Philip N. Klein (638 words) [view diff] exact match in snippet view article find links to article

approximation scheme for planar weighted TSP". 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05). pp. 647–656. doi:10.1109/SFCS.2005.7. ISBN 0-7695-2468-0

Graph isomorphism problem (4,222 words) [view diff] exact match in snippet view article find links to article

exponential time" (PDF), Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), IEEE Computer Society, pp. 667–676, doi:10

Shor's algorithm (5,812 words) [view diff] exact match in snippet view article find links to article

Discrete logarithms and factoring". Proceedings 35th Annual Symposium on Foundations of Computer Science. pp. 124–134. doi:10.1109/sfcs.1994.365700. ISBN 978-0-8186-6580-6

Distance oracle (1,409 words) [view diff] exact match in snippet view article find links to article

beyond the Thorup–Zwick Bound. 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS). p. 815. doi:10.1109/FOCS.2010.83. ISBN 978-1-4244-8525-3

Ackermann function (7,095 words) [view diff] exact match in snippet view article find links to article

Ackermann-complete. Proceedings of the 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science. arXiv:2104.13866. doi:10.1109/FOCS52979.2021.00120.

Multiple line segment intersection (366 words) [view diff] exact match in snippet view article find links to article

algorithm Shamos, M. I.; Hoey, D. (1976). "17th Annual Symposium on Foundations of Computer Science (sfcs 1976)" (PDF): 208. doi:10.1109/SFCS.1976.16. S2CID 124804

Doubling space (911 words) [view diff] exact match in snippet view article find links to article

fractals, and low-distortion embeddings". 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. pp. 534–543. doi:10.1109/SFCS.2003

Michael Luby (999 words) [view diff] exact match in snippet view article find links to article

Luby, Michael (2002). "LT codes". The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. pp. 271–282. doi:10.1109/sfcs.2002

Ackermann function (7,095 words) [view diff] exact match in snippet view article find links to article

Ackermann-complete. Proceedings of the 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science. arXiv:2104.13866. doi:10.1109/FOCS52979.2021.00120.

Dynamic time warping (3,863 words) [view diff] exact match in snippet view article find links to article

Problems and Dynamic Time Warping". 2015 IEEE 56th Annual Symposium on Foundations of Computer Science. pp. 79–97. arXiv:1502.01063. doi:10.1109/FOCS.2015.15

3-dimensional matching (1,550 words) [view diff] exact match in snippet view article find links to article

Bounded Pathwidth Local Search". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 509–518. arXiv:1304.1424. Bibcode:2013arXiv1304

Andrew Childs (886 words) [view diff] exact match in snippet view article find links to article

N^{1/2 + o(1)} on a Quantum Computer". 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). pp. 2513–2530. doi:10.1109/FOCS.2007.57.

Compressed data structure (471 words) [view diff] exact match in snippet view article find links to article

structures with applications". Proceedings 41st Annual Symposium on Foundations of Computer Science. pp. 390–398. doi:10.1109/SFCS.2000.892127. ISBN 0-7695-0850-2

Clique-sum (1,178 words) [view diff] exact match in snippet view article find links to article

approximation, and coloring" (PDF), Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (PDF), pp. 637–646, doi:10.1109/SFCS.2005.14, ISBN 0-7695-2468-0

Standard model (cryptography) (506 words) [view diff] exact match in snippet view article

Use an Imperfect Reference String". 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07). pp. 249–259. doi:10.1109/focs.2007.70. ISBN 978-0769530109

Map graph (811 words) [view diff] exact match in snippet view article find links to article

in polynomial time", Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS 1998), pp. 396–405, doi:10.1109/SFCS.1998.743490

Colour refinement algorithm (899 words) [view diff] exact match in snippet view article find links to article

labelling of graphs in linear average time". 20th Annual Symposium on Foundations of Computer Science (SFCS 1979). pp. 39–46. doi:10.1109/SFCS.1979.8. Retrieved

Amit Sahai (1,154 words) [view diff] exact match in snippet view article find links to article

Encryption for all Circuits". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE. pp. 40–49. CiteSeerX 10.1.1.672.1968. doi:10.1109/FOCS

Expander graph (5,344 words) [view diff] exact match in snippet view article find links to article

constant-degree expanders and extractors". Proceedings 41st Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. pp. 3–13. doi:10.1109/sfcs.2000.892006

Graham scan (1,738 words) [view diff] exact match in snippet view article find links to article

triangulations in two dimensions" (PDF). 30th Annual Symposium on Foundations of Computer Science. Vol. 30. pp. 494–499. doi:10.1109/SFCS.1989.63524. ISBN 0-8186-1982-1

Square packing (1,189 words) [view diff] exact match in snippet view article find links to article

simple polygons with unit squares", 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago, IL, USA, October 27–30, 2024, IEEE

Deutsch–Jozsa algorithm (2,191 words) [view diff] exact match in snippet view article find links to article

power of quantum computation". Proceedings 35th Annual Symposium on Foundations of Computer Science. pp. 116–123. doi:10.1109/SFCS.1994.365701. ISBN 0-8186-6580-7

Compressed suffix array (744 words) [view diff] exact match in snippet view article find links to article

Structures with Applications". Proceedings of the 41st Annual Symposium on Foundations of Computer Science. p.390. R. Grossi, A. Gupta, and J. S. Vitter, High-Order

Cooley–Tukey FFT algorithm (5,348 words) [view diff] exact match in snippet view article find links to article

Cache-oblivious algorithms. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS 99), p.285-297. 1999. Extended abstract at IEEE

Set packing (1,514 words) [view diff] exact match in snippet view article find links to article

Bounded Pathwidth Local Search". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 509–518. arXiv:1304.1424. doi:10.1109/FOCS.2013

Induced path (1,486 words) [view diff] exact match in snippet view article find links to article

approximate within n1−ε". Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science. pp. 627–636. doi:10.1109/SFCS.1996.548522. Kautz, William

Submodular flow (352 words) [view diff] exact match in snippet view article find links to article

submodular flow problems", Proceedings of the 34th Annual Symposium on Foundations of Computer Science (FOCS), Palo Alto, California, USA, 3-5 November 1993

Berman–Hartmanis conjecture (1,250 words) [view diff] exact match in snippet view article find links to article

relative to an oracle", Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pp. 30–39, CiteSeerX 10.1.1.42.6130, doi:10.1109/SFCS

FM-index (1,327 words) [view diff] exact match in snippet view article find links to article

Structures with Applications". Proceedings of the 41st Annual Symposium on Foundations of Computer Science. p.390. Paolo Ferragina and Giovanni Manzini (2005).

Pseudotriangle (2,058 words) [view diff] exact match in snippet view article find links to article

arm motion planning", Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE Computer Society, pp. 443–453, doi:10.1109/SFCS

Planarization (1,184 words) [view diff] exact match in snippet view article find links to article

few error vertices in linear time", 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS '09) (PDF), pp. 639–648, doi:10.1109/FOCS.2009

Market equilibrium computation (4,073 words) [view diff] exact match in snippet view article find links to article

Fixed Number of Goods or Agents". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. pp. 45–53. doi:10.1109/FOCS.2008.30. ISBN 978-0-7695-3436-7

Fountain code (1,460 words) [view diff] exact match in snippet view article find links to article

Luby, Michael (2002). "LT codes". The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. pp. 271–282. doi:10.1109/sfcs.2002

Alpha–beta pruning (2,405 words) [view diff] exact match in snippet view article find links to article

the Complexity of Evaluating Game Trees". 27th Annual Symposium on Foundations of Computer Science. pp. 29–38. doi:10.1109/SFCS.1986.44. ISBN 0-8186-0740-8

Arrow–Debreu exchange market (1,262 words) [view diff] exact match in snippet view article find links to article

Fixed Number of Goods or Agents". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. pp. 45–53. doi:10.1109/FOCS.2008.30. ISBN 978-0-7695-3436-7

Martin Farach-Colton (953 words) [view diff] exact match in snippet view article find links to article

tree construction with large alphabets", 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22,

Hamiltonian simulation (1,181 words) [view diff] exact match in snippet view article find links to article

dependence on all parameters". 2015 IEEE 56th Annual Symposium on Foundations of Computer Science. pp. 792–809. arXiv:1501.01715. Bibcode:2015arXiv150101715B

Tami Tamir (386 words) [view diff] exact match in snippet view article find links to article

frugality of truthful mechanisms", 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 October 2005, Pittsburgh, PA, USA

Cell-probe model (1,404 words) [view diff] exact match in snippet view article find links to article

Approximate Nearest Neighbour Searching". 45th Annual IEEE Symposium on Foundations of Computer Science. pp. 473–482. doi:10.1109/FOCS.2004.12. ISBN 0-7695-2228-9

Triangle-free graph (2,524 words) [view diff] exact match in snippet view article find links to article

combinatorial arguments", Proceedings of the 55th Annual Symposium on Foundations of Computer Science (FOCS 2014), IEEE, pp. 216–225, arXiv:1407.0085, doi:10

Feedback vertex set (1,805 words) [view diff] exact match in snippet view article find links to article

of Maximum Acyclic Subgraph". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. pp. 573–582. doi:10.1109/FOCS.2008.51. ISBN 978-0-7695-3436-7

Grigory Yaroslavtsev (923 words) [view diff] exact match in snippet view article find links to article

Retrieved 10 November 2019. "FOCS 2017 58th Annual IEEE Symposium on Foundations of Computer Science". FOCS17. Simons Institute at Berkeley. Retrieved 10

Concrete security (694 words) [view diff] exact match in snippet view article find links to article

symmetric encryption" (PDF). Proceedings 38th Annual Symposium on Foundations of Computer Science. pp. 394–403. doi:10.1109/SFCS.1997.646128. ISBN 0-8186-8197-7

Binomial heap (2,566 words) [view diff] exact match in snippet view article find links to article

(PDF). FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. pp. 174–183. CiteSeerX 10.1.1.549.471. doi:10.1109/SFCS

Elham Kashefi (926 words) [view diff] exact match in snippet view article find links to article

"Universal Blind Quantum Computation". 2009 50th Annual IEEE Symposium on Foundations of Computer Science. pp. 517–526. arXiv:0807.4154. doi:10.1109/FOCS.2009

Secure two-party computation (1,093 words) [view diff] exact match in snippet view article find links to article

(1982). "Protocols for secure computations". 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982). pp. 160–164. doi:10.1109/SFCS.1982.38. S2CID 206558698

Truthful job scheduling (1,748 words) [view diff] exact match in snippet view article find links to article

mechanisms for one-parameter agents". Proceedings 42nd IEEE Symposium on Foundations of Computer Science. pp. 482–491. doi:10.1109/SFCS.2001.959924. ISBN 0-7695-1390-5

Congestion game (7,315 words) [view diff] exact match in snippet view article find links to article

"Sink Equilibria and Convergence". 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05). pp. 142–151. doi:10.1109/SFCS.2005.68. ISBN 0-7695-2468-0

Blossom algorithm (2,022 words) [view diff] exact match in snippet view article find links to article

finding maximum matching in general graphs. 21st Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, New York. pp. 17–27. Edmonds

Dijoin (626 words) [view diff] exact match in snippet view article find links to article

submodular flow problems", Proceedings of the 34th Annual Symposium on Foundations of Computer Science (FOCS), Palo Alto, California, USA, 3-5 November 1993

Pointer jumping (1,429 words) [view diff] exact match in snippet view article find links to article

functions in logarithmic parallel time". 25th Annual Symposium on Foundations of Computer Science, 1984. pp. 12–20. doi:10.1109/SFCS.1984.715896. ISBN 0-8186-0591-X

List of PSPACE-complete problems (1,807 words) [view diff] exact match in snippet view article find links to article

decision problem for the predicate calculus. 19th Annual Symposium on Foundations of Computer Science. IEEE. pp. 35–47. Garey, M.R.; Johnson, D.S. (1979).

Distribution learning theory (3,845 words) [view diff] exact match in snippet view article find links to article

Learning Sums of Independent Integer Random Variables. IEEE Symposium on Foundations of Computer Science, 2013 [6] K. Pearson Contribution to the Mathematical

Discrepancy of permutations (735 words) [view diff] exact match in snippet view article find links to article

Counterexample and Some Consequences". 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science. pp. 253–262. doi:10.1109/FOCS.2012.84. ISBN 978-0-7695-4874-6

Graham–Pollak theorem (1,447 words) [view diff] exact match in snippet view article find links to article

"Unambiguous DNFs and Alon–Saks–Seymour", 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pp

Fusion tree (2,434 words) [view diff] exact match in snippet view article find links to article

Select, and Predecessor Search". 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. p. 166-175. arXiv:1408.3045. doi:10.1109/FOCS.2014.26

Szemerédi regularity lemma (6,164 words) [view diff] exact match in snippet view article find links to article

and Combinatorial Algorithms", 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 745–754, doi:10.1109/FOCS.2009.76, ISBN 978-1-4244-5116-6

Jelani Nelson (1,269 words) [view diff] exact match in snippet view article find links to article

Johnson-Lindenstrauss Lemma. Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS). pp. 633–638. arXiv:1609.02094. doi:10.1109/FOCS

Log-rank conjecture (469 words) [view diff] exact match in snippet view article find links to article

Möbius Functions and Communication Complexity, Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, pp. 81–90{{citation}}:

Luby transform code (1,583 words) [view diff] exact match in snippet view article find links to article

Tornado codes M.Luby, "LT Codes", The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. The exclusive or (XOR) operation, symbolized by

Van Emde Boas tree (2,313 words) [view diff] exact match in snippet view article find links to article

than logarithmic time (Proceedings of the 16th Annual Symposium on Foundations of Computer Science 10: 75-84, 1975) Gudmund Skovbjerg Frandsen: Dynamic

Edmonds–Pruhs protocol (1,583 words) [view diff] exact match in snippet view article find links to article

"Balanced Allocations of Cake". 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). pp. 623–634. doi:10.1109/focs.2006.17.

Divide-and-conquer algorithm (2,894 words) [view diff] exact match in snippet view article find links to article

Prokop (1999). "Cache-oblivious algorithms". 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). pp. 285–297. doi:10.1109/SFFCS.1999

Vertex cover (2,556 words) [view diff] exact match in snippet view article find links to article

Have Near-Perfect Expansion". 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). pp. 592–601. doi:10.1109/FOCS.2018.00062.

Interactive proof system (2,746 words) [view diff] exact match in snippet view article find links to article

Approximation Problems. Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pp. 13–22. 1992. Arora, Sanjeev; Barak, Boaz, "Complexity

Quantum nonlocality (9,392 words) [view diff] exact match in snippet view article find links to article

Quantum Cryptography with Imperfect Apparatus. IEEE Symposium on Foundations of Computer Science (FOCS). Acín, Antonio; Nicolas Gisin; Lluis Masanes (2006)

Heap (data structure) (2,929 words) [view diff] exact match in snippet view article

(PDF). FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. pp. 174–183. CiteSeerX 10.1.1.549.471. doi:10.1109/SFCS

Ring learning with errors signature (2,570 words) [view diff] exact match in snippet view article find links to article

approximate to within some constant". In Proc. 39th Symposium on Foundations of Computer Science: 92–98. Lyubashevsky, Vadim (2009-01-01). "Fiat-Shamir

Communication-avoiding algorithm (1,680 words) [view diff] exact match in snippet view article find links to article

algorithms", In FOCS '99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999. IEEE Computer Society. S. Toledo, "Locality of

Queue number (2,715 words) [view diff] exact match in snippet view article find links to article

nonrepetitive coloring", Proceedings of the 54th IEEE Symposium on Foundations of Computer Science (FOCS '13), pp. 280–289, arXiv:1306.1595, doi:10.1109/FOCS

Hamiltonian path problem (2,518 words) [view diff] exact match in snippet view article find links to article

for Undirected Hamiltonicity". 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. IEEE. pp. 173–182. arXiv:1008.0541. doi:10.1109/focs

Optimal binary search tree (2,965 words) [view diff] exact match in snippet view article find links to article

optimality—almost" (PDF), Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 484–490, CiteSeerX 10.1.1.99.4964, doi:10.1109/FOCS

Pseudorandom generator theorem (1,933 words) [view diff] exact match in snippet view article find links to article

"Theory and Application of Trapdoor Functions." 23rd IEEE Symposium on Foundations of Computer Science, pp. 80–91, 1982. M. Blum and S. Micali "How to Generate

Ham sandwich theorem (2,708 words) [view diff] exact match in snippet view article find links to article

theorems and applications", Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280), p. 232, doi:10.1109/sfcs.1998.743449

Spectral clustering (3,562 words) [view diff] exact match in snippet view article find links to article

Planar graphs and finite element meshes". Annual IEEE Symposium on Foundations of Computer Science. Ng, Andrew Y.; Jordan, Michael I.; Weiss, Yair (2002)

Boyer–Moore string-search algorithm (2,769 words) [view diff] exact match in snippet view article find links to article

searching algorithm". Proceedings of the 18th Annual Symposium on Foundations of Computer Science. SFCS '77. Washington, District of Columbia: IEEE Computer

Quantum machine learning (9,362 words) [view diff] exact match in snippet view article find links to article

2015 IEEE 56th Annual Symposium on Foundations of Computer Science. 56th Annual Symposium on Foundations of Computer Science. IEEE. pp. 792–809. arXiv:1501

Funnelsort (1,427 words) [view diff] exact match in snippet view article find links to article

Cache-oblivious algorithms. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS 99), pp. 285-297. 1999. Extended abstract at IEEE

Approximate membership query filter (1,639 words) [view diff] exact match in snippet view article find links to article

Approximate Membership Data Structures". 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. pp. 797–804. doi:10.1109/FOCS.2010.81. ISBN 978-1-4244-8525-3

Vapnik–Chervonenkis dimension (2,798 words) [view diff] exact match in snippet view article find links to article

Characterization of Multiclass Learnability". 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). arXiv:2203.01550. Pollard, D. (1984). Convergence

Paul Benioff (1,797 words) [view diff] exact match in snippet view article find links to article

Discrete logarithms and factoring". Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press. pp. 124–134. doi:10.1109/sfcs

Approximation algorithm (3,126 words) [view diff] exact match in snippet view article find links to article

and other geometric problems". Proceedings 38th Annual Symposium on Foundations of Computer Science. pp. 554–563. doi:10.1109/SFCS.1997.646145. ISBN 978-0-8186-8197-4

Presburger arithmetic (3,249 words) [view diff] exact match in snippet view article find links to article

Presburger Arithmetic is Hard" (PDF). 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). pp. 37–48. arXiv:1708.08179. doi:10.1109/FOCS

Balls into bins problem (1,958 words) [view diff] exact match in snippet view article find links to article

"Balanced Allocations of Cake" (PDF). 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). pp. 623–634. doi:10.1109/FOCS.2006.17. ISBN 0-7695-2720-5

Yen's algorithm (2,179 words) [view diff] exact match in snippet view article find links to article

improved network optimization algorithms. 25th Annual Symposium on Foundations of Computer Science. IEEE. pp. 338–346. doi:10.1109/SFCS.1984.715934. Bouillet

Next-bit test (1,391 words) [view diff] exact match in snippet view article find links to article

trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982. Manuel Blum and Silvio Micali, How to generate

Yao's Millionaires' problem (1,952 words) [view diff] exact match in snippet view article find links to article

1982). "Protocols for secure computations". 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982). Vol. 1. pp. 160–164. doi:10.1109/SFCS.1982

Uniform-machines scheduling (1,767 words) [view diff] exact match in snippet view article find links to article

mechanisms for one-parameter agents". Proceedings 42nd IEEE Symposium on Foundations of Computer Science. pp. 482–491. doi:10.1109/SFCS.2001.959924. ISBN 0-7695-1390-5

Crossing number (graph theory) (3,160 words) [view diff] exact match in snippet view article

number is it, anyway?". Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS 1998). pp. 617–626. doi:10.1109/SFCS.1998.743512

Randomized algorithm (4,218 words) [view diff] exact match in snippet view article find links to article

(October 1989). "Randomized search trees". 30th Annual Symposium on Foundations of Computer Science. pp. 540–545. doi:10.1109/SFCS.1989.63531. ISBN 0-8186-1982-1

Fibonacci heap (3,785 words) [view diff] exact match in snippet view article find links to article

(PDF). FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. pp. 174–183. CiteSeerX 10.1.1.549.471. doi:10.1109/SFCS

Checkers (3,341 words) [view diff] exact match in snippet view article find links to article

complexity of checkers on an N × N board". 19th Annual Symposium on Foundations of Computer Science. pp. 55–64. doi:10.1109/SFCS.1978.36. Robson, J. M. (May

NC (complexity) (3,078 words) [view diff] exact match in snippet view article

(1979). "On simultaneous resource bounds". 20th Annual Symposium on Foundations of Computer Science (SFCS 1979): 307–311. doi:10.1109/SFCS.1979.29. ISSN 0272-5428

Exponential time hypothesis (3,061 words) [view diff] exact match in snippet view article find links to article

-SAT and constraint satisfaction problems", 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, IEEE

Maximum cut (3,125 words) [view diff] exact match in snippet view article find links to article

and Linear Programming", Proceedings of the 37th IEEE Symposium on Foundations of Computer Science: 617–626. Zeng, Q.; Hou, J. (2017), "Bipartite Subgraphs

Bin packing problem (7,097 words) [view diff] exact match in snippet view article find links to article

O(log OPT · Log Log OPT) Bins". 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 20–29. arXiv:1301.4010. doi:10.1109/FOCS.2013.11

Tonelli–Shanks algorithm (3,750 words) [view diff] exact match in snippet view article find links to article

1977, `On taking roots in finite fields'. In: 18th IEEE Symposium on Foundations of Computer Science. pp. 175-177 "Accademia nazionale dei Lincei, Rome. Rendiconti

Nested radical (3,440 words) [view diff] exact match in snippet view article find links to article

(1992). "Simplification of Nested Radicals". 30th Annual Symposium on Foundations of Computer Science. Vol. 21. SIAM. pp. 85–110. CiteSeerX 10.1.1.34.2003

Public-key cryptography (4,512 words) [view diff] exact match in snippet view article find links to article

the basic Merkle-Hellman cryptosystem". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982): 145–152. doi:10.1109/SFCS.1982.5. Tunggal

Quantum Fourier transform (3,302 words) [view diff] exact match in snippet view article find links to article

algorithm and applications". Proceedings 41st Annual Symposium on Foundations of Computer Science. pp. 515–525. CiteSeerX 10.1.1.29.4161. doi:10.1109/SFCS

Deterministic rendezvous problem (1,739 words) [view diff] exact match in snippet view article find links to article

sequences, and the complexity of maze problems". 20th Annual Symposium on Foundations of Computer Science (SFCS 1979): 218–223. doi:10.1109/SFCS.1979.34. S2CID 18719861

Single-machine scheduling (2,762 words) [view diff] exact match in snippet view article find links to article

processor scheduling". Proceedings of the 19th Annual Symposium on Foundations of Computer Science. SFCS '78. USA: IEEE Computer Society: 246–252. doi:10

Polygon covering (2,229 words) [view diff] exact match in snippet view article find links to article

"Covering polygons is hard". [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. p. 601. doi:10.1109/sfcs.1988.21976. ISBN 978-0-8186-0877-3

Maze-solving algorithm (2,893 words) [view diff] exact match in snippet view article find links to article

sequences, and the complexity of maze problems". 20th Annual Symposium on Foundations of Computer Science (sfcs 1979). IEEE Computer Society. pp. 218–223. Maze

Quantum walk (2,600 words) [view diff] exact match in snippet view article find links to article

algorithms for hidden nonlinear structures, Proc. 48th IEEE Symposium on Foundations of Computer Science, pp. 395–404, 2007, arXiv:0705.2784. Andris Ambainis

Space hierarchy theorem (2,784 words) [view diff] exact match in snippet view article find links to article

Space-Bounded Computations". Proceedings of the 19th Annual Symposium on Foundations of Computer Science. "How do we know that P != LINSPACE without knowing if

Nearest neighbor search (3,341 words) [view diff] exact match in snippet view article find links to article

Neighbor in High Dimensions". 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). pp. 459–468. CiteSeerX 10.1.1.142.3471. doi:10

Schwartz–Zippel lemma (2,253 words) [view diff] exact match in snippet view article find links to article

permanents is in NC". Proceedings of the 28th Annual Symposium on Foundations of Computer Science (FOCS 1987), Los Angeles, California, USA, 27-29 October

Non-interactive zero-knowledge proof (2,465 words) [view diff] exact match in snippet view article find links to article

Fiat–Shamir Paradigm. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03). 2003 Rafael Pass. On Deniability in the Common

Shellsort (3,463 words) [view diff] exact match in snippet view article find links to article

bounds for Shellsort" (PDF). Proceedings., 33rd Annual Symposium on Foundations of Computer Science. Vol. 33. Pittsburgh, United States. pp. 226–235. CiteSeerX 10

Suffix array (3,775 words) [view diff] exact match in snippet view article find links to article

construction with large alphabets. Proceedings 38th Annual Symposium on Foundations of Computer Science. doi:10.1109/SFCS.1997.646102. ISBN 0-8186-8197-7. I

Online matrix-vector multiplication problem (989 words) [view diff] exact match in snippet view article find links to article

lower bounds for dynamic problems". 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18–21, 2014

Blichfeldt's theorem (1,935 words) [view diff] exact match in snippet view article find links to article

cryptography", in Thorup, Mikkel (ed.), 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, IEEE Computer

Locality-sensitive hashing (4,040 words) [view diff] exact match in snippet view article find links to article

"Fast similarity sketching." 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2017. Christiani, Tobias. "Fast locality-sensitive

K-server problem (1,290 words) [view diff] exact match in snippet view article find links to article

k-server algorithms". Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. pp. 454–463. Koutsoupias, Elias; Papadimitriou, Christos

Geometric separator (2,388 words) [view diff] exact match in snippet view article find links to article

theorems and applications". Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280). p. 232. doi:10.1109/sfcs.1998.743449

Graph minor (4,046 words) [view diff] exact match in snippet view article find links to article

algorithm with parity conditions", 52nd Annual IEEE Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, pp

NLTS conjecture (1,115 words) [view diff] exact match in snippet view article find links to article

"Local Hamiltonians Whose Ground States are Hard to Approximate" (PDF). IEEE Symposium on Foundations of Computer Science (FOCS). Retrieved Aug 7, 2022.

Dijkstra's algorithm (5,637 words) [view diff] exact match in snippet view article find links to article

improved network optimization algorithms. 25th Annual Symposium on Foundations of Computer Science. IEEE. pp. 338–346. doi:10.1109/SFCS.1984.715934. Fredman

Streaming algorithm (3,624 words) [view diff] exact match in snippet view article find links to article

"Selection and Sorting with Limited Storage". 19th Annual Symposium on Foundations of Computer Science, Ann Arbor, Michigan, USA, 16–18 October 1978. IEEE Computer

Salem–Spencer set (2,612 words) [view diff] exact match in snippet view article find links to article

"Strong Bounds for 3-Progressions". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 933–973. arXiv:2302.05537. doi:10.1109/FOCS57990

Computational complexity of mathematical operations (1,576 words) [view diff] exact match in snippet view article find links to article

Matrix Multiplication". Proceedings of the 46th Annual Symposium on Foundations of Computer Science. IEEE. pp. 379–388. arXiv:math.GR/0511460. doi:10.1109/SFCS

David Easley (1,959 words) [view diff] exact match in snippet view article find links to article

Kleinberg, Robert Kleinberg, Eva Tardos, Proc. 52nd IEEE Symposium on Foundations of Computer Science, 2011. Flow Toxicity and Volatility in a High Frequency

Time hierarchy theorem (2,497 words) [view diff] exact match in snippet view article find links to article

for Probabilistic Polynomial Time". 45th Annual IEEE Symposium on Foundations of Computer Science. p. 316. doi:10.1109/FOCS.2004.33. ISBN 0-7695-2228-9

Regret (decision theory) (2,987 words) [view diff] exact match in snippet view article

Agent: Beyond the Common Prior". 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 259–270. arXiv:2009.05518. doi:10.1109/focs46700

Constraint satisfaction problem (3,364 words) [view diff] exact match in snippet view article find links to article

Nonuniform CSPs". Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017. IEEE Computer Society. pp. 319–330. arXiv:1703

Semidefinite programming (4,698 words) [view diff] exact match in snippet view article find links to article

for Semidefinite Programming". 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). Durham, NC, USA: IEEE. pp. 910–918. arXiv:2009

Price of anarchy in auctions (2,914 words) [view diff] exact match in snippet view article find links to article

Generalized Second Price Auction". 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. p. 735. CiteSeerX 10.1.1.168.6636. doi:10.1109/FOCS

Lattice problem (3,660 words) [view diff] exact match in snippet view article find links to article

Factors is NP-Hard". Proceedings of the 39th Annual Symposium on Foundations of Computer Science. IEEE Computer Society. p. 99. ISBN 978-0-8186-9172-0

Hash table (5,966 words) [view diff] exact match in snippet view article find links to article

Addressing Without Reordering. 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). arXiv:2501.02305. doi:10.1109/FOCS61266.2024

Noisy-storage model (2,870 words) [view diff] exact match in snippet view article find links to article

the Bounded Quantum-Storage Model". 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05). pp. 449–458. arXiv:quant-ph/0508222. Bibcode:2005quant

Linear probing (3,605 words) [view diff] exact match in snippet view article find links to article

Demise of Primary Clustering". 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 1171–1182. doi:10.1109/focs52979.2021

Diameter (graph theory) (1,082 words) [view diff] exact match in snippet view article

shortest cycles, diameter and matchings", 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012

Bayesian persuasion (1,279 words) [view diff] exact match in snippet view article find links to article

Agent: Beyond the Common Prior". 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 259–270. arXiv:2009.05518. doi:10.1109/focs46700

Ring learning with errors (2,962 words) [view diff] exact match in snippet view article find links to article

computation: discrete logarithms and factoring. 35th Annual Symposium on Foundations of Computer Science. Santa Fe: IEEE. doi:10.1109/SFCS.1994.365700. ISBN 0-8186-6580-7

Straight-line program (1,619 words) [view diff] exact match in snippet view article find links to article

" Foundations of Computer Science, 1984. 25th Annual Symposium on Foundations of Computer Science. IEEE, 1984 Ákos Seress. (2003). Permutation Group Algorithms

Stacker crane problem (625 words) [view diff] exact match in snippet view article find links to article

"The Finite Capacity Dial-A-Ride Problem", 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California

Binary heap (5,128 words) [view diff] exact match in snippet view article find links to article

(PDF). FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. pp. 174–183. CiteSeerX 10.1.1.549.471. doi:10.1109/SFCS

M. C. Escher (6,378 words) [view diff] exact match in snippet view article find links to article

complexity of recognizing polyhedral scenes". 26th Annual Symposium on Foundations of Computer Science (SFCS 1985). pp. 175–185. CiteSeerX 10.1.1.100.4844.

3SUM (2,664 words) [view diff] exact match in snippet view article find links to article

Degenerates, and Love Triangles. 2014 IEEE 55th Annual Symposium on Foundations of Computer Science. p. 621. arXiv:1404.0799. Bibcode:2014arXiv1404.0799G

Skew binomial heap (2,409 words) [view diff] exact match in snippet view article find links to article

(PDF). FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. pp. 174–183. CiteSeerX 10.1.1.549.471. doi:10.1109/SFCS

Boolean satisfiability problem (5,047 words) [view diff] exact match in snippet view article find links to article

constraint satisfaction problems" (PDF). 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). pp. 410–414. doi:10.1109/SFFCS.1999

2-satisfiability (9,112 words) [view diff] exact match in snippet view article find links to article

(the odds are on his side)", Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp. 620–627, doi:10.1109/SFCS.1992.267789, ISBN 978-0-8186-2900-6

K-means clustering (7,754 words) [view diff] exact match in snippet view article find links to article

polynomial smoothed complexity". Proceedings of the 50th Symposium on Foundations of Computer Science (FOCS). arXiv:0904.1113. Aloise, D.; Deshpande, A.; Hansen

Ryan O'Donnell (computer scientist) (687 words) [view diff] exact match in snippet view article

and thresholds of halfspaces". The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. IEEE. pp. 177–186. doi:10.1109/SFCS

Quasi-polynomial growth (727 words) [view diff] exact match in snippet view article find links to article

bound for on-line chain partitioning", 51st Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA

Approximate max-flow min-cut theorem (2,264 words) [view diff] exact match in snippet view article find links to article

approximation algorithms". Proceedings of the 29th IEEE Symposium on Foundations of Computer Science: 422–431. Chung, F. K.; Coffman, E. G.; Reiman, M. I

Linkless embedding (3,484 words) [view diff] exact match in snippet view article find links to article

graph minors: linkless embeddings", Proc. 29th IEEE Symposium on Foundations of Computer Science (FOCS '88), pp. 398–409, doi:10.1109/SFCS.1988.21956

Selection algorithm (5,755 words) [view diff] exact match in snippet view article find links to article

rank, select, and predecessor search". 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18–21, 2014

Quantum network (6,389 words) [view diff] exact match in snippet view article find links to article

"Universal Blind Quantum Computation". 2009 50th Annual IEEE Symposium on Foundations of Computer Science. pp. 517–526. arXiv:0807.4154. doi:10.1109/FOCS.2009

Scale-free network (6,013 words) [view diff] exact match in snippet view article find links to article

the web graph" (PDF). Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS). Redondo Beach, CA: IEEE CS Press. pp. 57–65.

Treewidth (4,569 words) [view diff] exact match in snippet view article find links to article

for Treewidth", Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, IEEE, pp. 184–192, arXiv:2104.07463, doi:10.1109/FOCS52979

SAT solver (3,583 words) [view diff] exact match in snippet view article find links to article

constraint satisfaction problems" (PDF). 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). pp. 410–414. doi:10.1109/SFFCS.1999

Polynomial evaluation (3,448 words) [view diff] exact match in snippet view article find links to article

Bounds for Evaluating Polynomials". 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science. Vol. 53. IEEE. pp. 293–301. doi:10.1109/FOCS.2012.21

Square (8,941 words) [view diff] exact match in snippet view article find links to article

simple polygons with unit squares". 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago, IL, USA, October 27–30, 2024. IEEE

Quantum cryptography (9,126 words) [view diff] exact match in snippet view article find links to article

Quantum Cryptography with Imperfect Apparatus. IEEE Symposium on Foundations of Computer Science (FOCS). arXiv:quant-ph/9809039. Bibcode:1998quant.ph

In-place matrix transposition (3,044 words) [view diff] exact match in snippet view article find links to article

"Cache-oblivious algorithms," in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS 99), p. 285-297 (1999). doi:10.1109/SFFCS.1999

Proportional cake-cutting (3,416 words) [view diff] exact match in snippet view article find links to article

"Balanced Allocations of Cake". 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). pp. 623–634. doi:10.1109/focs.2006.17.

Homomorphic encryption (4,692 words) [view diff] exact match in snippet view article find links to article

"Non-interactive cryptocomputing for NC/Sup 1/". 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). pp. 554–566. doi:10.1109/SFFCS.1999

Local differential privacy (2,891 words) [view diff] exact match in snippet view article find links to article

"What Can We Learn Privately?". 2008 49th Annual IEEE Symposium on Foundations of Computer Science. pp. 531–540. arXiv:0803.0924. doi:10.1109/FOCS.2008

IP (complexity) (5,591 words) [view diff] exact match in snippet view article

interactive proof systems". Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press. pp. 2–10. doi:10.1109/fscs

Exponential mechanism (3,031 words) [view diff] exact match in snippet view article find links to article

Privately? Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science. arXiv:0803.0924 The Algorithmic Foundations of Differential

Hypergraph (6,836 words) [view diff] exact match in snippet view article find links to article

non-satisfiability of dense random 3CNF formulas. 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). IEEE. pp. 497–508. doi:10.1109/FOCS.2006.78

Secure multi-party computation (5,909 words) [view diff] exact match in snippet view article find links to article

exchange secrets," SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pp. 162-167, 1986. Ben-Or, Michael; Goldwasser, Shafi;

Johnson–Lindenstrauss lemma (5,136 words) [view diff] exact match in snippet view article find links to article

Johnson-Lindenstrauss Lemma", Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 633–638, arXiv:1609.02094, doi:10.1109/FOCS

Existential theory of the reals (3,821 words) [view diff] exact match in snippet view article find links to article

two-dimensional packing problems", 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, IEEE

Yao's principle (3,834 words) [view diff] exact match in snippet view article find links to article

measure of complexity", Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 222–227, doi:10.1109/SFCS.1977.24 Laraki

Comparison of data structures (1,345 words) [view diff] exact match in snippet view article find links to article

(PDF). FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. pp. 174–183. CiteSeerX 10.1.1.549.471. doi:10.1109/SFCS

Karmarkar–Karp bin packing algorithms (6,385 words) [view diff] exact match in snippet view article find links to article

the one-dimensional bin-packing problem". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982): 312–320. doi:10.1109/SFCS.1982.61. S2CID 18583908

Egalitarian item allocation (2,969 words) [view diff] exact match in snippet view article find links to article

Allocating Goods to Maximize Fairness". 2009 50th Annual IEEE Symposium on Foundations of Computer Science. pp. 107–116. arXiv:0901.0205. doi:10.1109/FOCS.2009

List decoding (3,774 words) [view diff] exact match in snippet view article find links to article

over Polynomial-Size Alphabets". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). FOCS 2023, Santa Cruz, CA, USA. IEEE. pp. 164–176

Red–black tree (9,338 words) [view diff] exact match in snippet view article find links to article

for Balanced Trees". Proceedings of the 19th Annual Symposium on Foundations of Computer Science. pp. 8–21. doi:10.1109/SFCS.1978.3. "Red Black Trees"

Tutte polynomial (5,377 words) [view diff] exact match in snippet view article find links to article

vertex-exponential time", Proc. of the 47th annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 677–686, arXiv:0711.2585, doi:10.1109/FOCS

Graph removal lemma (5,077 words) [view diff] exact match in snippet view article find links to article

"Testing subgraphs in large graphs". Proceedings 42nd IEEE Symposium on Foundations of Computer Science. FOCS '01. USA: IEEE Computer Society. pp. 434–441. doi:10

Timeline of quantum mechanics (10,053 words) [view diff] exact match in snippet view article find links to article

Discrete logarithms and factoring". Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press. pp. 124–134. doi:10.1109/SFCS

Mathematics and art (12,031 words) [view diff] exact match in snippet view article find links to article

complexity of recognizing polyhedral scenes". 26th Annual Symposium on Foundations of Computer Science (SFCS 1985). pp. 175–185. CiteSeerX 10.1.1.100.4844.

Envy-free cake-cutting (5,573 words) [view diff] exact match in snippet view article find links to article

Protocol for Any Number of Agents". 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). New Brunswick, NJ, USA: IEEE. pp. 416–427. arXiv:1604

Fully polynomial-time approximation scheme (5,027 words) [view diff] exact match in snippet view article find links to article

and Related Counting Problems". 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. pp. 817–826. doi:10.1109/FOCS.2011.32. ISBN 978-0-7695-4571-4

Roth's theorem on arithmetic progressions (4,555 words) [view diff] exact match in snippet view article find links to article

"Strong Bounds for 3-Progressions". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). IEEE. pp. 933–973. arXiv:2302.05537. doi:10.1109/FOCS57990

Sensitivity theorem (2,366 words) [view diff] exact match in snippet view article find links to article

(1987). "Generic oracles and oracle classes". 28th Annual Symposium on Foundations of Computer Science (sfcs 1987). IEEE. doi:10.1109/sfcs.1987.30. Buhrman

Multi-armed bandit (7,667 words) [view diff] exact match in snippet view article find links to article

bounds for online learning". Proceedings 41st Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. pp. 270–279. doi:10.1109/sfcs.2000

PLS (complexity) (5,471 words) [view diff] exact match in snippet view article

"Structure in locally optimal solutions". 30th Annual Symposium on Foundations of Computer Science. pp. 216–221. doi:10.1109/SFCS.1989.63481. ISBN 0-8186-1982-1

Feedback arc set (6,130 words) [view diff] exact match in snippet view article find links to article

algorithms for submodular flow problems", 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, IEEE

Reed–Solomon error correction (12,395 words) [view diff] exact match in snippet view article find links to article

over Polynomial-Size Alphabets". 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). FOCS 2023, Santa Cruz, CA, USA, 2023. pp. 164–176

Glossary of quantum computing (5,490 words) [view diff] exact match in snippet view article find links to article

Yao (1993). Quantum circuit complexity. 34th Annual Symposium on Foundations of Computer Science. pp. 352–361. Abel Molina; John Watrous (2018). "Revisiting

Maximum disjoint set (4,745 words) [view diff] exact match in snippet view article find links to article

theorems and applications". Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280). p. 232. doi:10.1109/sfcs.1998.743449

Algorithmic problems on convex sets (3,992 words) [view diff] exact match in snippet view article find links to article

programming algorithm runs in polynomial time". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982). pp. 327–328. doi:10.1109/SFCS.1982.63. Retrieved

Characteristic samples (2,764 words) [view diff] exact match in snippet view article find links to article

one-counter languages in polynomial time". 28th Annual Symposium on Foundations of Computer Science (SFCS 1987). IEEE. pp. 61–67. doi:10.1109/sfcs.1987.36

List of Dutch inventions and innovations (19,000 words) [view diff] exact match in snippet view article find links to article

than logarithmic time". Proceedings of the 16th Annual Symposium on Foundations of Computer Science. 10: 75–84. Hamilton, Naomi (5 August 2008). "The A-Z

Fixed-point computation (3,881 words) [view diff] exact match in snippet view article find links to article

of Approximate Fixed Points". 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). pp. 229–238. doi:10.1109/FOCS.2016.32. ISBN 978-1-5090-3933-3

Word equation (4,051 words) [view diff] exact match in snippet view article find links to article

equations with constants is in PSPACE". 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). IEEE Comput. Soc. pp. 495–500. doi:10

Strict Fibonacci heap (6,087 words) [view diff] exact match in snippet view article find links to article

(PDF). FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. pp. 174–183. CiteSeerX 10.1.1.549.471. doi:10.1109/SFCS