Imagen de Portada

On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kwok, Tsz Chiu, Wei, Zhewei, Yang, Mingji
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On Solving Linear Systems in Sublinear Time
por: Andoni, Alexandr, et al.
Publicado: (2018)

Approximating Single-Source Personalized PageRank with Absolute Error Guarantees
por: Wei, Zhewei, et al.
Publicado: (2024)

PageRank Centrality in Directed Graphs with Bounded In-Degree
por: Thorup, Mikkel, et al.
Publicado: (2025)

Revisiting Local Computation of PageRank: Simple and Optimal
por: Wang, Hanzhi, et al.
Publicado: (2024)

Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model
por: Feng, Weiming, et al.
Publicado: (2025)

Solving the Correlation Cluster LP in Sublinear Time
por: Cao, Nairen, et al.
Publicado: (2025)

Efficient Algorithms for Personalized PageRank Computation: A Survey
por: Yang, Mingji, et al.
Publicado: (2024)

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

Solving Hypergraph Laplacian Systems in Almost-Linear Time
por: Yoshida, Yuichi
Publicado: (2026)

Computing String Covers in Sublinear Time
por: Radoszewski, Jakub, et al.
Publicado: (2024)

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

Approximate Butterfly Counting in Sublinear Time
por: Luo, Chi, et al.
Publicado: (2026)

Simple Sublinear Algorithms for $(Δ+1)$ Vertex Coloring via Asymmetric Palette Sparsification
por: Assadi, Sepehr, et al.
Publicado: (2025)

Counting Distinct Square Substrings in Sublinear Time
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2025)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
por: Goranci, Gramoz, et al.
Publicado: (2025)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
por: Bernstein, Aaron, et al.
Publicado: (2025)

Constant Approximation of Arboricity in Near-Optimal Sublinear Time
por: Dai, Jiangqi, et al.
Publicado: (2025)

Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time
por: Eden, Talya, et al.
Publicado: (2025)

Fully Dynamic Exact Edge Connectivity in Sublinear Time
por: Goranci, Gramoz, et al.
Publicado: (2023)

Lempel-Ziv (LZ77) Factorization in Sublinear Time
por: Kempa, Dominik, et al.
Publicado: (2024)

Two Linear Passes Are Necessary for Sum-Exclude-Self Under Sublinear Space
por: Au, Andrew
Publicado: (2026)

Minimizing Makespan in Sublinear Time via Weighted Random Sampling
por: Fu, Bin, et al.
Publicado: (2026)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time
por: Bille, Philip, et al.
Publicado: (2022)

Using Ray-shooting Queries for Sublinear Algorithms for Dominating Sets in RDV Graphs
por: Biedl, Therese, et al.
Publicado: (2026)

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
por: Bhattacharya, Sayan, et al.
Publicado: (2023)

Approximating Dasgupta Cost in Sublinear Time from a Few Random Seeds
por: Kapralov, Michael, et al.
Publicado: (2022)

Almost-Optimal Sublinear Additive Spanners
por: Tan, Zihan, et al.
Publicado: (2023)

A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time
por: Mahabadi, Sepideh, et al.
Publicado: (2025)

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries
por: Shah, Vihan
Publicado: (2026)

Sublinear Edge Fault Tolerant Spanners for Hypergraphs
por: He, Jialin, et al.
Publicado: (2025)

Simple and Optimal Sublinear Algorithms for Mean Estimation
por: Bertolotti, Beatrice, et al.
Publicado: (2024)

Sublinear Algorithms for TSP via Path Covers
por: Behnezhad, Soheil, et al.
Publicado: (2023)

Sublinear Spectral Clustering Oracle with Little Memory
por: Shen, Ranran, et al.
Publicado: (2026)

Dynamic Correlation Clustering in Sublinear Update Time
por: Cohen-Addad, Vincent, et al.
Publicado: (2024)

Training Overparametrized Neural Networks in Sublinear Time
por: Deng, Yichuan, et al.
Publicado: (2022)

Solving Linear Programs with Differential Privacy
por: Ene, Alina, et al.
Publicado: (2025)

Improved Sublinear Algorithms for Classical and Quantum Graph Coloring
por: Ferber, Asaf, et al.
Publicado: (2025)

Sublinear Algorithms for Estimating Single-Linkage Clustering Costs
por: Peng, Pan, et al.
Publicado: (2025)

Sublinear Random Access Generators for Preferential Attachment Graphs
por: Even, Guy, et al.
Publicado: (2016)

Simple and Optimal Algorithms for Heavy Hitters and Frequency Moments in Distributed Models
por: Huang, Zengfeng, et al.
Publicado: (2025)