Algebraic methods in the congested clique (Q2010605): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Algebraic Methods in the Congested Clique
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6560050
@@ Property / title @@
+Algebraic Methods in the Congested Clique (English)
@@ Property / title: Algebraic Methods in the Congested Clique (English) / rank @@
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05283
@@ Property / zbMATH Open document ID: 1333.05283 / rank @@
+Normal rank
@@ Property / DOI @@
+.1145/2767386.2767414
@@ Property / DOI: 10.1145/2767386.2767414 / rank @@
+Normal rank
@@ Property / published in @@
+Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
+Normal rank
@@ Property / publication date @@
+March 2016Timestamp +2016-03-23T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-03-23T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 23 March 2016 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C12
@@ Property / Mathematics Subject Classification ID: 05C12 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C69
@@ Property / Mathematics Subject Classification ID: 05C69 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6560050
@@ Property / zbMATH DE Number: 6560050 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2950813619
@@ Property / OpenAlex ID: W2950813619 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2107008873
@@ Property / OpenAlex ID: W2107008873 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.04963
@@ Property / arXiv ID: 1503.04963 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4858551
@@ Property / cites work: Q4858551 / rank @@
+Normal rank
@@ Property / cites work @@
+Memorization and Association on a Realistic Neural Model
+Normal rank
@@ Property / cites work @@
+Communication complexity of PRAMs
@@ Property / cites work: Communication complexity of PRAMs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting given length cycles
@@ Property / cites work: Finding and counting given length cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
+Normal rank
@@ Property / cites work @@
+Graph expansion and communication costs of fast matrix multiplication
+Normal rank
@@ Property / cites work @@
+Determinant Sums for Undirected Hamiltonicity
@@ Property / cites work: Determinant Sums for Undirected Hamiltonicity / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Two Disjoint Paths in Polynomial Time
@@ Property / cites work: Shortest Two Disjoint Paths in Polynomial Time / rank @@
+Normal rank
@@ Property / cites work @@
+Fourier meets M\"{o}bius: fast subset convolution
@@ Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank @@
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+Probably optimal graph motifs
@@ Property / cites work: Probably optimal graph motifs / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time
+Normal rank
@@ Property / cites work @@
+Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
+Normal rank
@@ Property / cites work @@
+Q4331740
@@ Property / cites work: Q4331740 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic methods in the congested clique
@@ Property / cites work: Algebraic methods in the congested clique / rank @@
+Normal rank
@@ Property / cites work @@
+All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
+Normal rank
@@ Property / cites work @@
+More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Fast Hamiltonicity Checking Via Bases of Perfect Matchings
+Normal rank
@@ Property / cites work @@
+Q2934691
@@ Property / cites work: Q2934691 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed verification and hardness of distributed approximation
+Normal rank
@@ Property / cites work @@
+“Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
+Normal rank
@@ Property / cites work @@
+On the power of the congested clique model
@@ Property / cites work: On the power of the congested clique model / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of fixed parameter clique and dominating set
+Normal rank
@@ Property / cites work @@
+Faster algorithms for finding and counting subgraphs
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
+Normal rank
@@ Property / cites work @@
+New Bounds on the Complexity of the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+Q5743466
@@ Property / cites work: Q5743466 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5616737
@@ Property / cites work: Q5616737 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path
+Normal rank
@@ Property / cites work @@
+An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths
+Normal rank
@@ Property / cites work @@
+Lessons from the Congested Clique Applied to MapReduce
+Normal rank
@@ Property / cites work @@
+Toward Optimal Bounds in the Congested Clique
@@ Property / cites work: Toward Optimal Bounds in the Congested Clique / rank @@
+Normal rank
@@ Property / cites work @@
+Q5363797
@@ Property / cites work: Q5363797 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal distributed all pairs shortest paths and applications
+Normal rank
@@ Property / cites work @@
+Communication lower bounds for distributed-memory matrix multiplication
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algebraic Algorithms for Path and Packing Problems
+Normal rank
@@ Property / cites work @@
+Q5365132
@@ Property / cites work: Q5365132 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Distributed Construction of Smallk-Dominating Sets and Applications
+Normal rank
@@ Property / cites work @@
+Powers of tensors and fast matrix multiplication
@@ Property / cites work: Powers of tensors and fast matrix multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal deterministic routing and sorting on the congested clique
+Normal rank
@@ Property / cites work @@
+Fast routing table construction using small messages
+Normal rank
@@ Property / cites work @@
+Efficient distributed source detection with limited bandwidth
+Normal rank
@@ Property / cites work @@
+Tight bounds for parallel randomized load balancing
+Normal rank
@@ Property / cites work @@
+Saving space by algebraization
@@ Property / cites work: Saving space by algebraization / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds
+Normal rank
@@ Property / cites work @@
+Q4530626
@@ Property / cites work: Q4530626 / rank @@
+Normal rank
@@ Property / cites work @@
+Computer science today. Recent trends and developments
+Normal rank
@@ Property / cites work @@
+Efficient determination of the transitive closure of a directed graph
+Normal rank
@@ Property / cites work @@
+Distributed approximation algorithms for weighted shortest paths
+Normal rank
@@ Property / cites work @@
+Q3688439
@@ Property / cites work: Q3688439 / rank @@
+Normal rank
@@ Property / cites work @@
+The round complexity of distributed sorting
@@ Property / cites work: The round complexity of distributed sorting / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank
@@ Property / cites work @@
+A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
+Normal rank
@@ Property / cites work @@
+Distributed Algorithms for Network Diameter and Girth
+Normal rank
@@ Property / cites work @@
+Q3710543
@@ Property / cites work: Q3710543 / rank @@
+Normal rank
@@ Property / cites work @@
+On the all-pairs-shortest-path problem in unweighted undirected graphs.
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(n^{3}\log \log n/\log n)\) time algorithm for the all-pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+Q4219043
@@ Property / cites work: Q4219043 / rank @@
+Normal rank
@@ Property / cites work @@
+Bulk-synchronous parallel Gaussian elimination
@@ Property / cites work: Bulk-synchronous parallel Gaussian elimination / rank @@
+Normal rank
@@ Property / cites work @@
+Finding, Minimizing, and Counting Weighted Subgraphs
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank
@@ Property / cites work @@
+Faster all-pairs shortest paths via circuit complexity
+Normal rank
@@ Property / cites work @@
+An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications
+Normal rank
@@ Property / cites work @@
+Q4796165
@@ Property / cites work: Q4796165 / rank @@
+Normal rank
@@ Property / cites work @@
+All pairs shortest paths using bridging sets and rectangular matrix multiplication
+Normal rank
@@ Property / cites work @@
+A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths
+Normal rank