Find link

Theory of Computing not in Parameterized approximation algorithm

language:

Find link is a tool written by Edward Betts.

Longer titles found: Theory of Computing Systems (view), Symposium on Theory of Computing (view), Simons Institute for the Theory of Computing (view)

searching for Theory of Computing 377 found (742 total)

alternate case: theory of Computing

Computational learning theory (865 words) [view diff] exact match in snippet view article find links to article

bibliography. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing (May 1992), pages 351–369. http://portal.acm.org/citation.cfm?id=129712

Joel Spencer (369 words) [view diff] case mismatch in snippet view article find links to article

Mathematics in 2017, "for contributions to discrete mathematics and theory of computing, particularly random graphs and networks, Ramsey theory, logic, and

Alexander Razborov (716 words) [view diff] exact match in snippet view article find links to article

annual ACM symposium on Theory of computing - STOC '89". Proceedings of the 21st Annual ACM Symposium on the Theory of Computing. Seattle, Washington, United

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

problems". Proceedings of the Twenty-Eighth annual ACM symposium on Theory of computing. Philadelphia, Pennsylvania, United States: ACM. pp. 99–108. doi:10

Mihalis Yannakakis (1,448 words) [view diff] exact match in snippet view article find links to article

about hardness of approximation. In the Annual ACM Symposium on Theory of Computing of 1988, Yannakakis and Christos Papadimitriou introduced the definitions

Jack Edmonds (1,543 words) [view diff] case mismatch in snippet view article find links to article

optimization, polyhedral combinatorics, discrete mathematics and the theory of computing. He was the recipient of the 1985 John von Neumann Theory Prize.

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

games", Proceedings of the thirty-fourth annual ACM symposium on Theory of computing, pp. 767–775, doi:10.1145/509907.510017, ISBN 1-58113-495-9, S2CID 207635974

Boolean satisfiability problem (4,824 words) [view diff] case mismatch in snippet view article find links to article

versus NP problem - one of the most important open problems in the theory of computing. Nevertheless, as of 2007, heuristic SAT-algorithms are able to solve

Amos Fiat (906 words) [view diff] exact match in snippet view article find links to article

file allocation", Proceedings of the Twenty-Fifth ACM Symposium on Theory of Computing (STOC '93), pp. 164–173, doi:10.1145/167088.167142, ISBN 978-0897915915

Mikkel Thorup (564 words) [view diff] exact match in snippet view article find links to article

SIAM Journal on Computing, ACM Transactions on Algorithms, and the Theory of Computing. He has been a Fellow of the Association for Computing Machinery

Correlation clustering (2,006 words) [view diff] case mismatch in snippet view article find links to article

information". Proceedings of the thirty-seventh annual ACM symposium on Theory of computing – STOC '05. p. 684. doi:10.1145/1060590.1060692. ISBN 1581139608

Lattice-based cryptography (2,872 words) [view diff] exact match in snippet view article find links to article

Problems". Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. pp. 99–108. CiteSeerX 10.1.1.40.2489. doi:10.1145/237814.237838

Sheila Greibach (1,353 words) [view diff] exact match in snippet view article find links to article

(Extended Abstract)," Proceedings of the fifth annual ACM symposium on Theory of Computing, April 1973 Every deterministic context-free language can be accepted

Space complexity (1,004 words) [view diff] case mismatch in snippet view article find links to article

Noam (1992), "RL ⊆ SC", Proceedings of the 24th ACM Symposium on Theory of computing (STOC '92), Victoria, British Columbia, Canada, pp. 619–623, doi:10

Miklós Ajtai (632 words) [view diff] exact match in snippet view article find links to article

lattice and for Schnorr's algorithm for the shortest vector problem". Theory of Computing. 4: 21–51. doi:10.4086/toc.2008.v004a002. Ajtai, Miklós (5 October

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

randomness. Proceedings of the Seventeenth Annual Symposium on the Theory of Computing, ACM. 1985. Goldwasser, S.; Micali, S.; Rackoff, C. (1989). "The

List of NP-complete problems (2,746 words) [view diff] case mismatch in snippet view article find links to article

Correction Problem". Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75. pp. 218–223. doi:10.1145/800116.803771. ISBN 9781450374194

Parity learning (347 words) [view diff] case mismatch in snippet view article find links to article

parity learning,” in Proceedings of the 40th annual ACM symposium on Theory of computing (Victoria, British Columbia, Canada: ACM, 2008), 629–638, http://portal

International Journal of Computer Mathematics (200 words) [view diff] case mismatch in snippet view article find links to article

Journal of Computer Mathematics: Computer Systems Theory, covering the theory of computing and computer systems was established in 2016. The journal is abstracted

Circuit complexity (2,571 words) [view diff] exact match in snippet view article find links to article

sorting network". Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25–27 April, 1983, Boston, Massachusetts, USA. Association for Computing

Michael Saks (mathematician) (823 words) [view diff] case mismatch in snippet view article

structures". Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. New York, NY, USA: Association for Computing Machinery

P (complexity) (1,940 words) [view diff] case mismatch in snippet view article

STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing. pp. 137–146. doi:10.1145/800070.802186. Immerman, Neil (1982). "Relational

Computational hardness assumption (3,302 words) [view diff] exact match in snippet view article find links to article

extended abstract". Proceedings on 41st Annual ACM Symposium on Theory of Computing (STOC). pp. 333–342. doi:10.1145/1536414.1536461. Ajtai, Miklós;

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

Vignette: Hard Problems All The Way Up | Simons Institute for the Theory of Computing". simons.berkeley.edu. 30 July 2015. Retrieved 2015-09-17. Sipser

QIP (complexity) (503 words) [view diff] case mismatch in snippet view article

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing, ACM, pp. 608–617, ISBN 978-1-58113-184-0 Jain, Rahul; Upadhyay,

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

Gupta, Anupam (eds.), STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, {ACM}, pp. 1487–1500, arXiv:2204

Greg Kuperberg (614 words) [view diff] exact match in snippet view article find links to article

Machine, retrieved March 8, 2008.; Theory of Computing, About the Authors, retrieved March 8, 2008. Theory of Computing, About the Authors; "Three Outstanding

Trivial measure (311 words) [view diff] exact match in snippet view article find links to article

Christopher P. (2015-04-01). "Trivial Measures are not so Trivial". Theory of Computing Systems. 56 (3): 487–512. arXiv:1503.06332. doi:10.1007/s00224-015-9614-8

Learning with errors (3,411 words) [view diff] case mismatch in snippet view article find links to article

cryptography,” in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Baltimore, MD, USA: ACM, 2005), 84–93, http://portal.acm.org/citation

Clique-width (2,057 words) [view diff] exact match in snippet view article find links to article

; Mosca, R. (2005), "New graph classes of bounded clique-width", Theory of Computing Systems, 38 (5): 623–645, CiteSeerX 10.1.1.3.5994, doi:10.1007/s00224-004-1154-6

Stephen Cook (1,540 words) [view diff] exact match in snippet view article find links to article

Proving Procedures, presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-Completeness. The ensuing

Bruce Reed (mathematician) (499 words) [view diff] case mismatch in snippet view article

computing tree width quickly", Proc. 24th Annual ACM Symposium on Theory of computing, pp. 221–228, doi:10.1145/129712.129734, ISBN 978-0897915113, S2CID 16259988

Hidden Matching Problem (1,351 words) [view diff] case mismatch in snippet view article find links to article

complexity". Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. STOC '04. Chicago, IL, USA: Association for Computing Machinery

Demand oracle (745 words) [view diff] case mismatch in snippet view article find links to article

oracle model". Proceedings of the fortieth annual ACM symposium on Theory of computing. STOC '08. Victoria, British Columbia, Canada: Association for Computing

MAX-3SAT (1,458 words) [view diff] case mismatch in snippet view article find links to article

theory", Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 619–626, doi:10.1145/509907.509996, ISBN 1581134959, S2CID 94045

SimHash (284 words) [view diff] exact match in snippet view article find links to article

rounding algorithms", Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 380–388, doi:10.1145/509907.509965, ISBN 978-1581134957, S2CID 4229473

Craig Gentry (computer scientist) (282 words) [view diff] exact match in snippet view article

Homomorphic Encryption Using Ideal Lattices. In the 41st ACM Symposium on Theory of Computing (STOC), 2009. Greenberg, Andy (3 November 2014), "Hacker Lexicon:

Richard Cleve (415 words) [view diff] case mismatch in snippet view article find links to article

quantum walk". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. San Diego, CA, USA: ACM. pp. 59–68. arXiv:quant-ph/0209131. doi:10

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

polylogarithmic time". Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91. STOC '91. New York, NY, US: ACM. pp. 21–32. CiteSeerX 10

Edge (geometry) (701 words) [view diff] exact match in snippet view article

per face", Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing (STOC '86), pp. 404–413, doi:10.1145/12130.12172, ISBN 0-89791-193-8

Lance Fortnow (1,054 words) [view diff] exact match in snippet view article find links to article

polylogarithmic time", in Proceedings of the 23rd ACM Symposium on the Theory of Computing, pages 21-31. ACM, New York, 1991 L. Fortnow and D. Whang, "Optimality

Alfred Aho (1,739 words) [view diff] exact match in snippet view article find links to article

Prentice Hall, 1972. ISBN 0-13-914556-7 A. V. Aho (ed.) Currents in the Theory of Computing. Prentice Hall, 1973. ISBN 0-13-195651-5 A. V. Aho and J. D. Ullman

Oded Goldreich (1,378 words) [view diff] exact match in snippet view article find links to article

any One-Way Function. In the proceedings of the 21st ACM Symp. on Theory of Computing, pages 25-32, 1989. Oded Goldreich, Silvio Micali, and Avi Wigderson

Grover's algorithm (4,708 words) [view diff] case mismatch in snippet view article find links to article

search". Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96. Philadelphia, Pennsylvania, USA: Association for Computing

Arthur–Merlin protocol (1,831 words) [view diff] case mismatch in snippet view article find links to article

STOC '85: Proceedings of the seventeenth annual ACM symposium on Theory of computing, ACM, pp. 421–429, ISBN 978-0-89791-151-1. Goldwasser, Shafi; Sipser

Quantum Byzantine agreement (2,088 words) [view diff] case mismatch in snippet view article find links to article

STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. Baltimore, MD, USA. pp. 481–485. doi:10.1145/1060590.1060662. Lamport

Perceptual computing (1,330 words) [view diff] case mismatch in snippet view article find links to article

Perceptual computing is an application of Zadeh's theory of computing with words on the field of assisting people to make subjective judgments. The perceptual

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

algorithms". In 2023, this research received the Annual ACM Symposium on Theory of Computing (STOC) 30-year Test of Time Award. In 1994, Klein and Robert E. Tarjan

Voltage graph (1,060 words) [view diff] exact match in snippet view article find links to article

detecting cycles in dynamic graphs", Proc. 21st Annual ACM Symposium on Theory of Computing (STOC '89), pp. 523–534, doi:10.1145/73007.73057, ISBN 0-89791-307-8

Least fixed point (1,474 words) [view diff] case mismatch in snippet view article find links to article

STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computing. pp. 147–152. doi:10.1145/800070.802187. Revised version in Information

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

streams". Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05. p. 202. doi:10.1145/1060590.1060621. ISBN 9781581139600

Quantum sort (165 words) [view diff] case mismatch in snippet view article find links to article

Sorting". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. p. 69. arXiv:quant-ph/0211174. doi:10.1145/780542.780553. ISBN 1581136749

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

theory". Proceedings of the twenty-eighth annual ACM symposium on Theory of computing – STOC '96. p. 376. doi:10.1145/237814.237984. ISBN 0897917855. S2CID 771941

Gary Miller (computer scientist) (304 words) [view diff] exact match in snippet view article

Retrieved 31 October 2013. "Gary Miller | Simons Institute for the Theory of Computing". simons.berkeley.edu. 2 July 2013. "Miller's thesis" (PDF). Gary

RL (complexity) (419 words) [view diff] case mismatch in snippet view article

Noam (1992), "RL ⊆ SC", Proceedings of the 24th ACM Symposium on Theory of computing (STOC '92), Victoria, British Columbia, Canada, pp. 619–623, doi:10

Set cover problem (3,011 words) [view diff] case mismatch in snippet view article find links to article

STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, ACM, pp. 475–484, ISBN 978-0-89791-888-6. Dinur, Irit; Steurer,

Noam Nisan (556 words) [view diff] exact match in snippet view article find links to article

"Algorithmic mechanism design", Proceedings of the 31st ACM Symposium on Theory of Computing (STOC '99), pp. 129–140, doi:10.1145/301250.301287, S2CID 8316937

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

linear lists", Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, pp. 49–60. Tsakalidis, A. K. (1985), "AVL-trees for localized search"

Michael Kearns (computer scientist) (1,133 words) [view diff] exact match in snippet view article

Kearns and Valiant (Unpublished manuscript 1988, ACM Symposium on Theory of Computing 1989) is the origin of boosting machine learning algorithms, which

Quantum computing (12,492 words) [view diff] case mismatch in snippet view article find links to article

theory". Proceedings of the twenty-fifth annual ACM symposium on Theory of computing – STOC '93. San Diego, California, United States: ACM Press. pp. 11–20

Thomas Jerome Schaefer (177 words) [view diff] exact match in snippet view article find links to article

Two-Person Perfect-Information Games". Eighth Annual ACM Symposium on Theory of Computing. ACM. pp. 41–49. MR 0451853. Schaefer, Thomas J. (1978). "The complexity

Matching (graph theory) (3,032 words) [view diff] exact match in snippet view article

matching" (PDF). Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC 1990). pp. 352–358. doi:10.1145/100216.100262. ISBN 0-89791-361-2

Silvio Micali (637 words) [view diff] case mismatch in snippet view article find links to article

applications". Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88. p. 103. doi:10.1145/62212.62222. ISBN 0897912640. S2CID 7282320

Deterministic context-free language (633 words) [view diff] exact match in snippet view article find links to article

squared space". Proceedings of the eleventh annual ACM Symposium on Theory of Computing - STOC '79. Atlanta. pp. 338–345. doi:10.1145/800135.804426. Hoogeboom

Jeffrey Vitter (1,412 words) [view diff] exact match in snippet view article find links to article

Epsilon-Approximations with Small Packing Constraint Violation, ACM Symposium on Theory of Computing (STOC), May 1992, 771-782. J. S. Vitter, Random Sampling with a Reservoir

Gábor Tardos (631 words) [view diff] case mismatch in snippet view article find links to article

codes", Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, vol. 55, pp. 116–125, CiteSeerX 10.1.1.8.8911, doi:10.1145/780542

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

of Sciences Leopoldina. Manfred Warmuth, Simons Institute in the Theory of Computing, retrieved 2023-05-17 "Manfred K. Warmuth", IEEE Xplore, IEEE, retrieved

Elias Koutsoupias (376 words) [view diff] exact match in snippet view article find links to article

retrieved 2019-07-07 "Elias Koutsoupias". Simons Institute for the Theory of Computing. Koutsoupias & Papadimitriou (1999). "Gödel Prize, ACM". European

Simplex algorithm (6,261 words) [view diff] exact match in snippet view article find links to article

Algorithm", Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, pp. 209–218, CiteSeerX 10.1.1.697.2526, doi:10.1145/2746539.2746557

Rüdiger Urbanke (369 words) [view diff] exact match in snippet view article find links to article

905935. S2CID 7381972. "Rüdiger Urbanke – Simons Institute for the Theory of Computing". simons.berkeley.edu. Retrieved 2017-02-05. "Distinguished Lecturers

Succinct game (1,887 words) [view diff] case mismatch in snippet view article find links to article

Problems". Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. Seattle, WA, USA: ACM. pp. 61–70. doi:10.1145/1132516.1132526. ISBN 1-59593-134-1

Michael Ben-Or (230 words) [view diff] exact match in snippet view article find links to article

Distributed Computation" in Proceedings of the 20th ACM Symposium on Theory of Computing (STOC), Chicago, Illinois, USA, May 1988, pages 1-10. Tal Rabin and

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

graphs. In Proceedings of the Twenty-Sixth Annual ACM Symposium on theory of Computing (Montreal, Quebec, Canada, May 23–25, 1994). STOC '94. ACM, New York

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

the twenty-fifth annual ACM symposium on Theory of Computing. STOC '93: ACM Symposium on the Theory of Computing. Association for Computing Machinery. pp

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

Bases. STOC '77: Proceedings of the ninth annual ACM symposium on Theory of computing. pp. 77–90. doi:10.1145/800105.803397. Chandra, Ashok K.; Harel,

Disjoint-set data structure (4,910 words) [view diff] case mismatch in snippet view article find links to article

structures". Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 345–354. doi:10.1145/73007.73040. ISBN 0897913078

Work stealing (2,078 words) [view diff] exact match in snippet view article find links to article

Warut (2016). "Upper Bounds on Number of Steals in Rooted Trees". Theory of Computing Systems. 58 (2): 223–240. arXiv:1706.08219. doi:10.1007/s00224-015-9613-9

Algorithmic game theory (1,514 words) [view diff] exact match in snippet view article find links to article

"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

Prior-independent mechanism (1,142 words) [view diff] exact match in snippet view article find links to article

revenue maximization". Proceedings of the 46th Annual ACM Symposium on Theory of Computing - STOC '14. p. 243. arXiv:1502.00963. doi:10.1145/2591796.2591867

Planarity testing (1,840 words) [view diff] exact match in snippet view article find links to article

testing", Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing (STOC), pp. 706–715, doi:10.1145/195058.195439, S2CID 16799743 Di

Prabhakar Raghavan (1,169 words) [view diff] case mismatch in snippet view article find links to article

Watson Research Center. In 1994, he was promoted to manager of theory of computing. A year later, he relocated to the Almaden center in Silicon Valley

Koret Foundation (1,785 words) [view diff] exact match in snippet view article find links to article

Computational Biology and Bioinformatics | Simons Institute for the Theory of Computing". simons.berkeley.edu. 2 October 2018. Retrieved 2021-04-07. "Koret-Berkeley-Tel

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

computation". Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. pp. 494–503. CiteSeerX 10.1.1.121.4746. doi:10.1145/509907.509980

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

sampling". Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. S. Guha, P. Indyk, S. Muthukrishnan, M. Strauss. pp. 152–161. doi:10

VMAC (742 words) [view diff] case mismatch in snippet view article find links to article

(Extended Abstract)". Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77. ACM. pp. 106–112. doi:10.1145/800105.803400. S2CID 1302091

SC (complexity) (325 words) [view diff] case mismatch in snippet view article

Noam (1992), "RL ⊆ SC", Proceedings of the 24th ACM Symposium on Theory of computing (STOC '92), Victoria, British Columbia, Canada, pp. 619–623, doi:10

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

(1994), "Optimal Parallel Suffix Tree Construction", ACM Symposium on Theory of Computing (PDF). Iliopoulos, Costas; Rytter, Wojciech (2004), "On Parallel

Low-rank approximation (3,884 words) [view diff] exact match in snippet view article find links to article

STOC '16 Proceedings of the forty-eighth annual ACM symposium on Theory of Computing. Clarkson, Kenneth L.; Woodruff, David P. (2013). Low Rank Approximation

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

STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. Palo Alto, CA: ACM. pp. 151–160. doi:10.1145/2488608.2488628.

Quantum refereed game (3,254 words) [view diff] case mismatch in snippet view article find links to article

games". Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. pp. 565–574. arXiv:quant-ph/0611234. Bibcode:2006quant.ph.11234G

Charles Rackoff (301 words) [view diff] exact match in snippet view article find links to article

against traffic analysis", in Proceedings of the 25th ACM Symposium on Theory of Computing, May 1993, pp. 672–681. Charles Rackoff at the Mathematics Genealogy

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

Christian (2006), "The effect of faults on network expansion", Theory of Computing Systems, 39 (6): 903–928, arXiv:cs/0404029, doi:10.1007/s00224-006-1349-0

Kurt Mehlhorn (846 words) [view diff] exact match in snippet view article find links to article

determinism in VLSI and distributed computing" (PDF), Proc. 14th ACM Symp. Theory of Computing (STOC), pp. 330–337, doi:10.1145/800070.802208, ISBN 978-0897910705

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

Strict Fibonacci heaps (PDF). Proceedings of the 44th symposium on Theory of Computing - STOC '12. p. 1177. doi:10.1145/2213977.2214082. ISBN 978-1-4503-1245-5

Travelling salesman problem (11,604 words) [view diff] exact match in snippet view article find links to article

Vassilevska (eds.), STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pp. 32–45, arXiv:2007.01409

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

"Unconditional Pseudorandom Generators for Low Degree Polynomials", Theory of Computing, 5 (3): 69–82, doi:10.4086/toc.2009.v005a003 Naor, Joseph; Naor,

Standard model (cryptography) (506 words) [view diff] case mismatch in snippet view article

(1998). "The Random Oracle Methodology Revisited". Symposium on Theory of computing (STOC). ACM. pp. 209–218. Retrieved 2007-11-01. Victor Shoup (1997)

Welfare maximization (2,835 words) [view diff] case mismatch in snippet view article find links to article

oracle model". Proceedings of the fortieth annual ACM symposium on Theory of computing. STOC '08. New York, NY, USA: Association for Computing Machinery

Karp's 21 NP-complete problems (491 words) [view diff] exact match in snippet view article find links to article

of Theorem Proving Procedures". Proc. 3rd Annual ACM Symposium on Theory of Computing (STOC). pp. 151–158. doi:10.1145/800157.805047. ISBN 9781450374644

Elon Lindenstrauss (741 words) [view diff] exact match in snippet view article find links to article

Study". July 2024. "Elon Lindenstrauss". Simons Institute for the Theory of Computing. 17 March 2014. Retrieved 24 May 2017. "Editorial board". Duke Mathematical

Seifert surface (1,358 words) [view diff] case mismatch in snippet view article find links to article

NP-complete". Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. STOC '02. New York, NY, USA: Association for Computing Machinery

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

Raymond (eds.), Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1973, Austin, Texas, USA, Association for Computing

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

product. In Proceedings of the thirty-fourth annual ACM symposium on Theory of computing. ACM Press, 2002. doi:10.1145/509907.509932. Robinson, Sara, Toward

Short integer solution problem (3,166 words) [view diff] case mismatch in snippet view article find links to article

problems.] Proceedings of the twenty-eighth annual ACM symposium on Theory of computing. ACM, 1996. Micciancio, Daniele. [Generalized compact knapsacks,

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

quantum walk". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. Vol. 35. pp. 59–68. arXiv:quant-ph/0209131. doi:10.1145/780542.780552

Algorithmic mechanism design (296 words) [view diff] exact match in snippet view article find links to article

abstract)", Proceedings of the thirty-first annual ACM symposium on Theory of Computing, pp. 129–140, doi:10.1145/301250.301287, ISBN 978-1581130676. Nisan

Zero-knowledge proof (7,955 words) [view diff] case mismatch in snippet view article find links to article

applications". Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 (PDF). pp. 103–112. doi:10.1145/62212.62222. ISBN 978-0897912648

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

dynamic problems." Proceedings of the forty-second ACM symposium on Theory of computing. 2010. Henzinger, Monika, et al. "Unifying and strengthening hardness

Amplitude amplification (1,667 words) [view diff] exact match in snippet view article find links to article

Simon's problem". Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems. IEEE Computer Society Press. pp. 12–23. arXiv:quant-ph/9704027

Transdichotomous model (503 words) [view diff] exact match in snippet view article find links to article

Machines", Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing (STOC '81), pp. 168–176, doi:10.1145/800076.802470, S2CID 12878381

Balanced Boolean function (444 words) [view diff] exact match in snippet view article find links to article

Ronald (eds.), Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22–24, 2005, Association for Computing Machinery

Moni Naor (676 words) [view diff] exact match in snippet view article find links to article

and Applications". Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC 1990 (abstract): 213–223. Amos Fiat; Moni Naor (1994). "Broadcast

Noga Alon (1,336 words) [view diff] exact match in snippet view article find links to article

1006/jcss.1997.1545. MR 1688610. Previously in the ACM Symposium on Theory of Computing (STOC), 1996. Alon, Noga (1999). "Combinatorial Nullstellensatz"

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

Existence of Potential Functions in Weighted Congestion Games". Theory of Computing Systems. 49 (1): 46–70. doi:10.1007/s00224-011-9315-x. ISSN 1433-0490

Error correction code (4,707 words) [view diff] case mismatch in snippet view article find links to article

argument". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. ACM. pp. 106–115. arXiv:quant-ph/0208062. doi:10.1145/780542.780560

Amin Shokrollahi (421 words) [view diff] case mismatch in snippet view article find links to article

codes". Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97. ACM. pp. 150–159. doi:10.1145/258533.258573. ISBN 978-0897918886

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

Square-Root Space". Proceedings of the 57th Annual ACM Symposium on Theory of Computing. ACM. pp. 13–23. doi:10.1145/3717823.3718225. ISBN 979-8-4007-1510-5

Ludwig Staiger (445 words) [view diff] exact match in snippet view article find links to article

Liouville numbers, Borel normality and algorithmic randomness, Theory of Computing Systems, First online 27 April 2017, doi:10.1007/s00224-017-9767-8

Satish B. Rao (546 words) [view diff] exact match in snippet view article find links to article

metrics by tree metrics," in Proceedings of 35th Annual ACM Symp. on Theory of Computing, New York, NY: ACM Press, 2003, pp. 448–455. K. Hildrum, J. D. Kubiatowicz

Hilbert curve (1,285 words) [view diff] exact match in snippet view article find links to article

R. (2000). "On multidimensional curves with Hilbert property". Theory of Computing Systems. 33 (4): 295–312. CiteSeerX 10.1.1.7.2039. doi:10.1007/s002240010003

Maze generation algorithm (2,447 words) [view diff] exact match in snippet view article find links to article

Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. Symposium on Theory of Computing. Philadelphia: ACM. pp. 296–303. CiteSeerX 10.1

Planted clique (1,688 words) [view diff] exact match in snippet view article find links to article

Are Equivalent", Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pp. 358–366, doi:10.1145/3618260.3649751, ISBN 979-8-4007-0383-6

Rajeev Motwani (919 words) [view diff] exact match in snippet view article find links to article

Raghavan, Prabhakar (2012). "Rajeev Motwani (1962-2009)" (PDF). Theory of Computing. 8: 55–57. doi:10.4086/toc.2012.v008a003. Rajeev Motwani, computer

Gil Kalai (729 words) [view diff] exact match in snippet view article find links to article

subexponential randomized simplex algorithm", Proc. 24th ACM Symp. Theory of Computing (STOC 1992), pp. 475–482. Friedgut, Ehud; Kalai, Gil (1996), "Every

CUR matrix approximation (981 words) [view diff] exact match in snippet view article find links to article

STOC '14 Proceedings of the forty-sixth annual ACM symposium on Theory of Computing. Song, Zhao; Woodruff, David P.; Zhong, Peilin (2017). Low Rank Approximation

Grassfire transform (473 words) [view diff] exact match in snippet view article find links to article

Huttenlocher, Daniel P (2012). "Distance Transforms of Sampled Functions". Theory of Computing. 8: 415–28. CiteSeerX 10.1.1.88.1647. doi:10.4086/toc.2012.v008a019

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

Strict Fibonacci heaps (PDF). Proceedings of the 44th symposium on Theory of Computing - STOC '12. pp. 1177–1184. CiteSeerX 10.1.1.233.1740. doi:10.1145/2213977

Conjunctive query (1,922 words) [view diff] case mismatch in snippet view article find links to article

Abstract)", Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82, pp. 137–146, CiteSeerX 10.1.1.331.6045, doi:10.1145/800070

Dense subgraph (1,897 words) [view diff] exact match in snippet view article find links to article

STOC'10—Proceedings of the 2010 ACM International Symposium on Theory of Computing, ACM, New York, pp. 201–210, doi:10.1145/1806689.1806719, ISBN 9781450300506

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

mental game". Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87. New York, New York, US: Association for Computing Machinery

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

are faulty". Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86. ACM. pp. 364–369. doi:10.1145/12130.12168. ISBN 0897911938

Leftist grammar (154 words) [view diff] case mismatch in snippet view article find links to article

annual ACM symposium on Theory of computing - STOC '00. Proceedings of the thirty-second annual ACM symposium on Theory of computing (STOC '00). pp. 306–315

