Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-25258-2_26
+Normal rank
@@ Property / OpenAlex ID @@
+W2295809089
@@ Property / OpenAlex ID: W2295809089 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributedly Testing Cycle-Freeness
@@ Property / cites work: Distributedly Testing Cycle-Freeness / rank @@
+Normal rank
@@ Property / cites work @@
+Q4540518
@@ Property / cites work: Q4540518 / rank @@
+Normal rank
@@ Property / cites work @@
+The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
+Normal rank
@@ Property / cites work @@
+Cycles of even length in graphs
@@ Property / cites work: Cycles of even length in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Excluding pairs of graphs
@@ Property / cites work: Excluding pairs of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The communication complexity of distributed task allocation
+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 @@
+Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
+Normal rank
@@ Property / cites work @@
+Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
+Normal rank
@@ Property / cites work @@
+Lower bound of the Hadwiger number of graphs by their average degree
+Normal rank
@@ Property / cites work @@
+On randomized one-round communication complexity
@@ Property / cites work: On randomized one-round communication complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+On a property of the class of n-colorable graphs
@@ Property / cites work: On a property of the class of n-colorable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An extremal function for contractions of graphs
@@ Property / cites work: An extremal function for contractions of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The extremal function for complete minors
@@ Property / cites work: The extremal function for complete minors / rank @@
+Normal rank
@@ Property / cites work @@
+When distributed computation is communication expensive
+Normal rank