|
 | Up a level |
Gupta, N and Saha, C and Thankey, B (2023) Equivalence Test for Read-Once Arithmetic Formulas. In: 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, 22-25 January 2023, Florence, Italy, pp. 4205-4272.
Galvez, W and Khan, A and Mari, M and Mömke, T and Pittu, MR and Wiese, A (2022) A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. In: 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, 9 January 2022 through 12 January 2022, Alexander, pp. 894-905.
Bhattacharyya, C and Kannan, R (2020) Finding a latent k�simplex in O� (k · nnz(data)) time via Subset Smoothing. In: 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, 5-8 January 2020, Salt Lake City; United States, pp. 122-140.
