The Machtey Award is awarded at the annual IEEE Symposium on Foundations of Computer Science (FOCS) to the author(s) of the best student paper(s). A paper qualifies as a student paper if all authors are full-time students at the date of the submission. The award decision is made by the Program Committee.
6-726: The award is named after Michael Machtey, who was a researcher in the theoretical computer science community in the 1970s. The counterpart of this award at the ACM Symposium on Theory of Computing (STOC) is the Danny Lewin Best Student Paper Award . Past recipients of the Machtey award are tabulated below. Daniel Kane (MIT), Paul Valiant (MIT) Piotr Sankowski (Warsaw) T.S. Jayram ( Washington ) Symposium on Theory of Computing The Annual ACM Symposium on Theory of Computing ( STOC )
12-647: Is an academic conference in the field of theoretical computer science . STOC has been organized annually since 1969, typically in May or June; the conference is sponsored by the Association for Computing Machinery special interest group SIGACT . Acceptance rate of STOC, averaged from 1970 to 2012, is 31%, with the rate of 29% in 2012. As Fich (1996) writes, STOC and its annual IEEE counterpart FOCS (the Symposium on Foundations of Computer Science ) are considered
18-577: Is awarded to the author(s) of the best student-only-authored paper in STOC. The award is named in honor of Daniel M. Lewin , an American-Israeli mathematician and entrepreneur who co-founded Internet company Akamai Technologies , and was one of the first victims of the September 11 attacks . STOC was first organised on 5–7 May 1969, in Marina del Rey , California , United States . The conference chairman
24-661: Is presented alternately at STOC and at the International Colloquium on Automata, Languages and Programming (ICALP); the Knuth Prize for outstanding contributions to the foundations of computer science is presented alternately at STOC and at FOCS . Since 2003, STOC has presented one or more Best Paper Awards to recognize papers of the highest quality at the conference. In addition, the Danny Lewin Best Student Paper Award
30-468: The two top conferences in theoretical computer science, considered broadly: they “are forums for some of the best work throughout theory of computing that promote breadth among theory of computing researchers and help to keep the community together.” Johnson (1984) includes regular attendance at STOC and FOCS as one of several defining characteristics of theoretical computer scientists. The Gödel Prize for outstanding papers in theoretical computer science
36-523: Was Patrick C. Fischer , and the program committee consisted of Michael A. Harrison , Robert W. Floyd , Juris Hartmanis , Richard M. Karp , Albert R. Meyer , and Jeffrey D. Ullman . Early seminal papers in STOC include Cook (1971) , which introduced the concept of NP-completeness (see also Cook–Levin theorem ). STOC was organised in Canada in 1992, 1994, 2002, 2008, and 2017 in Greece in 2001, as
#955044