Arun Manoharan and Ammasi Krishnan


  1. [1] B. Bloom, Space/time trade-offs in hash coding with allowableerrors, ACM Communication, 13 (7), 1970, 422–426.
  2. [2] A. Broder and M. Mitzenmacher, Network Applications ofbloom filters: A survey, Internet Mathematics, 1 (4), 2003,485–509.
  3. [3] S. Dharmapurikar, M. Attig, and J.W. Lockwood, Designand implementation of a string matching system for networkintrusion detection using FPGA-based bloom filters, Proc.12th Annual IEEE Symposium on Field Programmable CustomComputing Machines, Napa, California, 2004, 322–323.
  4. [4] M. Arun, A. Krishnan, and P.S. Periaswamy, Design and im-plementation of a string matching system for network intru-sion detection using FPGA-based low power multiple-hashingbloom filters, International Journal of Computer Science andApplication, 1 (3), 2008, 186–189.
  5. [5] I. Kaya and T. Kocak, A low power lookup technique formulti-hashing network applications, Proc. IEEE ComputerSociety Annual Symposium on Emerging VLSI Technologiesand Architectures (ISVLSI 06), Karlsruhe, Germany, 2006,179–184.
  6. [6] M. Arun and A. Krishnan, Implementation of content ad-dressable memory using block XOR based precomputationtechnique in reconfigurable platform for network applications,International Journal of Applied Engineering Research, 7 (11),2010, 1877–1886.
  7. [7] C.S. Lin, J.C. Chang, and B.D. Liu, A low-power precompu-tation based fully parallel content-addressable memory, IEEEJournal of Solid-State Circuits, 38 (4), 2003, 622–654.
  8. [8] M. Dietzfelbinger and R. Pagh, Succinct data structures for re-trieval and approximate membership, The Computing ResearchRepository (CoRR), 2008, http://arxiv.org/abs/0803.3693v1,26 March 2008
  9. [9] P. Bose, H. Guo, E. Kranakis, A. Maheshwari, P. Morin, J.Morrison, M. Smid, and Y. Tang, On the false-positive rate ofbloom filters, Technical Report TR-07-07, Carleton University,School of Computer Science, Ottawa, Canada, 2007, 1–19.
  10. [10] J.L. Carter and M. Wegman, Universal classes of hash functions,Journal of Computer and System Sciences, 18 (6), 1978, 143–154.
  11. [11] M. Mitzenmacher, Compressed bloom filters, IEEE/ACMTransactions on Networking, 10 (5), 2002, 604–612.

Important Links:

Go Back