Image de couverture de livre

On HTLC-Based Protocols for Multi-Party Cross-Chain Swaps

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Clark, Emily, Georgiou, Chloe, Poon, Katelyn, Chrobak, Marek
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms F.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Refutation of Elmasry's $\tilde{O}(m \sqrt{n})$-Time Algorithm for Single-Source Shortest Paths
par: Atalig, Sunny, et autres
Publié: (2025)

Online Paging with Heterogeneous Cache Slots
par: Chrobak, Marek, et autres
Publié: (2022)

On Permutation Selectors and their Applications in Ad-Hoc Radio Networks Protocols
par: Kuschner, Jordan, et autres
Publié: (2024)

Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
par: Atalig, Sunny, et autres
Publié: (2024)

On the Online Weighted Non-Crossing Matching Problem
par: Boyar, Joan, et autres
Publié: (2026)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
par: Bergougnoux, Benjamin, et autres
Publié: (2026)

A Tight Lower Bound for Comparison-Based Quantile Summaries
par: Cormode, Graham, et autres
Publié: (2019)

The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs
par: Chauhan, Archit, et autres
Publié: (2024)

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
par: Dolatabadi, Reza Hosseini, et autres
Publié: (2024)

Set Parameterized Matching via Multi-Layer Hashing
par: Lewenstein, Moshe, et autres
Publié: (2026)

Fine-Grained Complexity of Multiple Domination and Dominating Patterns in Sparse Graphs
par: Künnemann, Marvin, et autres
Publié: (2024)

What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing
par: Blin, Lélia, et autres
Publié: (2024)

On the Parameterized Complexity of Diverse SAT
par: Misra, Neeldhara, et autres
Publié: (2024)

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $Δ$-Coloring
par: Assadi, Sepehr, et autres
Publié: (2022)

A Linear-Time 1.5-Approximation for Broadcasting in k-Cycle Graphs
par: Bringolf, Jeffrey, et autres
Publié: (2025)

Constant time enumeration of perfect bipartite matchings
par: Fink, Jiří
Publié: (2025)

Buffered Partially-Persistent External-Memory Search Trees
par: Brodal, Gerth Stølting, et autres
Publié: (2025)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
par: Hušek, Radek, et autres
Publié: (2020)

Online $b$-Matching with Stochastic Rewards
par: Albers, Susanne, et autres
Publié: (2024)

Scheduling with Obligatory Tests
par: Dogeas, Konstantinos, et autres
Publié: (2024)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
par: DeHaan, Ian, et autres
Publié: (2024)

Revisiting Path Contraction and Cycle Contraction
par: Krithika, R., et autres
Publié: (2024)

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
par: Chakrabarti, Amit, et autres
Publié: (2024)

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

Online Combinatorial Optimization with Graphical Dependencies
par: Gao, Zhimeng, et autres
Publié: (2025)

Offline green bin packing and its constrained variant
par: Gong, Mingyang, et autres
Publié: (2026)

Exploiting Low Scanwidth to Resolve Soft Polytomies
par: Bruchhold, Sebastian, et autres
Publié: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
par: Awofeso, Christine, et autres
Publié: (2025)

Online computation of normalized substring complexity
par: Kucherov, Gregory, et autres
Publié: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
par: Gong, Mingyang, et autres
Publié: (2025)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
par: Blomer, Valentin, et autres
Publié: (2026)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
par: Mosenzon, Ron
Publié: (2025)

A Faster Directed Single-Source Shortest Path Algorithm
par: Duan, Ran, et autres
Publié: (2026)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
par: Lindermayr, Alexander, et autres
Publié: (2025)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
par: Emmerich, Michael
Publié: (2025)

Connected Components in Linear Work and Near-Optimal Time
par: Farhadi, Alireza, et autres
Publié: (2023)

Hierarchical Exponential Search Via K-Spines
par: Dong, Bob
Publié: (2025)

On the satisfability of random k-Horn formulae
par: Istrate, Gabriel
Publié: (2000)

Search and evacuation with a near majority of faulty agents
par: Czyzowicz, J., et autres
Publié: (2026)

Approximation algorithms for Job Scheduling with reconfigurable resources
par: Bergé, Pierre, et autres
Publié: (2023)