• Symposium on Discrete Algorithms
    The Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) is an academic conference in the fields of algorithm design and discrete mathematics. It is...
    5 KB (196 words) - 04:42, 22 May 2024
  • Thumbnail for Shortest path problem
    Shortest path problem (redirect from Shortest path algorithms)
    Dimension, Shortest Paths, and Provably Efficient Algorithms". ACM-SIAM Symposium on Discrete Algorithms, pages 782–793, 2010. Abraham, Ittai; Delling, Daniel;...
    40 KB (4,020 words) - 09:27, 2 September 2024
  • Thumbnail for Fast Fourier transform
    Fast Fourier transform (redirect from Arithmetic complexity of the discrete Fourier transform)
    and Practical Algorithm for Sparse Fourier Transform" (PDF). ACM-SIAM Symposium on Discrete Algorithms. Archived (PDF) from the original on 2012-03-04....
    63 KB (7,383 words) - 16:01, 26 August 2024
  • Thumbnail for Greedy algorithm
    Greedy algorithm
    branch-and-bound algorithm. There are a few variations to the greedy algorithm: Pure greedy algorithms Orthogonal greedy algorithms Relaxed greedy algorithms Greedy...
    16 KB (1,778 words) - 17:37, 3 July 2024
  • Nearest neighbor search (redirect from Approximation algorithms for nearest-neighbor search)
    sieving." Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms (pp. 10-24). Society for Industrial and Applied Mathematics...
    27 KB (3,341 words) - 11:34, 22 August 2024
  • Thumbnail for Component (graph theory)
    Component (graph theory) (section Algorithms)
    Sanjeev (ed.), Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013...
    30 KB (3,441 words) - 12:55, 5 July 2024
  • Thumbnail for Graph coloring
    Graph coloring (redirect from Algorithms for graph coloring)
    G-colourable graphs", Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1426–1435 Yates, F. (1937), The design and analysis of...
    67 KB (7,996 words) - 16:56, 29 August 2024
  • Priority queue (section Discrete event simulation)
    Efficient Priority Queues" (PDF), Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 52–58 Goodrich, Michael T.; Tamassia, Roberto (2004)....
    32 KB (4,891 words) - 10:57, 17 August 2024
  • Thumbnail for Minimum spanning tree
    Minimum spanning tree (redirect from Parallel algorithms for the minimum spanning tree problem)
    tree, parallel connectivity, and set maxima algorithms", Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), San Francisco, California, pp...
    44 KB (5,460 words) - 11:42, 17 August 2024
  • Quasi-polynomial time (category Analysis of algorithms)
    Chawla, Shuchi (ed.), Proceedings of the 31st Annual ACM–SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5–8, 2020, pp...
    11 KB (1,088 words) - 14:14, 29 July 2024