Search references for SYMPOSIUM ON-DISCRETE-ALGORITHMS. Phrases containing SYMPOSIUM ON-DISCRETE-ALGORITHMS
See searches and references containing SYMPOSIUM ON-DISCRETE-ALGORITHMS!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
Symposium on Discrete Algorithms
Symposium_on_Discrete_Algorithms
Computational problem of graph theory
Dimension, Shortest Paths, and Provably Efficient Algorithms". ACM-SIAM Symposium on Discrete Algorithms, pages 782–793, 2010. Abraham, Ittai; Delling, Daniel;
Shortest_path_problem
American computer scientist and mathematician (born 1963)
Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990 (pp. 1-11). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms). Association
David_Eppstein
Academic journal
the journal also invites selected papers from the ACM-SIAM Symposium on Discrete Algorithms (SODA). The journal is abstracted and indexed in the Science
ACM Transactions on Algorithms
ACM_Transactions_on_Algorithms
Abstract data type in computer science
Efficient Priority Queues" (PDF), Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 52–58 Goodrich, Michael T.; Tamassia, Roberto (2004).
Priority_queue
European Symposium on Algorithms SODA – ACM–SIAM Symposium on Discrete Algorithms SWAT and WADS – SWAT and WADS conferences Conferences on computational
List of computer science conferences
List_of_computer_science_conferences
Sequence of operations for a task
perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals
Algorithm
Sequence of locally optimal choices
constraints" (PDF). Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics. doi:10.1137/1
Greedy_algorithm
Discrete Fourier transform algorithm
and Practical Algorithm for Sparse Fourier Transform" (PDF). ACM-SIAM Symposium on Discrete Algorithms. Archived (PDF) from the original on 2012-03-04.
Fast_Fourier_transform
Annual conference series on algorithms
The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically
European Symposium on Algorithms
European_Symposium_on_Algorithms
Hybrid sorting algorithm based on insertion sort and merge sort
ACM-SIAM Symposium on Discrete Algorithms. pp. 467–474. ISBN 0-89871-313-7. "listsort.txt". Python source code. 18 May 2022. Archived from the original on 28
Timsort
Optimization problem in computer science
sieving." Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms (pp. 10-24). Society for Industrial and Applied Mathematics
Nearest_neighbor_search
Association for Computing Machinery (ACM) special interest group
(jointly sponsored by SIGGRAPH), until 2014 SODA: ACM/SIAM Symposium on Discrete Algorithms (jointly sponsored by the Society for Industrial and Applied
ACM_SIGACT
Problem in computer science
Clifford (eds.), Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007
Hidden_shift_problem
Problem in computational complexity theory
Subgraph Counting". Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 459–498. doi:10.1137/1.9781611977073.23. ISBN 978-1-61197-707-3
Online matrix-vector multiplication problem
Online_matrix-vector_multiplication_problem
Algorithm for finding shortest paths
Graph Theory. Proceedings of the Sixteenth Annual ACM–SIAM Symposium on Discrete Algorithms (SODA). Haeupler, Bernhard; Hladík, Richard; Rozhon, Václav;
Dijkstra's_algorithm
Data structure which is efficient to both store in memory and query
multisets". Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms. pp. 233–242. arXiv:0705.0552. CiteSeerX 10.1.1.246.3123. doi:10
Succinct_data_structure
Vector quantization algorithm minimizing the sum of squared deviations
Seeding" (PDF). Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA): 1027–1035. Bahmani, Bahman; Moseley, Benjamin; Vattani
K-means_clustering
Self-adjusting binary search tree
Kenneth L. (ed.). Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 22–24 January 1995. San Francisco, California, USA. ACM/SIAM
Splay_tree
Computational complexity class
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
Quasi-polynomial_time
OV in complexity theory
of the Polynomial Method to Algorithm Design", Proceedings of the 2015 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings, Society
Orthogonal_vectors_problem
Path structure in mathematical trees
graph views", Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 2000), New York: ACM, pp. 566–575, MR 1755515
Heavy-light_decomposition
(almost) linear time algorithm for odd cycles transversal", Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia,
Odd_cycle_transversal
Graph without triples of adjacent vertices
query algorithms for triangle finding and associativity testing", Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA
Triangle-free_graph
Problem of computing shortest paths around geometric obstacles
Euclidean shortest path queries in the plane", Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), Association for Computing Machinery, pp. 215–224
Euclidean_shortest_path
NP-hard problem in combinatorial optimization
Exponential-Time Dynamic Programming Algorithms". Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 1783–1793. doi:10.1137/1
Travelling_salesman_problem
American computer scientist
Ph.D., he went on to work at Google and co-founded Tokutek. He was program chair of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003). The
Martin_Farach-Colton
Graph able to be embedded on a torus
toroidality testing", Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery, pp. 574–580, ISBN 978-0-89871-390-9
Toroidal_graph
Graphs in Linear Time". Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 589–605. doi:10.1137/1.9781611975482.37. Wagner
Laminar_set_family
matching" (PDF), Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, New York: ACM, pp. 468–485, MR 3205231 Kapralov, Michael (2013)
Ruzsa–Szemerédi_problem
Mathematical and computational problem
produced with sophisticated algorithms. In addition, many approximation algorithms exist. For example, the first fit algorithm provides a fast but often
Bin_packing_problem
Directed graph with no directed cycles
acyclic graphs", Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '01), Philadelphia, PA, USA: Society for Industrial and
Directed_acyclic_graph
Estimate of time taken for running an algorithm
N. (ed.). Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19
Time_complexity
Algorithm to multiply matrices
central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms efficient. Applications of matrix
Matrix multiplication algorithm
Matrix_multiplication_algorithm
Optimization problem in computer science
Exponential Time Algorithms for the Shortest Vector Problem". Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '10. Philadelphia
Lattice_problem
"On the bidirected cut relaxation for the metric Steiner tree problem", Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp
Quasi-bipartite_graph
Well-spaced set of points in a metric space
"Navigating nets: simple algorithms for proximity search", Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '04), Philadelphia
Delone_set
Subfield of computer science and mathematics
Group on Algorithms and Computation Theory (SIGACT) provides the following description: TCS covers a wide variety of topics including algorithms, data
Theoretical_computer_science
Methodic assignment of colors to elements of a graph
G-colourable graphs", Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1426–1435 {{citation}}: templatestyles stripmarker in
Graph_coloring
Algorithmic runtime requirements for matrix multiplication
be performed. Matrix multiplication algorithms are a central subroutine in theoretical and numerical algorithms for numerical linear algebra and optimization
Computational complexity of matrix multiplication
Computational_complexity_of_matrix_multiplication
Theorem about origami
flat origami", Proceedings of the Seventh Annual ACM–SIAM Symposium on Discrete Algorithms (Atlanta, GA, 1996), New York: ACM, pp. 175–183, MR 1381938
Big-little-big_lemma
flat origami". Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Atlanta, GA, 1996). ACM, New York. pp. 175–183. MR 1381938
Mathematics_of_paper_folding
American computer scientist and educator
weighted graphs". Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. pp. 3089–3139
Satish_B._Rao
Unrelated vertices in graphs
in polynomial time", SODA (Symposium on Discrete Algorithms): 570–581. Luby, Michael (1986), "A simple parallel algorithm for the maximal independent
Independent set (graph theory)
Independent_set_(graph_theory)
Least-weight tree connecting graph vertices
tree, parallel connectivity, and set maxima algorithms", Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), San Francisco, California, pp
Minimum_spanning_tree
Concept in computational geometry
3-Approximation Algorithm for Maximum Independent Set of Rectangles", Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings
Maximum_disjoint_set
Graph coloring with an allowed number of same-color neighbors
Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, Louisiana, United States, January 05–07, 1997). Symposium on Discrete Algorithms. Society for
Defective_coloring
Graph drawing with vertices in horizontal layers
"Approximation algorithms for the maximum acyclic subgraph problem", Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA'90), pp. 236–243
Layered_graph_drawing
Field of study of computational systems
Computer Science) European Symposium on Algorithms Fundamenta Informaticae Symposium on Discrete Algorithms Journal of Logic and Computation Bioinformatics
Informatics
Graph theory problem
ancestors with linking. Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434–443. Duan, R.; Pettie, S. (2014). Linear-time approximation
Maximum-weight_matching
Algorithm for shuffling a finite sequence
Parallel". Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics:
Fisher–Yates_shuffle
Canadian computer scientist
straight cut suffice", Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '99), pp. 891–892. Faculty profile Archived 2013-07-22
Anna_Lubiw
Technique used in signal processing and data compression
; Winograd, S. (September 1992b). "Fast algorithms for the discrete cosine transform". IEEE Transactions on Signal Processing. 40 (9): 2174–2193. Bibcode:1992ITSP
Discrete_cosine_transform
Type of optimization problem
Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 2564–2583. doi:10
Chore_division
Algorithm to be run on quantum computers
access to the gate. The algorithm is frequently used as a subroutine in other algorithms. Shor's algorithm solves the discrete logarithm problem and the
Quantum_algorithm
Competitive randomized algorithms for non-uniform problems. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA
Ski_rental_problem
Graph data structure
(1999). "I/O-complexity of Graph Algorithms". Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '99. Philadelphia, PA, USA:
Edge_list
Succinct data structure
entropy-compressed text indexes, Proceedings of the 14th Annual SIAM/ACM Symposium on Discrete Algorithms (SODA), January 2003, 841-850. P. Ferragina, R. Giancarlo,
Wavelet_Tree
Analysis of datasets using techniques from topology
Dmitriy (2009). Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 1011–20. CiteSeerX 10.1.1.179.3236. doi:10.1137/1.9781611973068
Topological_data_analysis
Fairness notion in fair item allocation
Valuations". Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics
Envy-freeness_up_to_any_item
Longest distance between two vertices
approximation algorithms for the graph diameter", in Chekuri, Chandra (ed.), Proceedings of the Twenty-Fifth Annual ACM–SIAM Symposium on Discrete Algorithms, SODA
Diameter_(graph_theory)
Data structure for approximate set membership
lookup tables", Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (PDF), pp. 30–39 Cohen, Saar; Matias, Yossi (2003), "Spectral
Bloom_filter
Economical computational problem
Allocation of a Mixed Manna", Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings, Society for Industrial and Applied Mathematics
Market equilibrium computation
Market_equilibrium_computation
Reconstruction of binary images from a small number of their projections
accurate reconstructions can be made by many different algorithms. It is typical for discrete tomography that only a few projections (line sums) are used
Discrete_tomography
Fair item allocation problem
maximize fairness". Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '08. San Francisco, California: Society for Industrial
Egalitarian_item_allocation
Mathematical version of an order change
sigma-tau problem". Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. New Orleans, Louisiana: Society for Industrial
Permutation
Assigning directions to the edges of an undirected graph
transitive orientation", 8th ACM-SIAM Symposium on Discrete Algorithms, pp. 19–25. Mihail, M.; Winkler, P. (1996), "On the number of Eulerian orientations
Orientation_(graph_theory)
Computer science data structure
Efficient Priority Queues" (PDF), Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 52–58 Goodrich, Michael T.; Tamassia, Roberto (2004).
Heap_(data_structure)
Subpermutation of a longer permutation
linear time". Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms: 20. arXiv:1307.3073. doi:10.1137/1.9781611973402.7. ISBN 978-1-61197-338-9
Permutation_pattern
Ratio in Mathematical Optimization
Optimization". Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. p. 1087. arXiv:0902.1792. doi:10.1137/1.9781611973075.88.
Correlation_gap
Probabilistic data structure
skip lists" (PDF). Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms (SODA '92). Orlando, Florida, USA: Society for Industrial and
Skip_list
Topics referred to by the same term
architecture Soda PDF, a family of applications used on .pdf files Symposium on Discrete Algorithms, an annual academic conference in computer science Czech
Soda_(disambiguation)
Tree data structure
and algorithms for nearest neighbor search in general metric spaces". Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms. Society
Metric_tree
Problem of finding the longest simple path for a given graph
Fenghui (2007), "Improved algorithms for path, matching, and packing problems", Proc. 18th ACM-SIAM Symposium on Discrete algorithms (SODA '07) (PDF), pp. 298–307
Longest_path_problem
Theorem about infinite graphs
"Bidimensionality: new connections between FPT algorithms and PTASs", Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA) (PDF), pp. 590–601, MR 2298309
Halin's_grid_theorem
Optimization problem
annual ACM-SIAM symposium on Discrete algorithms. Symposium on Discrete Algorithms archive. pp. 463–472. Fleischer, Rudolf (2000). Algorithms – ESA 2000.
Job-shop_scheduling
American mathematician
using coherent configurations". Proc. 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM. pp. 1074–1087. arXiv:1207.6528. doi:10.1137/1
Henry_Cohn
Graph of king moves on a chessboard
quadrangulations", Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '02), pp. 346–355, CiteSeerX 10.1.1.1.7694, ISBN 0-89871-513-X
King's_graph
"Bidimensionality: new connections between FPT algorithms and PTASs", 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 590–601. Demaine, Erik
Bidimensionality
Independent set which is not a subset of any other independent set
"Algorithms for k-colouring and finding maximal independent sets", Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Soda
Maximal_independent_set
Computational problem in graph theory
maximum flow algorithm". In Frederickson, Greg N. (ed.). Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January
Maximum_flow_problem
Maximal subgraph whose vertices can reach each other
Sanjeev (ed.), Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013
Component_(graph_theory)
Any shape with straight sides can be cut from a single sheet of folded paper with one cut
straight cut suffice", Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '99), Association for Computing Machinery, pp. 891–892
Fold-and-cut_theorem
clustered planarity, and thickenability", Proc. 31st ACM-SIAM Symposium on Discrete Algorithms, pp. 2876–2895, arXiv:1907.13086, doi:10.1137/1.9781611975994
Clustered_planarity
Japanese computer scientist (born 1940)
Society for Mathematical Sciences. In 2004, the International Symposium on Discrete Algorithms and Optimization in Kyoto was held in honor of Ibaraki's retirement
Toshihide_Ibaraki
Any planar graph can be subdivided by removing a few vertices
deterministic near-linear time algorithm for finding minimum cuts in planar graphs", Proc. 15th ACM–SIAM Symposium on Discrete Algorithms (SODA'04), pp. 828–829
Planar_separator_theorem
Polygonal region of all points visible from a given point in a plane
The robot localization problem in two dimensions. ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics. Liow, Nicklaus
Visibility_polygon
Quantum algorithm for integer factorization
to the factoring algorithm, but may refer to any of the three algorithms. The discrete logarithm algorithm and the factoring algorithm are instances of
Shor's_algorithm
Graph path which is an induced subgraph
D.; Palios, Leonidas (2004). "Hole and antihole detection in graphs". Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms. pp. 850–859.
Induced_path
and more", Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, Pennsylvania: SIAM, pp. 1557–1576, MR 3202998
Induced_matching
Geometric graph with unit edge lengths
(Seffi); Buchbinder, Niv (eds.), Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January
Unit_distance_graph
Academic conference in the field of theoretical computer science
The International Symposium on Algorithms and Computation (ISAAC) is an academic conference in the field of algorithms and theoretical computer science
International Symposium on Algorithms and Computation
International_Symposium_on_Algorithms_and_Computation
Decision problem in computer science
N. (ed.). Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017). SIAM. pp. 1073–1084. arXiv:1610.04712. doi:10
Subset_sum_problem
Description of flat one-vertex origami
(1996), "The complexity of flat origami", Proc. 7th ACM-SIAM Symposium on Discrete algorithms (SODA '96), pp. 175–183, ISBN 9780898713664. Kawasaki, Toshikazu
Kawasaki's_theorem
Utility function used in economic equations
Valuations", Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, pp. 2326–2340
Budget-additive_valuation
Method of graph decomposition
second-order logic", Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10), Association for Computing Machinery, pp. 354–364
Bramble_(graph_theory)
Mathematical result
published in the Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012. Esteve, Anna; Boj, Eva; Fortiana, Josep (2009), "Interaction
Johnson–Lindenstrauss_lemma
Graph containing no induced cycles with an even number of nodes
"A Faster Algorithm to Recognize Even-Hole-Free Graphs", Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1286–1297
Even-hole-free_graph
Concept in quantum mathematics
Raphaël (2017). "Dynamic Algorithms for Graph Coloring". Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 1–20. arXiv:1711
Quantum_random_circuits
Compressed data structure for pattern matching
SIAM/ACM Symposium on Discrete Algorithms, January 2003, 841–850. K. Sadakane, Compressed Text Databases with Efficient Query Algorithms Based on the Compressed
Compressed_suffix_array
SYMPOSIUM ON-DISCRETE-ALGORITHMS
SYMPOSIUM ON-DISCRETE-ALGORITHMS
SYMPOSIUM ON-DISCRETE-ALGORITHMS
SYMPOSIUM ON-DISCRETE-ALGORITHMS
SYMPOSIUM ON-DISCRETE-ALGORITHMS
SYMPOSIUM ON-DISCRETE-ALGORITHMS
SYMPOSIUM ON-DISCRETE-ALGORITHMS
SYMPOSIUM ON-DISCRETE-ALGORITHMS
SYMPOSIUM ON-DISCRETE-ALGORITHMS