:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Demange, Noé, Strozecki, Yann, Vial, Sandrine
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Chemical Physics
Accès en ligne:	https://arxiv.org/abs/2604.11060
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Complexity of Finding and Enumerating Interconnection Trees
par: Demange, Noé, et autres
Publié: (2026)

Enumerating models of DNF faster: breaking the dependency on the formula size
par: Capelli, Florent, et autres
Publié: (2018)

From Amortized to Worst Case Delay in Enumeration Algorithms
par: Capelli, Florent, et autres
Publié: (2021)

Deterministic Scheduling of Periodic Messages for Low Latency in Cloud RAN
par: Barth, Dominique, et autres
Publié: (2018)

Accuracy and resource advantages of quantum eigenvalue estimation with non-Hermitian transcorrelated electronic Hamiltonians
par: Uvarov, Alexey, et autres
Publié: (2025)

Demand Selection for VRP with Emission Quota
par: Najar, Farid, et autres
Publié: (2025)

Quantum matrix arithmetics with Hamiltonian evolution
par: Kang, Christopher, et autres
Publié: (2025)

Quantum eigenvalue processing
par: Low, Guang Hao, et autres
Publié: (2024)

Gray Codes With Constant Delay and Constant Auxiliary Space
par: Amarilli, Antoine, et autres
Publié: (2026)

Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation
par: Papadopoulos, Nicholas J. C., et autres
Publié: (2026)

Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
par: Courtney, Joshua M.
Publié: (2026)

Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers
par: Chakraborty, Shantanav
Publié: (2023)

Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms
par: Uotila, Valter
Publié: (2024)

How to Design a Quantum Streaming Algorithm Without Knowing Anything About Quantum Computing
par: Kallaugher, John, et autres
Publié: (2024)

Scalable Pattern Matching in Computation Graphs
par: Mondada, Luca, et autres
Publié: (2024)

A $(5/3+ε)$-Approximation for Tricolored Non-crossing Euclidean TSP
par: Baligács, Júlia, et autres
Publié: (2024)

DialSort: Non-Comparative Integer Sorting via the Self-Indexing Principle: Architecture, Implementation, and Substrate-Aware Analysis
par: Narvaez, Alexander
Publié: (2026)

A Quantum Constraint Generation Framework for Binary Linear Programs
par: Czégel, András, et autres
Publié: (2025)

Generalized matching decoders for 2D topological translationally-invariant codes
par: Tan, Shi Jie Samuel, et autres
Publié: (2026)

Additive approximation algorithm for geodesic centers in $δ$-hyperbolic graphs
par: Chakraborty, Dibyayan, et autres
Publié: (2024)

Image Computation for Quantum Transition Systems
par: Hong, Xin, et autres
Publié: (2025)

Rapid Exploration of Assembly Chemical Space of Molecular Graphs
par: Seet, Ian, et autres
Publié: (2024)

Computing Flows in Subquadratic Space
par: Brand, Jan van den, et autres
Publié: (2026)

Computing k-mers in Graphs
par: Alanko, Jarno N., et autres
Publié: (2025)

Online Computation with Untrusted Advice
par: Angelopoulos, Spyros, et autres
Publié: (2019)

Noisy Computing of the Threshold Function
par: Wang, Ziao, et autres
Publié: (2024)

Property Testing of Computational Networks
par: Czumaj, Artur, et autres
Publié: (2025)

Gibbs Sampling of Continuous Potentials on a Quantum Computer
par: Motamedi, Arsalan, et autres
Publié: (2022)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
par: Chalopin, Jérémie, et autres
Publié: (2025)

Diameter Computation on (Random) Geometric Graphs
par: Bläsius, Thomas, et autres
Publié: (2026)

Computational Complexity of the Interval Ordering Problem
par: Pawlowski, Simeon, et autres
Publié: (2026)

Parameterized Algorithms for Computing MAD Trees
par: Breitkopf, Tom-Lukas, et autres
Publié: (2026)

Instance-Optimality in PageRank Computation
par: Thorup, Mikkel, et autres
Publié: (2025)

Computing String Covers in Sublinear Time
par: Radoszewski, Jakub, et autres
Publié: (2024)

Online Computation of String Net Frequency
par: Guo, Peaker, et autres
Publié: (2024)

Parameterized Algorithms for Computing Pareto Sets
par: Könen, Joshua, et autres
Publié: (2025)

Efficient Algorithms to Compute Closed Substrings
par: Jain, Samkith K, et autres
Publié: (2025)

Practical Computation of Graph VC-Dimension
par: Coudert, David, et autres
Publié: (2024)

Online Computation of Palindromes and Suffix Trees on Tries
par: Shibata, Hiroki, et autres
Publié: (2026)

Computing Experiment-Constrained D-Optimal Designs
par: Pillai, Aditya, et autres
Publié: (2024)