Longest Prefix Matching Using Bloom Filters

doi 10.1145/863955.863979

Full Text

Abstract

Available in

Date

Authors

Publisher

ACM Press

Related search

Realizing a Sub-Linear Time String-Matching Algorithm With a Hardware Accelerator Using Bloom Filters

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
HardwareElectronic EngineeringElectricalArchitectureSoftware
2009English

Improving Bloom Filter Performance on Sequence Data Using $$K$$ -Mer Bloom Filters

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Scalable VANET Content Routing Using Hierarchical Bloom Filters

2013English

Scalable Context-Sensitive Points-To Analysis Using Multi-Dimensional Bloom Filters

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Optimizing Data Popularity Conscious Bloom Filters

2008English

Language Classification Using N-Grams Accelerated by FPGA-based Bloom Filters

2007English

An Improved Construction for Counting Bloom Filters

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Hardened Bloom Filters, With an Application to Unobservability

Annales UMCS, Informatica
2012English

Flow Fair Sampling Based on Multistage Bloom Filters

Telkomnika
Electronic EngineeringElectrical
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy