Equivalence classes and conditional hardness in massively parallel computations

The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Distributed computing Ročník 35; číslo 2; s. 165 - 183
Hlavní autori:	Nanongkai, Danupon, Scquizzato, Michele
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2022 Springer Nature B.V
Predmet:	Algorithms Complex networks Complexity Complexity class Computational complexity Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Conditional hardness Data handling Data processing Equivalence Equivalence classes Fine grained Fine-grained complexity Graph theory Hardness Large-scale data processing Low bound Lower bounds Massively Parallel Computation Massively parallels Parallel Computation Parallel computation model Parallel processing Robustness Shortest-path problems Software Engineering/Programming and Operating Systems Theory of Computation Fine-grained complexity Massively Parallel Computation Conditional hardness
ISSN:	0178-2770, 1432-0452, 1432-0452
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this model is to condition on conjectures about the hardness of some specific problems, such as graph connectivity on promise graphs that are either one cycle or two cycles, usually called the one cycle versus two cycles problem. This is unlike the traditional arguments based on conjectures about complexity classes (e.g., P ≠ NP ), which are often more robust in the sense that refuting them would lead to groundbreaking algorithms for a whole bunch of problems. In this paper we present connections between problems and classes of problems that allow the latter type of arguments. These connections concern the class of problems solvable in a sublogarithmic amount of rounds in the MPC model, denoted by MPC ( o ( log N ) ) , and the standard space complexity classes L and NL , and suggest conjectures that are robust in the sense that refuting them would lead to many surprisingly fast new algorithms in the MPC model. We also obtain new conditional lower bounds, and prove new reductions and equivalences between problems in the MPC model. Specifically, our main results are as follows. Lower bounds conditioned on the one cycle versus two cycles conjecture can be instead argued under the L ⊈ MPC ( o ( log N ) ) conjecture: these two assumptions are equivalent, and refuting either of them would lead to o ( log N ) -round MPC algorithms for a large number of challenging problems, including list ranking, minimum cut, and planarity testing. In fact, we show that these problems and many others require asymptotically the same number of rounds as the seemingly much easier problem of distinguishing between a graph being one cycle or two cycles. Many lower bounds previously argued under the one cycle versus two cycles conjecture can be argued under an even more robust (thus harder to refute) conjecture, namely NL ⊈ MPC ( o ( log N ) ) . Refuting this conjecture would lead to o ( log N ) -round MPC algorithms for an even larger set of problems, including all-pairs shortest paths, betweenness centrality, and all aforementioned ones. Lower bounds under this conjecture hold for problems such as perfect matching and network flow.
AbstractList	The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this model is to condition on conjectures about the hardness of some specific problems, such as graph connectivity on promise graphs that are either one cycle or two cycles, usually called the one cycle versus two cycles problem. This is unlike the traditional arguments based on conjectures about complexity classes (e.g., P≠ NP), which are often more robust in the sense that refuting them would lead to groundbreaking algorithms for a whole bunch of problems. In this paper we present connections between problems and classes of problems that allow the latter type of arguments. These connections concern the class of problems solvable in a sublogarithmic amount of rounds in the MPC model, denoted by MPC(o(log N)) , and the standard space complexity classes L and NL, and suggest conjectures that are robust in the sense that refuting them would lead to many surprisingly fast new algorithms in the MPC model. We also obtain new conditional lower bounds, and prove new reductions and equivalences between problems in the MPC model. Specifically, our main results are as follows.Lower bounds conditioned on the one cycle versus two cycles conjecture can be instead argued under the L⊈ MPC(o(log N)) conjecture: these two assumptions are equivalent, and refuting either of them would lead to o(log N) -round MPC algorithms for a large number of challenging problems, including list ranking, minimum cut, and planarity testing. In fact, we show that these problems and many others require asymptotically the same number of rounds as the seemingly much easier problem of distinguishing between a graph being one cycle or two cycles.Many lower bounds previously argued under the one cycle versus two cycles conjecture can be argued under an even more robust (thus harder to refute) conjecture, namely NL⊈ MPC(o(log N)). Refuting this conjecture would lead to o(log N) -round MPC algorithms for an even larger set of problems, including all-pairs shortest paths, betweenness centrality, and all aforementioned ones. Lower bounds under this conjecture hold for problems such as perfect matching and network flow. The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this model is to condition on conjectures about the hardness of some specific problems, such as graph connectivity on promise graphs that are either one cycle or two cycles, usually called the one cycle versus two cycles problem. This is unlike the traditional arguments based on conjectures about complexity classes (e.g., P ≠ NP ), which are often more robust in the sense that refuting them would lead to groundbreaking algorithms for a whole bunch of problems. In this paper we present connections between problems and classes of problems that allow the latter type of arguments. These connections concern the class of problems solvable in a sublogarithmic amount of rounds in the MPC model, denoted by MPC ( o ( log N ) ) , and the standard space complexity classes L and NL , and suggest conjectures that are robust in the sense that refuting them would lead to many surprisingly fast new algorithms in the MPC model. We also obtain new conditional lower bounds, and prove new reductions and equivalences between problems in the MPC model. Specifically, our main results are as follows.Lower bounds conditioned on the one cycle versus two cycles conjecture can be instead argued under the L ⊈ MPC ( o ( log N ) ) conjecture: these two assumptions are equivalent, and refuting either of them would lead to o ( log N ) -round MPC algorithms for a large number of challenging problems, including list ranking, minimum cut, and planarity testing. In fact, we show that these problems and many others require asymptotically the same number of rounds as the seemingly much easier problem of distinguishing between a graph being one cycle or two cycles.Many lower bounds previously argued under the one cycle versus two cycles conjecture can be argued under an even more robust (thus harder to refute) conjecture, namely NL ⊈ MPC ( o ( log N ) ) . Refuting this conjecture would lead to o ( log N ) -round MPC algorithms for an even larger set of problems, including all-pairs shortest paths, betweenness centrality, and all aforementioned ones. Lower bounds under this conjecture hold for problems such as perfect matching and network flow.The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this model is to condition on conjectures about the hardness of some specific problems, such as graph connectivity on promise graphs that are either one cycle or two cycles, usually called the one cycle versus two cycles problem. This is unlike the traditional arguments based on conjectures about complexity classes (e.g., P ≠ NP ), which are often more robust in the sense that refuting them would lead to groundbreaking algorithms for a whole bunch of problems. In this paper we present connections between problems and classes of problems that allow the latter type of arguments. These connections concern the class of problems solvable in a sublogarithmic amount of rounds in the MPC model, denoted by MPC ( o ( log N ) ) , and the standard space complexity classes L and NL , and suggest conjectures that are robust in the sense that refuting them would lead to many surprisingly fast new algorithms in the MPC model. We also obtain new conditional lower bounds, and prove new reductions and equivalences between problems in the MPC model. Specifically, our main results are as follows.Lower bounds conditioned on the one cycle versus two cycles conjecture can be instead argued under the L ⊈ MPC ( o ( log N ) ) conjecture: these two assumptions are equivalent, and refuting either of them would lead to o ( log N ) -round MPC algorithms for a large number of challenging problems, including list ranking, minimum cut, and planarity testing. In fact, we show that these problems and many others require asymptotically the same number of rounds as the seemingly much easier problem of distinguishing between a graph being one cycle or two cycles.Many lower bounds previously argued under the one cycle versus two cycles conjecture can be argued under an even more robust (thus harder to refute) conjecture, namely NL ⊈ MPC ( o ( log N ) ) . Refuting this conjecture would lead to o ( log N ) -round MPC algorithms for an even larger set of problems, including all-pairs shortest paths, betweenness centrality, and all aforementioned ones. Lower bounds under this conjecture hold for problems such as perfect matching and network flow. The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this model is to condition on conjectures about the hardness of some specific problems, such as graph connectivity on promise graphs that are either one cycle or two cycles, usually called the one cycle versus two cycles problem. This is unlike the traditional arguments based on conjectures about complexity classes (e.g., P≠NP), which are often more robust in the sense that refuting them would lead to groundbreaking algorithms for a whole bunch of problems. In this paper we present connections between problems and classes of problems that allow the latter type of arguments. These connections concern the class of problems solvable in a sublogarithmic amount of rounds in the MPC model, denoted by MPC(o(logN)), and the standard space complexity classes L and NL, and suggest conjectures that are robust in the sense that refuting them would lead to many surprisingly fast new algorithms in the MPC model. We also obtain new conditional lower bounds, and prove new reductions and equivalences between problems in the MPC model. Specifically, our main results are as follows.Lower bounds conditioned on the one cycle versus two cycles conjecture can be instead argued under the L⊈MPC(o(logN)) conjecture: these two assumptions are equivalent, and refuting either of them would lead to o(logN)-round MPC algorithms for a large number of challenging problems, including list ranking, minimum cut, and planarity testing. In fact, we show that these problems and many others require asymptotically the same number of rounds as the seemingly much easier problem of distinguishing between a graph being one cycle or two cycles.Many lower bounds previously argued under the one cycle versus two cycles conjecture can be argued under an even more robust (thus harder to refute) conjecture, namely NL⊈MPC(o(logN)). Refuting this conjecture would lead to o(logN)-round MPC algorithms for an even larger set of problems, including all-pairs shortest paths, betweenness centrality, and all aforementioned ones. Lower bounds under this conjecture hold for problems such as perfect matching and network flow. The (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this model is to condition on conjectures about the hardness of some specific problems, such as graph connectivity on promise graphs that are either one cycle or two cycles, usually called the problem. This is unlike the traditional arguments based on conjectures about complexity classes (e.g., ), which are often more robust in the sense that refuting them would lead to groundbreaking algorithms for a whole bunch of problems. In this paper we present connections between problems and classes of problems that allow the latter type of arguments. These connections concern the class of problems solvable in a sublogarithmic amount of rounds in the MPC model, denoted by , and the standard space complexity classes and , and suggest conjectures that are robust in the sense that refuting them would lead to many surprisingly fast new algorithms in the MPC model. We also obtain new conditional lower bounds, and prove new reductions and equivalences between problems in the MPC model. Specifically, our main results are as follows.Lower bounds conditioned on the one cycle versus two cycles conjecture can be instead argued under the conjecture: these two assumptions are equivalent, and refuting either of them would lead to -round MPC algorithms for a large number of challenging problems, including list ranking, minimum cut, and planarity testing. In fact, we show that these problems and many others require asymptotically the same number of rounds as the seemingly much easier problem of distinguishing between a graph being one cycle or two cycles.Many lower bounds previously argued under the one cycle versus two cycles conjecture can be argued under an even more robust (thus harder to refute) conjecture, namely . Refuting this conjecture would lead to -round MPC algorithms for an even larger set of problems, including all-pairs shortest paths, betweenness centrality, and all aforementioned ones. Lower bounds under this conjecture hold for problems such as perfect matching and network flow. The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this model is to condition on conjectures about the hardness of some specific problems, such as graph connectivity on promise graphs that are either one cycle or two cycles, usually called the one cycle versus two cycles problem. This is unlike the traditional arguments based on conjectures about complexity classes (e.g., $$\textsf {P}\ne \textsf {NP}$$ P ≠ NP ), which are often more robust in the sense that refuting them would lead to groundbreaking algorithms for a whole bunch of problems. In this paper we present connections between problems and classes of problems that allow the latter type of arguments. These connections concern the class of problems solvable in a sublogarithmic amount of rounds in the MPC model, denoted by $$\textsf {MPC}(o(\log N))$$ MPC ( o ( log N ) ) , and the standard space complexity classes $$\textsf {L}$$ L and $$\textsf {NL}$$ NL , and suggest conjectures that are robust in the sense that refuting them would lead to many surprisingly fast new algorithms in the MPC model. We also obtain new conditional lower bounds, and prove new reductions and equivalences between problems in the MPC model. Specifically, our main results are as follows. Lower bounds conditioned on the one cycle versus two cycles conjecture can be instead argued under the $$\textsf {L}\nsubseteq \textsf {MPC}(o(\log N))$$ L ⊈ MPC ( o ( log N ) ) conjecture: these two assumptions are equivalent, and refuting either of them would lead to $$o(\log N)$$ o ( log N ) -round MPC algorithms for a large number of challenging problems, including list ranking, minimum cut, and planarity testing. In fact, we show that these problems and many others require asymptotically the same number of rounds as the seemingly much easier problem of distinguishing between a graph being one cycle or two cycles. Many lower bounds previously argued under the one cycle versus two cycles conjecture can be argued under an even more robust (thus harder to refute) conjecture, namely $$\textsf {NL}\nsubseteq \textsf {MPC}(o(\log N))$$ NL ⊈ MPC ( o ( log N ) ) . Refuting this conjecture would lead to $$o(\log N)$$ o ( log N ) -round MPC algorithms for an even larger set of problems, including all-pairs shortest paths, betweenness centrality, and all aforementioned ones. Lower bounds under this conjecture hold for problems such as perfect matching and network flow. The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this model is to condition on conjectures about the hardness of some specific problems, such as graph connectivity on promise graphs that are either one cycle or two cycles, usually called the one cycle versus two cycles problem. This is unlike the traditional arguments based on conjectures about complexity classes (e.g., $$\textsf {P}\ne \textsf {NP}$$ P≠NP), which are often more robust in the sense that refuting them would lead to groundbreaking algorithms for a whole bunch of problems. In this paper we present connections between problems and classes of problems that allow the latter type of arguments. These connections concern the class of problems solvable in a sublogarithmic amount of rounds in the MPC model, denoted by $$\textsf {MPC}(o(\log N))$$ MPC(o(logN)), and the standard space complexity classes $$\textsf {L}$$ L and $$\textsf {NL}$$ NL, and suggest conjectures that are robust in the sense that refuting them would lead to many surprisingly fast new algorithms in the MPC model. We also obtain new conditional lower bounds, and prove new reductions and equivalences between problems in the MPC model. Specifically, our main results are as follows.Lower bounds conditioned on the one cycle versus two cycles conjecture can be instead argued under the $$\textsf {L}\nsubseteq \textsf {MPC}(o(\log N))$$ L⊈MPC(o(logN)) conjecture: these two assumptions are equivalent, and refuting either of them would lead to $$o(\log N)$$ o(logN)-round MPC algorithms for a large number of challenging problems, including list ranking, minimum cut, and planarity testing. In fact, we show that these problems and many others require asymptotically the same number of rounds as the seemingly much easier problem of distinguishing between a graph being one cycle or two cycles.Many lower bounds previously argued under the one cycle versus two cycles conjecture can be argued under an even more robust (thus harder to refute) conjecture, namely $$\textsf {NL}\nsubseteq \textsf {MPC}(o(\log N))$$ NL⊈MPC(o(logN)). Refuting this conjecture would lead to $$o(\log N)$$ o(logN)-round MPC algorithms for an even larger set of problems, including all-pairs shortest paths, betweenness centrality, and all aforementioned ones. Lower bounds under this conjecture hold for problems such as perfect matching and network flow. The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of classical graph problems. So far, the only way to argue lower bounds for this model is to condition on conjectures about the hardness of some specific problems, such as graph connectivity on promise graphs that are either one cycle or two cycles, usually called the one cycle versus two cycles problem. This is unlike the traditional arguments based on conjectures about complexity classes (e.g., P ≠ NP ), which are often more robust in the sense that refuting them would lead to groundbreaking algorithms for a whole bunch of problems. In this paper we present connections between problems and classes of problems that allow the latter type of arguments. These connections concern the class of problems solvable in a sublogarithmic amount of rounds in the MPC model, denoted by MPC ( o ( log N ) ) , and the standard space complexity classes L and NL , and suggest conjectures that are robust in the sense that refuting them would lead to many surprisingly fast new algorithms in the MPC model. We also obtain new conditional lower bounds, and prove new reductions and equivalences between problems in the MPC model. Specifically, our main results are as follows. Lower bounds conditioned on the one cycle versus two cycles conjecture can be instead argued under the L ⊈ MPC ( o ( log N ) ) conjecture: these two assumptions are equivalent, and refuting either of them would lead to o ( log N ) -round MPC algorithms for a large number of challenging problems, including list ranking, minimum cut, and planarity testing. In fact, we show that these problems and many others require asymptotically the same number of rounds as the seemingly much easier problem of distinguishing between a graph being one cycle or two cycles. Many lower bounds previously argued under the one cycle versus two cycles conjecture can be argued under an even more robust (thus harder to refute) conjecture, namely NL ⊈ MPC ( o ( log N ) ) . Refuting this conjecture would lead to o ( log N ) -round MPC algorithms for an even larger set of problems, including all-pairs shortest paths, betweenness centrality, and all aforementioned ones. Lower bounds under this conjecture hold for problems such as perfect matching and network flow.
Author	Nanongkai, Danupon Scquizzato, Michele
Author_xml	– sequence: 1 givenname: Danupon surname: Nanongkai fullname: Nanongkai, Danupon organization: University of Copenhagen, KTH Royal Institute of Technology – sequence: 2 givenname: Michele orcidid: 0000-0002-9108-2448 surname: Scquizzato fullname: Scquizzato, Michele email: scquizza@math.unipd.it organization: University of Padova
BackLink	https://www.ncbi.nlm.nih.gov/pubmed/35300185$$D View this record in MEDLINE/PubMed https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-319607$$DView record from Swedish Publication Index (Kungliga Tekniska Högskolan)
BookMark	eNp9kktv1DAUhS1URKeFP8ACRWLDJnD9ip0NUlXKQ6rUDbC1PI4z4-LYUzuZqv8eh0yBdtGVrevvXB0dnxN0FGKwCL3G8B4DiA8ZgLGmBoLrcsOyJs_QCjNKamCcHKEVYFGGQsAxOsn5GgAoxuQFOqacAmDJV-jq4mZye-1tMLYyXudsc6VDV5kYOje6GLSvtjp1weZcuVANBXF76--qnU7ae-sLOuymUc9wfome99pn--pwnqIfny--n3-tL6--fDs_u6wNF3Ks20Z3Ruo1bzgXuO0105QJLntcBtKIntBuLYwUhnG7Nm0H2rYN04L1hnIG9BTVy958a3fTWu2SG3S6U1E79cn9PFMxbdSvcasobhsQhf-48AUebGdsGIv7B7KHL8Ft1SbulWxBYNKWBe8OC1K8mWwe1eCysd7rYOOUFWkYngOG2dvbR-h1nFIJcqaoaJgs-Rfqzf-O_lq5_5sCyAUwKeacbK-MW1IuBp1XGNRcA7XUQJUaqD81UKRIySPp_fYnRfQQaYHDxqZ_tp9Q_QYfwMWh
CitedBy_id	crossref_primary_10_1007_s00446_024_00461_9 crossref_primary_10_1016_j_jpdc_2023_02_010
Cites_doi	10.1145/1272998.1273005 10.1137/1.9781611975482.98 10.1109/FOCS.2019.00097 10.1145/277651.277662 10.1137/0213028 10.1109/FOCS.2017.70 10.1016/S0022-0000(70)80006-X 10.1137/1.9781611973730.112 10.1145/28395.28409 10.1016/0304-3975(82)90058-5 10.1142/9789813272880_0188 10.1145/225058.225101 10.1145/3181776 10.1007/s00224-013-9469-9 10.1145/1327452.1327492 10.1137/1.9781611975031.155 10.1109/FOCS.2019.00095 10.1145/3451992 10.1137/0218038 10.1016/j.ic.2003.09.002 10.1016/0196-6774(87)90018-6 10.1145/3382734.3405737 10.1145/3465084.3467903 10.1145/1989493.1989505 10.1016/S0019-9958(85)80041-3 10.1145/3055399.3055460 10.1145/3186893 10.1109/FOCS.2018.00070 10.1145/3357713.3384303 10.1145/277651.277681 10.1137/S0097539795294141 10.1137/18M1197655 10.1145/3350755.3400223 10.1137/1.9781611975031.76 10.1145/2670979.2670997 10.1109/ICDE.2013.6544813 10.1145/3232536 10.1007/PL00001603 10.1145/2611462.2611493 10.1007/BF01683259 10.1007/978-3-642-25591-5_39 10.1145/2934664 10.1145/3293611.3331596 10.1145/3125644 10.1145/2304576.2304607 10.1007/978-3-662-44465-8_33 10.1145/3293611.3331609 10.1137/1.9781611975482.100 10.14778/3424573.3424579 10.1006/jcss.1997.1485 10.1145/3210377.3210391 10.1109/FOCS.2019.00096 10.1137/1.9781611973075.76 10.1137/1.9781611973730.28 10.1145/2767386.2767434 10.1007/978-1-4612-0539-5 10.1109/SWAT.1971.4 10.1145/2809814 10.1016/j.tcs.2015.09.029 10.1016/S0022-0000(75)80050-X 10.1145/3460900 10.1145/3293611.3331607 10.1145/1391289.1391291 10.1145/1132516.1132583 10.1145/2591796.2591805 10.1017/CBO9780511804090 10.1137/1.9781611975994.79 10.1145/3212734.3212743 10.1137/1.9781611975482.48 10.1145/3209689 10.1006/jcss.1995.1035 10.1007/978-3-662-48653-5_1 10.1137/1.9781611975482.99 10.1145/79173.79181 10.1137/1.9781611973099.40
ContentType	Journal Article
Copyright	The Author(s) 2022 The Author(s) 2022. The Author(s) 2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: The Author(s) 2022 – notice: The Author(s) 2022. – notice: The Author(s) 2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	C6C AAYXX CITATION NPM 3V. 7RQ 7SC 7XB 8AL 8AO 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U U9A 7X8 5PM ADTPV AFDQA AOWAS D8T D8V ZZAVC
DOI	10.1007/s00446-021-00418-2
DatabaseName	Springer Nature OA Free Journals CrossRef PubMed ProQuest Central (Corporate) Career & Technical Education Database Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology collection ProQuest One Community College ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic MEDLINE - Academic PubMed Central (Full Participant titles) SwePub SWEPUB Kungliga Tekniska Högskolan full text SwePub Articles SWEPUB Freely available online SWEPUB Kungliga Tekniska Högskolan SwePub Articles full text
DatabaseTitle	CrossRef PubMed Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Pharma Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Career and Technical Education (Alumni Edition) Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest Career and Technical Education ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) MEDLINE - Academic
DatabaseTitleList	MEDLINE - Academic Computer Science Database PubMed CrossRef
Database_xml	– sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: 7RQ name: Career & Technical Education Database url: https://search.proquest.com/career sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1432-0452
EndPage	183
ExternalDocumentID	oai_DiVA_org_kth_319607 PMC8907129 35300185 10_1007_s00446_021_00418_2
Genre	Journal Article
GrantInformation_xml	– fundername: European Research Council grantid: 715672 funderid: http://dx.doi.org/10.13039/501100000781 – fundername: Università degli Studi di Padova grantid: BIRD197859/19 funderid: http://dx.doi.org/10.13039/501100003500 – fundername: ; grantid: 715672 – fundername: ; grantid: BIRD197859/19
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 203 28- 29G 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 7RQ 8AO 8FE 8FG 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDPE ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BPHCQ BSONS C6C CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBD EBLON EBS EDO EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K6V K7- KDC KOV KOW LAS LLZTM M0N M4Y MA- N2Q N9A NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PQQKQ PROAC PT4 PT5 Q2X QOK QOS R4E R89 R9I RHV RIG RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR YZZ Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZCA ZMTXR ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AETEA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB NPM 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U U9A 7X8 PUEGO 5PM ADTPV AFDQA AOWAS D8T D8V ZZAVC
ID	FETCH-LOGICAL-c578t-96adc8ab5655719fa4a34758f16558c7f23db7c87c45ebc9d0ae964a74fc35403
IEDL.DBID	K7-
ISICitedReferencesCount	8
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000744824300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0178-2770 1432-0452
IngestDate	Tue Nov 04 16:57:37 EST 2025 Tue Nov 04 01:38:31 EST 2025 Mon Sep 29 02:14:05 EDT 2025 Tue Dec 02 16:00:07 EST 2025 Wed Feb 19 02:05:10 EST 2025 Sat Nov 29 06:13:26 EST 2025 Tue Nov 18 20:56:21 EST 2025 Fri Feb 21 02:47:28 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	Fine-grained complexity Massively Parallel Computation Conditional hardness
Language	English
License	The Author(s) 2022. Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c578t-96adc8ab5655719fa4a34758f16558c7f23db7c87c45ebc9d0ae964a74fc35403
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
ORCID	0000-0002-9108-2448
OpenAccessLink	https://link.springer.com/10.1007/s00446-021-00418-2
PMID	35300185
PQID	2637648353
PQPubID	31799
PageCount	19
ParticipantIDs	swepub_primary_oai_DiVA_org_kth_319607 pubmedcentral_primary_oai_pubmedcentral_nih_gov_8907129 proquest_miscellaneous_2641000300 proquest_journals_2637648353 pubmed_primary_35300185 crossref_citationtrail_10_1007_s00446_021_00418_2 crossref_primary_10_1007_s00446_021_00418_2 springer_journals_10_1007_s00446_021_00418_2
PublicationCentury	2000
PublicationDate	2022-04-01
PublicationDateYYYYMMDD	2022-04-01
PublicationDate_xml	– month: 04 year: 2022 text: 2022-04-01 day: 01
PublicationDecade	2020
PublicationPlace	Berlin/Heidelberg
PublicationPlace_xml	– name: Berlin/Heidelberg – name: Germany – name: Heidelberg
PublicationTitle	Distributed computing
PublicationTitleAbbrev	Distrib. Comput
PublicationTitleAlternate	Distrib Comput
PublicationYear	2022
Publisher	Springer Berlin Heidelberg Springer Nature B.V
Publisher_xml	– name: Springer Berlin Heidelberg – name: Springer Nature B.V
References	Chang, Y.-J., Fischer, M., Ghaffari, M., Uitto, J., Zheng, Y.: The complexity of (Δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta $$\end{document}+1) coloring in congested clique, massively parallel computation, and centralized local computation. In: Proceedings of the 38th ACM Symposium on Principles of Distributed Computing (PODC), pp. 471–480 (2019) Ghaffari, M., Kuhn, F., Uitto, J.: Conditional hardness results for massively parallel computation from distributed lower bounds. In: Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 1650–1663 (2019) Behnezhad, S., Hajiaghayi, M., Harris, D.G.: Exponentially faster massively parallel maximal matching. In: Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 1637–1649 (2019) Andoni, A., Stein, C., Song, Z., Wang, Z., Zhong, P.: Parallel graph connectivity in log diameter rounds. In: Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 674–685 (2018) BilardiGScquizzatoMSilvestriFA lower bound technique for communication in BSPACM Trans. Parallel Comput.20184312710.1145/3181776 Goodrich, M.T., Sitchinava, N., Zhang, Q.: Sorting, searching, and simulation in the MapReduce framework. In: Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC), pp. 374–383 (2011) Korhonen, J.H., Suomela, J.: Towards a complexity theory for the congested clique. In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 163–172 (2018) Andoni, A., Nikolov, A., Onak, K., Yaroslavtsev, G.: Parallel algorithms for geometric graph problems. In: Proceedings of the 46th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 574–583 (2014) Im, S., Moseley, B., Sun, X.: Efficient massively parallel methods for dynamic programming. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 798–811 (2017) PanduranganGRobinsonPScquizzatoMFast distributed algorithms for connectivity and MST in large graphsACM Trans. Parallel Comput.20185112210.1145/3209689 Assadi, S., Bateni, M., Bernstein, A., Mirrokni, V.S., Stein, C.: Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1616–1635 (2019) AllenderEMahajanMThe complexity of planarity testingInf. Comput.20041891117134203192010.1016/j.ic.2003.09.002 CookSAA taxonomy of problems with fast parallel algorithmsInf. Control1985641–322283708810.1016/S0019-9958(85)80041-3 DeanJGhemawatSMapReduce: simplified data processing on large clustersCommun. ACM200851110711310.1145/1327452.1327492 Jacob, R., Lieber, T., Sitchinava, N.: On the complexity of list ranking in the parallel external memory model. In: Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 384–395 (2014) LewisHRPapadimitriouCHSymmetric space-bounded computationTheor. Comput. Sci.19821916118766653910.1016/0304-3975(82)90058-5 PapadimitriouCHComputational Complexity1994BostonAddison-Wesley0833.68049 Klauck, H., Nanongkai, D., Pandurangan, G.,Robinson, P.: Distributed computation of large-scale graph problems. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 391–410 (2015) Reingold, O., Trevisan, L., Vadhan, S.P.: Pseudorandom walks on regular digraphs and the RL vs. L problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 457–466 (2006) ChandraAKStockmeyerLJVishkinUConstant depth reducibilitySIAM J. Comput.198413242343973999810.1137/0213028 Pietracaprina, A., Pucci, G., Riondato, M., Silvestri, F., Upfal, E.: Space-round tradeoffs for MapReduce computations. In: Proceedings of the 26th International Conference on Supercomputing (ICS), pp. 235–244 (2012) WhiteTHadoop: The Definitive Guide2012SebastopolO’Reilly Media, Inc. CzumajADaviesPParterMGraph sparsification for derandomizing massively parallel computation with low spaceACM Trans. Algorithms2021172127427893310.1145/3451992 Karloff, H.J., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: Proceedings of the 21st annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 938–948 (2010) KumarRMoseleyBVassilvitskiiSVattaniAFast greedy algorithms in MapReduce and streamingACM Trans. Parallel Comput.20152312210.1145/2809814 Nanongkai, D., Scquizzato, M.: Equivalence classes and conditional hardness in massively parallel computations. In: Proceedings of the 23rd International Conference on Principles of Distributed Systems (OPODIS), pp. 33:1–33:16 (2019) HegemanJWPemmarajuSVLessons from the congested clique applied to MapReduceTheor. Comput. Sci.2015608268281342908310.1016/j.tcs.2015.09.029 Kiveris, R., Lattanzi, S., Mirrokni, V.S., Rastogi, V., Vassilvitskii, S.: Connected components in MapReduce and beyond. In: Proceedings of the ACM Symposium on Cloud Computing (SoCC), pp. 18:1–18:13 (2014) Karger, D.R.: Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 21–30 (1993) RoughgardenTVassilvitskiiSWangJRShuffles and circuits (on lower bounds for modern parallel computation)J. ACM2018656124388258510.1145/3232536 BehnezhadSDhulipalaLEsfandiariHLackiJMirrokniVSSchudyWParallel graph algorithms in constant adaptive rounds: theory meets practiceProc. VLDB Endow.202013133588360210.14778/3424573.3424579 Ghaffari, M., Nowicki, K.: Massively parallel algorithms for minimum cut. In: Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC), pp. 119–128 (2020) Abboud, A., Grandoni, F., Vassilevska Williams, V.: Subcubic equivalences between graph centrality problems, APSP and diameter. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1681–1697 (2015) PanduranganGRobinsonPScquizzatoMOn the distributed complexity of large-scale graph computationsACM Trans. Parallel Comput.202182128429566010.1145/3460900 Scquizzato, M.,Silvestri, F.: Communication lower bounds for distributed-memory computations. In: Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 627–638 (2014) Onak, K.: Personal communication (2019) Behnezhad, S., Derakhshan, M., Hajiaghayi, M.: Semi-MapReduce meets congested clique. CoRR (2018). arXiv:1802.10297 SipserMIntroduction to the Theory of Computation1997BostonPWS Publishing Company1169.68300 BorodinACookSADymondPWRuzzoWLTompaMTwo applications of inductive counting for complementation problemsSIAM J. Comput.198918355957899683610.1137/0218038 Boroujeni, M., Ehsani, S., Ghodsi, M., Hajiaghayi, M.T. , Seddighin, S.: Approximating edit distance in truly subquadratic time: quantum and MapReduce. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1170–1189 (2018) Assadi , S., Khanna, S.: Tight bounds on the round complexity of the distributed maximum coverage problem. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2412–2431 (2018) Ghaffari, M., Gouleakis, T., Konrad, C., Mitrovic, S., Rubinfeld, R.: Improved massively parallel computation algorithms for MIS, matching, and vertex cover. In: Proceedings of the 37th ACM Symposium on Principles of Distributed Computing (PODC), pp. 129–138 (2018) Chung, K., Ho, K., Sun, X.: On the hardness of massively parallel computation. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 153–162 (2020) DasBDattaSNimbhorkarPLog-space algorithms for paths and matchings in k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-treesTheory Comput. Syst.2013534669689308435810.1007/s00224-013-9469-9 Drucker, A., Kuhn, F., Oshman, R.: On the power of the congested clique model. In: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing (PODC), pp. 367–376 (2014) ZahariaMXinRSWendellPDasTArmbrustMDaveAMengXRosenJVenkataramanSFranklinMJGhodsiAGonzalezJShenkerSStoicaIApache Spark: a unified engine for big data processingCommun. ACM20165911566510.1145/2934664 Nisan, N., Ta-Shma, A.: Symmetric logspace is closed under complement. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC), pp. 140–146 (1995) Rastogi, V., Machanavajjhala, A., Chitnis, L., Sarma, A.D.: Finding connected components in Map-Reduce in logarithmic rounds. In: Proceedings of the 29th IEEE International Conference on Data Engineering (ICDE), pp. 50–61 (2013) Behnezhad, S., Dhulipala, L., Esfandiari, H., Lacki, J., Mirrokni, V.: Near-optimal massively parallel graph connectivity. In: Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 1615–1636 (2019) SavitchWJRelationships between nondeterministic and deterministic tape complexitiesJ. Comput. Syst. Sci.19704217719226670210.1016/S0022-0000(70)80006-X ImmermanNDescriptive Complexity1999BerlinSpringer10.1007/978-1-4612-0539-5 Fischer, M.J., Meyer, A.R.: Boolean matrix multiplication and transitive closure. In: Proceedings of the 12th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 129–131 (1971) JonesNDSpace-bounded reducibility among combinatorial problemsJ. Comput. Syst. Sci.1975111688539816510.1016/S0022-0000(75)80050-X Vassilevska WilliamsVWilliamsRRSubcubic equivalences between path, matrix, and triangle problemsJ. ACM2018655138385653910.1145/3186893 JonesNDLienYELaaserWTNew problems complete for nondeterministic log spaceMath. Sys 418_CR17 418_CR18 G Pandurangan (418_CR71) 2018; 5 418_CR19 418_CR52 418_CR54 418_CR11 A Borodin (418_CR23) 1989; 18 418_CR55 418_CR12 418_CR13 418_CR14 418_CR58 418_CR59 ND Jones (418_CR56) 1975; 11 E Allender (418_CR5) 2004; 189 418_CR51 T Roughgarden (418_CR78) 2018; 65 418_CR1 418_CR2 418_CR49 LG Valiant (418_CR83) 1990; 33 N Immerman (418_CR53) 1999 V Vassilevska Williams (418_CR85) 2018; 65 418_CR41 418_CR42 A Czumaj (418_CR33) 2020; 49 418_CR43 418_CR87 418_CR44 418_CR45 418_CR47 418_CR48 S Behnezhad (418_CR20) 2020; 13 SA Cook (418_CR30) 1987; 8 418_CR80 G Pandurangan (418_CR72) 2021; 8 HR Lewis (418_CR66) 1982; 19 418_CR82 M Zaharia (418_CR88) 2016; 59 G Bilardi (418_CR22) 2018; 4 418_CR40 418_CR84 MT Goodrich (418_CR46) 1999; 29 FN Afrati (418_CR3) 2013; 6 A Czumaj (418_CR32) 2021; 17 J Dean (418_CR35) 2008; 51 418_CR39 ND Jones (418_CR57) 1976; 10 M Beaudry (418_CR16) 1995; 50 K Etessami (418_CR38) 1997; 54 418_CR74 418_CR31 418_CR75 418_CR77 B Das (418_CR34) 2013; 53 418_CR36 418_CR37 418_CR70 AK Chandra (418_CR26) 1984; 13 SA Cook (418_CR29) 1985; 64 418_CR27 418_CR28 418_CR4 C Àlvarez (418_CR6) 2000; 9 418_CR9 JW Hegeman (418_CR50) 2015; 608 418_CR7 418_CR8 418_CR64 418_CR21 418_CR65 418_CR67 T White (418_CR86) 2012 418_CR24 418_CR68 P Beame (418_CR15) 2017; 64 418_CR25 418_CR69 R Kumar (418_CR63) 2015; 2 O Reingold (418_CR76) 2008; 55 418_CR60 418_CR61 418_CR62 CH Papadimitriou (418_CR73) 1994 S Arora (418_CR10) 2009 WJ Savitch (418_CR79) 1970; 4 M Sipser (418_CR81) 1997
References_xml	– reference: Korhonen, J.H., Suomela, J.: Towards a complexity theory for the congested clique. In: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 163–172 (2018) – reference: Goodrich, M.T., Sitchinava, N., Zhang, Q.: Sorting, searching, and simulation in the MapReduce framework. In: Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC), pp. 374–383 (2011) – reference: ReingoldOUndirected connectivity in log-spaceJ. ACM200855417:1-17:24244501410.1145/1391289.1391291 – reference: Dhulipala, L., Durfee, D., Kulkarni, J., Peng, R., Sawlani, S., Sun, X.: Parallel batch-dynamic graphs: algorithms and lower bounds. In: Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1300–1319 (2020) – reference: Behnezhad, S., Dhulipala, L., Esfandiari, H., Lacki, J., Mirrokni, V.: Near-optimal massively parallel graph connectivity. In: Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 1615–1636 (2019) – reference: Rastogi, V., Machanavajjhala, A., Chitnis, L., Sarma, A.D.: Finding connected components in Map-Reduce in logarithmic rounds. In: Proceedings of the 29th IEEE International Conference on Data Engineering (ICDE), pp. 50–61 (2013) – reference: Assadi, S., Bateni, M., Bernstein, A., Mirrokni, V.S., Stein, C.: Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1616–1635 (2019) – reference: Frei, F., Wada, K.: Efficient circuit simulation in MapReduce. In: Proceedings of the 30th International Symposium on Algorithms and Computation (ISAAC), pp. 52:1–52:21 (2019) – reference: Isard, M., Budiu, M., Yu, Y., Birrell, A.,Fetterly, D.: Dryad: distributed data-parallel programs from sequential building blocks. In: Proceedings of the 2007 EuroSys Conference, pp. 59–72 (2007) – reference: BeaudryMMcKenziePCircuits, matrices, and nonassociative computationJ. Comput. Syst. Sci.1995503441455133955410.1006/jcss.1995.1035 – reference: Lattanzi, S., Moseley, B., Suri, S., Vassilvitskii, S.: Filtering: a method for solving graph problems in MapReduce. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 85–94 (2011) – reference: SipserMIntroduction to the Theory of Computation1997BostonPWS Publishing Company1169.68300 – reference: Czumaj, A., Davies, P., Parter, M.: Component stability in low-space massively parallel computation. In: Proceedings of the 40th ACM Symposium on Principles of Distributed Computing (PODC), pp. 481–491 (2021) – reference: Nanongkai, D., Scquizzato, M.: Equivalence classes and conditional hardness in massively parallel computations. In: Proceedings of the 23rd International Conference on Principles of Distributed Systems (OPODIS), pp. 33:1–33:16 (2019) – reference: Reingold, O., Trevisan, L., Vadhan, S.P.: Pseudorandom walks on regular digraphs and the RL vs. L problem. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 457–466 (2006) – reference: Svensson, O., Tarnawski, J.: The matching problem in general graphs is in quasi-NC. In: Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 696–707 (2017) – reference: ÀlvarezCGreenlawRA compendium of problems complete for symmetric logarithmic spaceComput. Complex.200092123145180968810.1007/PL00001603 – reference: JonesNDSpace-bounded reducibility among combinatorial problemsJ. Comput. Syst. Sci.1975111688539816510.1016/S0022-0000(75)80050-X – reference: Assadi, S., Chen, Y., Khanna, Y.: Sublinear algorithms for (Δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta $$\end{document}+1) vertex coloring. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 767–786 (2019) – reference: ChandraAKStockmeyerLJVishkinUConstant depth reducibilitySIAM J. Comput.198413242343973999810.1137/0213028 – reference: Jacob, R., Lieber, T., Sitchinava, N.: On the complexity of list ranking in the parallel external memory model. In: Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 384–395 (2014) – reference: BehnezhadSDhulipalaLEsfandiariHLackiJMirrokniVSSchudyWParallel graph algorithms in constant adaptive rounds: theory meets practiceProc. VLDB Endow.202013133588360210.14778/3424573.3424579 – reference: Karloff, H.J., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: Proceedings of the 21st annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 938–948 (2010) – reference: AfratiFNSarmaADSalihogluSUllmanJDUpper and lower bounds on the cost of a Map-Reduce computationPVLDB201364277288 – reference: Ahn, K.J., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 459–467 (2012) – reference: Im, S.,Moseley, B.: A conditional lower bound on graph connectivity in MapReduce. CoRR (2019). arXiv: 1904.08954 – reference: Assadi , S., Khanna, S.: Tight bounds on the round complexity of the distributed maximum coverage problem. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2412–2431 (2018) – reference: HegemanJWPemmarajuSVLessons from the congested clique applied to MapReduceTheor. Comput. Sci.2015608268281342908310.1016/j.tcs.2015.09.029 – reference: Ghaffari, M., Nowicki, K.: Massively parallel algorithms for minimum cut. In: Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC), pp. 119–128 (2020) – reference: Nisan, N., Ta-Shma, A.: Symmetric logspace is closed under complement. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC), pp. 140–146 (1995) – reference: ZahariaMXinRSWendellPDasTArmbrustMDaveAMengXRosenJVenkataramanSFranklinMJGhodsiAGonzalezJShenkerSStoicaIApache Spark: a unified engine for big data processingCommun. ACM20165911566510.1145/2934664 – reference: Yaroslavtsev, G., Vadapalli, A.: Massively parallel algorithms and hardness for single-linkage clustering under ℓp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell _p$$\end{document}-distances. In: Proceedings of the 34th International Conference on Machine Learning (ICML), pp. 5596–5605 (2018) – reference: DeanJGhemawatSMapReduce: simplified data processing on large clustersCommun. ACM200851110711310.1145/1327452.1327492 – reference: Behnezhad, S., Brandt, S., Derakhshan, M., Fischer, M., Hajiaghayi, M., Karp, R.M., Uitto, J.: Massively parallel computation of matching and MIS in sparse graphs. In: Proceedings of the 38th ACM Symposium on Principles of Distributed Computing (PODC), pp. 481–490 (2019) – reference: Ghaffari, M., Gouleakis, T., Konrad, C., Mitrovic, S., Rubinfeld, R.: Improved massively parallel computation algorithms for MIS, matching, and vertex cover. In: Proceedings of the 37th ACM Symposium on Principles of Distributed Computing (PODC), pp. 129–138 (2018) – reference: Kiveris, R., Lattanzi, S., Mirrokni, V.S., Rastogi, V., Vassilvitskii, S.: Connected components in MapReduce and beyond. In: Proceedings of the ACM Symposium on Cloud Computing (SoCC), pp. 18:1–18:13 (2014) – reference: Vassilevska Williams, V.: On some fine-grained questions in algorithms and complexity. In Proceedings of the International Congress of Mathematicians 2018 (ICM 2018), pp. 3431–3472 (2018) – reference: Pietracaprina, A., Pucci, G., Riondato, M., Silvestri, F., Upfal, E.: Space-round tradeoffs for MapReduce computations. In: Proceedings of the 26th International Conference on Supercomputing (ICS), pp. 235–244 (2012) – reference: BorodinACookSADymondPWRuzzoWLTompaMTwo applications of inductive counting for complementation problemsSIAM J. Comput.198918355957899683610.1137/0218038 – reference: BilardiGScquizzatoMSilvestriFA lower bound technique for communication in BSPACM Trans. Parallel Comput.20184312710.1145/3181776 – reference: Karger, D.R.: Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 21–30 (1993) – reference: PapadimitriouCHComputational Complexity1994BostonAddison-Wesley0833.68049 – reference: Andoni, A., Stein, C., Zhong, P.: Log diameter rounds algorithms for 2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2$$\end{document}-vertex and 2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2$$\end{document}-edge connectivity. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 14:1–14:16 (2019) – reference: AroraSBarakBComputational Complexity: A Modern Approach2009CambridgeCambridge University Press10.1017/CBO9780511804090 – reference: CookSAMcKenziePProblems complete for deterministic logarithmic spaceJ. Algorithms19878338539490599410.1016/0196-6774(87)90018-6 – reference: Klauck, H., Nanongkai, D., Pandurangan, G.,Robinson, P.: Distributed computation of large-scale graph problems. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 391–410 (2015) – reference: RoughgardenTVassilvitskiiSWangJRShuffles and circuits (on lower bounds for modern parallel computation)J. ACM2018656124388258510.1145/3232536 – reference: Im, S., Moseley, B., Sun, X.: Efficient massively parallel methods for dynamic programming. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 798–811 (2017) – reference: Chang, Y.-J., Fischer, M., Ghaffari, M., Uitto, J., Zheng, Y.: The complexity of (Δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Delta $$\end{document}+1) coloring in congested clique, massively parallel computation, and centralized local computation. In: Proceedings of the 38th ACM Symposium on Principles of Distributed Computing (PODC), pp. 471–480 (2019) – reference: ImmermanNDescriptive Complexity1999BerlinSpringer10.1007/978-1-4612-0539-5 – reference: PanduranganGRobinsonPScquizzatoMFast distributed algorithms for connectivity and MST in large graphsACM Trans. Parallel Comput.20185112210.1145/3209689 – reference: Vassilevska WilliamsVWilliamsRRSubcubic equivalences between path, matrix, and triangle problemsJ. ACM2018655138385653910.1145/3186893 – reference: WhiteTHadoop: The Definitive Guide2012SebastopolO’Reilly Media, Inc. – reference: Fish, B., Kun, J., Lelkes, Á.D., Reyzin, L., Turán, G.: On the computational complexity of MapReduce. In: Proceedings of the 29th International Symposium on Distributed Computing (DISC), pp. 1–15 (2015) – reference: Assadi, S., Sun, X., Weinstein, O.: Massively parallel algorithms for finding well-connected components in sparse graphs. In: Proceedings of the 38th ACM Symposium on Principles of Distributed Computing (PODC), pp. 461–470 (2019) – reference: CookSAA taxonomy of problems with fast parallel algorithmsInf. Control1985641–322283708810.1016/S0019-9958(85)80041-3 – reference: GoodrichMTCommunication-efficient parallel sortingSIAM J. Comput.1999292416432171791710.1137/S0097539795294141 – reference: BeamePKoutrisPSuciuDCommunication steps for parallel query processingJ. ACM2017646158372071910.1145/3125644 – reference: EtessamiKCounting quantifiers, successor relations, and logarithmic spaceJ. Comput. Syst. Sci.1997543400411146376310.1006/jcss.1997.1485 – reference: Drucker, A., Kuhn, F., Oshman, R.: On the power of the congested clique model. In: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing (PODC), pp. 367–376 (2014) – reference: Lacki, J., Mitrovic, S., Onak, K., Sankowski,P.: Walking randomly, massively, and efficiently. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 364–377 (2020) – reference: Behnezhad, S., Hajiaghayi, M., Harris, D.G.: Exponentially faster massively parallel maximal matching. In: Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 1637–1649 (2019) – reference: Behnezhad, S., Derakhshan, M., Hajiaghayi, M.: Semi-MapReduce meets congested clique. CoRR (2018). arXiv:1802.10297 – reference: Ghaffari, M., Kuhn, F., Uitto, J.: Conditional hardness results for massively parallel computation from distributed lower bounds. In: Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 1650–1663 (2019) – reference: SavitchWJRelationships between nondeterministic and deterministic tape complexitiesJ. Comput. Syst. Sci.19704217719226670210.1016/S0022-0000(70)80006-X – reference: Boroujeni, M., Ehsani, S., Ghodsi, M., Hajiaghayi, M.T. , Seddighin, S.: Approximating edit distance in truly subquadratic time: quantum and MapReduce. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1170–1189 (2018) – reference: Scquizzato, M.,Silvestri, F.: Communication lower bounds for distributed-memory computations. In: Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 627–638 (2014) – reference: Hajiaghayi, M., Seddighin, S., Sun, X.: Massively parallel approximation algorithms for edit distance and longest common subsequence. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1654–1672 (2019) – reference: Chung, K., Ho, K., Sun, X.: On the hardness of massively parallel computation. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 153–162 (2020) – reference: KumarRMoseleyBVassilvitskiiSVattaniAFast greedy algorithms in MapReduce and streamingACM Trans. Parallel Comput.20152312210.1145/2809814 – reference: Abboud, A., Grandoni, F., Vassilevska Williams, V.: Subcubic equivalences between graph centrality problems, APSP and diameter. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1681–1697 (2015) – reference: MacKenzie, P.D., Ramachandran, V.: Computational bounds for fundamental problems on general-purpose parallel models. In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 152–163 (1998) – reference: CzumajADaviesPParterMGraph sparsification for derandomizing massively parallel computation with low spaceACM Trans. Algorithms2021172127427893310.1145/3451992 – reference: PanduranganGRobinsonPScquizzatoMOn the distributed complexity of large-scale graph computationsACM Trans. Parallel Comput.202182128429566010.1145/3460900 – reference: Adler, M. Dittrich, W. Juurlink, B.H.H., Kutylowski, M., Rieping, I.: Communication-optimal parallel minimum spanning tree algorithms. In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 27–36 (1998) – reference: Onak, K.: Personal communication (2019) – reference: AllenderEMahajanMThe complexity of planarity testingInf. Comput.20041891117134203192010.1016/j.ic.2003.09.002 – reference: Hegeman, J.W., Pandurangan, G., Pemmaraju, S.V., Sardeshmukh, V.B., Scquizzato, M.: Toward optimal bounds in the congested clique: graph connectivity and MST. In: Proceedings of the 34th ACM Symposium on Principles of Distributed Computing (PODC), pp. 91–100 (2015) – reference: CzumajALackiJMadryAMitrovicSOnakKSankowskiPRound compression for parallel matching algorithmsSIAM J. Comput.2020495STOC18-1416762610.1137/18M1197655 – reference: Andoni, A., Stein, C., Song, Z., Wang, Z., Zhong, P.: Parallel graph connectivity in log diameter rounds. In: Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 674–685 (2018) – reference: ValiantLGA bridging model for parallel computationCommun. ACM199033810311110.1145/79173.79181 – reference: Andoni, A., Nikolov, A., Onak, K., Yaroslavtsev, G.: Parallel algorithms for geometric graph problems. In: Proceedings of the 46th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 574–583 (2014) – reference: DasBDattaSNimbhorkarPLog-space algorithms for paths and matchings in k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-treesTheory Comput. Syst.2013534669689308435810.1007/s00224-013-9469-9 – reference: Ghaffari, M., Uitto, J.: Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation. In:Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1636–1653 (2019) – reference: Buss, S.R.: The Boolean formula value problem is in ALOGTIME. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 123–131 (1987) – reference: LewisHRPapadimitriouCHSymmetric space-bounded computationTheor. Comput. Sci.19821916118766653910.1016/0304-3975(82)90058-5 – reference: JonesNDLienYELaaserWTNew problems complete for nondeterministic log spaceMath. Syst. Theory19761011744342910.1007/BF01683259 – reference: Fischer, M.J., Meyer, A.R.: Boolean matrix multiplication and transitive closure. In: Proceedings of the 12th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 129–131 (1971) – ident: 418_CR54 doi: 10.1145/1272998.1273005 – ident: 418_CR11 doi: 10.1137/1.9781611975482.98 – ident: 418_CR43 doi: 10.1109/FOCS.2019.00097 – ident: 418_CR2 doi: 10.1145/277651.277662 – volume: 13 start-page: 423 issue: 2 year: 1984 ident: 418_CR26 publication-title: SIAM J. Comput. doi: 10.1137/0213028 – volume-title: Computational Complexity year: 1994 ident: 418_CR73 – ident: 418_CR82 doi: 10.1109/FOCS.2017.70 – volume-title: Hadoop: The Definitive Guide year: 2012 ident: 418_CR86 – volume: 4 start-page: 177 issue: 2 year: 1970 ident: 418_CR79 publication-title: J. Comput. Syst. Sci. doi: 10.1016/S0022-0000(70)80006-X – ident: 418_CR1 doi: 10.1137/1.9781611973730.112 – ident: 418_CR25 doi: 10.1145/28395.28409 – volume: 19 start-page: 161 year: 1982 ident: 418_CR66 publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(82)90058-5 – ident: 418_CR84 doi: 10.1142/9789813272880_0188 – ident: 418_CR69 doi: 10.1145/225058.225101 – volume: 4 start-page: 1 issue: 3 year: 2018 ident: 418_CR22 publication-title: ACM Trans. Parallel Comput. doi: 10.1145/3181776 – volume: 53 start-page: 669 issue: 4 year: 2013 ident: 418_CR34 publication-title: Theory Comput. Syst. doi: 10.1007/s00224-013-9469-9 – volume: 51 start-page: 107 issue: 1 year: 2008 ident: 418_CR35 publication-title: Commun. ACM doi: 10.1145/1327452.1327492 – ident: 418_CR13 doi: 10.1137/1.9781611975031.155 – ident: 418_CR19 doi: 10.1109/FOCS.2019.00095 – volume: 17 start-page: 1 issue: 2 year: 2021 ident: 418_CR32 publication-title: ACM Trans. Algorithms doi: 10.1145/3451992 – ident: 418_CR51 – volume: 18 start-page: 559 issue: 3 year: 1989 ident: 418_CR23 publication-title: SIAM J. Comput. doi: 10.1137/0218038 – volume: 189 start-page: 117 issue: 1 year: 2004 ident: 418_CR5 publication-title: Inf. Comput. doi: 10.1016/j.ic.2003.09.002 – volume: 8 start-page: 385 issue: 3 year: 1987 ident: 418_CR30 publication-title: J. Algorithms doi: 10.1016/0196-6774(87)90018-6 – ident: 418_CR44 doi: 10.1145/3382734.3405737 – ident: 418_CR31 doi: 10.1145/3465084.3467903 – ident: 418_CR65 doi: 10.1145/1989493.1989505 – volume: 64 start-page: 2 issue: 1–3 year: 1985 ident: 418_CR29 publication-title: Inf. Control doi: 10.1016/S0019-9958(85)80041-3 – ident: 418_CR52 doi: 10.1145/3055399.3055460 – volume: 65 start-page: 1 issue: 5 year: 2018 ident: 418_CR85 publication-title: J. ACM doi: 10.1145/3186893 – ident: 418_CR8 doi: 10.1109/FOCS.2018.00070 – ident: 418_CR64 doi: 10.1145/3357713.3384303 – ident: 418_CR67 doi: 10.1145/277651.277681 – volume: 29 start-page: 416 issue: 2 year: 1999 ident: 418_CR46 publication-title: SIAM J. Comput. doi: 10.1137/S0097539795294141 – volume: 49 start-page: STOC18-1 issue: 5 year: 2020 ident: 418_CR33 publication-title: SIAM J. Comput. doi: 10.1137/18M1197655 – ident: 418_CR68 – ident: 418_CR28 doi: 10.1145/3350755.3400223 – ident: 418_CR24 doi: 10.1137/1.9781611975031.76 – ident: 418_CR60 doi: 10.1145/2670979.2670997 – ident: 418_CR75 doi: 10.1109/ICDE.2013.6544813 – volume: 65 start-page: 1 issue: 6 year: 2018 ident: 418_CR78 publication-title: J. ACM doi: 10.1145/3232536 – volume: 9 start-page: 123 issue: 2 year: 2000 ident: 418_CR6 publication-title: Comput. Complex. doi: 10.1007/PL00001603 – ident: 418_CR37 doi: 10.1145/2611462.2611493 – volume: 10 start-page: 1 year: 1976 ident: 418_CR57 publication-title: Math. Syst. Theory doi: 10.1007/BF01683259 – volume: 6 start-page: 277 issue: 4 year: 2013 ident: 418_CR3 publication-title: PVLDB – ident: 418_CR47 doi: 10.1007/978-3-642-25591-5_39 – ident: 418_CR58 – volume: 59 start-page: 56 issue: 11 year: 2016 ident: 418_CR88 publication-title: Commun. ACM doi: 10.1145/2934664 – ident: 418_CR14 doi: 10.1145/3293611.3331596 – volume: 64 start-page: 1 issue: 6 year: 2017 ident: 418_CR15 publication-title: J. ACM doi: 10.1145/3125644 – ident: 418_CR74 doi: 10.1145/2304576.2304607 – ident: 418_CR55 doi: 10.1007/978-3-662-44465-8_33 – volume-title: Introduction to the Theory of Computation year: 1997 ident: 418_CR81 – ident: 418_CR17 doi: 10.1145/3293611.3331609 – ident: 418_CR48 doi: 10.1137/1.9781611975482.100 – volume: 13 start-page: 3588 issue: 13 year: 2020 ident: 418_CR20 publication-title: Proc. VLDB Endow. doi: 10.14778/3424573.3424579 – volume: 54 start-page: 400 issue: 3 year: 1997 ident: 418_CR38 publication-title: J. Comput. Syst. Sci. doi: 10.1006/jcss.1997.1485 – ident: 418_CR62 doi: 10.1145/3210377.3210391 – ident: 418_CR21 doi: 10.1109/FOCS.2019.00096 – ident: 418_CR59 doi: 10.1137/1.9781611973075.76 – ident: 418_CR61 doi: 10.1137/1.9781611973730.28 – ident: 418_CR49 doi: 10.1145/2767386.2767434 – volume-title: Descriptive Complexity year: 1999 ident: 418_CR53 doi: 10.1007/978-1-4612-0539-5 – ident: 418_CR39 doi: 10.1109/SWAT.1971.4 – volume: 2 start-page: 1 issue: 3 year: 2015 ident: 418_CR63 publication-title: ACM Trans. Parallel Comput. doi: 10.1145/2809814 – volume: 608 start-page: 268 year: 2015 ident: 418_CR50 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2015.09.029 – ident: 418_CR70 – ident: 418_CR9 – ident: 418_CR18 – volume: 11 start-page: 68 issue: 1 year: 1975 ident: 418_CR56 publication-title: J. Comput. Syst. Sci. doi: 10.1016/S0022-0000(75)80050-X – volume: 8 start-page: 1 issue: 2 year: 2021 ident: 418_CR72 publication-title: ACM Trans. Parallel Comput. doi: 10.1145/3460900 – ident: 418_CR87 – ident: 418_CR41 – ident: 418_CR27 doi: 10.1145/3293611.3331607 – volume: 55 start-page: 17:1- issue: 4 year: 2008 ident: 418_CR76 publication-title: J. ACM doi: 10.1145/1391289.1391291 – ident: 418_CR77 doi: 10.1145/1132516.1132583 – ident: 418_CR80 – ident: 418_CR7 doi: 10.1145/2591796.2591805 – volume-title: Computational Complexity: A Modern Approach year: 2009 ident: 418_CR10 doi: 10.1017/CBO9780511804090 – ident: 418_CR36 doi: 10.1137/1.9781611975994.79 – ident: 418_CR42 doi: 10.1145/3212734.3212743 – ident: 418_CR12 doi: 10.1137/1.9781611975482.48 – volume: 5 start-page: 1 issue: 1 year: 2018 ident: 418_CR71 publication-title: ACM Trans. Parallel Comput. doi: 10.1145/3209689 – volume: 50 start-page: 441 issue: 3 year: 1995 ident: 418_CR16 publication-title: J. Comput. Syst. Sci. doi: 10.1006/jcss.1995.1035 – ident: 418_CR40 doi: 10.1007/978-3-662-48653-5_1 – ident: 418_CR45 doi: 10.1137/1.9781611975482.99 – volume: 33 start-page: 103 issue: 8 year: 1990 ident: 418_CR83 publication-title: Commun. ACM doi: 10.1145/79173.79181 – ident: 418_CR4 doi: 10.1137/1.9781611973099.40
SSID	ssj0003112
Score	2.344891
Snippet	The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving... The (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over... The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving...
SourceID	swepub pubmedcentral proquest pubmed crossref springer
SourceType	Open Access Repository Aggregation Database Index Database Enrichment Source Publisher
StartPage	165
SubjectTerms	Algorithms Complex networks Complexity Complexity class Computational complexity Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Conditional hardness Data handling Data processing Equivalence Equivalence classes Fine grained Fine-grained complexity Graph theory Hardness Large-scale data processing Low bound Lower bounds Massively Parallel Computation Massively parallels Parallel Computation Parallel computation model Parallel processing Robustness Shortest-path problems Software Engineering/Programming and Operating Systems Theory of Computation
SummonAdditionalLinks	– databaseName: SpringerLink Journals dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Lb9YwDLdgcOCyjecKGwoS4gKR-kib5DixTTuggXhMu0VpmrKK0m_7HpP232OnD_QxNAmObd20SWzHjuOfAV6XVYZmvou5QueD4wqdcZtIy_O6QFdblTpLQqLwB3lyos7O9KchKWwxnnYfQ5JBU0_JbiH2yOlIAYFE4fzehXu43CkSx89fTif9myUhxkl153kqZTykyvy9jfXl6IaNefOo5BQv_QNbNKxHR1v_15Nt2BzsT7bfM8xDuOO7R7A11nZgg6g_ho-Hl6sGuZCumCMT2y-Y7SqG_nPV9BuIjDK2SFWypmM_kQQ1Z3vNCE28bX3LXGi13xJ8At-ODr--P-ZD8QXuUIiXXBe2csqWaPDlMtG1FTYT6FzUCd5QTtYpITM7JZ3Ifel0FVuvC2GlqB3tJWVPYaObdX4HWFqhRi1zIZFOuLhQZe107NGwkLWLSx9BMs6BcQMyORXIaM2EqRxGzOCImTBiJo3g7fTORY_LcSv17ji1ZpDRhUkLVK4CLdAsglfTY5QuCpnYzs9WRCOS4DbGETzrOWH6HL5IJQ3zCOQaj0wEhNy9_qRrzgOCt9Jo2aU6gncjg_z-rdt68abnuLUvHDSn-2Y2_25-LM8NKdRYPv-3dl_Ag5SSOsJ5pF3YWM5Xfg_uu6tls5i_DML1C9ldHoo priority: 102 providerName: Springer Nature
Title	Equivalence classes and conditional hardness in massively parallel computations
URI	https://link.springer.com/article/10.1007/s00446-021-00418-2 https://www.ncbi.nlm.nih.gov/pubmed/35300185 https://www.proquest.com/docview/2637648353 https://www.proquest.com/docview/2641000300 https://pubmed.ncbi.nlm.nih.gov/PMC8907129 https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-319607
Volume	35
WOSCitedRecordID	wos000744824300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: Springer Standard Collection customDbUrl: eissn: 1432-0452 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpR3ZbtQwcERbHnih3ATKykiIF7DIbecJFdgKCbQsC1QrXizHcWhEyLZ7IPH3zDhHtVTaF14sJZ4c1hyewzMD8CwvIlTzjc8lGh8cd-iI60BonpQpmtoyz6LAJQp_FJOJnM-zaedwW3XHKnuZ6AR1sTDkI38VpsgKMeoL0evzC05doyi62rXQ2IODIAwDovMPgg-SOApctJM60PNQCL9LmnGpcy6SyemAApWcwvntjemKtnn10OQQOf2nyqjbmU4O_3dNt-Bmp5Oy45aIbsM129yBw77fA-vY_y58Gl9sKqRMumKG1G67YropGNrURdU6FRllcZH4ZFXDfiEIStP6D6MK43Vta2bcW1s34T34djL--vY97xoycIOMveZZqgsjdY5KYCKCrNSxjmI0OMoAb0gjypCqNRspTJzY3GSFr22WxlrEpSH_UnQf9ptFYx8CCwuUsnkSC4SLjZ_KvDSZb1HZEKXxc-tB0GNDma5aOTXNqNVQZ9lhUCEGlcOgCj14MTxz3tbq2Al91CNFdXy7UpcY8eDpMI0cR2EU3djFhmDiwJmSvgcPWpoYPocPUpvDxAOxRS0DAFXz3p5pqjNX1VtmqO2FmQcve7q6_K1dq3je0t7WF95Vp8dqsfyhfq7PFAlZXzzavdzHcCOkxA53JukI9tfLjX0C183vdbVajmBPzD7TOJcjOHgznkxnI8dqOE6T7zjOvpz-Bc2pLg4
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VgkQvlDeBAkYCLmCRt5MDQhVt1arL8lBBvRnHcdqIkLT7APVP8RuZcR7VUmlvPXDc9SRZbz7Pw-P5BuB5lgfo5muXJxh8cLTQAVeeUDwqYgy1kywNPFsoPBLjcXJ4mH5agT99LQwdq-x1olXUeaNpj_yNH-NSCNFfCN6dnHLqGkXZ1b6FRguLfXP2G0O26du9LXy_L3x_Z_vg_S7vugpwjeic8TRWuU5Uhp5MJLy0UKEKQvSaCw-_SLQofKIc1onQYWQyneauMmkcKhEWmjZJArzvFbiKetymhcWXz4PmDzybXaWO99wXwu2KdGypns2ccjoQQRRXOL5oCC94txcPaQ6Z2n9YTa0l3Fn_3_7Dm3Cj87nZZrtIbsGKqW_Det_PgnXq7Q583D6dl7jy6BPTFFaYKVN1znRDiX27acqoSo3MAytr9hNF0FpUZ4wY1KvKVEzbu7bboHfh66VM6x6s1k1tHgDzc7QiWRQKlAu1GydZoVPXoDMlCu1mxgGvf_tSd2zs1BSkkgOPtEWMRMRIixjpO_BquOak5SJZKr3Rg0B2emkqzxHgwLNhGDUKpYlUbZo5yYSeDZVdB-63GBwehxdSG8fIAbGAzkGA2MoXR-ry2LKWJyl6s37qwOsex-c_a9ksXrZYX3jCVvltUzaTI_ljdizJiLji4fLpPoXruwcfRnK0N95_BGs-FbHY81cbsDqbzM1juKZ_zcrp5Ild0gy-Xzb-_wIId4XX
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Jb9QwFH4qBSEulJ1AASMBF4ia3fEBoYrpiKrVMAdAFRfjOA6NCEk7C6h_jV_He85SDZXm1gPHxC-Lk89v8dsAXmR5iGq-9twUjQ8XJXToKp8rNy4SNLXTTIS-TRQ-5JNJenQkphvwp8-FobDKnidaRp03mvbId4IEl0KE-kK4U3RhEdPR-N3JqUsdpMjT2rfTaCFyYM5-o_k2f7s_wn_9MgjGe5_ef3C7DgOuRqQuXJGoXKcqQ60m5r4oVKTCCDXowscTqeZFQOWHdcp1FJtMi9xTRiSR4lGhacMkxPtegascbUwy_Kbx10EKhL71tCLgEYmce13Cjk3bs15Ul4IjqNwVjq8KxQua7sWAzcFr-0-FUysVx1v_8_e8BTc7XZzttovnNmyY-g5s9X0uWMf27sLHvdNliSuSjpgmc8PMmapzphty-NvNVEbZayQ2WFmzn0iCUqQ6Y1RZvapMxbS9a7s9eg8-X8q07sNm3dTmIbAgR-mSxRFHukh7SZoVWngGlSxeaC8zDvg9EqTuqrRTs5BKDvWlLXokokda9MjAgdfDNSdtjZK11Ns9IGTHr-byHA0OPB-GkdOQ-0jVplkSTeRbE9pz4EGLx-FxeCG1d4wd4CtIHQioivnqSF0e22rmqUAtNxAOvOkxff5a62bxqsX9yhNG5Zdd2cy-yx-LY0nCxeOP1k_3GVxH2MvD_cnBY7gRUG6LDcvahs3FbGmewDX9a1HOZ0_t6mbw7bLh_xeVuo6q
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Equivalence+classes+and+conditional+hardness+in+massively+parallel+computations&rft.jtitle=Distributed+computing&rft.au=Nanongkai%2C+Danupon&rft.au=Scquizzato%2C+Michele&rft.date=2022-04-01&rft.issn=0178-2770&rft.volume=35&rft.issue=2&rft.spage=165&rft_id=info:doi/10.1007%2Fs00446-021-00418-2&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-2770&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-2770&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-2770&client=summon