• Symposium on Theory of Computing
    The Annual ACM Symposium on Theory of Computing (STOC) is an academic conference in the field of theoretical computer science. STOC has been organized...
    12 KB (1,162 words) - 18:57, 13 December 2023
  • Symposium on Foundations of Computer Science
    FOCS and its annual Association for Computing Machinery counterpart STOC (the Symposium on Theory of Computing) are considered the two top conferences...
    13 KB (534 words) - 16:55, 14 April 2024
  • Lattice problem
    most lattice problems based on voronoi cell computations". Proceedings of the forty-second ACM symposium on Theory of computing. STOC '10. New York, NY,...
    28 KB (3,660 words) - 20:46, 21 April 2024
  • Computational learning theory
    Cryptographic limitations on learning boolean formulae and finite automata. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 433–444...
    8 KB (845 words) - 12:01, 9 June 2024
  • Matching (graph theory)
    "An optimal algorithm for on-line bipartite matching" (PDF). Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC 1990). pp. 352–358...
    23 KB (2,938 words) - 20:01, 24 May 2024
  • SIAM Journal on Computing
    of the IEEE Annual Symposium on Foundations of Computer Science (FOCS) and the Annual ACM Symposium on Theory of Computing (STOC), where about 15% of...
    2 KB (154 words) - 17:03, 2 May 2024
  • Algorithmic game theory
    "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...
    13 KB (1,416 words) - 18:24, 13 June 2024
  • Verifiable computing
    Verifiable computing (or verified computation or verified computing) enables a computer to offload the computation of some function, to other perhaps untrusted...
    14 KB (1,887 words) - 03:39, 2 January 2024
  • Locality-sensitive hashing (redirect from Applications of locality-sensitive hashing)
    Neighbors: Towards Removing the Curse of Dimensionality.". Proceedings of 30th Symposium on Theory of Computing. Charikar, Moses S. (2002). "Similarity...
    30 KB (4,013 words) - 13:50, 25 June 2024
  • Parameterized approximation algorithm (section Talks on parameterized approximations)
    inapproximability". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. STOC '03. New York, NY, USA: Association for Computing Machinery. pp. 585–594...
    27 KB (3,226 words) - 06:31, 21 June 2024