Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Adaptive Cuckoo Filters 2019-09-12 Paper Hierarchical Heavy Hitters with the Space Saving Algorithm 2019-09-12 Paper Distance-Sensitive Bloom Filters 2019-09-11...
    10 bytes (16 words) - 09:57, 8 December 2023
  • Pattern Matching with Feed-Forward Bloom Filters 2019-09-12 Paper Exact pattern matching with feed-forward bloom filters 2014-04-01 Paper...
    10 bytes (16 words) - 22:28, 27 December 2023
  • Partitions 2016-03-23 Paper Tight bounds for sliding Bloom filters 2016-02-19 Paper Bloom Filters in Adversarial Environments 2015-12-10 Paper Magic Functions...
    10 bytes (17 words) - 20:42, 9 December 2023
  • Pattern Matching with Feed-Forward Bloom Filters 2019-09-12 Paper Exact pattern matching with feed-forward bloom filters 2014-04-01 Paper...
    10 bytes (18 words) - 22:28, 27 December 2023
  • Publication Date of Publication Type Spatial Bloom Filters: Enabling Privacy in Location-Aware Applications 2015-11-25 Paper Implementing Information-Theoretically...
    10 bytes (16 words) - 05:27, 9 December 2023
  • Publication Date of Publication Type On the analysis of Bloom filters 2017-10-18 Paper The RABTree and RAB\(^-\)Tree: lean index structures for snapshot...
    10 bytes (16 words) - 03:46, 13 December 2023
  • Publication Date of Publication Type Optimizing data popularity conscious bloom filters 2014-12-12 Paper The fundamental solution for the theory of orthotropic...
    10 bytes (16 words) - 12:09, 13 December 2023
  • Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters 2013-12-17 Paper...
    10 bytes (16 words) - 10:17, 6 October 2023
  • Type Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters 2015-10-20 Paper...
    10 bytes (16 words) - 09:56, 6 October 2023
  • Type Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters 2015-10-20 Paper...
    10 bytes (16 words) - 09:56, 6 October 2023
  • Type Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters 2015-10-20 Paper...
    10 bytes (16 words) - 09:56, 6 October 2023
  • Type Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters 2015-10-20 Paper...
    10 bytes (16 words) - 09:56, 6 October 2023
  • Publication Date of Publication Type Bloom Filters in Adversarial Environments 2019-11-25 Paper...
    10 bytes (16 words) - 14:46, 28 January 2024
  • Publication Date of Publication Type Using the Power of Two Choices to Improve Bloom Filters 2009-04-28 Paper...
    10 bytes (16 words) - 03:01, 28 December 2023
  • Inferring Insertion Times and Optimizing Error Penalties in Time-decaying Bloom Filters 2021-11-25 Paper...
    10 bytes (18 words) - 12:32, 14 March 2024
  • Publication Type A Power and Throughput-Efficient Packet Classifier with n Bloom Filters 2017-07-27 Paper...
    10 bytes (16 words) - 12:32, 14 March 2024
  • programming approach for improving accuracy of lossy data compression by Bloom filters 2016-10-07 Paper...
    10 bytes (16 words) - 11:07, 7 October 2023
  • Publication Date of Publication Type An Improved Construction for Counting Bloom Filters 2008-03-11 Paper...
    10 bytes (16 words) - 22:11, 26 December 2023
  • Publication Date of Publication Type On Adding Bloom Filters to Longest Prefix Matching Algorithms 2017-06-20 Paper...
    10 bytes (16 words) - 21:56, 26 December 2023
  • Publication Date of Publication Type On Adding Bloom Filters to Longest Prefix Matching Algorithms 2017-06-20 Paper...
    10 bytes (16 words) - 21:56, 26 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)