ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2106.02942
  4. Cited By
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
v1v2v3 (latest)

Time-Optimal Sublinear Algorithms for Matching and Vertex Cover

5 June 2021
Soheil Behnezhad
ArXiv (abs)PDFHTML

Papers citing "Time-Optimal Sublinear Algorithms for Matching and Vertex Cover"

3 / 3 papers shown
Title
Adaptive Massively Parallel Connectivity in Optimal Space
Adaptive Massively Parallel Connectivity in Optimal Space
R. Latypov
J. Łącki
Yannic Maus
Jara Uitto
57
0
0
08 Feb 2023
Privately Estimating Graph Parameters in Sublinear time
Privately Estimating Graph Parameters in Sublinear time
Jeremiah Blocki
Elena Grigorescu
Tamalika Mukherjee
77
10
0
11 Feb 2022
Adaptive Massively Parallel Constant-round Tree Contraction
Adaptive Massively Parallel Constant-round Tree Contraction
Mohammadtaghi Hajiaghayi
Marina Knittel
Hamed Saleh
Hsin-Hao Su
23
3
0
02 Nov 2021
1