Goldwasser–Micali cryptosystem (976 words) [view diff] case mismatch in snippet view article find links to article

information". Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. pp. 365–377. doi:10.1145/800070.802212. ISBN 0897910702

Aumann's agreement theorem (1,199 words) [view diff] case mismatch in snippet view article find links to article

(PDF). Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. pp. 634–643. doi:10.1145/1060590.1060686. ISBN 978-1-58113-960-0

Karloff–Zwick algorithm (368 words) [view diff] case mismatch in snippet view article find links to article

theory", Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 619–626, doi:10.1145/509907.509996, ISBN 1581134959, S2CID 94045

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

Dimensions", Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC '97, New York, NY, USA: ACM, pp. 599–608, doi:10.1145/258533

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

proving procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158. doi:10.1145/800157.805047. ISBN 9781450374644. S2CID 7573663

Smoothed analysis (1,727 words) [view diff] case mismatch in snippet view article find links to article

algorithms", Proceedings of the thirty-third annual ACM symposium on Theory of computing, ACM, pp. 296–305, arXiv:cs/0111050, Bibcode:2001cs.......11050S

János Pach (1,299 words) [view diff] exact match in snippet view article find links to article

supporting Fáry embeddings of planar graphs", Proc. 20th ACM Symp. Theory of Computing, pp. 426–433, doi:10.1145/62212.62254, S2CID 15230919. Pach, János;

Leslie Valiant (1,220 words) [view diff] case mismatch in snippet view article find links to article

Valiant". Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09. pp. 1–2. doi:10.1145/1536414.1536415. ISBN 9781605585062

Invertible matrix (7,170 words) [view diff] exact match in snippet view article find links to article

Linear Systems, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence: ACM Pan, Victor; Reif, John (1985), Harvard University

Turing's Theory of Computing Machines". Presented at the meeting of the Association, 23–25 June 1954. Hao Wang (1957), "A Variant to Turing's Theory of Computing

Functional encryption (534 words) [view diff] exact match in snippet view article find links to article

functional encryption - Stoc 13 Proceedings of the 2013 ACM Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 555–564. ISBN 978-1-4503-2029-0. Amit

