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

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

Latest revision as of 03:49, 21 July 2024

scientific article; zbMATH DE number 6560050
  • Algebraic Methods in the Congested Clique
Language Label Description Also known as
English
Algebraic methods in the congested clique
scientific article; zbMATH DE number 6560050
  • Algebraic Methods in the Congested Clique

Statements

Algebraic methods in the congested clique (English)
0 references
Algebraic Methods in the Congested Clique (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
27 November 2019
0 references
23 March 2016
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
distributed computing
0 references
congested clique model
0 references
lower bounds
0 references
matrix multiplication
0 references
subgraph detection
0 references
distance computation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references