


default search action
3rd ACDA 2025: Montreal, QC, Canada
- Alex Conway, Alex Pothen, Martin Farach-Colton, Bora Uçar:

Proceedings of the 3rd Conference on Applied and Computational Discrete Algorithms, ACDA 2025, Montreal, Quebec, Canada, July 30 - August 1, 2025. SIAM 2025, ISBN 978-1-61197-875-9 - Shangdi Yu, Joshua Engels, Yihao Huang, Julian Shun:

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search. 1-17 - Christian Schulz, Henning Woydt:

Shared-Memory Hierarchical Process Mapping. 18-31 - Vivek Bharadwaj, Austin Glover, Aydin Buluç, James Demmel:

An Efficient Sparse Kernel Generator for O(3)-Equivariant Deep Networks. 32-46 - Erik Mårtensson, Paul Stankovski Wagner:

The Number of the Beast: Reducing Additions in Fast Matrix Multiplication Algorithms for Dimensions up to 666. 47-60 - Matthias Bentert, Daniel Coimbra Salomao, Alex Crane, Yosuke Mizutani, Felix Reidl, Blair D. Sullivan:

A Space-Efficient Algebraic Approach to Robotic Motion Planning. 61-73 - Adil Chhabra, Florian Kurpicz, Christian Schulz, Dominik Schweisgut, Daniel Seemaier:

Partitioning Trillion Edge Graphs on Edge Devices. 74-89 - Simon Märtens, Uwe Naumann:

Scheduled Jacobian Chaining. 90-100 - Yuvaraj Chesetti, Prashant Pandey:

Evaluating Learned Indexes for External Memory Joins. 101-114 - Michael A. Bender, Martín Farach-Colton, Riko Jacob, Hanna Komlós, David Tench, Evan T. West:

The Case for External Graph Sketching. 115-129 - David Eppstein, Ofek Gila, Michael T. Goodrich, Ryuto Kitagawa:

Zip-Tries: Simple Dynamic Data Structures for Strings. 130-143 - Roy Nissim, Oded Schwartz, Yuval Spiizer:

Minimizing the Division Factor of Toom-Cook Algorithms. 144-154 - Ernestine Großmann, Kenneth Langedal, Christian Schulz:

Accelerating Reductions Using Graph Neural Networks for the Maximum Weight Independent Set Problem. 155-168 - Rita Safi, Raphaël Payen, Yezekael Hayel, Alix Dupont, Tania Jiménez:

Smart charging and optimization of personalized flexibility services for electric vehicles's users. 169-181 - Aditya Pillai, Gabriel Ponte, Marcia Fampa, Jon Lee, Mohit Singh, Weijun Xie:

Computing Experiment-Constrained D-Optimal Designs. 182-195 - Torsten Bosse, H. Martin Bücker:

Algorithmic Differentiation and Vertex Elimination on Computational Hypergraphs. 196-207 - H. Martin Bücker, Christian Komusiewicz, Jurek Rostalsky:

Heuristic Graph Colouring using Hypergraph Representations. 208-221 - Robert Krause, Lars Gottesbüren, Nikolai Maas:

Deterministic Parallel High-Quality Hypergraph Partitioning. 222-236 - Lukas Berner, Felix L. Heitmann, Henning Meyerhenke:

Optimization of Infrastructure Network Maintenance: Complexity, Exact Solutions, and a Greedy Heuristic. 237-250 - Aaron Schild, Sreenivas Gollapudi, Anupam Gupta, Kostas Kollias, Ali Kemal Sinop:

Why is My Route Different Today? An Algorithm for Explaining Route Selection. 251-263 - Daniel Brous, David Shmoys:

Optimizing Districting Plans to Maximize Majority-Minority Districts via IPs and Local Search. 264-275 - Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Yimin Zhu:

Speeding up Stencil Computation using Gaussian Approximations. 276-292 - Xiangyun Ding, Yan Gu, Yihan Sun:

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications. 293-307 - Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala:

Online Distributed Queue Length Estimation. 308-321 - Olga Holtz, Abraham Hsu, Yoav Moran, Oded Schwartz, Gal Wiernik:

Alternative Bases for New Fast Matrix Multiplication Algorithms. 322-334

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














