Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Deterministic massively parallel connectivity

Tools
- Tools
+ Tools

Coy, Sam and Czumaj, Artur (2022) Deterministic massively parallel connectivity. In: ACM SIGACT Symposium on Theory of Computing (STOC ’22), Rome, Italy, 20-24 Jun. Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC ’22) ISBN 9781450392648. doi:10.1145/3519935.3520055 (In Press)

[img]
Preview
PDF
WRAP-Deterministic-massively-parallel-connectivity-Coy-2022.pdf - Accepted Version - Requires a PDF viewer.

Download (841Kb) | Preview
Official URL: https://doi.org/10.1145/3519935.3520055

Request Changes to record.

Abstract

We consider the problem of designing fundamental graph algorithms on the model of Massive Parallel Computation (MPC). The input to the problem is an undirected graph

Item Type: Conference Item (Paper)
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Machine theory, Computational complexity, Parallel algorithms , Numbers, Random, Computer science -- Mathematics, Graph algorithms, Computer algorithms, Graph connectivity
Journal or Publication Title: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC ’22)
Publisher: ACM
ISBN: 9781450392648
Official Date: 2022
Dates:
DateEvent
2022Published
3 February 2022Accepted
DOI: 10.1145/3519935.3520055
Status: Peer Reviewed
Publication Status: In Press
Reuse Statement (publisher, data, author rights): © 2022 Copyright held by the owner/author(s). Publication rights licensed to ACM. This is the author’s version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC ’22), June 20–24, 2022, Rome, Italy, https://doi.org/10.1145/3519935.3520055.
Access rights to Published version: Restricted or Subscription Access
Copyright Holders: the owner/author(s). Publication rights licensed to ACM
Date of first compliant deposit: 19 April 2022
Date of first compliant Open Access: 21 April 2022
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
EP/V01305X/1[EPSRC] Engineering and Physical Sciences Research Councilhttp://dx.doi.org/10.13039/501100000266
DIMAP[EPSRC] Engineering and Physical Sciences Research Councilhttp://dx.doi.org/10.13039/501100000266
UNSPECIFIEDInternational Business Machines Corporationhttp://dx.doi.org/10.13039/100004316
Making Connections GrantWeizmann UKhttp://dx.doi.org/10.13039/100014383
Studentship[EPSRC] Engineering and Physical Sciences Research Councilhttp://dx.doi.org/10.13039/501100000266
Conference Paper Type: Paper
Title of Event: ACM SIGACT Symposium on Theory of Computing (STOC ’22)
Type of Event: Conference
Location of Event: Rome, Italy
Date(s) of Event: 20-24 Jun
Related URLs:
  • Organisation
Open Access Version:
  • ArXiv

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us