AWPP (269 words) [view diff] exact match in snippet view article find links to article

Stephen A. (2003). "PP-lowness and a simple definition of AWPP". Theory of Computing Systems. 36 (2): 199–212. doi:10.1007/s00224-002-1089-8. MR 1950277

Akamai Technologies (3,078 words) [view diff] exact match in snippet view article find links to article

for Relieving Hot Spots on the World Wide Web". ACM Symposium on Theory of Computing, 1997, pp. 654–663. J. Dilley, B. Maggs, J. Parikh, H. Prokop, R

Parallel RAM (1,275 words) [view diff] case mismatch in snippet view article find links to article

access machines". Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78. New York, NY, USA: Association for Computing Machinery

Fixed-point logic (2,031 words) [view diff] case mismatch in snippet view article find links to article

Abstract)". Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. New York, NY, USA: ACM. pp. 137–146. CiteSeerX 10.1.1

Kenneth L. Clarkson (543 words) [view diff] exact match in snippet view article find links to article

for shortest path motion planning", Proc. 19th ACM Symposium on Theory of Computing, pp. 56–65, doi:10.1145/28395.28402, S2CID 12206444. Clarkson, Kenneth

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

(unless SETH is false). Forty-Seventh Annual ACM on Symposium on Theory of Computing (STOC). arXiv:1412.0348. Bibcode:2014arXiv1412.0348B. Wong, C. K

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

chosen ciphertext attacks". Proceedings 21st Annual ACM Symposium on Theory of Computing: 427–437. 1990. "Jonathan Katz and Moti Yung, Unforgeable Encryption

Game Description Language (1,609 words) [view diff] case mismatch in snippet view article find links to article

trees". Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94. pp. 750–759. doi:10.1145/195058.195451. ISBN 0-89791-663-8

Time hierarchy theorem (2,511 words) [view diff] case mismatch in snippet view article find links to article

time complexity". Proceedings of the fourth annual ACM symposium on Theory of computing. STOC '72. Denver, Colorado, United States: ACM. pp. 187–192. doi:10

Occam learning (1,710 words) [view diff] case mismatch in snippet view article find links to article

algorithms. In Proceedings of the twenty-second annual ACM symposium on Theory of computing (pp. 54-63). ACM. Haussler, D. (1988). Quantifying inductive bias:

Catalytic computing (679 words) [view diff] case mismatch in snippet view article find links to article

Catalytic space". Proceedings of the forty-sixth annual ACM symposium on Theory of computing. STOC '14. New York, NY, USA: Association for Computing Machinery

RSA cryptosystem (7,807 words) [view diff] case mismatch in snippet view article find links to article

information". Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. New York, NY, USA: Association for Computing Machinery

Goldner–Harary graph (750 words) [view diff] exact match in snippet view article find links to article

necessary and sufficient for planar graphs", Proc. 18th ACM Symp. Theory of Computing (STOC), pp. 104–108, doi:10.1145/12130.12141, S2CID 5359519. Knill

Epsilon-equilibrium (1,402 words) [view diff] exact match in snippet view article find links to article

(2006). "Reducibility Among Equilibrium Problems". 38th Symposium on Theory of Computing. pp. 61–70. doi:10.1145/1132516.1132526. C. Daskalakis, P.W. Goldberg

Station-to-Station protocol (1,208 words) [view diff] exact match in snippet view article find links to article

exchange protocols", Proceedings of the 30th Annual Symposium on the Theory of Computing RFC 2412, "The OAKLEY Key Determination Protocol". ISO/IEC 117703

Jon Kleinberg (992 words) [view diff] case mismatch in snippet view article find links to article

phenomenon". Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00. p. 163. doi:10.1145/335305.335325. ISBN 978-1581131840

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

Theoretical Aspects of Reasoning about Knowledge 1994, ACM Symposium on Theory of Computing 2005, and the International Conference on Database Theory 2009. Fagin

Entanglement (graph measure) (369 words) [view diff] exact match in snippet view article

and G. Lenzi, The variable hierarchy of the mu-calculus is strict, Theory of Computing Systems, vol. 40, pp. 437–466 (2007) You can play the entanglement

Computer Pioneer Award (421 words) [view diff] case mismatch in snippet view article find links to article

Glushkov Digital automation of computer architecture Jozef Gruska Theory of computing and organizational activities Jiri Horejs Informatics and computer

Algorithm engineering (921 words) [view diff] exact match in snippet view article find links to article

the purpose of assessing the current goals and directions of the Theory of Computing (TOC) community" identified the slow speed of adoption of theoretical

List ranking (471 words) [view diff] case mismatch in snippet view article find links to article

computation", Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, pp. 230–239, doi:10.1145/800057.808686, ISBN 0-89791-133-4

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

cryptography", Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC '05) (in German), Baltimore, MD, USA: ACM Press, p. 84, arXiv:2401

Wang B-machine (515 words) [view diff] exact match in snippet view article find links to article

automaton Counter-machine model Hao Wang (1957), A Variant to Turing's Theory of Computing Machines, JACM (Journal of the Association for Computing Machinery)

Isolation lemma (1,912 words) [view diff] case mismatch in snippet view article find links to article

complexity. Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. p. 204. doi:10.1145/73007.73027. ISBN 0897913078. Calabro

Ski rental problem (1,822 words) [view diff] exact match in snippet view article find links to article

guessing game and randomized online algorithms. Annual ACM Symposium on Theory of Computing, 2000. http://portal.acm.org/citation.cfm?id=335385 A. R. Karlin

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

algorithmic speedup by quantum walk, Proc. 35th ACM Symposium on Theory of Computing, pp. 59–68, 2003, arXiv:quant-ph/0209131 . A. M. Childs, L. J. Schulman

S. Rao Kosaraju (267 words) [view diff] exact match in snippet view article find links to article

n-body potential fields (preliminary version)", STOC '92: Proc. ACM Symp. Theory of Computing, ACM. S. Rao Kosaraju at the Mathematics Genealogy Project

Aleksandar Nikolov (computer scientist) (713 words) [view diff] exact match in snippet view article

