Cover Image

Efficient algorithm for linear diophantine equations in two variables

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Deora, Mayank, Pal, Pinakpani
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An average case efficient algorithm for solving two-variable linear Diophantine equations
by: Deora, Mayank, et al.
Published: (2024)

FPT algorithms over linear delta-matroids with applications
by: Eiben, Eduard, et al.
Published: (2025)

A Novel exact algorithm for economic lot-sizing with piecewise linear production costs
by: Papadopoulos, Kleitos
Published: (2024)

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
by: Tsin, Yung H.
Published: (2023)

Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems
by: Nguyen, Linh Anh
Published: (2024)

How many users have been here for a long time? Efficient solutions for counting long aggregated visits
by: Afshani, Peyman, et al.
Published: (2026)

Improved quantum algorithms for linear and nonlinear differential equations
by: Krovi, Hari
Published: (2022)

Efficient Trace Frequency Queries in Sparse Graphs
by: Awofeso, Christine, et al.
Published: (2025)

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
by: Biedl, Therese
Published: (2025)

The clustered Sparrow algorithm
by: Dumitrescu, Cristian
Published: (2018)

Streaming algorithms for products of probabilities
by: Lohrey, Markus, et al.
Published: (2025)

Parameterized algorithms for $k$-Inversion
by: Antony, Dhanyamol, et al.
Published: (2026)

Ultrabubble enumeration via a lowest common ancestor approach
by: Zisis, Athanasios E., et al.
Published: (2026)

A practical algorithm for 3-admissibility
by: Awofeso, Christine, et al.
Published: (2025)

New algorithms for girth and cycle detection
by: Roditty, Liam, et al.
Published: (2025)

Engineering Semi-streaming DFS algorithms
by: Bhagavan, Kancharla Nikhilesh, et al.
Published: (2024)

Insights into $(k,ρ)$-shortcutting algorithms
by: Leonhardt, Alexander, et al.
Published: (2024)

Practical algorithms for Hierarchical overlap graphs
by: Talera, Saumya, et al.
Published: (2024)

An efficient, provably optimal algorithm for the 0-1 loss linear classification problem
by: He, Xi, et al.
Published: (2023)

Vantage Point Selection Algorithms for Bottleneck Capacity Estimation
by: Ashvinkumar, Vikrant, et al.
Published: (2025)

Strassen's algorithm via orbit flip graphs
by: Ikenmeyer, Christian, et al.
Published: (2025)

Faster parameterized algorithm for 3-Hitting Set
by: Tsur, Dekel
Published: (2025)

An FPT algorithm for Matching Cut and d-cut
by: Aravind, N R, et al.
Published: (2021)

Optimal bounds on a tree inference algorithm
by: Gardiner, Jack, et al.
Published: (2024)

Faster algorithms for k-Orthogonal Vectors in low dimension
by: Dürr, Anita, et al.
Published: (2025)

Fast exact algorithms via the Matrix Tree Theorem
by: Arvind, V., et al.
Published: (2025)

New simple and fast quicksort algorithm for equal keys
by: Afereidoon, Parviz
Published: (2025)

Parallel batch queries on dynamic trees: algorithms and experiments
by: Ikram, Humza, et al.
Published: (2025)

Approximation algorithms for satisfiable and nearly satisfiable ordering CSPs
by: Makarychev, Yury
Published: (2026)

Minimum sum vertex cover: kernelization and parameterized algorithms
by: Cao, Yixin, et al.
Published: (2024)

Faster algorithms for packing forests in graphs and related problems
by: Arkhipov, Pavel, et al.
Published: (2024)

SquareSort: a cache-oblivious sorting algorithm
by: Koucký, Michal, et al.
Published: (2024)

Composing dynamic programming tree-decomposition-based algorithms
by: Baste, Julien
Published: (2019)

Local Search for Clustering in Almost-linear Time
by: Jiang, Shaofeng H. -C., et al.
Published: (2025)

A customizable inexact subgraph matching algorithm for attributed graphs
by: Benko, Tatyana, et al.
Published: (2025)

Approximation and parameterized algorithms for covering disjointness-compliable set families
by: Nutov, Zeev, et al.
Published: (2025)

Round-efficient Fully-scalable MPC algorithms for k-Means
by: Jiang, Shaofeng H. -C., et al.
Published: (2026)

A computational study of Gomory-Hu construction tree algorithms
by: Kolmogorov, Vladimir
Published: (2022)

Exponentially faster fixed-parameter algorithms for high-multiplicity scheduling
by: Fischer, David, et al.
Published: (2022)

A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
by: Chen, Tyler, et al.
Published: (2025)