Society for Industrial and Applied Mathematics
Publisher
- 2021
- Published
Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model
Jacob, R., Sitchinava, N. & Goodrich, M. T., 14 Jan 2021, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, p. 2141-2153 13 p.Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
- 2020
- Published
Approximately counting and sampling small witnesses using a colourful decision oracle
Dell, H., Lapinskas, J. & Meeks, K., 2020, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. Chawla, S. (ed.). Society for Industrial and Applied Mathematics, p. 2201-2211 11 p.Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
- 2019
- Published
Lower Bounds for Oblivious Data Structures
Jacob, R., Larsen, K. G. & Nielsen, J. B., 6 Jan 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied MathematicsResearch output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
- Published
Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme
Aumüller, M. & Hass, N., 2019, 2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, 14 p.Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
- 2017
- Published
A Framework for Similarity Search with Space-Time Tradeoffs using Locality Sensitive Filtering
Christiani, T. L., 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, p. 31-46Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
- Published
Distance Sensitive Bloom Filters Without False Negatives
Goswami, M., Pagh, R., Silvestri, F. & Sivertsen, J., 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. Society for Industrial and Applied Mathematics, p. 257-269 13 p.Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
- Published
Parameter-free Locality Sensitive Hashing for Spherical Range Reporting
Ahle, T. D., Pagh, R. & Aumüller, M., 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 18 p.Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
- 2016
- Published
Locality-sensitive Hashing without False Negatives
Pagh, R., 2016, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, p. 1-9Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
- 2015
- Published
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce
Ceccarello, M. & Silvestri, F., 5 Jan 2015, Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX). Brandes, U. & Eppstein, D. (eds.). Society for Industrial and Applied Mathematics, p. 119-132Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
- Published
Approximate Range Emptiness in Constant Time and Optimal Space
Goswami, M., Jørgensen, A. G., Larsen, K. G. & Pagh, R., 2015, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, p. 769-775Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review
ID: 256740