include contributions to conferences such as STOC (Symposium on Theory of Computing), FOCS (Foundations of Computer Science), and SODA (Symposium on

International Colloquium on Automata, Languages and Programming (629 words) [view diff] exact match in snippet view article find links to article

annually, alternates with the conference STOC (ACM Symposium on Theory of Computing). The list of computer science conferences contains other academic

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

problem", Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, pp. 457–466, doi:10.1145/1132516.1132583, ISBN 978-1595931344, S2CID 17360260

Abbas El Gamal (847 words) [view diff] exact match in snippet view article find links to article

Retrieved 2018-07-24. "Abbas El Gamal | Simons Institute for the Theory of Computing". simons.berkeley.edu. Retrieved 2018-07-24. "Stocks". Bloomberg

Bruno de Finetti (1,324 words) [view diff] exact match in snippet view article find links to article

applications". Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. STOC '13. New York, NY, USA: ACM. pp. 861–870. arXiv:1210.6367.

Bend minimization (733 words) [view diff] exact match in snippet view article find links to article

complexity, and crossing resolution of non-planar graph drawings", Theory of Computing Systems, 49 (3): 565–575, doi:10.1007/s00224-010-9275-6, MR 2822838

Paul Vitányi (571 words) [view diff] exact match in snippet view article find links to article

Distributed Computing (1987–2003), Information Processing Letters; the Theory of Computing Systems; the Parallel Processing Letters; the International journal

Jeff Edmonds (382 words) [view diff] exact match in snippet view article find links to article

of Processes with Arbitrary Speedup Curves on a Multiprocessor", Theory of Computing Systems, 49 (4): 817–833, doi:10.1007/s00224-011-9349-0. Edmonds

Push–relabel maximum flow algorithm (4,259 words) [view diff] case mismatch in snippet view article find links to article

STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computing, and then officially in October 1988 as an article in the Journal

Faith Ellen (281 words) [view diff] exact match in snippet view article find links to article

2005, retrieved 2015-01-08. "Faith Ellen | Simons Institute for the Theory of Computing". simons.berkeley.edu. Retrieved 2020-05-24. Attiya, Hagit; Ellen

Quantum supremacy (5,940 words) [view diff] case mismatch in snippet view article find links to article

optics". Proceedings of the forty-third annual ACM symposium on Theory of computing. STOC '11. New York, New York, United States: Association for Computing

Arden's rule (353 words) [view diff] exact match in snippet view article find links to article

2011. Arden, D. N. (1960). Delayed logic and finite state machines, Theory of Computing Machine Design, pp. 1-35, University of Michigan Press, Ann Arbor

Gap theorem (549 words) [view diff] exact match in snippet view article find links to article

Michael A. (eds.). Proceedings of the 1st Annual ACM Symposium on Theory of Computing, May 5–7, 1969, Marina del Rey, CA, USA. Association for Computing

Quadratic programming (1,931 words) [view diff] case mismatch in snippet view article find links to article

multicommodity flows". Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86. New York, NY, USA: Association for Computing Machinery

Fáry's theorem (1,261 words) [view diff] exact match in snippet view article find links to article

embeddings of planar graphs", Twentieth Annual ACM Symposium on Theory of Computing, pp. 426–433, doi:10.1145/62212.62254, ISBN 0-89791-264-0, S2CID 15230919

Optimal facility location (3,810 words) [view diff] case mismatch in snippet view article find links to article

clustering", Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88, pp. 434–444, doi:10.1145/62212.62255, ISBN 0897912640

Lov Grover (453 words) [view diff] exact match in snippet view article find links to article

for database search, Proceedings, 28th Annual ACM Symposium on the Theory of Computing, (May 1996) p. 212 Grover L.K.: From Schrödinger's equation to quantum

Jan Verelst (computer scientist) (445 words) [view diff] case mismatch in snippet view article

the same?." In Proceedings of the 2005 Australasian symposium on Theory of computing-Volume 41 (pp. 3–11). Australian Computer Society, Inc.. Ven, Kris

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

tables". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 1284–1297. arXiv:2111.00602. doi:10

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

Ivan (2019). "Cascade heap: towards time-optimal extractions". Theory of Computing Systems. 63 (4): 637–646. doi:10.1007/s00224-018-9866-1. MR 3942251

Frieder Nake (929 words) [view diff] case mismatch in snippet view article find links to article

computer art, aesthetics, semiotics, computers and society, and theory of computing. He has been a visiting professor to Universitetet Oslo, Aarhus Universitet

Oblivious RAM (3,993 words) [view diff] exact match in snippet view article find links to article

Alfred V. (ed.), Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC '87), Association for Computing Machinery, pp. 182–194, doi:10

Quadratic residuosity problem (1,204 words) [view diff] case mismatch in snippet view article find links to article

information". Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. pp. 365–377. doi:10.1145/800070.802212. ISBN 0897910702

Serge Abiteboul (830 words) [view diff] case mismatch in snippet view article find links to article

complexity". Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91. p. 209. doi:10.1145/103418.103444. ISBN 978-0897913973

Loop-erased random walk (2,458 words) [view diff] exact match in snippet view article find links to article

'96: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996), Association for Computing Machinery, New

Flow network (3,081 words) [view diff] exact match in snippet view article find links to article

better". Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. STOC '13. Palo Alto, California, USA: Association for Computing

Convex polytope (3,262 words) [view diff] exact match in snippet view article find links to article

Computation Trees", Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC '83), pp. 80–86, doi:10.1145/800061.808735. Lawrence, Jim (1991)

K-server problem (1,379 words) [view diff] case mismatch in snippet view article find links to article

problems". Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88. New York, NY, USA: Association for Computing Machinery

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

John A. (eds.), Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada, ACM, pp. 221–228

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

Huttenlocher, Daniel P. (2012). "Distance transforms of sampled functions". Theory of Computing. 8: 415–428. doi:10.4086/toc.2012.v008a019. MR 2967180. Chris Green

Insertion sort (2,921 words) [view diff] exact match in snippet view article find links to article

Martín; Mosteiro, Miguel A. (2006). "Insertion sort is O(n log n)". Theory of Computing Systems. 39 (3): 391–397. arXiv:cs/0407003. doi:10.1007/s00224-005-1237-z

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

Strict Fibonacci heaps (PDF). Proceedings of the 44th symposium on Theory of Computing - STOC '12. pp. 1177–1184. CiteSeerX 10.1.1.233.1740. doi:10.1145/2213977

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

sorting network", Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp. 1–9, doi:10.1145/800061.808726, ISBN 978-0-89791-099-6, S2CID 15311122

Lattice (group) (2,315 words) [view diff] case mismatch in snippet view article

cryptography". Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. STOC '05. New York, NY, USA: ACM. pp. 84–93. CiteSeerX 10.1.1.110

Pollard's kangaroo algorithm (1,295 words) [view diff] case mismatch in snippet view article find links to article

Kangaroo? (PDF). Proceedings of the forty-first annual ACM symposium on Theory of computing (STOC 2009). pp. 553–560. arXiv:0812.0789. doi:10.1145/1536414.1536490

Pell's equation (6,703 words) [view diff] exact match in snippet view article find links to article

thirty-seventh annual ACM symposium on Theory of computing – STOC '05, New York: ACM, Symposium on Theory of Computing, pp. 475–480, CiteSeerX 10.1.1.420

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

Vadhan, Salil P. (eds.), Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6–8 June 2011, ACM, pp. 441–450, doi:10

Boosting (machine learning) (2,241 words) [view diff] case mismatch in snippet view article

automata". Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. Vol. 21. ACM. pp. 433–444. doi:10.1145/73007.73049. ISBN 978-0897913072

Multiplication algorithm (6,886 words) [view diff] case mismatch in snippet view article find links to article

Multiplication" (PDF). Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, June 11–13, 2007, San Diego, California, USA. pp. 57–66. doi:10

Quantum entanglement (13,737 words) [view diff] case mismatch in snippet view article find links to article

entanglement". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. p. 10. arXiv:quant-ph/0303055. doi:10.1145/780542.780545. ISBN 978-1-58113-674-6

Tarjan's off-line lowest common ancestors algorithm (816 words) [view diff] exact match in snippet view article find links to article

of disjoint set union", Proceedings of the 15th ACM Symposium on Theory of Computing (STOC), pp. 246–251, doi:10.1145/800061.808753, ISBN 0-89791-099-0

Bloom filter (10,788 words) [view diff] case mismatch in snippet view article find links to article

membership testers". Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78. New York, New York, USA: ACM Press. pp. 59–65. doi:10

Market equilibrium computation (4,358 words) [view diff] case mismatch in snippet view article find links to article

clearing prices". Proceedings of the forty-second ACM symposium on Theory of computing. STOC '10. Cambridge, Massachusetts, USA: Association for Computing

Euler tour technique (977 words) [view diff] case mismatch in snippet view article find links to article

operation". Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95. p. 519. doi:10.1145/225058.225269. ISBN 0897917189. Euler

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

Strict Fibonacci heaps (PDF). Proceedings of the 44th symposium on Theory of Computing - STOC '12. pp. 1177–1184. CiteSeerX 10.1.1.233.1740. doi:10.1145/2213977

Resistance distance (1,483 words) [view diff] case mismatch in snippet view article find links to article

times". Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 574–685. doi:10.1145/73007.73062. ISBN 0897913078

Double-ended queue (2,281 words) [view diff] exact match in snippet view article find links to article

functional representations of catenable sorted lists. In ACM Symposium on Theory of Computing, pages 202–211, May 1996. (pp. 4, 82, 84, 124) Chris Okasaki (Aug

H. T. Kung (955 words) [view diff] case mismatch in snippet view article find links to article

pebble game". Proceedings of the thirteenth annual ACM symposium on Theory of computing - STOC '81. New York, NY, USA: ACM. pp. 326–333. doi:10.1145/800076

Regular language (3,422 words) [view diff] case mismatch in snippet view article find links to article

"Word Problems Requiring Exponential Time". Proc. 5th ann. symp. on Theory of computing (STOC) (PDF). ACM. pp. 1–9. Hopcroft, Ullman (1979), Corollary p

3SUM (2,676 words) [view diff] case mismatch in snippet view article find links to article

for dynamic problems", Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10, p. 603, doi:10.1145/1806689.1806772, ISBN 9781450300506

2-choice hashing (663 words) [view diff] case mismatch in snippet view article find links to article

abstract)" (PDF), Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94, Montréal: Association for Computing Machinery, pp. 593–602

Group isomorphism problem (627 words) [view diff] case mismatch in snippet view article find links to article

Preliminary Report)". Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78. ACM Press. pp. 51–58. doi:10.1145/800133.804331. ISBN 978-1-4503-7437-8

Key-agreement protocol (1,473 words) [view diff] case mismatch in snippet view article find links to article

abstract)". Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98. Association for Computing Machinery. pp. 419–428. doi:10

Connected dominating set (1,239 words) [view diff] exact match in snippet view article find links to article

ecology of parameters: an illustration using bounded max leaf number", Theory of Computing Systems, 45 (4): 822–848, doi:10.1007/s00224-009-9167-9, S2CID 4053586

Computation tree (298 words) [view diff] exact match in snippet view article find links to article

bounds for algebraic computation trees", Proc. 15th Annu. Symp. Theory of Computing, pp. 80–86, doi:10.1145/800061.808735, ISBN 0-89791-099-0. Grigoriev

Computation tree (298 words) [view diff] exact match in snippet view article find links to article

bounds for algebraic computation trees", Proc. 15th Annu. Symp. Theory of Computing, pp. 80–86, doi:10.1145/800061.808735, ISBN 0-89791-099-0. Grigoriev

Bellman–Ford algorithm (2,854 words) [view diff] exact match in snippet view article find links to article

O'Donnell, Ryan (eds.). Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24–28, 2024. Association

Dana Angluin (1,235 words) [view diff] case mismatch in snippet view article find links to article

and matchings". Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77. New York, New York, USA: ACM Press. pp. 30–41. doi:10

Non-blocking algorithm (2,392 words) [view diff] exact match in snippet view article find links to article

Algorithms Practically Wait-Free?. Proc. 46th Annual ACM Symposium on Theory of Computing (STOC’14). pp. 714–723. arXiv:1311.3200. doi:10.1145/2591796.2591836

Pavol Hell (385 words) [view diff] case mismatch in snippet view article find links to article

D.G. (1978). "Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78". STOC. pp. 240–245. doi:10.1145/800133.804353. Feder

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

majority. In Proceedings of the Twenty-First Annual ACM Symposium on theory of Computing (Seattle, Washington, United States, May 14–17, 1989). doi:10.1145/73007

L-reduction (1,017 words) [view diff] exact match in snippet view article find links to article

STOC '88: Proceedings of the twentieth annual ACM Symposium on Theory of Computing. doi:10.1145/62212.62233. Crescenzi, Pierluigi (1997). "A short guide

Semantic security (1,435 words) [view diff] exact match in snippet view article find links to article

keeping secret all partial information, Annual ACM Symposium on Theory of Computing, 1982. Shannon, Claude (1949). "Communication Theory of Secrecy Systems"

BPP (complexity) (2,456 words) [view diff] exact match in snippet view article

Lemma". Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 220–229. doi:10.1145/258533.258590 Valentine Kabanets (2003)

String-searching algorithm (2,341 words) [view diff] case mismatch in snippet view article find links to article

matching". Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. pp. 592–601. Clifford, Peter; Clifford, Raphaël (January 2007).

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

Indistinguishability Obfuscation (iO) | Simons Institute for the Theory of Computing". simons.berkeley.edu. Archived from the original on 22 August 2021

Aude Oliva (536 words) [view diff] exact match in snippet view article find links to article

basicresearch.defense.gov. Retrieved 2018-11-10. "Aude Oliva | Simons Institute for the Theory of Computing". simons.berkeley.edu. Retrieved 2018-11-10.

Witness-indistinguishable proof (178 words) [view diff] case mismatch in snippet view article find links to article

protocols". Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90. pp. 416–426. doi:10.1145/100216.100272. ISBN 0897913612

Janson inequality (656 words) [view diff] exact match in snippet view article find links to article

problem". Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. pp. 442–453. arXiv:1809.04092. doi:10.1145/3313276.3316339. ISBN 978-1-4503-6705-9

Pablo Parrilo (246 words) [view diff] exact match in snippet view article find links to article

Retrieved 2024-10-03. "Pablo Parrilo". Simons Institute for the Theory of Computing. Retrieved 2024-10-03. "Pablo Parrilo". IDSS. Retrieved 2024-10-03

