Bounded Local Generator Classes for Deterministic State Evolution
Fuente:
arXiv
Saved in:
| Main Author: | Martin II, R. Jay |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Accelerating Probabilistic Response-Time Analysis: Revised Critical Instant and Optimized Convolution
by: Takahashi, Hiroto, et al.
Published: (2025)
by: Takahashi, Hiroto, et al.
Published: (2025)
A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
by: Van Over, Brandon, et al.
Published: (2024)
by: Van Over, Brandon, et al.
Published: (2024)
Structured Gossip: A Partition-Resilient DNS for Internet-Scale Dynamic Networks
by: Sinha, Priyanka, et al.
Published: (2026)
by: Sinha, Priyanka, et al.
Published: (2026)
On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
by: Li, Bowen, et al.
Published: (2024)
by: Li, Bowen, et al.
Published: (2024)
Deterministic $k$-Median Clustering in Near-Optimal Time
by: Costa, Martín, et al.
Published: (2025)
by: Costa, Martín, et al.
Published: (2025)
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
by: Khanna, Sanjeev, et al.
Published: (2024)
by: Khanna, Sanjeev, et al.
Published: (2024)
Vizing's Theorem in Deterministic Almost-Linear Time
by: Assadi, Sepehr, et al.
Published: (2025)
by: Assadi, Sepehr, et al.
Published: (2025)
Tight Streaming Lower Bounds for Deterministic Approximate Counting
by: Wang, Yichuan
Published: (2024)
by: Wang, Yichuan
Published: (2024)
A Note On Deterministic Submodular Maximization With Bounded Curvature
by: Li, Wenxin
Published: (2024)
by: Li, Wenxin
Published: (2024)
Non-Signaling Locality Lower Bounds for Dominating Set
by: Fleming, Noah, et al.
Published: (2026)
by: Fleming, Noah, et al.
Published: (2026)
Lower Bounds for Non-adaptive Local Computation Algorithms
by: Azarmehr, Amir, et al.
Published: (2025)
by: Azarmehr, Amir, et al.
Published: (2025)
Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting
by: Grossman, Ofer, et al.
Published: (2023)
by: Grossman, Ofer, et al.
Published: (2023)
Deterministic Dynamic Edge Colouring
by: Christiansen, Aleksander B. G.
Published: (2024)
by: Christiansen, Aleksander B. G.
Published: (2024)
Deterministic Cache-Oblivious Funnelselect
by: Brodal, Gerth Stølting, et al.
Published: (2024)
by: Brodal, Gerth Stølting, et al.
Published: (2024)
Faster Pseudo-Deterministic Minimum Cut
by: Kenneth-Mordoch, Yotam
Published: (2026)
by: Kenneth-Mordoch, Yotam
Published: (2026)
Faster Deterministic Streaming Vertex Coloring
by: Chechik, Shiri, et al.
Published: (2026)
by: Chechik, Shiri, et al.
Published: (2026)
Deterministic Mincut in Almost-Linear Time
by: Li, Jason
Published: (2021)
by: Li, Jason
Published: (2021)
A Note on Deterministic FPTAS for Partition
by: Chen, Lin, et al.
Published: (2025)
by: Chen, Lin, et al.
Published: (2025)
Packed Acyclic Deterministic Finite Automata
by: Shibata, Hiroki, et al.
Published: (2024)
by: Shibata, Hiroki, et al.
Published: (2024)
Deterministic Online Bipartite Edge Coloring
by: Blikstad, Joakim, et al.
Published: (2024)
by: Blikstad, Joakim, et al.
Published: (2024)
On the Power of Spatial Locality on Online Routing Problems
by: Guragain, Swapnil, et al.
Published: (2025)
by: Guragain, Swapnil, et al.
Published: (2025)
Deterministic Monotone Min-Plus Product and Convolution
by: Jin, Ce, et al.
Published: (2026)
by: Jin, Ce, et al.
Published: (2026)
Deterministic Edge Coloring with few Colors in CONGEST
by: Blikstad, Joakim, et al.
Published: (2026)
by: Blikstad, Joakim, et al.
Published: (2026)
Fast Practical Compression of Deterministic Finite Automata
by: Bille, Philip, et al.
Published: (2023)
by: Bille, Philip, et al.
Published: (2023)
Intermediate N-Gramming: Deterministic and Fast N-Grams For Large N and Large Datasets
by: Curtin, Ryan R., et al.
Published: (2025)
by: Curtin, Ryan R., et al.
Published: (2025)
Convex Optimization with Local Label Differential Privacy: Tight Bounds in All Privacy Regimes
by: Chua, Lynn, et al.
Published: (2026)
by: Chua, Lynn, et al.
Published: (2026)
Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions
by: Lange, Jane, et al.
Published: (2023)
by: Lange, Jane, et al.
Published: (2023)
Deterministic Almost-Linear-Time Gomory-Hu Trees
by: Abboud, Amir, et al.
Published: (2025)
by: Abboud, Amir, et al.
Published: (2025)
Deterministic Dynamic Maximal Matching in Sublinear Update Time
by: Bernstein, Aaron, et al.
Published: (2025)
by: Bernstein, Aaron, et al.
Published: (2025)
Deterministic Padded Decompositions and Negative-Weight Shortest Paths
by: Li, Jason
Published: (2025)
by: Li, Jason
Published: (2025)
A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
by: Dufay, Marc, et al.
Published: (2025)
by: Dufay, Marc, et al.
Published: (2025)
Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
by: Wan, Zongqi, et al.
Published: (2024)
by: Wan, Zongqi, et al.
Published: (2024)
A Lower Bound for Light Spanners in General Graphs
by: Bodwin, Greg, et al.
Published: (2024)
by: Bodwin, Greg, et al.
Published: (2024)
LatticeHashForest: An Efficient Data Structure for Repetitive Data and Operations
by: Ghorui, Anamitra, et al.
Published: (2025)
by: Ghorui, Anamitra, et al.
Published: (2025)
The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
by: Ardizzoni, Stefano, et al.
Published: (2021)
by: Ardizzoni, Stefano, et al.
Published: (2021)
Probabilistic AVL Trees (p-AVL): Relaxing Deterministic Balancing
by: Desikan, Hayagriv
Published: (2026)
by: Desikan, Hayagriv
Published: (2026)
A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
by: Chuzhoy, Julia, et al.
Published: (2026)
by: Chuzhoy, Julia, et al.
Published: (2026)
Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture
by: Björklund, Andreas, et al.
Published: (2024)
by: Björklund, Andreas, et al.
Published: (2024)
Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
by: Jiang, Yonggang, et al.
Published: (2025)
by: Jiang, Yonggang, et al.
Published: (2025)
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
by: Henzinger, Monika, et al.
Published: (2024)
by: Henzinger, Monika, et al.
Published: (2024)
Similar Items
-
Accelerating Probabilistic Response-Time Analysis: Revised Critical Instant and Optimized Convolution
by: Takahashi, Hiroto, et al.
Published: (2025) -
A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
by: Van Over, Brandon, et al.
Published: (2024) -
Structured Gossip: A Partition-Resilient DNS for Internet-Scale Dynamic Networks
by: Sinha, Priyanka, et al.
Published: (2026) -
On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
by: Li, Bowen, et al.
Published: (2024) -
Deterministic $k$-Median Clustering in Near-Optimal Time
by: Costa, Martín, et al.
Published: (2025)