Algebraic Methods in the Congested Clique

17 March 2015

Papers citing "Algebraic Methods in the Congested Clique"

50 / 75 papers shown

Title
Sublinear-time Sampling of Spanning Trees in the Congested Clique Sriram V. Pemmaraju Sourya Roy Joshua Sobel 64 0 0 20 Nov 2024
Distributed Complexity of $P_k$ -freeness: Decision and Certification Masayuki Miyamoto 49 1 0 27 Oct 2024
Faster Cycle Detection in the Congested Clique K. Censor-Hillel Tomer Even Virginia Vassilevska Williams 98 0 0 27 Aug 2024
$k$ -Center Clustering in Distributed Models Leyla Biabani A. Paz 24 1 0 25 Jul 2024
Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique Andrzej Lingas 55 1 0 25 May 2024
$A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds of the Congested Clique$ A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds of the Congested Clique Andrzej Lingas 51 0 0 24 May 2024
Improved All-Pairs Approximate Shortest Paths in Congested Clique Hong Duc Bui Shashwat Chandra Yi-Jun Chang Michal Dory Dean Leitersdorf 84 2 0 04 May 2024
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity Chetan Gupta Janne H. Korhonen Jan Studený Jukka Suomela Hossein Vahidi 56 0 0 23 Apr 2024
Classical and Quantum Distributed Algorithms for the Survivable Network Design Problem Phillip A. Kerger D. E. B. Neira Zoe Gonzalez Izquierdo E. Rieffel 80 0 0 16 Apr 2024
On Distributed Computation of the Minimum Triangle Edge Transversal K. Censor-Hillel Majd Khoury 90 0 0 21 Feb 2024
Recognizing Hereditary Properties in the Presence of Byzantine Nodes David Cifuentes-Núnez Pedro Montealegre I. Rapaport 34 1 0 12 Dec 2023
Convex Hulls, Triangulations, and Voronoi Diagrams of Planar Point Sets on the Congested Clique J. Jansson C. Levcopoulos A. Lingas Valentin Polishchuk 91 0 0 17 May 2023
$Mind the $\tilde{\mathcal{O}}$: Asymptotically Better, but Still Impractical, Quantum Distributed Algorithms$ Mind the $\tilde{\mathcal{O}}$ : Asymptotically Better, but Still Impractical, Quantum Distributed Algorithms Phillip A. Kerger D. E. B. Neira Zoe Gonzalez Izquierdo E. Rieffel 42 0 0 06 Apr 2023
On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST Model Pierre Fraigniaud Mael Luce Ioan Todinca 67 2 0 05 Apr 2023
Deterministic Near-Optimal Distributed Listing of Cliques K. Censor-Hillel Dean Leitersdorf David Vulakh 85 9 0 18 May 2022
$Undirected $(1+\varepsilon)$-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms$ Undirected $(1+\varepsilon)$ -Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms Václav Rozhon Christoph Grunau Bernhard Haeupler Goran Zuzic Jason Li 51 29 0 12 Apr 2022
Distributed Subgraph Finding: Progress and Challenges K. Censor-Hillel 56 14 0 13 Mar 2022
Benchmarking Graphormer on Large-Scale Molecular Modeling Datasets Yu Shi Shuxin Zheng Guolin Ke Yifei Shen Jiacheng You Jiyan He Shengjie Luo Chang-Shu Liu Di He Tie-Yan Liu AI4CE 102 67 0 09 Mar 2022
Sparse Matrix Multiplication in the Low-Bandwidth Model Chetan Gupta J. Hirvonen Janne H. Korhonen Jan Studený Jukka Suomela 43 5 0 02 Mar 2022
An Empirical Study of Graphormer on Large-Scale Molecular Modeling Datasets Yu Shi Shuxin Zheng Guolin Ke Yifei Shen Jiacheng You Jiyan He Shengjie Luo Chang-Shu Liu Di He Tie-Yan Liu AI4CE 51 0 0 28 Feb 2022
Efficient Distributed Computations in Anonymous Dynamic Congested Systems with Opportunistic Connectivity Dariusz R. Kowalski Miguel A. Mosteiro 22 4 0 15 Feb 2022
Quantum Distributed Algorithms for Detection of Cliques K. Censor-Hillel Orr Fischer Franccois Le Gall Dean Leitersdorf R. Oshman GNN 40 26 0 09 Jan 2022
Lower Bounds for Induced Cycle Detection in Distributed Computing Franccois Le Gall Masayuki Miyamoto 63 6 0 02 Oct 2021
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters Janne H. Korhonen Amir Nikabadi GNN 82 4 0 14 Sep 2021
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model Ioannis Anagnostides Themis Gouleakis 44 11 0 03 Aug 2021
Near-Optimal Scheduling in the Congested Clique K. Censor-Hillel Yannic Maus Volodymyr Polosukhin 22 1 0 14 Feb 2021
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs K. Censor-Hillel Orr Fischer T. Gonen F. Gall Dean Leitersdorf R. Oshman 137 28 0 19 Jan 2021
Tight Distributed Listing of Cliques K. Censor-Hillel Yi-Jun Chang Franccois Le Gall Dean Leitersdorf 63 21 0 14 Nov 2020
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 69 13 0 10 Nov 2020
Distance Computations in the Hybrid Network Model via Oracle Simulations K. Censor-Hillel Dean Leitersdorf Volodymyr Polosukhin 57 17 0 26 Oct 2020
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization Yi-Jun Chang Thatchaphol Saranurak 30 34 0 29 Jul 2020
On Distributed Listing of Cliques K. Censor-Hillel F. Gall Dean Leitersdorf 36 24 0 10 Jul 2020
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs Michel Feldmann Kristian Hinnenthal Christian Scheideler 34 22 0 02 Jul 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model Fabian Kuhn P. Schneider 78 30 0 15 Jun 2020
Exponentially Faster Shortest Paths in the Congested Clique Michal Dory M. Parter 131 23 0 06 Mar 2020
A Systematic Survey of General Sparse Matrix-Matrix Multiplication Jianhua Gao Weixing Ji Fangli Chang Zhaonian Tan Bingxin Wei Zeming Liu Yueyan Zhao 35 59 0 26 Feb 2020
Massively Parallel Algorithms for Small Subgraph Counting Amartya Shankha Biswas T. Eden Quanquan C. Liu Slobodan Mitrović R. Rubinfeld 42 8 0 19 Feb 2020
Shortest Paths in a Hybrid Network Model John E. Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider 39 31 0 04 Sep 2019
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model Taisuke Izumi F. Gall F. Magniez 36 32 0 30 Aug 2019
$Distributed Approximation Algorithms for Steiner Tree in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$$ Distributed Approximation Algorithms for Steiner Tree in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$ Parikshit Saikia Sushanta Karmakar 8 9 0 28 Jul 2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model Taisuke Izumi F. Gall 30 35 0 06 Jun 2019
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators Lijie Chen O. Grossman 40 6 0 19 May 2019
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration Yi-Jun Chang Thatchaphol Saranurak 42 51 0 17 Apr 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 49 54 0 14 Mar 2019
Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights K. Bose Manash Kumar Kundu Ranendu Adhikary B. Sau 31 16 0 13 Feb 2019
Large-Scale Distributed Algorithms for Facility Location with Outliers Tanmay Inamdar Shreyas Pai Sriram V. Pemmaraju 16 7 0 15 Nov 2018
Massively Parallel Approximate Distance Sketches M. Dinitz Yasamin Nazari 50 1 0 21 Oct 2018
Distributed Triangle Detection via Expander Decomposition Yi-Jun Chang Seth Pettie Hengjie Zhang 50 47 0 17 Jul 2018
Detecting cliques in CONGEST networks A. Czumaj C. Konrad 48 36 0 03 Jul 2018
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths Matteo Pontecorvi V. Ramachandran GNN 41 11 0 21 May 2018