Greatest common divisor (4,739 words) [view diff] exact match in snippet view article find links to article

smoothness to achieve parallelism". 20th Annual ACM Symposium on Theory of Computing. New York. pp. 528–538. doi:10.1145/62212.62264. ISBN 0-89791-264-0

String-to-string correction problem (418 words) [view diff] case mismatch in snippet view article find links to article

Correction Problem". Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75. pp. 218–223. doi:10.1145/800116.803771. ISBN 9781450374194

Logical depth (300 words) [view diff] exact match in snippet view article find links to article

Teixeira, Andreia (2017-02-01). "Sophistication vs Logical Depth". Theory of Computing Systems. 60 (2): 280–298. arXiv:1304.8046. doi:10.1007/s00224-016-9672-6

Library sort (927 words) [view diff] exact match in snippet view article find links to article

Mosteiro, Miguel A. (June 2006). "Insertion Sort is O(n log n)" (PDF). Theory of Computing Systems. 39 (3): 391–397. arXiv:cs/0407003. doi:10.1007/s00224-005-1237-z

Algorithmic technique (913 words) [view diff] case mismatch in snippet view article find links to article

multidimensional space". Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76. New York, NY, USA: ACM. pp. 220–230. doi:10.1145/800113

Diyi Yang (397 words) [view diff] exact match in snippet view article find links to article

Retrieved February 20, 2024. "Diyi Yang". Simons Institute for the Theory of Computing. Retrieved February 20, 2024. "Tutorials at ACL 2022". Archived from

Janusz Brzozowski (computer scientist) (985 words) [view diff] exact match in snippet view article

2019-10-30 at the Wayback Machine at the University of Waterloo The Theory of Computing Hall of Fame Archived 2019-10-30 at the Wayback Machine Janusz A

Tornado code (967 words) [view diff] case mismatch in snippet view article find links to article

codes". Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97. pp. 150–159. doi:10.1145/258533.258573. ISBN 0-89791-888-6

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

hypergraphs", Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, pp. 311–320, arXiv:1307.2608, Bibcode:2013arXiv1307.2608K, doi:10

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

"Computing the volume is difficult", Proc. 18th ACM Symposium on Theory of Computing (Berkeley, California, May 28–30, 1986) (PDF), New York, NY: ACM

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

STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. STOC. Portland, Oregon: ACM. pp. 567–576. arXiv:1411.6317. Dinur

Covering graph (1,409 words) [view diff] case mismatch in snippet view article find links to article

(Extended Abstract)". Proceedings of the twelfth annual ACM symposium on Theory of computing (STOC '80). Association for Computing Machinery. pp. 82–93. doi:10

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

(2007-03-30). "A Simple PromiseBQP-complete Matrix Problem" (PDF). Theory of Computing. 3 (4): 61–79. doi:10.4086/toc.2007.v003a004. Retrieved 2024-04-18

First-fit bin packing (2,556 words) [view diff] case mismatch in snippet view article find links to article

allocation algorithms". Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72. pp. 143–150. doi:10.1145/800152.804907. S2CID 26654056

Four color theorem (6,333 words) [view diff] exact match in snippet view article find links to article

four-coloring planar graphs", Proceedings of the 28th ACM Symposium on Theory of Computing (STOC 1996), pp. 571–575, doi:10.1145/237814.238005, ISBN 0-89791-785-5

PP (complexity) (2,357 words) [view diff] exact match in snippet view article

"PP is closed under intersection", Proceedings of ACM Symposium on Theory of Computing 1991, pp. 1–9, 1991. Lide Li (1993). On the Counting Functions (Ph

Sergey Bobkov (229 words) [view diff] exact match in snippet view article find links to article

"Sergey Bobkov". Current long-term visitors. Simons Institute for the Theory of Computing. Retrieved 2014-05-05. "Awardees: Mathematics". Humboldt Network

Yael Tauman Kalai (496 words) [view diff] exact match in snippet view article find links to article

Researcher, Microsoft Research New England, Simons Institute for the Theory of Computing, 22 October 2014 "ICERM - Trustee and Advisory Boards - Trustee &

Planar graph (4,589 words) [view diff] exact match in snippet view article find links to article

of fixed genus", Proceedings of the 12th Annual ACM Symposium on Theory of Computing (PDF), pp. 236–243, doi:10.1145/800141.804671, ISBN 978-0-89791-017-0

Kim Border (384 words) [view diff] exact match in snippet view article find links to article

"On the Borders of Border's Theorem | Simons Institute for the Theory of Computing". simons.berkeley.edu. Retrieved 3 April 2021. Le Breton, Michel;

Post–Turing machine (2,767 words) [view diff] case mismatch in snippet view article find links to article

Church's lambda calculus. Hao Wang (1957): "A variant to Turing's theory of computing machines", Journal of the Association for Computing Machinery (JACM)

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

collide". Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91. New Orleans, Louisiana, United States: ACM Press. pp

Michael A. Bender (451 words) [view diff] case mismatch in snippet view article find links to article

a pebble". Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98. pp. 269–278. CiteSeerX 10.1.1.8.1984. doi:10.1145/276698

Permutation automaton (453 words) [view diff] exact match in snippet view article find links to article

1016/S0019-9958(67)90481-0 Thierrin, Gabriel (March 1968). "Permutation automata". Theory of Computing Systems. 2 (1): 83–90. doi:10.1007/BF01691347. Janusz A. Brzozowski:

Frege system (912 words) [view diff] case mismatch in snippet view article find links to article

(Preliminary Version)". Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74. New York, NY, USA: Association for Computing Machinery

Stefan Langerman (575 words) [view diff] exact match in snippet view article find links to article

Langerman, Arthur; Langerman, Stefan (2006), "Morpion solitaire" (PDF), Theory of Computing Systems, 39 (3): 439–453, doi:10.1007/s00224-005-1240-4, MR 2218413

Katrina Ligett (349 words) [view diff] case mismatch in snippet view article find links to article

total anarchy", Proceedings of the fortieth annual ACM symposium on Theory of computing - STOC 08, p. 373, CiteSeerX 10.1.1.116.5105, doi:10.1145/1374376

Mathematics (15,943 words) [view diff] exact match in snippet view article find links to article

STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing. pp. 603–618. doi:10.1145/129712.129771. S2CID 11678884. Ewald, William

Sipser–Lautemann theorem (1,005 words) [view diff] exact match in snippet view article find links to article

approach to randomness". Proceedings of the 15th ACM Symposium on Theory of Computing. ACM Press: 330–335. CiteSeerX 10.1.1.472.8218. Lautemann, Clemens

Neil D. Jones (358 words) [view diff] case mismatch in snippet view article find links to article

polynomial time". Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74. pp. 40–46. doi:10.1145/800119.803883. S2CID 12251817

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

applications", Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90, pp. 213–223, CiteSeerX 10.1.1.421.2784, doi:10.1145/100216

Differentially private analysis of graphs (799 words) [view diff] case mismatch in snippet view article find links to article

analysis". Proceedings of the thirty-ninth annual ACM symposium on Theory of computing. New York, New York, USA: ACM Press. pp. 75–84. doi:10.1145/1250790

Voronoi diagram (5,504 words) [view diff] case mismatch in snippet view article find links to article

diagrams". Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. pp. 721–730. doi:10.1145/509907.510011. ISBN 1581134959. S2CID 1727373

Multiparty communication complexity (1,175 words) [view diff] exact match in snippet view article find links to article

distributive computing", Proceedings of the 11th ACM Symposium on Theory of Computing (STOC '79), pp. 209–213, doi:10.1145/800135.804414, S2CID 999287

Shortest common supersequence (1,034 words) [view diff] exact match in snippet view article find links to article

ratios". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (PDF). pp. 317–330. doi:10.1145/3519935.3520001. ISBN 9781450392648

Regular tree grammar (1,299 words) [view diff] case mismatch in snippet view article find links to article

languages" (PDF). Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04. pp. 202–211. doi:10.1145/1007352.1007390. ISBN 978-1581138528

Edith Hemaspaandra (264 words) [view diff] exact match in snippet view article find links to article

retrieved 2022-08-02 "In Memoriam – Alan Selman (1941 – 2021)", Theory of Computing Systems, 67 (3): 413–414, March 2021, doi:10.1007/s00224-021-10036-x

Union theorem (290 words) [view diff] exact match in snippet view article find links to article

Proceedings of the First Annual ACM Symposium on Theory of Computing. ACM Symposium on Theory of Computing. STOC '69. Marina del Rey, California, USA: Association

Job-shop scheduling (2,578 words) [view diff] exact match in snippet view article find links to article

Algorithms for an Ancient Scheduling Problem". Proc. 24th ACM Symp. Theory of Computing. pp. 51–58. doi:10.1145/129712.129718. Karger, D.; S. Phillips; E

Shlomi Dolev (2,390 words) [view diff] exact match in snippet view article find links to article

"Local stabilizer". Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems. pp. 74–84. doi:10.1109/ISTCS.1997.595159. ISBN 978-0-8186-8037-3

Kneser graph (1,779 words) [view diff] exact match in snippet view article find links to article

are Hamiltonian", Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 963–970, arXiv:2212.03918, doi:10.1145/3564246.3585137, ISBN 978-1-4503-9913-5

Lek-Heng Lim (288 words) [view diff] exact match in snippet view article find links to article

Retrieved 3 April 2022. "Lek-Heng Lim". Simons Institute for the Theory of Computing. Retrieved 3 April 2022. "LH's Homepage". University of Chicago.

Provable security (2,181 words) [view diff] case mismatch in snippet view article find links to article

revisited", Proceedings of the forty-third annual ACM symposium on Theory of computing, pp. 89–98, arXiv:1011.1264, doi:10.1145/1993636.1993650, ISBN 9781450306911

Shared snapshot objects (3,328 words) [view diff] case mismatch in snippet view article find links to article

test case". Proceedings of the twentieth annual ACM symposium on Theory of computing. pp. 78–92. Katseff, Howard P (1978). "A new solution to the critical

Stable matching problem (2,544 words) [view diff] exact match in snippet view article find links to article

David; Henzinger, Monika (eds.). Proceedings of the 50th Symposium on Theory of Computing (STOC 2018). Association for Computing Machinery. pp. 920–925. arXiv:1711

Linear optical quantum computing (3,871 words) [view diff] exact match in snippet view article find links to article

Arkhipov, Alex (2013). "The computational complexity of linear optics". Theory of Computing. 9: 143–252. doi:10.4086/toc.2013.v009a004. Ball, Philip (2020).

Consensus (computer science) (4,770 words) [view diff] exact match in snippet view article

"Cloture Votes: n/4-resilient Distributed Consensus in t + 1 rounds". Theory of Computing Systems. 2. 26: 3–19. doi:10.1007/BF01187072. S2CID 6102847. Burrows

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

pricing" (PDF), Proceedings of the Forty-Second ACM Symposium on Theory of Computing (STOC '10), New York, NY, USA: ACM, pp. 311–320, arXiv:0907.2435

Samy Bengio (1,079 words) [view diff] exact match in snippet view article find links to article

2019-10-10. Retrieved 2021-02-23. "Samy Bengio | Simons Institute for the Theory of Computing". simons.berkeley.edu. 17 October 2017. Retrieved 2021-02-23. "Interview:

Fast Fourier transform (7,809 words) [view diff] case mismatch in snippet view article find links to article

functions". Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95. Kyoto, Japan. pp. 407–416. doi:10.1145/225058.225167

Conductance (graph theory) (1,428 words) [view diff] case mismatch in snippet view article

resolved". Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88. ACM Press. pp. 235–244. doi:10.1145/62212.62234. ISBN 978-0-89791-264-8

Top tree (3,226 words) [view diff] exact match in snippet view article find links to article

connectivity", Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory of Computing Holm, Jacob; Rotenberg, Eva; Thorup, Mikkel (2018), "Dynamic Bridge-Finding

Pseudorandom generator (1,864 words) [view diff] case mismatch in snippet view article find links to article

applications", Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90, pp. 213–223, CiteSeerX 10.1.1.421.2784, doi:10.1145/100216

Fair cake-cutting (4,312 words) [view diff] exact match in snippet view article find links to article

Kanellopoulos, P.; Kyropoulou, M. (2011). "The Efficiency of Fair Division". Theory of Computing Systems. 50 (4): 589. CiteSeerX 10.1.1.475.9976. doi:10.1007/s00224-011-9359-y

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

"Some simplified NP-complete problems", Proc. 6th ACM Symposium on Theory of Computing (STOC '74), pp. 47–63, doi:10.1145/800119.803884, S2CID 207693360

Metric k-center (3,613 words) [view diff] case mismatch in snippet view article find links to article

clustering". Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88. New York, NY, USA: Association for Computing Machinery

Descriptive complexity theory (2,548 words) [view diff] case mismatch in snippet view article find links to article

Abstract)". Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82. New York, NY, USA: ACM. pp. 137–146. CiteSeerX 10.1.1

Quasi-bipartite graph (523 words) [view diff] case mismatch in snippet view article find links to article

relaxations". Proceedings of the forty-fourth annual ACM symposium on Theory of computing. p. 1161-1176. doi:10.1145/2213977.2214081. ISBN 9781450312455. S2CID 13424446

Link/cut tree (2,567 words) [view diff] case mismatch in snippet view article find links to article

Dynamic Trees". Proceedings of the thirteenth annual ACM symposium on Theory of computing - STOC '81 (PDF). pp. 114–122. doi:10.1145/800076.802464. Sleator

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

On the Learnability of Discrete Distributions. ACM Symposium on Theory of Computing, 1994 [1] L. Valiant A theory of the learnable. Communications of

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

groups". Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97. pp. 48–53. doi:10.1145/258533.258548. ISBN 0-89791-888-6

Link/cut tree (2,567 words) [view diff] case mismatch in snippet view article find links to article

Dynamic Trees". Proceedings of the thirteenth annual ACM symposium on Theory of computing - STOC '81 (PDF). pp. 114–122. doi:10.1145/800076.802464. Sleator

State complexity (3,375 words) [view diff] case mismatch in snippet view article find links to article

Finite Automata". Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78. STOC 1978. ACM. pp. 275–286. doi:10.1145/800133.804357

Peter Richtarik (877 words) [view diff] exact match in snippet view article find links to article

Fellows at CORE". Retrieved August 22, 2016. "Simons Institute for the Theory of Computing, UC Berkeley". Retrieved August 22, 2016. "Alan Turing Institute

Roger Wattenhofer (362 words) [view diff] exact match in snippet view article find links to article

2006). "Dynamic Analysis of the Arrow Distributed Protocol" (PDF). Theory of Computing Systems. 39 (6): 875–901. doi:10.1007/s00224-006-1251-9. hdl:20.500

