| Article Details | ||
|---|---|---|
| Title: | A Worst-Case Optimal Multi-Round Algorithm for Parallel Computation of Conjunctive Queries | |
| Article URLs: | ||
| Alternative Article URLs: | ||
| Authors: | Bas Ketsman |
|
| Dan Suciu |
|
|
| Sharing: | Research produced no artifacts | |
| Verification: | Authors have verified information | |
| Artifact Evaluation Badge: | none | |
| Artifact URLs: |
|
|
| Artifact Correspondence Email Addresses: |
|
|
| NSF Award Numbers: | 1535565 | |
| DBLP Key: | conf/pods/KetsmanS17 | |
| Author Comments: | ||