Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms (Q5458312): 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.1007/978-3-540-77004-6_16
+Normal rank
@@ Property / OpenAlex ID @@
+W1869106409
@@ Property / OpenAlex ID: W1869106409 / rank @@
+Normal rank
@@ Property / cites work @@
+Space/time trade-offs in hash coding with allowable errors
+Normal rank
@@ Property / cites work @@
+Min-wise independent permutations
@@ Property / cites work: Min-wise independent permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Network Applications of Bloom Filters: A Survey
@@ Property / cites work: Network Applications of Bloom Filters: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250236
@@ Property / cites work: Q4250236 / rank @@
+Normal rank
@@ Property / cites work @@
+Authoritative sources in a hyperlinked environment
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5458312