Image de couverture de livre

Improved parallel derandomization via finite automata with applications

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Giliberti, Jeff, Harris, David G.
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Massively Parallel Ruling Set Made Deterministic
par: Giliberti, Jeff, et autres
Publié: (2024)

Simple parallel estimation of the partition ratio for Gibbs distributions
par: Harris, David G., et autres
Publié: (2025)

Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond
par: Banihashem, Kiarash, et autres
Publié: (2025)

Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication
par: Harris, David G.
Publié: (2021)

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
par: Harris, David G.
Publié: (2023)

Graph-Based Nearest-Neighbor Search without the Spread
par: Giliberti, Jeff, et autres
Publié: (2026)

Engineering faster double-array Aho-Corasick automata
par: Kanda, Shunsuke, et autres
Publié: (2022)

Simple and efficient four-cycle counting on sparse graphs
par: Burkhardt, Paul, et autres
Publié: (2023)

Adversarially Robust Approximate Furthest Neighbor
par: Banihashem, Kiarash, et autres
Publié: (2026)

Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing
par: Diaz-Dominguez, Diego
Publié: (2024)

The adaptive complexity of parallelized log-concave sampling
par: Zhou, Huanjian, et autres
Publié: (2024)

A faster algorithm for Vertex Cover parameterized by solution size
par: Harris, David G., et autres
Publié: (2022)

Dependent randomized rounding for clustering and partition systems with knapsack constraints
par: Harris, David G., et autres
Publié: (2017)

A framework for boosting matching approximation: parallel, distributed, and dynamic
par: Mitrović, Slobodan, et autres
Publié: (2025)

Near-Optimal Parallel Approximate Counting via Sampling
par: Harris, David G., et autres
Publié: (2026)

A new notion of commutativity for the algorithmic Lovász Local Lemma
par: Harris, David G., et autres
Publié: (2020)

Stochastic Optimization and Learning for Two-Stage Supplier Problems
par: Brubach, Brian, et autres
Publié: (2020)

Sum-of-Squares Lower Bounds for Independent Set in Ultra-Sparse Random Graphs
par: Kothari, Pravesh, et autres
Publié: (2024)

Improved linearly ordered colorings of hypergraphs via SDP rounding
par: Louis, Anand, et autres
Publié: (2024)

Sparse Graph Reconstruction and Seriation for Large-Scale Image Stacks
par: Yang, Fuming, et autres
Publié: (2025)

Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
par: Mahabadi, Sepideh, et autres
Publié: (2024)

Sequential Testing with Subadditive Costs
par: Harris, Blake, et autres
Publié: (2025)

Improved Lower Bounds for Privacy under Continual Release
par: Aryanfard, Bardiya, et autres
Publié: (2025)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
par: Assadi, Sepehr, et autres
Publié: (2024)

Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
par: Mitrović, Slobodan, et autres
Publié: (2026)

A faster algorithm for the construction of optimal factoring automata
par: Erlebach, Thomas, et autres
Publié: (2024)

Scalable Algorithms for Approximate DNF Model Counting
par: Burkhardt, Paul, et autres
Publié: (2026)

Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices
par: Kothari, Pravesh K., et autres
Publié: (2025)

Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
par: Kiefer, Stefan, et autres
Publié: (2025)

Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants
par: Kanellopoulos, Sotiris, et autres
Publié: (2026)

Optimal prefix-suffix queries with applications
par: Pissis, Solon P.
Publié: (2024)

New approximate distance oracles and their applications
par: Kadria, Avi, et autres
Publié: (2025)

Improved Online Sorting
par: Nirjhor, Jubayer, et autres
Publié: (2025)

Improving Order with Queues
par: Karrenbauer, Andreas, et autres
Publié: (2022)

Course Allocation with Credits via Stable Matching
par: Rodríguez, José, et autres
Publié: (2025)

Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General
par: Shmoys, David, et autres
Publié: (2026)

Online matching games in bipartite expanders and applications
par: Bauwens, Bruno, et autres
Publié: (2022)

Improved Online Reachability Preservers
par: Bodwin, Greg, et autres
Publié: (2024)

Improved Circular Dictionary Matching
par: Cotumaccio, Nicola
Publié: (2025)

Improved Directed Expander Decompositions
par: Fleischmann, Henry, et autres
Publié: (2025)