Separable state (2,516 words) [view diff] exact match in snippet view article find links to article

quantum entanglement, in Proceedings of the 35th ACM Symposium on Theory of Computing, ACM Press, New York, 2003. Sevag Gharibian, Strong NP-Hardness of

Turing machine (9,386 words) [view diff] case mismatch in snippet view article find links to article

Books/Doubleday. ISBN 978-0-385-49243-0. Hao Wang, "A variant to Turing's theory of computing machines", Journal of the Association for Computing Machinery (JACM)

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

earlier version appeared in Proceedings of the 32nd ACM Symposium on Theory of Computing, May 2000, 397–406. Paolo Ferragina and Giovanni Manzini (2000).

Cryptography (11,081 words) [view diff] case mismatch in snippet view article find links to article

randomness". Proceedings of the seventeenth annual ACM symposium on Theory of computing – STOC '85. pp. 421–429. CiteSeerX 10.1.1.130.3397. doi:10.1145/22145

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

Strict Fibonacci heaps (PDF). Proceedings of the 44th symposium on Theory of Computing - STOC '12. pp. 1177–1184. CiteSeerX 10.1.1.233.1740. doi:10.1145/2213977

Presburger arithmetic (3,255 words) [view diff] case mismatch in snippet view article find links to article

quantifier alternation". Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78. pp. 320–325. doi:10.1145/800133.804361. S2CID 13966721

Bounding sphere (1,736 words) [view diff] exact match in snippet view article find links to article

(PDF), Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, New York, NY, US: ACM, pp. 250–257, CiteSeerX 10.1.1.4.9395, doi:10

Entropy compression (1,387 words) [view diff] exact match in snippet view article find links to article

STOC'09—Proceedings of the 2009 ACM International Symposium on Theory of Computing, New York: ACM, pp. 343–350, arXiv:0810.4812, doi:10.1145/1536414

P versus NP problem (7,797 words) [view diff] exact match in snippet view article find links to article

proving procedures". Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158. doi:10.1145/800157.805047. ISBN 9781450374644. S2CID 7573663

Best-fit bin packing (643 words) [view diff] case mismatch in snippet view article find links to article

allocation algorithms". Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72. pp. 143–150. doi:10.1145/800152.804907. S2CID 26654056

SNP (complexity) (860 words) [view diff] case mismatch in snippet view article

satisfaction". Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93. pp. 612–622. doi:10.1145/167088.167245. ISBN 0897915917

Yuri Gurevich (836 words) [view diff] exact match in snippet view article find links to article

STOC '82: Proceedings of the Fourteenth annual ACM Symposium on Theory of Computing, 1982, 60-65. Y. Gurevich and S. Shelah. Expected computation time

Bramble (graph theory) (955 words) [view diff] exact match in snippet view article

Theorem", Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing (STOC '15), Portland, Oregon, USA: ACM, pp. 655–664, arXiv:1411.5681

Multiplicative weight update method (3,696 words) [view diff] exact match in snippet view article find links to article

Multiplicative Weights Update Method: A Meta-Algorithm and Applications". Theory of Computing. 8: 121–164. doi:10.4086/toc.2012.v008a006. "The Multiplicative Weights

Eun Jung Kim (computer scientist) (252 words) [view diff] exact match in snippet view article

Jung Kim", Current long-term visitors, Simons Institute for the Theory of Computing, 2015, retrieved 2022-03-08 "Ms Eun Jung Kim", Researcher profiles

Not-all-equal 3-satisfiability (644 words) [view diff] exact match in snippet view article find links to article

complexity of satisfiability problems", Proc. Tenth ACM Symposium on Theory of Computing (STOC '78), New York: ACM, pp. 216–226, MR 0521057 Dinur, Irit; Regev

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

solvable optimization problems on graphs of bounded clique-width", Theory of Computing Systems, 33 (2): 125–150, doi:10.1007/s002249910009, MR 1739644,

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

generation secure against quantum adversaries". The 44th Symposium on Theory of Computing (STOC). pp. 61–76. Miklos Santha, Umesh V. Vazirani (1984-10-24)

Distance-hereditary graph (2,290 words) [view diff] exact match in snippet view article find links to article

solvable optimization problems on graphs on bounded clique width", Theory of Computing Systems, 33 (2): 125–150, doi:10.1007/s002249910009, S2CID 15402031

Leftover hash lemma (588 words) [view diff] exact match in snippet view article find links to article

David S. (ed.), Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washington, USA, {ACM}, pp. 12–24, doi:10

Random matrix (7,569 words) [view diff] exact match in snippet view article find links to article

Arkhipov, Alex (2013). "The computational complexity of linear optics". Theory of Computing. 9: 143–252. doi:10.4086/toc.2013.v009a004. Russell, Nicholas; Chakhmakhchyan

Elad Hazan (748 words) [view diff] exact match in snippet view article find links to article

multiplicative weights update method: a meta-algorithm and applications. Theory of Computing, 8(1), 121–164. Hazan, E. (2019). Introduction to online convex optimization

Random-access stored-program machine (2,620 words) [view diff] exact match in snippet view article find links to article

effective understanding. Hao Wang (1957), A Variant to Turing's Theory of Computing Machines, JACM (Journal of the Association for Computing Machinery)

James Renegar (1,009 words) [view diff] exact match in snippet view article find links to article

Mathematics Genealogy Project "Jim Renegar". Simons Institute for the Theory of Computing. "James Renegar, Professor". Department of Mathematics, Cornell University

Fourier transform on finite groups (2,052 words) [view diff] case mismatch in snippet view article find links to article

groups", Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97, pp. 48–53, doi:10.1145/258533.258548, ISBN 0-89791-888-6

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

Current Matrix Multiplication Time. 51st Annual ACM Symposium on the Theory of Computing. STOC'19. arXiv:1810.07896. Lee, Yin-Tat; Song, Zhao; Zhang, Qiuyi

