Cover Image

Testable algorithms for approximately counting edges and triangles in sublinear time and space

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Eden, Talya, Rubinfeld, Ronitt, Vasilyan, Arsen
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

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

Quality control in sublinear time: a case study via random graphs
by: Marcussen, Cassandra, et al.
Published: (2025)

Locally computing edge orientations
by: Mitrović, Slobodan, et al.
Published: (2025)

Testable Learning with Distribution Shift
by: Klivans, Adam R., et al.
Published: (2023)

Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
by: Mitrović, Slobodan, et al.
Published: (2026)

Stochastic Matching via In-n-Out Local Computation Algorithms
by: Azarmehr, Amir, et al.
Published: (2024)

No Price Tags? No Problem: Query Strategies for Unpriced Information
by: Nadimpalli, Shivam, et al.
Published: (2025)

Robust learning of halfspaces under log-concave marginals
by: Lange, Jane, et al.
Published: (2025)

Optimal Algorithms for Augmented Testing of Discrete Distributions
by: Aliakbarpour, Maryam, et al.
Published: (2024)

A note on approximating the average degree of bounded arboricity graphs
by: Eden, Talya, et al.
Published: (2026)

Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions
by: Lange, Jane, et al.
Published: (2023)

Better Private Distribution Testing by Leveraging Unverified Auxiliary Data
by: Aliakbarpour, Maryam, et al.
Published: (2025)

Testing $C_k$-freeness in bounded-arboricity graphs
by: Eden, Talya, et al.
Published: (2024)

Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds
by: Klivans, Adam R., et al.
Published: (2024)

Beyond Worst Case Local Computation Algorithms
by: Biswas, Amartya Shankha, et al.
Published: (2024)

A Fast Coloring Oracle for Average Case Hypergraphs
by: Marcussen, Cassandra, et al.
Published: (2025)

Learning $\mathsf{AC}^0$ Under Graphical Models
by: Chandrasekaran, Gautam, et al.
Published: (2026)

Tolerant Algorithms for Learning with Arbitrary Covariate Shift
by: Goel, Surbhi, et al.
Published: (2024)

Near-optimal streaming approximation for Max-DICUT in sublinear space using two passes
by: Velusamy, Santhoshini
Published: (2025)

The Power of Iterative Filtering for Supervised Learning with (Heavy) Contamination
by: Klivans, Adam R., et al.
Published: (2025)

Testing Noise Assumptions of Learning Algorithms
by: Goel, Surbhi, et al.
Published: (2025)

A Fully Polynomial-Time Algorithm for Robustly Learning Halfspaces over the Hypercube
by: Chandrasekaran, Gautam, et al.
Published: (2025)

Equivalence of Coarse and Fine-Grained Models for Learning with Distribution Shift
by: Klivans, Adam R., et al.
Published: (2026)

Learning Constant-Depth Circuits in Malicious Noise Models
by: Klivans, Adam R., et al.
Published: (2024)

Efficient Discrepancy Testing for Learning with Distribution Shift
by: Chandrasekaran, Gautam, et al.
Published: (2024)

Iterative Chow Filtering for Learning with Distribution Shift
by: Chandrasekaran, Gautam, et al.
Published: (2026)

Fast Agnostic Learners in the Plane
by: Eden, Talya, et al.
Published: (2025)

Triangle Counting with Local Edge Differential Privacy
by: Eden, Talya, et al.
Published: (2023)

An $2\sqrt{k}$-approximation algorithm for minimum power $k$ edge disjoint $st$ -paths
by: Nutov, Zeev
Published: (2022)

Bicriteria approximation for $k$-edge-connectivity
by: Nutov, Zeev, et al.
Published: (2025)

Sampling and counting triangle-free graphs near the critical density
by: Jenssen, Matthew, et al.
Published: (2024)

Improved bicriteria approximation for $k$-edge-connectivity
by: Nutov, Zeev
Published: (2025)

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

A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
by: Armbruster, Alexander, et al.
Published: (2025)

A simple deterministic near-linear time approximation scheme for transshipment with arbitrary positive edge costs
by: Fox, Emily
Published: (2023)

Classes Testable with $O(1/ε)$ Queries for Small $ε$ Independent of the Number of Variables
by: Bshouty, Nader H., et al.
Published: (2026)

Limitations of Membership Queries in Testable Learning
by: Lange, Jane, et al.
Published: (2025)

Testably Learning Polynomial Threshold Functions
by: Slot, Lucas, et al.
Published: (2024)

Testability in group theory
by: Becker, Oren, et al.
Published: (2022)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
by: Apers, Simon, et al.
Published: (2021)