Identifying frequent items in a network using gossip (Q666263): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jpdc.2010.07.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2061373204
@@ Property / OpenAlex ID: W2061373204 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q60148589
@@ Property / Wikidata QID: Q60148589 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3546603
@@ Property / cites work: Q3546603 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542551
@@ Property / cites work: Q4542551 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient top-K query calculation in distributed networks
+Normal rank
@@ Property / cites work @@
+Q3546780
@@ Property / cites work: Q3546780 / rank @@
+Normal rank
@@ Property / cites work @@
+Geographic Gossip: Efficient Averaging for Sensor Networks
+Normal rank
@@ Property / cites work @@
+The shortest-path problem for graphs with random arc-lengths
+Normal rank
@@ Property / cites work @@
+Finding repeated elements
@@ Property / cites work: Finding repeated elements / rank @@
+Normal rank
@@ Property / cites work @@
+Probability and Computing
@@ Property / cites work: Probability and Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Computing separable functions via gossip
@@ Property / cites work: Computing separable functions via gossip / rank @@
+Normal rank