Two Observations on Probabilistic Primality Testing (1987)

Cached

Download Links

by Pierre Beauchemin , Gilles Brassard , Claude Crepeau , Claude Goutier , Universite De Montreal C. P
Citations:3 - 1 self

Documents Related by Co-Citation

20 Evaluation and comparison of two efficient probabilistic primality testing algorithms – L Monier - 1980
192 A probabilistic algorithm for testing primality – Michael Rabin - 1980
22 The Generation of Random Numbers That Are Probably Prime – Pierre Beauchemin, Gilles Brassard, Claude Crepeau, Claude Goutier, Carl Pomerance - 1988
33 Average case error estimates for the strong probable prime test – I Damg˚ard, P Landrock, C Pomerance - 1993
5 Integer Hash Function. http://www.concentric.net/ Ttwang/tech/inthash.htm – T Wang - 2007
2 improved construction for counting Bloom filters – “An - 2006
1 Quantitative literacy - drug testing, cancer screening, and the identification of igneous rocks – H L Vacher - 2003
1 Design exploration of hybrid caches with disparate memory technologies – X Wu, J Li, L Zhang, E Speight, R Rajamony, Y Xie - 2010
2 The variable-increment counting Bloom filter,” Comnet – O Rottenstreich, Y Kanizo, I Keslassy - 2011
3 CAIDA Anonymized 2008 Internet Trace equinix-chicago 2008-03-19 – C Shannon, E Aben, K claffy, D E Andersen
9 IPv6 lookups using distributed and load balanced bloom filters for 100 Gbps core router line cards – H Song, F Hao, M S Kodialam, T V Lakshman - 2009
5 The Variable-Increment Counting Bloom Filter – Ori Rottenstreich, Isaac Keslassy
9 Retouched bloom filters: allowing networked applications to trade off selected false positives against false negatives – Benoit Donnet, Bruno Baynat, Timur Friedman - 2006
3 A Generalized Bloom Filter to Secure Distributed Network Applications – R P Laufer, P B Velloso, O C M B Duarte - 2011
18 Designing Packet Buffers for Router Linecards – Sundar Iyer, Ramana Rao Kompella, Nick Mckeown - 2002
3 A lower bound for dynamic approximate membership data structures – S Lovett, E Porat
31 Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines – Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese - 2006
31 An Improved Construction for Counting Bloom Filters – Flavio Bonomi, Michael Mitzenmacher, Rina Panigrahy, Sushil Singh, George Varghese - 2006
1456 Space/Time Trade-offs in Hash Coding with Allowable Errors – Burton H. Bloom - 1970