Saved in:
| Main Authors: | Liu, Ruipeng, Qiu, Qinru, Khan, Simon, Katz, Garrett E. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.15793 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
by: Ehimwenma, Kennedy E., et al.
Published: (2025)
by: Ehimwenma, Kennedy E., et al.
Published: (2025)
Reconstructing Bounded Treelength Graphs with Linearithmic Shortest Path Distance Queries
by: Kaudan, Chirag, et al.
Published: (2026)
by: Kaudan, Chirag, et al.
Published: (2026)
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
by: Ganian, Robert, et al.
Published: (2025)
by: Ganian, Robert, et al.
Published: (2025)
SubGen: Token Generation in Sublinear Time and Memory
by: Zandieh, Amir, et al.
Published: (2024)
by: Zandieh, Amir, et al.
Published: (2024)
Computing and Learning on Combinatorial Data
by: Zhang, Simon
Published: (2025)
by: Zhang, Simon
Published: (2025)
TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate
by: Zandieh, Amir, et al.
Published: (2025)
by: Zandieh, Amir, et al.
Published: (2025)
Assortment Planning with Sponsored Products
by: Tang, Shaojie, et al.
Published: (2024)
by: Tang, Shaojie, et al.
Published: (2024)
Memory-Efficient Sequential Pattern Mining with Hybrid Tries
by: Hosseininasab, Amin, et al.
Published: (2022)
by: Hosseininasab, Amin, et al.
Published: (2022)
Approximating Optimal Labelings for Temporal Connectivity
by: Carnevale, Daniele, et al.
Published: (2025)
by: Carnevale, Daniele, et al.
Published: (2025)
FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
by: Almansoori, Mahmood K. M., et al.
Published: (2025)
by: Almansoori, Mahmood K. M., et al.
Published: (2025)
Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
by: Nguyen, Hue T., et al.
Published: (2025)
by: Nguyen, Hue T., et al.
Published: (2025)
Efficient Detection of Exchangeable Factors in Factor Graphs
by: Luttermann, Malte, et al.
Published: (2024)
by: Luttermann, Malte, et al.
Published: (2024)
Masked Matrix Multiplication for Emergent Sparsity
by: Wheatman, Brian, et al.
Published: (2024)
by: Wheatman, Brian, et al.
Published: (2024)
Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
by: Wang, Long, et al.
Published: (2025)
by: Wang, Long, et al.
Published: (2025)
Queueing, Predictions, and LLMs: Challenges and Open Problems
by: Mitzenmacher, Michael, et al.
Published: (2025)
by: Mitzenmacher, Michael, et al.
Published: (2025)
Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
by: Han, Yue, et al.
Published: (2025)
by: Han, Yue, et al.
Published: (2025)
Adaptive Multi-Round Allocation with Stochastic Arrivals
by: Pan, Yuqi, et al.
Published: (2026)
by: Pan, Yuqi, et al.
Published: (2026)
Knapsack: Connectedness, Path, and Shortest-Path
by: Dey, Palash, et al.
Published: (2023)
by: Dey, Palash, et al.
Published: (2023)
Online Allocation with Unknown Shared Supply
by: Neoh, Tzeh Yuan, et al.
Published: (2026)
by: Neoh, Tzeh Yuan, et al.
Published: (2026)
A Survey on the Densest Subgraph Problem and Its Variants
by: Lanciano, Tommaso, et al.
Published: (2023)
by: Lanciano, Tommaso, et al.
Published: (2023)
Parameterized Analysis of Bribery in Challenge the Champ Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)
by: Chaudhary, Juhi, et al.
Published: (2024)
Stochastic Multi-round Submodular Optimization with Budget
by: Auletta, Vincenzo, et al.
Published: (2024)
by: Auletta, Vincenzo, et al.
Published: (2024)
Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
by: la Tour, Max Dupré, et al.
Published: (2024)
by: la Tour, Max Dupré, et al.
Published: (2024)
Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
by: Panda, Atasi, et al.
Published: (2022)
by: Panda, Atasi, et al.
Published: (2022)
Lifted Causal Inference in Relational Domains
by: Luttermann, Malte, et al.
Published: (2024)
by: Luttermann, Malte, et al.
Published: (2024)
The Complexity of Bayesian Network Learning: Revisiting the Superstructure
by: Ganian, Robert, et al.
Published: (2026)
by: Ganian, Robert, et al.
Published: (2026)
Variance Computation for Weighted Model Counting with Knowledge Compilation Approach
by: Nakamura, Kengo, et al.
Published: (2026)
by: Nakamura, Kengo, et al.
Published: (2026)
Nearly Optimal Attention Coresets
by: Liberty, Edo, et al.
Published: (2026)
by: Liberty, Edo, et al.
Published: (2026)
Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
by: Benomar, Ziyad, et al.
Published: (2025)
by: Benomar, Ziyad, et al.
Published: (2025)
Instance Dependent Testing of Samplers using Interval Conditioning
by: Bhattacharyya, Rishiraj, et al.
Published: (2025)
by: Bhattacharyya, Rishiraj, et al.
Published: (2025)
Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
by: Ihalainen, Hannes, et al.
Published: (2025)
by: Ihalainen, Hannes, et al.
Published: (2025)
Scalable Algorithms for Approximate DNF Model Counting
by: Burkhardt, Paul, et al.
Published: (2026)
by: Burkhardt, Paul, et al.
Published: (2026)
Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search
by: Shimoda, Takumi, et al.
Published: (2024)
by: Shimoda, Takumi, et al.
Published: (2024)
A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem
by: Luo, Chunyu, et al.
Published: (2024)
by: Luo, Chunyu, et al.
Published: (2024)
Universal Hirschberg for Width Bounded Dynamic Programs
by: Nye, Logan
Published: (2025)
by: Nye, Logan
Published: (2025)
A canonical generalization of OBDD
by: Capelli, Florent, et al.
Published: (2026)
by: Capelli, Florent, et al.
Published: (2026)
Identification for Tree-shaped Structural Causal Models in Polynomial Time
by: Gupta, Aaryan, et al.
Published: (2023)
by: Gupta, Aaryan, et al.
Published: (2023)
Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
by: Fioravantes, Foivos, et al.
Published: (2025)
by: Fioravantes, Foivos, et al.
Published: (2025)
An Invertible State Space for Process Trees
by: Kolhof, Gero, et al.
Published: (2024)
by: Kolhof, Gero, et al.
Published: (2024)
Enhanced Methods for the Weight Constrained Shortest Path Problem
by: Ahmadi, Saman, et al.
Published: (2022)
by: Ahmadi, Saman, et al.
Published: (2022)
Similar Items
-
An Extended Symbolic-Arithmetic Model for Teaching Double-Black Removal with Rotation in Red-Black Trees
by: Ehimwenma, Kennedy E., et al.
Published: (2025) -
Reconstructing Bounded Treelength Graphs with Linearithmic Shortest Path Distance Queries
by: Kaudan, Chirag, et al.
Published: (2026) -
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
by: Ganian, Robert, et al.
Published: (2025) -
SubGen: Token Generation in Sublinear Time and Memory
by: Zandieh, Amir, et al.
Published: (2024) -
Computing and Learning on Combinatorial Data
by: Zhang, Simon
Published: (2025)