Find link

language:

Find link is a tool written by Edward Betts.

searching for ACM SIGACT 201 found (270 total)

alternate case: aCM SIGACT

The Complexity of Songs (863 words) [view diff] exact match in snippet view article find links to article

of functions. Knuth, Donald (Summer 1977). "The Complexity of Songs". ACM SIGACT News. 9 (2): 17–24. doi:10.1145/1008354.1008355. S2CID 17533775. Reprinted

Well-founded semantics (542 words) [view diff] exact match in snippet view article find links to article

well-founded semantics for general logic programs". Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems. New York, New

Underwood Dudley (1,165 words) [view diff] exact match in snippet view article find links to article

11001; Perla Myers, The Mathematics Teacher, JSTOR 20876870; Song Yan, ACM SIGACT News, doi:10.1145/1998037.1998048; Mehdi Hassani, MAA Reviews. Readings

Dale Skeen (1,159 words) [view diff] exact match in snippet view article find links to article

fault-tolerant protocol for replicated data management". Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS '85. Dl.acm

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

Map that Reflects the Territory: Essays by the LessWrong Community"". ACM SIGACT News. 53 (1): 13–24. doi:10.1145/3532737.3532741. Users wrote reviews

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

Jorge Stolfi (1984). "Pessimal Algorithms and Simplexity Analysis" (PDF). ACM SIGACT News. 16 (3): 49–53. CiteSeerX 10.1.1.116.9158. doi:10.1145/990534.990536

Christofides algorithm (1,404 words) [view diff] exact match in snippet view article find links to article

Samir; Vassilevska Williams, Virginia (eds.), STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021

Princess and monster game (576 words) [view diff] exact match in snippet view article find links to article

Chrobak (2004). "A princess swimming in the fog looking for a monster cow". ACM SIGACT News. 35 (2): 74–78. doi:10.1145/992287.992304. S2CID 8687739. S. Alpern

Steven Skiena (719 words) [view diff] exact match in snippet view article find links to article

(2014), ACM SIGACT News 45 (2): 40–42, doi:10.1145/2636805.2636817. Review of The Algorithm Design Manual: Neelakantan Kartha (2011), ACM SIGACT News 42

Prize for Innovation in Distributed Computing (244 words) [view diff] no match in snippet view article find links to article

Keidar, ACM-SIGACT News Distributed Computing Column, December 2009 [2] CNRS website [3] Proceedings of SIROCCO 2011 [4] Idit Keidar, ACM-SIGACT News Distributed

Vinod Vaikuntanathan (245 words) [view diff] exact match in snippet view article find links to article

edu. Archived from the original on 2022-11-24. Retrieved 2022-11-24. "ACM SIGACT - Gödel Prize". sigact.org. Archived from the original on 2022-11-24.

Cristian Calude (1,311 words) [view diff] exact match in snippet view article find links to article

March 2015). "Guest Column: Adiabatic Quantum Computing Challenges". ACM SIGACT News. 46 (1): 40–61. doi:10.1145/2744447.2744459. ISSN 0163-5700. Abbott

Zvika Brakerski (287 words) [view diff] exact match in snippet view article find links to article

is - next to BGV - one of the dominant second-generation FHE schema. "ACM SIGACT - Gödel Prize". sigact.org. Archived from the original on 2022-11-24.

Shlomo Moran (140 words) [view diff] exact match in snippet view article find links to article

Mathematics Genealogy Project. 1993 Gödel Prize Archived 2015-12-08 at the Wayback Machine, ACM SIGACT, retrieved 2010-12-02. Home page at the Technion

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