Sanjeev Goyal (420 words) [view diff] exact match in snippet view article find links to article

Kearns (2012), Competitive Contagion in Networks, Symposium on the Theory of Computing. L. Ductor, M.Fafchamps, S. Goyal and M. v.d.Leij (2014), Social

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

Strict Fibonacci heaps (PDF). Proceedings of the 44th symposium on Theory of Computing - STOC '12. pp. 1177–1184. CiteSeerX 10.1.1.233.1740. doi:10.1145/2213977

Jos Baeten (284 words) [view diff] case mismatch in snippet view article find links to article

2015, he returned to the University of Amsterdam as professor of theory of computing at the Institute of Logic, Language and Computation. He retired from

Language equation (1,127 words) [view diff] exact match in snippet view article find links to article

Michal (2007). "The Power of Commuting with Finite Sets of Words". Theory of Computing Systems. 40 (4): 521–551. doi:10.1007/s00224-006-1321-z. ISSN 1432-4350

Nested word (3,063 words) [view diff] case mismatch in snippet view article find links to article

languages" (PDF). Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04. pp. 202–211. doi:10.1145/1007352.1007390. ISBN 978-1581138528

Game theory (15,372 words) [view diff] case mismatch in snippet view article find links to article

trees". Proceedings of the twenty-sixth annual ACM symposium on Theory of computing – STOC '94. pp. 750–759. doi:10.1145/195058.195451. ISBN 0-89791-663-8

Ring learning with errors key exchange (3,424 words) [view diff] case mismatch in snippet view article find links to article

cryptography". Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. STOC '05. New York, NY, USA: ACM. pp. 84–93. CiteSeerX 10.1.1.110

Vizing's theorem (2,776 words) [view diff] exact match in snippet view article find links to article

Nikhil (eds.), Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czechia, June 23–27, 2025, Association for Computing

Matrix norm (4,788 words) [view diff] case mismatch in snippet view article find links to article

inequality". Proceedings of the thirty-sixth annual ACM symposium on Theory of computing. STOC '04. Chicago, IL, USA: Association for Computing Machinery

Minimum spanning tree (5,460 words) [view diff] exact match in snippet view article find links to article

Heuristics for weighted perfect matching. 12th Annual ACM Symposium on Theory of Computing (STOC '80). New York, NY, USA: ACM. pp. 398–419. doi:10.1145/800141

Hyphanet (6,092 words) [view diff] case mismatch in snippet view article find links to article

(PDF). Proceedings of the thirty-second annual ACM symposium on Theory of computing. pp. 163–70. doi:10.1145/335305.335325. ISBN 978-1-58113-184-0. S2CID 221559836

Coreset (562 words) [view diff] case mismatch in snippet view article find links to article

streams". Proceedings of the thirty-seventh annual ACM symposium on Theory of computing. STOC '05. New York, NY, USA: Association for Computing Machinery

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

Strict Fibonacci heaps (PDF). Proceedings of the 44th symposium on Theory of Computing - STOC '12. pp. 1177–1184. CiteSeerX 10.1.1.233.1740. doi:10.1145/2213977

Bipartite dimension (1,737 words) [view diff] exact match in snippet view article find links to article

Yerukhimovich, Arkady (2005), "Efficient data storage in large nanoarrays", Theory of Computing Systems, 38 (4): 503–536, doi:10.1007/s00224-004-1196-9, S2CID 5844939

Random projection (1,829 words) [view diff] case mismatch in snippet view article find links to article

algorithms". Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. Vol. 1. pp. 380–388. doi:10.1145/509907.509965. ISBN 1581134959

Control flow (6,135 words) [view diff] exact match in snippet view article find links to article

"Analysis of structured programs," Proc. Fifth Annual ACM Syrup. Theory of Computing, (May 1973), 240-252; also in J. Computer and System Sciences, 9

Emina Soljanin (279 words) [view diff] exact match in snippet view article find links to article

Retrieved 2 December 2019. "Emina Soljanin". Simons Institute for the Theory of Computing. 19 June 2014. Retrieved 2 December 2019. "Emina Soljanin". IEEE

Kemeny–Young method (2,900 words) [view diff] exact match in snippet view article find links to article

note on exact algorithms for vertex ordering problems on graphs", Theory of Computing Systems, 50 (3): 420–432, doi:10.1007/s00224-011-9312-0, hdl:1956/4556

Join five (930 words) [view diff] exact match in snippet view article find links to article

Langerman, Arthur; Langerman, Stefan (2006), "Morpion solitaire" (PDF), Theory of Computing Systems, 39 (3): 439–453, doi:10.1007/s00224-005-1240-4, MR 2218413

Hao Huang (mathematician) (431 words) [view diff] case mismatch in snippet view article

polynomials". Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92. New York, NY, USA: ACM. pp. 462–467. doi:10.1145/129712

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

every CSP?". Proceedings of the fortieth annual ACM symposium on Theory of computing. pp. 245–254. doi:10.1145/1374376.1374414. ISBN 9781605580470. S2CID 15075197

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

trees and arrays. Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72. pp. 125–136. doi:10.1145/800152.804905. Farach, M. (1997)

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

implies superpolynomial lower bounds", Proc. 42nd ACM Symposium on Theory of Computing (STOC 2010), New York, NY, USA: ACM, pp. 231–240, CiteSeerX 10.1

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

problem". Proceedings of the thirteenth annual ACM symposium on Theory of computing - STOC '81. New York, NY, USA: Association for Computing Machinery

Odd graph (1,924 words) [view diff] exact match in snippet view article find links to article

STOC'18—Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, New York: ACM, pp. 912–919, arXiv:1711.01636, MR 3826304 Weisstein

Smallest grammar problem (464 words) [view diff] case mismatch in snippet view article find links to article

(PDF). Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York

Secret sharing (3,790 words) [view diff] case mismatch in snippet view article find links to article

abstract)". Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92. pp. 699–710. doi:10.1145/129712.129780. ISBN 0897915119

N-body simulation (4,082 words) [view diff] exact match in snippet view article find links to article

sets with applications to k-nearest-neighbors and n-body potential fields (preliminary version)". STOC '92: Proc. ACM Symp. Theory of Computing. ACM..

Skew binary number system (1,120 words) [view diff] exact match in snippet view article find links to article

(2012). "Two Skew-Binary Numeral Systems and One Application" (PDF). Theory of Computing Systems. 50: 185–211. doi:10.1007/s00224-011-9357-0. S2CID 253736860

Decision tree model (3,229 words) [view diff] case mismatch in snippet view article find links to article

computation trees". Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83. New York, NY, USA: Association for Computing Machinery

Sophistication (complexity theory) (230 words) [view diff] exact match in snippet view article

Fortnow, Lance (August 30, 2007). "Sophistication Revisited" (PDF). Theory of Computing Systems. 45: 150–161. doi:10.1007/s00224-007-9095-5. S2CID 2020289

Computational social choice (1,538 words) [view diff] exact match in snippet view article find links to article

(2003-06-06). "Exact Complexity of the Winner Problem for Young Elections". Theory of Computing Systems. 36 (4): 375–386. arXiv:cs/0112021. doi:10.1007/s00224-002-1093-z

Uzi Vishkin (1,886 words) [view diff] exact match in snippet view article find links to article

an Extremely Fine-Grained Parallel Programming Approach" (PDF), Theory of Computing Systems, 36 (5): 551–552, doi:10.1007/s00224-003-1086-6, S2CID 1929495

Parameterized approximation algorithm (3,440 words) [view diff] case mismatch in snippet view article find links to article

inapproximability". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. STOC '03. New York, NY, USA: Association for Computing Machinery

Clarence Ellis (computer scientist) (1,308 words) [view diff] case mismatch in snippet view article

Bell Labs from 1969 to 1972 on probability theory applied to the theory of computing. In 1972 he became an assistant professor and a founding member of

Tensor sketch (4,517 words) [view diff] case mismatch in snippet view article find links to article

Wayback Machine." Proceedings of the forty-second ACM symposium on Theory of computing. 2010. Rudelson, Mark, and Shuheng Zhou. "Reconstruction from anisotropic

Dasgupta's objective (573 words) [view diff] exact match in snippet view article find links to article

clustering", Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2016), New York, New York: ACM, pp. 118–127, arXiv:1510.05043

All nearest smaller values (1,347 words) [view diff] case mismatch in snippet view article find links to article

problems", Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, New York, NY, USA: ACM, pp. 135–143, doi:10.1145/800057

Cristina Sernadas (342 words) [view diff] exact match in snippet view article find links to article

include: Introdução à Teoria da Computação (Introduction to the Theory of Computing, Editorial Presença, 1993) Introdução à Programação em Mathematica

Submodular set function (3,349 words) [view diff] case mismatch in snippet view article find links to article

oracle model". Proceedings of the fortieth annual ACM symposium on Theory of computing. STOC '08. New York, NY, USA: Association for Computing Machinery

Sergio Rajsbaum (1,049 words) [view diff] case mismatch in snippet view article find links to article

abstract)". Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94. ACM. pp. 810–819. doi:10.1145/195058.195466. ISBN 0-89791-663-8

Finger search tree (499 words) [view diff] case mismatch in snippet view article find links to article

linear lists". Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77. pp. 49–60. CiteSeerX 10.1.1.527.7294. doi:10.1145/800105

List of books in computational geometry (1,939 words) [view diff] exact match in snippet view article find links to article

Symposium on Discrete Algorithms (SODA) Annual ACM Symposium on Theory of Computing (STOC) Annual IEEE Symposium on Foundations of Computer Science (FOCS)

Brooks–Iyengar algorithm (1,837 words) [view diff] exact match in snippet view article find links to article

systems". Proceedings of the forty-fifth annual ACM symposium on Theory of Computing. STOC '13. New York, NY, USA: ACM. pp. 391–400. doi:10.1145/2488608

Metrical task system (805 words) [view diff] exact match in snippet view article find links to article

Systems". Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing. pp. 711–719. doi:10.1145/258533.258667. Yair Bartal, Béla Bollobás

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

requiring exponential time. In Proceedings of the 5th Symposium on Theory of Computing, pages 1–9, 1973. J. E. Hopcroft and J. D. Ullman. Introduction to