default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACDA 2021
- Michael Bender, John Gilbert, Bruce Hendrickson, Blair D. Sullivan:
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2021, Virtual Conference, July 19-21, 2021. SIAM 2021, ISBN 978-1-61197-683-0 - Michael Mitzenmacher:
Queues with Small Advice. 1-12 - Stéphane Chrétien, Oya Ekin Karasan, Ecenur Oguz, Mustafa Ç. Pinar:
The Quantile Matching Problem and Point Cloud Registration. 13-20 - Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu
:
Using Predicted Weights for Ad Delivery. 21-31 - Eugenio Angriman, Henning Meyerhenke, Christian Schulz, Bora Uçar:
Fully-dynamic Weighted Matching Approximation in Practice. 32-44 - S. M. Ferdous, Alex Pothen, Arif Khan, Ajay Panyala, Mahantesh Halappanavar:
A Parallel Approximation Algorithm for Maximizing Submodular b-Matching. 45-56 - Shaojie Tang, Jing Yuan:
Non-monotone Adaptive Submodular Meta-Learning. 57-65 - Rameshwar Pratap, Bhisham Dev Verma, Raghav Kulkarni:
Improving Tug-of-War sketch using Control-Variates method. 66-76 - Claudius Proissl, Tobias Rupp:
On the Difference between Search Space Size and Query Complexity in Contraction Hierarchies. 77-87 - Wes Gurnee, David B. Shmoys:
Fairmandering: A column generation heuristic for fairness-optimized political districting. 88-99 - Monika Henzinger, Alexander Noe, Christian Schulz:
Faster Parallel Multiterminal Cuts. 100-110 - Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan:
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. 111-122 - Giulia Guidi, Marquita Ellis, Daniel Rokhsar, Katherine A. Yelick, Aydin Buluç:
BELLA: Berkeley Efficient Long-Read to Long-Read Aligner and Overlapper. 123-134 - Jessica Shi, Laxman Dhulipala, Julian Shun:
Parallel Clique Counting and Peeling Algorithms. 135-146 - Nan Ding, Yang Liu, Samuel Williams, Xiaoye S. Li:
A Message-Driven, Multi-GPU Parallel Sparse Triangular Solver. 147-159 - Rigel Galgana, Cengke Shi, Amy Greenwald, Takehiro Oyakawa:
A Dynamic Program for Computing the Joint Cumulative Distribution Function of Order Statistics. 160-170 - Torsten Bosse, Ralf Seidler, H. Martin Bücker:
Efficient signed backward substitution for piecewise affine functions via path problems in a directed acyclic graph. 171-181 - Helen Xu, Sean Fraser, Charles E. Leiserson:
Multidimensional Included and Excluded Sums. 182-192 - Shruti Shivakumar, Jiajia Li, Ramakrishnan Kannan, Srinivas Aluru:
Efficient Parallel Sparse Symmetric Tucker Decomposition for High-Order Tensors. 193-204 - Majid Farhadi, Alejandro Toriello, Prasad Tetali:
The Traveling Firefighter Problem. 205-216 - Jurek Czyzowicz, Ryan Killick, Evangelos Kranakis, Grzegorz Stachowiak:
Search and evacuation with a near majority of faulty agents. 217-227 - Juan Carlos Martínez Mori, Samitha Samaranayake:
On the Request-Trip-Vehicle Assignment Problem. 228-239
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.
last updated on 2024-09-18 00:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
