Cover Image

Computing and Bounding Equilibrium Concentrations in Athermic Chemical Systems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Akef, Hamidreza, Hhan, Minki, Soloveichik, David
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Molecular Networks G.2.1; J.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Amplification at Equilibrium: Structural and Thermodynamic Limitations, and Implementation
by: Akef, Hamidreza, et al.
Published: (2026)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
by: Gillman, David, et al.
Published: (2025)

Reserve Matching with Thresholds
by: Evren, Suat
Published: (2023)

Unsplittable Multicommodity Flows in Outerplanar Graphs
by: Alemán-Espinosa, David, et al.
Published: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
by: Bläsius, Thomas, et al.
Published: (2024)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
by: Shota, Kan, et al.
Published: (2024)

Pop Stacks with a Bypass
by: Cioni, Lapo, et al.
Published: (2024)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
by: Adamson, Duncan, et al.
Published: (2023)

When Votes Change and Committees Should (Not)
by: Bredereck, Robert, et al.
Published: (2020)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
by: Streit, Robert P., et al.
Published: (2024)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
by: Könen, David, et al.
Published: (2023)

Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
by: Spielman, Daniel A., et al.
Published: (2006)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$
by: Spielman, Daniel A., et al.
Published: (2003)

Generating Signed Permutations by Twisting Two-Sided Ribbons
by: Yuan, et al.
Published: (2023)

Efficient Uniform Sampling of Surjections via their Profiles
by: Carayol, Arnaud, et al.
Published: (2026)

An O(nlogn) approximate knapsack algorithm
by: Dawes, Nick
Published: (2025)

Selective algorithm processing of subset sum distributions
by: Dawes, Nick
Published: (2024)

Engineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform
by: Andersson, Joel, et al.
Published: (2026)

Smoothed Analysis of Interior-Point Algorithms: Condition Number
by: Dunagan, John, et al.
Published: (2003)

Eliminating Illusion in Directed Networks
by: Jana, Sougata, et al.
Published: (2026)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
by: Bhattacharjee, Rajarshi, et al.
Published: (2023)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
by: Salas, Jesus
Published: (2025)

Harvesting Brownian Motion: Zero Energy Computational Sampling
by: Doty, David, et al.
Published: (2023)

Counting overlapping pairs of words
by: Rivals, Eric, et al.
Published: (2024)

Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof
by: Li, Yifei
Published: (2024)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
by: Bhattacharjee, Rajarshi, et al.
Published: (2024)

Beating Meet-in-the-Middle for Subset Balancing Problems
by: Randolph, Tim, et al.
Published: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
by: Randolph, Tim, et al.
Published: (2024)

Exact Computation of the Catalan Number $C(2,050,572,903)$
by: Ramani, Mahesh
Published: (2026)

Reconstructing Bounded Treelength Graphs with Linearithmic Shortest Path Distance Queries
by: Kaudan, Chirag, et al.
Published: (2026)

Entrywise Approximate Solutions for SDDM Systems in Almost-Linear Time
by: Farfan, Angelo, et al.
Published: (2025)

Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees
by: Høgemo, Svein
Published: (2024)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
by: Rahat, Md Tanzeem, et al.
Published: (2025)

A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals
by: Swenson, Krister M.
Published: (2024)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
by: Bushnell, Brian
Published: (2026)

Sequential Diversification with Provable Guarantees
by: Wang, Honglian, et al.
Published: (2024)

On the Computation of 2-Dimensional Recurrence Equations
by: Natale, Giuseppe
Published: (2024)

Restless reachability problems in temporal graphs
by: Thejaswi, Suhas, et al.
Published: (2020)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
by: Li, Shisheng
Published: (2026)

Explicit two-sided unique-neighbor expanders
by: Hsieh, Jun-Ting, et al.
Published: (2023)