hashed in constant time, Proc. 22nd ACM Symposium on Theory of Computing（英语：Symposium on Theory of Computing）: 244–253, 1990, doi:10.1145/100216.100247

哥德尔奖

哥德爾獎於1993年開始在STOC（ACM計算理論研討會（英语：Symposium on Theory of Computing），北美理論計算機科學的主要會議之一）或ICALP（自動機、語言和編程國際座談會（英语：International Colloquium on Automata, Languages and

容错学习问题

vector problem: extended abstract,” in Proceedings of the 41st annual ACM symposium on Theory of computing (Bethesda, MD, USA: ACM, 2009), 333-342, http://portal

扩展图

E., An O(n log n) sorting network, Proceedings of the 15th Annual ACM Symposium on Theory of Computing: 1–9, 1983, ISBN 0-89791-099-0, doi:10.1145/800061

庫克-李文定理

Stephen. The complexity of theorem proving procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing. 1971: 151–158 [2011-07-20]

Found in articles

元素唯一性问题

hashed in constant time, Proc. 22nd ACM Symposium on Theory of Computing（英语：Symposium on Theory of Computing）: 244–253, 1990, doi:10.1145/100216.100247

哥德尔奖

容错学习问题

vector problem: extended abstract,” in Proceedings of the 41st annual ACM symposium on Theory of computing (Bethesda, MD, USA: ACM, 2009), 333-342, http://portal

扩展图

E., An O(n log n) sorting network, Proceedings of the 15th Annual ACM Symposium on Theory of Computing: 1–9, 1983, ISBN 0-89791-099-0, doi:10.1145/800061

庫克-李文定理

Stephen. The complexity of theorem proving procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing. 1971: 151–158 [2011-07-20]