External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Massively Parallel Algorithms for Small Subgraph Counting

Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic. Massively Parallel Algorithms for Small Subgraph Counting. In Amit Chakrabarti, Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference). Volume 245 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Authors

Amartya Shankha Biswas

This author has not been identified. Look up 'Amartya Shankha Biswas' in Google

Talya Eden

This author has not been identified. Look up 'Talya Eden' in Google

Quanquan C. Liu

This author has not been identified. Look up 'Quanquan C. Liu' in Google

Ronitt Rubinfeld

This author has not been identified. Look up 'Ronitt Rubinfeld' in Google

Slobodan Mitrovic

This author has not been identified. Look up 'Slobodan Mitrovic' in Google
runs on