jointly by the European Association of Theoretical Computer Science and ACM SIGACT. (Other contemporaneous recipients were Andrei Bulatov, Jin-Yi Cai, Xi

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

Hungarian Academy of Sciences. June 2019. Retrieved 14 February 2020. "ACM SIGACT - Gödel Prize". sigact.org. Retrieved 2020-04-20. Gábor Tardos at the

Jeanne LaDuke (511 words) [view diff] exact match in snippet view article find links to article

(2010), Mathematical Reviews, MR2464022 Sorelle A. Friedler (June 2011), ACM SIGACT News 42 (2): 37–41, doi:10.1145/1998037.1998047 Hayda, Julian (October

Database theory (372 words) [view diff] exact match in snippet view article find links to article

Universality of data retrieval languages. In Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (pp. 110-119)

Graph reduction (583 words) [view diff] exact match in snippet view article find links to article

James H. (1976). A lazy evaluator. POPL '76: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages. ACM Press. pp

Neil Immerman (332 words) [view diff] exact match in snippet view article find links to article

68031{{citation}}: CS1 maint: untitled periodical (link) 1995 Gödel Prize, ACM SIGACT, retrieved 2010-01-23. ACM Fellows Award / Neil Immerman, Association

Low and high hierarchies (172 words) [view diff] exact match in snippet view article find links to article

Jörg Rothe p. 232 Lane A. Hemaspaandra, "Lowness: a yardstick for NP-P", ACM SIGACT News, 1993, vol. 24, no.2, pp. 11-14. doi:10.1145/156063.156064 v t e

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

from THE BOOK (4th edition) by Martin Aigner and Günter M. Ziegler". ACM SIGACT News. 42 (4): 32–37. doi:10.1145/2078162.2078171. ISSN 0163-5700. S2CID 11364231

Value numbering (977 words) [view diff] exact match in snippet view article find links to article

approach to global program optimization". Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '73. pp

Algorithmic Puzzles (341 words) [view diff] exact match in snippet view article find links to article

Gasarch, William (December 2013), "Review of Algorithmic Puzzles" (PDF), ACM SIGACT News, 44 (4): 47–48, doi:10.1145/2556663.2556674 Rosebrock, Stephan, "Review

Search game (585 words) [view diff] case mismatch in snippet view article find links to article

M. Chrobak, A princess swimming in the fog looking for a monster cow, ACM Sigact news, 35(2), 74–78 (2004). MY Kao, JH Reif and SR Tate, Searching in an

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

Nonrecursive Logic Programs with Complex Values", Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '98),

NP-hardness (1,119 words) [view diff] exact match in snippet view article find links to article

OCLC 247934368. Knuth, Donald (1974). "Postscript about NP-hard problems". ACM SIGACT News. 6 (2): 15–16. doi:10.1145/1008304.1008305. S2CID 46480926. Daniel

Judy Green (mathematician) (479 words) [view diff] exact match in snippet view article

american mathematics: the pre-1940 PhD's by Judy Green and Jeanne LaDuke". ACM SIGACT News. 42 (2): 37–41. doi:10.1145/1998037.1998047. ISSN 0163-5700. S2CID 14990095

Erdős number (3,622 words) [view diff] exact match in snippet view article find links to article

merit". ACM SIGACT News. 20 (1): 62–71. doi:10.1145/65780.65782. S2CID 34277380. Tompa, Martin (1990). "Figures of merit: the sequel". ACM SIGACT News.

Marko Petkovšek (306 words) [view diff] exact match in snippet view article find links to article

of A=B 5 by Marko Petkovsek, Herbert S. Wilf, and Doron Zeilberger". ACM SIGACT News. 31 (4). Association for Computing Machinery (ACM): 18–24. doi:10

Asynchrony (game theory) (253 words) [view diff] case mismatch in snippet view article

Distributed computing meets game theory: combining insights from two fields. Acm Sigact News, 42(2), 69–76. Ben-Or, M. (1983). Another Advantage of Free Choice:

Ivan Damgård (413 words) [view diff] exact match in snippet view article find links to article

Retrieved 2010-06-05. "PKC Test-of-Time Award". Retrieved 2023-07-26. "ACM SIGACT - STOC Test of Time Award". sigact.org. Retrieved 2021-10-10. Home page

Ivan Damgård (413 words) [view diff] exact match in snippet view article find links to article

Retrieved 2010-06-05. "PKC Test-of-Time Award". Retrieved 2023-07-26. "ACM SIGACT - STOC Test of Time Award". sigact.org. Retrieved 2021-10-10. Home page

Holyhedron (259 words) [view diff] exact match in snippet view article find links to article

O'Rourke, Joseph (September 1999). "Computational geometry column 37". ACM SIGACT News. 30 (3): 39–42. doi:10.1145/333623.333625. S2CID 9358750. Peterson

International Symposium on Distributed Computing (365 words) [view diff] exact match in snippet view article find links to article

(December 2012). "Distributed Computing Column 48: Annual Review 2012". ACM SIGACT News. 43 (4): 98–100. doi:10.1145/2421119.2421137. EATCS web site: Awards:

Natural proof (767 words) [view diff] no match in snippet view article find links to article

involve, such as properties hard or complete for exponential space. "ACM-SIGACT 2007 Gödel Prize". Archived from the original on 2016-03-03. Retrieved

James H. Morris (453 words) [view diff] case mismatch in snippet view article find links to article

29(3), 184-201. Henderson, P., & Morris, J. H. (1976). A lazy evaluator. ACM Sigact-Sigplan Symposium on Principles of Programming Languages (pp. 95–103)

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

Kempe, David; Henzinger, Monika (eds.). Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June

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

feasibility of consistent, available, partition-tolerant web services". ACM SIGACT News. 33 (2). Association for Computing Machinery (ACM): 51–59. doi:10

Read–modify–write (545 words) [view diff] exact match in snippet view article find links to article

multiplicative power of consensus numbers" (PDF). Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing. Association for

Steven Rudich (430 words) [view diff] no match in snippet view article find links to article

Fortnow, Lance. "Steven Rudich (1961-2024)". Retrieved 2024-11-14. "ACM-SIGACT Awards and Prizes: 2007 Gödel Prize". Archived from the original on 2016-03-03

Eleanor Rieffel (232 words) [view diff] exact match in snippet view article find links to article

(August 2012), "Review", MAA Reviews Sgarbas, Kyriakos N. (June 2013), ACM SIGACT News, 44 (2): 31–35, doi:10.1145/2491533.2491543, MR 3095941,

Bakhadyr Khoussainov (495 words) [view diff] exact match in snippet view article find links to article

pp. 367–392. doi:10.1007/3-540-60178-3_93. ISBN 978-3-540-44720-7. "ACM SIGACT - STOC Best Paper Award". www.sigact.org. Retrieved 2021-02-06. "IPEC

Luca Trevisan (312 words) [view diff] exact match in snippet view article find links to article

Student Paper Award Archived 25 December 2015 at the Wayback Machine, ACM SIGACT, retrieved 8 July 2015. Proceedings of ICM 2006 Archived 7 March 2015

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

for his seminal and influential contributions to efficient algorithms, ACM SIGACT. Volker Strassen at the Mathematics Genealogy Project Konrad-Zuse-Medaille

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

Stephens-Davidowitz, Noah (2017), A reverse Minkowski theorem, Annual ACM SIGACT Symposium on Theory of Computing, Montreal, Quebec, Canada, pp. 941–953

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

(2011-10-14). "Guest column: a casual tour around a circuit complexity bound". ACM SIGACT News. 42 (3): 54–76. doi:10.1145/2034575.2034591. ISSN 0163-5700.

Rebecca Waldecker (305 words) [view diff] exact match in snippet view article find links to article

Mathematical Society Newsletter, no. 438, p. 49 Green, Frederic (June 2016), ACM SIGACT News, 47 (2): 6–9, doi:10.1145/2951860.2951863, S2CID 26146309{{citation}}:

Carsten Lund (585 words) [view diff] exact match in snippet view article find links to article

doi:10.1109/SFCS.1992.267823. Parberry, Ian (2001), 2001 Gödel Prize, ACM SIGACT. Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N.; Rexford, J. (2000)

Ping Zhang (graph theorist) (590 words) [view diff] exact match in snippet view article

CS1 maint: untitled periodical (link) Green, Frederic (December 2016), ACM SIGACT News, 47 (4): 18–21, doi:10.1145/3023855.3023862, S2CID 31121135{{citation}}:

Rebecca N. Wright (307 words) [view diff] no match in snippet view article find links to article

Babai, László; Fortnow, Lance; Sinclair, Alistair (April 28, 2019), 2019 ACM-SIGACT Distinguished Service Award : Rebecca Wright, SIGACT Home page at Rutgers

Anita Burdman Feferman (904 words) [view diff] exact match in snippet view article find links to article

CS1 maint: untitled periodical (link) Lescanne, Pierre (March 2006), ACM SIGACT News, 37 (1): 27, doi:10.1145/1122480.1122489, S2CID 9529607{{citation}}:

Hilary Priestley (282 words) [view diff] exact match in snippet view article find links to article

Lattices and Order: T. S. Blyth, MR1058437, MR1902334; Jonathan Cohen, ACM SIGACT News, doi:10.1145/1233481.1233488; Amy Davidow, Amer. Math. Monthly, JSTOR 2323967;

History of the Actor model (2,771 words) [view diff] exact match in snippet view article find links to article

"Actor induction and meta-evaluation". Proceedings of the 1st annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages – POPL '73. pp

NP-completeness (3,617 words) [view diff] exact match in snippet view article find links to article

A.; Williams, R. (2012). "SIGACT News Complexity Theory Column 76". ACM SIGACT News. 43 (4): 70. doi:10.1145/2421119.2421135. S2CID 13367514. Aaronson

Hermes (programming language) (367 words) [view diff] exact match in snippet view article

"Mechanisms for compile-time enforcement of security". Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '83. pp

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

IACR Fellow". iacr.org. Retrieved 2023-08-27. Chita, Efi. "EATCS and ACM SIGACT present the Gödel Prize 2014 for designing innovative algorithms". EATCS

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

CS1 maint: untitled periodical (link) Nagaraj, S. V. (December 2013), ACM SIGACT News, 44 (4): 27–28, doi:10.1145/2556663.2556667, S2CID 8163160{{citation}}:

Hinged dissection (547 words) [view diff] exact match in snippet view article find links to article

O'Rourke, Joseph (March 2008). "Computational Geometry Column 50" (PDF). ACM SIGACT News. 39 (1). Retrieved 20 December 2013. Frederickson 2002, p.6 Frederickson

Anna Karlin (837 words) [view diff] exact match in snippet view article find links to article

(June 2017), "Review", MAA Reviews Aazami, Amir Babak (December 2018), ACM SIGACT News, 49 (4): 11–12, doi:10.1145/3300150.3300154{{citation}}: CS1 maint:

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

theorem for AC0[] via the coin problem". Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing: 442–453. arXiv:1809.04092. doi:10.1145/3313276

Certain answer (508 words) [view diff] exact match in snippet view article find links to article

and certain answers in general data models (PDF). Proocedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. pp. 59–70.

Empty type (260 words) [view diff] exact match in snippet view article find links to article

"Empty types in polymorphic lambda calculus". Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87. Vol

Kai Salomaa (370 words) [view diff] exact match in snippet view article find links to article

Salomaa, Kai (2014). "Complexity of input-driven pushdown automata". ACM SIGACT News. 45 (2): 47–67. doi:10.1145/2636805.2636821. ISSN 0163-5700. S2CID 16837177

Kai Salomaa (370 words) [view diff] exact match in snippet view article find links to article

Salomaa, Kai (2014). "Complexity of input-driven pushdown automata". ACM SIGACT News. 45 (2): 47–67. doi:10.1145/2636805.2636821. ISSN 0163-5700. S2CID 16837177

Carol Walker (579 words) [view diff] exact match in snippet view article find links to article

Gizem (January 2010), "Review", MAA Reviews Xie, Yulai (August 2012), ACM SIGACT News, 43 (3): 25–27, doi:10.1145/2421096.2421101{{citation}}: CS1 maint:

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

quasipolynomial time [extended abstract]", STOC'16—Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, ACM, New York, pp. 684–697, doi:10.1145/2897518

Real computation (488 words) [view diff] exact match in snippet view article find links to article

hdl:10400.1/1011. Scott Aaronson, NP-complete Problems and Physical Reality, ACM SIGACT News, Vol. 36, No. 1. (March 2005), pp. 30–52. Lenore Blum, Felipe Cucker

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

Curve and Surface Reconstruction: Algorithms with Mathematical Analysis", ACM SIGACT News, 41 (1): 24, doi:10.1145/1753171.1753178, S2CID 22437904 Bihlo, Alexander

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

blockchain. Inverted Forest Publishing. ISBN 978-1-5227-5183-0. Idit Keidar, ACM-SIGACT News Distributed Computing Column, June 2013 Decker, Christian; Wattenhofer

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

Russian). Archived from the original on 2007-12-21. Retrieved 2008-01-15. "ACM-SIGACT Awards and Prizes: 2007 Gödel Prize". "EATCS: Gödel Prize - 2007". Archived

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

time/Space tradeoff for hash tables". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 1284–1297

Lucy Gilbert (287 words) [view diff] exact match in snippet view article find links to article

structure in languages for distributed computing". Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '86. St

Catherine Yan (358 words) [view diff] exact match in snippet view article find links to article

Reviews, Mathematical Association of America Mount, John (June 2010), ACM SIGACT News, 41 (2): 14, doi:10.1145/1814370.1814374, S2CID 33869826{{citation}}:

Even-hole-free graph (727 words) [view diff] exact match in snippet view article find links to article

Kamath, Gautam; Chuzhoy, Julia (eds.), Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22–26

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

Chrobak (2004). "A princess swimming in the fog looking for a monster cow". ACM SIGACT News. 35 (2): 74–78. doi:10.1145/992287.992304. S2CID 8687739. S. Alpern

Data-flow analysis (3,561 words) [view diff] exact match in snippet view article find links to article

to Global Program Optimization" (PDF). Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL). POPL

Dataflow programming (1,616 words) [view diff] exact match in snippet view article find links to article

scale file processing: POGOL". POPL '73: Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages. ACM. pp. 226–234

Amir Ronen (303 words) [view diff] exact match in snippet view article find links to article

Auctions are Hard, (April 29, 2002) On Approximating Optimal Auctions "ACM SIGACT Presents Gödel Prize for Research that Illuminated Effects of Selfish

Martin Fürer (198 words) [view diff] exact match in snippet view article find links to article

and Applied Mathematics (SIAM), pp. 979–1005, doi:10.1137/070711761 "ACM SIGACT - STOC Best Paper Award". Fürer, Martin. "Martin Furer's Home Page". Penn

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

The Complexity of Theorem Proving Procedures, presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory

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

Frontiers in Science and Technology 1985 Microsoft Researcher to Receive ACM SIGACT Knuth Prize Archived 2011-04-29 at the Wayback Machine "Ravindran Kannan"

Georg Gottlob (1,048 words) [view diff] exact match in snippet view article find links to article

revision, updates, and counterfactuals". Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '92.

Time complexity (5,003 words) [view diff] exact match in snippet view article find links to article

parity games in quasipolynomial time". Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery

Robert L. Constable (807 words) [view diff] exact match in snippet view article find links to article

; Johnson, Scott D. (1979). "A PL/CV Precis". Proceedings of the 6th ACM SIGACT–SIGPLAN symposium on Principles of programming languages (POPL '79). Association

Portable C Compiler (1,126 words) [view diff] exact match in snippet view article find links to article

(1978). "A portable compiler: theory and practice". Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. Tucson, Arizona

Primality Testing for Beginners (654 words) [view diff] exact match in snippet view article find links to article

Green, Frederic (June 2016), "Review of Primality Testing for Beginners" (PDF), ACM SIGACT News, 47 (2): 6–9, doi:10.1145/2951860.2951863, S2CID 26146309

Machtey Award (179 words) [view diff] exact match in snippet view article find links to article

science awards Kleene award List of publications by Michael Machtey at DBLP ACM SIGACT. "Danny Lewin Best Student Paper Award" Archived June 20, 2008, at the

Constance Reid (1,577 words) [view diff] exact match in snippet view article find links to article

Reviews of From Zero to Infinity: Belle, Vaishak (June 2011). "Review". ACM SIGACT News. 42 (2): 10–11. doi:10.1145/1998037.1998040. S2CID 36802636. Gibb

Dekker's algorithm (1,063 words) [view diff] exact match in snippet view article find links to article

Alagarsamy, K. (2003). "Some Myths About Famous Mutual Exclusion Algorithms". ACM SIGACT News. 34 (3): 94–103. doi:10.1145/945526.945527. S2CID 7545330.

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

CS1 maint: untitled periodical (link) Tate, Stephen R. (June 1995), ACM SIGACT News, 26 (2): 26–27, doi:10.1145/202840.606473, S2CID 4740448{{citation}}:

FP (programming language) (897 words) [view diff] exact match in snippet view article

Wimmers, IBM Almaden Research Center, Proceedings of the Fifteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, San Diego, CA

Radhia Cousot (932 words) [view diff] exact match in snippet view article find links to article

"Systematic design of program analysis frameworks". Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79. ACM

Yuval Peres (1,140 words) [view diff] exact match in snippet view article find links to article

(June 2017). "Review". MAA Reviews. Aazami, Amir Babak (December 2018). ACM SIGACT News. 49 (4): 11–12. doi:10.1145/3300150.3300154. S2CID 56176729.{{cite

Richard Lipton (1,648 words) [view diff] exact match in snippet view article find links to article

Estimation By Adaptive Sampling", "PODS '90: Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems" Richard J.

Exception handling (1,806 words) [view diff] exact match in snippet view article find links to article

John B. (1975a). Structured exception handling. Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '75. pp

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

classification by overlap to length ratios". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (PDF). pp. 317–330. doi:10.1145/3519935

Daniel Abadi (583 words) [view diff] exact match in snippet view article find links to article

Machinery. Retrieved 2021-04-12. Golab, Wojciech (2018). "Proving PACELC". ACM SIGACT News. 49: 73–81. doi:10.1145/3197406.3197420. S2CID 3989621. Abadi, Daniel

Belief revision (7,935 words) [view diff] exact match in snippet view article find links to article

On the semantics of updates in databases. In Proceedings of the Second ACM SIGACT SIGMOD Symposium on Principles of Database Systems (PODS'83), pages 352–365

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

speedup of sequential machines: a defense of parallel computation thesis". ACM SIGACT News. 18 (1): 54–67. doi:10.1145/8312.8317. Goldschlager, Leslie M. (1982)

Teo Mora (1,432 words) [view diff] exact match in snippet view article find links to article

Gröbner technology by Teo Mora (Cambridge University Press 2005)" (PDF). ACM SIGACT News. 40 (1): 14–17. doi:10.1145/1515698.1515702. S2CID 12448065 – via

Operator-precedence parser (1,839 words) [view diff] exact match in snippet view article find links to article

Vaughan. "Top Down Operator Precedence." Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (1973). Norvell

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

reviewed in O'Rourke, J. (1995), "Computational geometry column 26", ACM SIGACT News, 26 (2): 15–17, arXiv:cs/9908007, doi:10.1145/202840.202842. Erdős

Paris Kanellakis (3,747 words) [view diff] exact match in snippet view article find links to article

(PODC'96). ACM. Dwork, Cynthia (1996). "Distributed computing column". ACM SIGACT News. 27 (3): 50–54. doi:10.1145/235666.235671. S2CID 7482415. Freuder

Tal Rabin (895 words) [view diff] exact match in snippet view article find links to article

Cryptologic Research. "CCC Council". Computing Community Consortium. "ACM SIGACT: People". www.sigact.org. "Journal of Cryptology - Editors". Springer

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

Kamath, Gautam; Chuzhoy, Julia (eds.). Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26

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

(January 1975). "The circuit value problem is log space complete for P". ACM SIGACT News. 7 (101): 18–20. doi:10.1145/990518.990519. O'Donnell, John; Hall

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

Samir; Williams, Virginia Vassilevska (eds.), STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021

María Cecilia Rivara (242 words) [view diff] exact match in snippet view article find links to article

O'Rourke, Joseph (September 1994), "Computational geometry column 23", ACM SIGACT News, 25 (3), Association for Computing Machinery (ACM): 24–27, doi:10

Alice and Bob (2,023 words) [view diff] exact match in snippet view article find links to article

"Coin Flipping by Telephone a Protocol for Solving Impossible Problems". ACM SIGACT News. 15 (1): 23–27. doi:10.1145/1008908.1008911. S2CID 19928725. Blum

Binary recompiler (1,595 words) [view diff] exact match in snippet view article find links to article

to global program optimization" (PDF). Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '73. pp

Hidden linear function problem (653 words) [view diff] exact match in snippet view article find links to article

unbounded fan-in shallow classical circuits". Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Vol. 362. Association for Computing

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

beyond", in Leonardi, Stefano; Gupta, Anupam (eds.), STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, {ACM}

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

(1989-03-29). "Bottom-up beats top-down for datalog". Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '89.

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

similarity-based hierarchical clustering", Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2016), New York, New York: ACM

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

"Separating words and trace reconstruction". Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. STOC 2021. New York, NY, USA: Association

Inline caching (1,570 words) [view diff] exact match in snippet view article find links to article

implementation of the smalltalk-80 system", POPL '84: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, January 1984

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

129–140, doi:10.1145/301250.301287, ISBN 978-1581130676, S2CID 8316937 "ACM SIGACT Presents Gödel Prize for Research that Illuminated Effects of Selfish

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

hashing via nonlinear spectral gaps". Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. STOC 2018. New York, NY, USA: Association

Topic model (2,392 words) [view diff] exact match in snippet view article find links to article

Santosh (1998). "Latent semantic indexing". Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '98.

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

Kneser graphs are Hamiltonian", STOC'18—Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, New York: ACM, pp. 912–919, arXiv:1711

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

(2016). "Do prices coordinate markets?". Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016. p. 440. arXiv:1511.00925

Transitive closure (2,306 words) [view diff] exact match in snippet view article find links to article

(1979). "Universality of data retrieval languages". Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of programming languages - POPL '79. pp

PACELC design principle (1,386 words) [view diff] exact match in snippet view article find links to article

to control the LC tradeoff. Golab, Wojciech (2018). "Proving PACELC". ACM SIGACT News. 49 (1): 73–81. doi:10.1145/3197406.3197420. S2CID 3989621. Abadi

Frank Harary (2,485 words) [view diff] exact match in snippet view article find links to article

Sciences), Cambridge University Press. [1], a biographical sketch at the ACM SIGACT site Frank Harary 1921-2005 - Columbia University Archived November 5

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

approximating densest k-subgraph", STOC'17—Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, ACM, pp. 954–961, arXiv:1611.05991,

Ewin Tang (1,440 words) [view diff] exact match in snippet view article find links to article

algorithm for recommendation systems". Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019. pp. 217–228. arXiv:1807

Michael Genesereth (1,658 words) [view diff] exact match in snippet view article find links to article

"Answering recursive queries using views". Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '97.

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

"Fast FPT-approximation of branchwidth", Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, ACM, pp. 886–899, arXiv:2111.03492,

Lovász local lemma (2,013 words) [view diff] exact match in snippet view article find links to article

prestigious Gödel Prize". ethz.ch. 6 April 2020. Retrieved 2020-04-20. "ACM SIGACT - Gödel Prize". sigact.org. Retrieved 2020-04-20. Spencer, J. (1977).

Just-in-time compilation (3,259 words) [view diff] exact match in snippet view article find links to article

implementation of the smalltalk-80 system" (PDF). Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84. pp

Finite model theory (3,107 words) [view diff] exact match in snippet view article find links to article

a database theoretician". PODS 2009: Proceedings of the twenty-eighth ACM SIGACT–SIGMOD symposium on Principles of database systems. pp. 65–76. doi:10

Quantum secret sharing (3,004 words) [view diff] exact match in snippet view article find links to article

14 December 2021. Wiesner, Stephen (January 1983). "Conjugate coding". ACM SIGACT News. 15 (1): 78–88. doi:10.1145/1008908.1008920. S2CID 207155055. Karlsson

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

Jeannette M. (1987). "Axioms for concurrent objects". Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87. pp

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

1978). "A simplifier based on efficient decision algorithms". Proc. 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages: 141–150. doi:10

Unit fraction (2,984 words) [view diff] exact match in snippet view article find links to article

"SIGACT news online algorithms column 20: The power of harmony" (PDF), ACM SIGACT News, 43 (2): 127–136, doi:10.1145/2261417.2261440, S2CID 14805804 Yang

Universally unique identifier (4,582 words) [view diff] exact match in snippet view article find links to article

internal names in a distributed file system". Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '82. pp

Larch Prover (1,558 words) [view diff] exact match in snippet view article find links to article

with the REVE term rewriting system generator," Proceedings of the 10th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, POPL '83, Austin

Quantum logic (4,045 words) [view diff] exact match in snippet view article find links to article

Papanikolaou, "Reasoning Formally About Quantum Systems: An Overview", ACM SIGACT News, 36(3), 2005. pp. 51–66. arXiv cs/0508005. D. Cohen, An Introduction

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

Peter; Morris, James H. (1976). "A lazy evaluator". Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76. pp

Relational model (4,196 words) [view diff] exact match in snippet view article find links to article

Universality of data retrieval languages. In Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (pp. 110-119)

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

smoothed analysis of the simplex method", Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 390–403, arXiv:1711.05667, doi:10

Quantum complexity theory (3,632 words) [view diff] exact match in snippet view article find links to article

Aaronson, Scott (2005). "NP-complete Problems and Physical Reality". ACM SIGACT News. 2005. arXiv:quant-ph/0502072. Bibcode:2005quant.ph..2072A. See section

Loop dependence analysis (1,968 words) [view diff] exact match in snippet view article find links to article

"Conversion of control dependence to data dependence". Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '83. POPL

Fixed-point logic (2,030 words) [view diff] exact match in snippet view article find links to article

(1979). "Universality of data retrieval languages". Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages - POPL '79. New

Gossip protocol (2,437 words) [view diff] exact match in snippet view article find links to article

gossip based membership protocol". Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '05. p

Vector clock (1,762 words) [view diff] exact match in snippet view article find links to article

availability of data in an unreliable network". Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS '82. p. 70.

Unbounded nondeterminism (2,718 words) [view diff] exact match in snippet view article find links to article

"Actor Induction and Meta-evaluation". Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages. POPL'73. Boston

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

"Information Complexity and the Quest for Interactive Compression". ACM SIGACT News. 46 (2): 41–64. doi:10.1145/2789149.2789161. Retrieved 1 December

Grover's algorithm (4,688 words) [view diff] exact match in snippet view article find links to article

1145/276698.276712. Ambainis, A. (2004-06-01). "Quantum search algorithms". ACM SIGACT News. 35 (2): 22–35. arXiv:quant-ph/0504012. doi:10.1145/992287.992296

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

Neighbor Queries in Fixed Dimensions". Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete Algorithms, 25–27 January 1993, Austin, Texas

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

"Coin flipping by telephone a protocol for solving impossible problems". ACM SIGACT News. 15 (1): 23–27. doi:10.1145/1008908.1008911. ISSN 0163-5700. S2CID 19928725

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

multiplicative power of consensus numbers" (PDF). Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing. Association for

Programming language (7,416 words) [view diff] exact match in snippet view article find links to article

Sebesta 2012, p. 211. Leivant, Daniel (1983). Polymorphic type inference. ACM SIGACT-SIGPLAN symposium on Principles of programming languages. Austin, Texas:

Consensus splitting (5,997 words) [view diff] exact match in snippet view article find links to article

"Consensus halving is PPA-complete". Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. STOC 2018. New York, NY, USA: Association

Static single-assignment form (3,954 words) [view diff] exact match in snippet view article find links to article

control structures in high-level languages". Proceedings of the 13th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages - POPL '86: 70–85

Handshaking lemma (3,598 words) [view diff] exact match in snippet view article find links to article

Kempe, David; Henzinger, Monika (eds.), Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June

IBM Research (4,452 words) [view diff] exact match in snippet view article find links to article

the algebra of non first normal form relations". Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS '82. ACM Press

Expander code (2,562 words) [view diff] exact match in snippet view article find links to article

(September 2004). "Guest column: error-correcting codes and expander graphs". ACM SIGACT News. 35 (3): 25–41. doi:10.1145/1027914.1027924. S2CID 17550280.

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

almost optimal, epsilon-balanced codes", Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 238–251, doi:10.1145/3055399.3055408

Tabulation hashing (2,762 words) [view diff] exact match in snippet view article find links to article

hashing with strong concentration bounds." Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. 2020. Dahlgaard, Søren, et al. "Hashing

Typestate analysis (1,836 words) [view diff] exact match in snippet view article find links to article

"Mechanisms for compile-time enforcement of security". Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '83. pp

Bunched logic (2,856 words) [view diff] exact match in snippet view article find links to article

John (1978). "Syntactic control of interference". Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78. pp

Structure editor (1,190 words) [view diff] exact match in snippet view article find links to article

a device for incremental semantic analysis". Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (POPL). New York

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

(2017-06-19). "Efficient quantum tomography II". Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. ACM. pp. 962–974. doi:10.1145/3055399

Sunflower (mathematics) (2,888 words) [view diff] exact match in snippet view article

"Improved bounds for the sunflower lemma", Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery

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

trees for k-SUM and related problems". Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. pp. 554–563. arXiv:1705.01720. doi:10

Belief propagation (4,323 words) [view diff] exact match in snippet view article find links to article

Algorithms by David J. C. MacKay", Cambridge University Press, 2003". ACM SIGACT News. 37 (4): 34–36. doi:10.1145/1189056.1189063. ISSN 0163-5700. S2CID 10570465

Kakeya set (3,592 words) [view diff] exact match in snippet view article find links to article

Dvir, Zeev (2009). "From Randomness Extraction to Rotating Needles". ACM SIGACT News. ECCC TR09-077.. Besicovitch, Abram (1963). "The Kakeya Problem"

Erdős–Szemerédi theorem (2,727 words) [view diff] exact match in snippet view article find links to article

ISSN 0895-4801. S2CID 207065775. Trevisan, Luca (2009-06-20). "Guest column". ACM SIGACT News. 40 (2): 50–66. doi:10.1145/1556154.1556170. ISSN 0163-5700. S2CID 12566158

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

"Automating cutting planes is NP-hard". Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. pp. 68–77. arXiv:2004.08037. doi:10

Relational algebra (6,354 words) [view diff] exact match in snippet view article find links to article

(1979). "Universality of data retrieval languages". Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages: 110–119. doi:10

Surface tension (8,772 words) [view diff] exact match in snippet view article find links to article

Problems and Physical Reality Archived 2018-02-23 at the Wayback Machine. ACM SIGACT News Gibbs, J.W. (2002) [1876–1878], "On the Equilibrium of Heterogeneous

Steiner tree problem (4,391 words) [view diff] exact match in snippet view article find links to article

(19 June 2017). "Lossy kernelization". Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (PDF). STOC 2017. New York, NY, USA:

Parameterized approximation algorithm (3,354 words) [view diff] exact match in snippet view article find links to article

complexity of approximating dominating set". Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. STOC 2018. New York, NY, USA: Association

Quantum computing (12,420 words) [view diff] exact match in snippet view article find links to article

arXiv:quant-ph/9605043. Ambainis, Ambainis (June 2004). "Quantum search algorithms". ACM SIGACT News. 35 (2): 22–35. arXiv:quant-ph/0504012. Bibcode:2005quant.ph..4012A

Big O notation (8,735 words) [view diff] exact match in snippet view article find links to article

Meertens, Lambert (April 1985). "Big Omega versus the wild functions" (PDF). ACM SIGACT News. 16 (4): 56–59. CiteSeerX 10.1.1.694.3072. doi:10.1145/382242.382835

Association rule learning (6,709 words) [view diff] exact match in snippet view article find links to article

new framework for itemset generation". Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '98.

Knapsack problem (7,799 words) [view diff] exact match in snippet view article find links to article

Algorithms and Why? Lessons from the Stony Brook Algorithm Repository". ACM SIGACT News. 30 (3): 65–74. CiteSeerX 10.1.1.41.8357. doi:10.1145/333623.333627

Actor model (7,144 words) [view diff] exact match in snippet view article find links to article

Russ Atkinson. Synchronization in Actor Systems Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages. 1977 Carl Hewitt

Game theory (15,399 words) [view diff] exact match in snippet view article find links to article

authority for provable rational behavior". Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing. pp. 289–290.

PL/C (4,270 words) [view diff] exact match in snippet view article find links to article

; Johnson, Scott D. (1979). "A PL/CV Precis". Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (POPL '79). Association

Small set expansion hypothesis (1,502 words) [view diff] exact match in snippet view article find links to article

Samir; Williams, Virginia Vassilevska (eds.), STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21–25, 2021

History of compiler construction (6,376 words) [view diff] exact match in snippet view article find links to article

to Global Program Optimization" (PDF). Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL). Boston

Logic programming (10,767 words) [view diff] exact match in snippet view article find links to article

Universality of data retrieval languages. In Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (pp. 110-119)

Belief merging (1,921 words) [view diff] exact match in snippet view article find links to article

Arbitration between old and new information". Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '93.

Rutgers University (16,282 words) [view diff] exact match in snippet view article find links to article

The Norwegian Academy of Science and Letters. Retrieved July 21, 2022. "ACM SIGACT - Gödel Prize". sigact.org. Archived from the original on July 16, 2010

List of academic awards (565 words) [view diff] no match in snippet view article find links to article

December 2017. Call for Nominations for the Prize (2013) Idit Keidar, ACM-SIGACT News Distributed Computing Column, December 2009 [1] "Dan David Prize

Timeline of women in computing (7,026 words) [view diff] exact match in snippet view article find links to article

2018. Retrieved 17 October 2018. Chita, Efi. "Gödel Prize (together with ACM SIGACT)". EATCS. Retrieved 21 May 2019. "Official ACM Turing award website".

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

cake cutting protocol for four agents". Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing – STOC 2016. p. 454. arXiv:1508.05143

Bloom filter (10,780 words) [view diff] exact match in snippet view article find links to article

time/Space tradeoff for hash tables". Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM. pp. 1284–1297

Twin-width (4,077 words) [view diff] exact match in snippet view article find links to article

matrices", in Leonardi, Stefano; Gupta, Anupam (eds.), STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20–24, 2022, Association

Chemical graph generator (5,049 words) [view diff] exact match in snippet view article find links to article

1999). "Combinatorial algorithms: generation, enumeration, and search". ACM SIGACT News. 30 (1): 33–35. doi:10.1145/309739.309744. ISSN 0163-5700. Wikidata Q105033277

Paxos (computer science) (6,819 words) [view diff] exact match in snippet view article

Algorithm. Google TechTalks. Lamport, Leslie (2001). Paxos Made Simple ACM SIGACT News (Distributed Computing Column) 32, 4 (Whole Number 121, December

Source-to-source compiler (9,291 words) [view diff] exact match in snippet view article find links to article

to Global Program Optimization" (PDF). Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL). POPL

White-box cryptography (2,481 words) [view diff] exact match in snippet view article find links to article

obfuscation from well-founded assumptions". Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. pp. 60–73. arXiv:2008.09317. doi:10

Filter and refine (2,042 words) [view diff] exact match in snippet view article find links to article

(1998). An overview of query optimization in relational systems (PDF). ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. Graefe, Goetz

Timeline of quantum computing and communication (22,740 words) [view diff] exact match in snippet view article find links to article

1007/s11047-014-9464-3. Wiesner, Stephen (January 1, 1983). "Conjugate coding". ACM SIGACT News. 15 (1): 78–88. doi:10.1145/1008908.1008920. Wiesner, Stephen. Written

Combinatorial participatory budgeting (8,327 words) [view diff] exact match in snippet view article find links to article

"Approximately stable committee selection". Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. STOC 2020. New York, NY, USA: Association

List of University of California, Berkeley alumni (9,848 words) [view diff] exact match in snippet view article find links to article

Engineering and Computer Sciences, College of Engineer, UC Berkeley. "ACM SIGACT Presents Gödel Prize for Research that Illuminated Effects of Selfish

Exception handling (programming) (6,550 words) [view diff] exact match in snippet view article

John B. (1975a). Structured exception handling. Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '75. pp