![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
ACDA 2023: Seattle, WA, USA
- Jonathan W. Berry, David B. Shmoys, Lenore Cowen, Uwe Naumann:
SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2023, Seattle, WA, USA, May 31 - June 2, 2023. SIAM 2023, ISBN 978-1-61197-771-4 - Luca Pascal Staus, Christian Komusiewicz, Nils Morawietz, Frank Sommer:
Exact Algorithms for Group Closeness Centrality. 1-12 - Christian Komusiewicz, Jannis Schramek, Frank Sommer:
On the Group Coverage Centrality Problem: Parameterized Complexity and Heuristics. 13-24 - Jannick Borowitz, Ernestine Großmann, Christian Schulz:
Engineering Fully Dynamic Δ-Orientation Algorithms. 25-37 - Claudius Proissl:
On Improving Contraction Hierarchies Using Distance Group Partitions. 38-48 - Yihao Huang, Shangdi Yu, Julian Shun:
Faster Parallel Exact Density Peaks Clustering. 49-62 - Jonas Charfreitag, Sven Mallach
, Petra Mutzel:
Integer Programming for the Maximum Cut Problem: A Refined Model and Implications for Branching. 63-74 - Lukas Schürmann, Petra Mutzel:
A Reduced Cost-based Model Strengthening Method. 75-86 - Nicholas Schiefer, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal, Tal Wagner:
Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees. 87-97 - Sarah Cannon:
Irreducibility of Recombination Markov Chains in the Triangular Lattice. 98-109 - Zhongzhu Chen, Marcia Fampa, Jon Lee:
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem. 110-118 - Shweta Jain, Yosuke Mizutani
, Blair D. Sullivan:
An Exponentially Smaller Kernel for Exact Weighted Clique Decomposition. 119-133 - Roy Nissim, Oded Schwartz:
Accelerating Distributed Matrix Multiplication with 4-Dimensional Polynomial Codes. 134-146 - Luanzheng Guo
, Jesun Firoz, Gokcen Kestor:
LAHypergraph: Parallel Hypergraph Analytics in the Language of Linear Algebra. 147-158 - Yuki Nishida:
Solving max-plus linear systems by level sparsification. 159-168 - Maryam Fazel, Omid Sadeghi:
Fast First-Order Methods for Monotone Strongly DR-Submodular Maximization. 169-179 - Jingbang Chen, Li Chen, Yang P. Liu, Richard Peng, Arvind Ramaswami:
Exponential Convergence of Sinkhorn Under Regularization Scheduling. 180-188 - Dorit S. Hochbaum, Zhihao Liu, Olivier Goldschmidt:
A Breakpoints Based Method for the Maximum Diversity and Dispersion Problems. 189-200 - Uwe Naumann, Erik Schneidereit, Simon Märtens, Markus Towara:
Elimination Techniques for Algorithmic Differentiation Revisited. 201-212 - Hunter McCoy, Steven A. Hofmeyr, Katherine A. Yelick, Prashant Pandey:
Singleton Sieving: Overcoming the Memory/Speed Trade-Off in Exascale κ-mer Analysis. 213-224 - Jarno N. Alanko
, Simon J. Puglisi
, Jaakko Vuohtoniemi:
Small Searchable κ-Spectra via Subset Rank Queries on the Spectral Burrows-Wheeler Transform. 225-236 - Rigel Galgana, Takehiro Oyakawa, Amy Greenwald:
Computing Boundary Crossing Probabilities of General Empirical Processes. 237-246
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.