Skip to content

ACM/SIAM Symposium on Discrete Algorithms

SODA

A*

CORE rank

CORE rank (raw)

A*

Acceptance rate

32.0% (2024)

Fields of research

Theory of Computation

Papers indexed

4,977

1990–2026

Papers per year

1990243 peak2026

SODA papers

4,977 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
1998Computing Univariate GCDs over Number Fields.Michael B. Monagan, Roger Margot
1998Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries.Peter Bro Miltersen
1998Fast Backtracking Principles Applied to Find New Cages.Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon
1998Analysis of Random Processes via And-Or Tree Evaluation.Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi
1998Matroid Decomposition Methods for the Set Maxima Problem.Vincenzo Liberatore
1998On-line Randomized Call Control Revisited.Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosn
1998Optimal Edge Ranking of Trees in Linear Time.Tak Wah Lam, Fung Ling Yue
1998Computation in Noisy Radio Networks.Eyal Kushilevitz, Yishay Mansour
1998Analysis of a Local Search Heuristic for Facility Location Problems.Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
1998The Power of Migration in Multi-Processor Scheduling of Real-Time Systems.Gilad Koren, Amihood Amir, Emanuel Dar
1998Authoritative Sources in a Hyperlinked Environment.Jon M. Kleinberg
1998On Approximating Rectangle Tiling and Packing.Sanjeev Khanna, S. Muthukrishnan, Mike Paterson
1998Better Random Sampling Algorithms for Flows in Undirected Graphs.David R. Karger
1998Hiding Cliques for Cryptographic Security.Ari Juels, Marcus Peinado
1998A Faster Algorithm for Minimum Cost Submodular Flows.Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
1998Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected.Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
1998Extended Hilbert Irreducibility and its Applications.Ming-Deh A. Huang, Yiu-Chung Wong
1998Two New Upper Bounds for SAT.Edward A. Hirsch
1998On the Distributed Complexity of Computing Maximal Matchings.Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
1998Greedy Strikes Back: Improved Facility Location Algorithms.Sudipto Guha, Samir Khuller
1998Fast Distributed Algorithms for {Brooks-Vizing} Colourings.David A. Grable, Alessandro Panconesi
1998Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control.Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin
1998Exact Arithmetic at Low Cost - A Case Study in Linear Programming.Bernd Grtner
1998A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.Naveen Garg, Goran Konjevod, R. Ravi
1998Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times.Lisa Fleischer
4,4014,425 of 4,977← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.