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. 1707.03478
  4. Cited By
Round Compression for Parallel Matching Algorithms

Round Compression for Parallel Matching Algorithms

11 July 2017
A. Czumaj
Jakub Lacki
Aleksander Madry
Slobodan Mitrovic
Krzysztof Onak
Piotr Sankowski
ArXivPDFHTML

Papers citing "Round Compression for Parallel Matching Algorithms"

3 / 3 papers shown
Title
String Matching with Wildcards in the Massively Parallel Computation
  Model
String Matching with Wildcards in the Massively Parallel Computation Model
Mohammadtaghi Hajiaghayi
Hamed Saleh
Saeed Seddighin
Xiaorui Sun
28
10
0
25 Oct 2019
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive
  Graphs
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
Sepehr Assadi
M. Bateni
A. Bernstein
Vahab Mirrokni
Cliff Stein
30
122
0
08 Nov 2017
Optimal Deterministic Routing and Sorting on the Congested Clique
Optimal Deterministic Routing and Sorting on the Congested Clique
Christoph Lenzen
62
168
0
08 Jul 2012
1