Some Practical Randomized Algorithms and Data Structures

[1]  Michael Mitzenmacher,et al.  Studying Balanced Allocations with Differential Equations , 1999, Combinatorics, Probability and Computing.

[2]  George Varghese,et al.  New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice , 2003, TOCS.

[3]  Pedro M. Domingos,et al.  Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier , 1996, ICML.

[4]  John W. Lockwood,et al.  Deep packet inspection using parallel Bloom filters , 2003, 11th Symposium on High Performance Interconnects, 2003. Proceedings..

[5]  The power of simple tabulation hashing , 2011, STOC '11.

[6]  Jorma Tarhio,et al.  Multipattern string matching with q-grams , 2007, ACM J. Exp. Algorithmics.

[7]  Konstantinos Panagiotou,et al.  Orientability of Random Hypergraphs and the Power of Multiple Choices , 2010, ICALP.

[8]  Michael Mitzenmacher,et al.  The Asymptotics of Selecting the Shortest of Two, Improved , 1999 .

[9]  George Varghese,et al.  Hash-Based Techniques for High-Speed Packet Processing , 2010, Algorithms for Next Generation Networks.

[10]  Manindra Agrawal,et al.  PRIMES is in P , 2004 .

[11]  Mikkel Thorup,et al.  Tabulation based 4-universal hashing with applications to second moment estimation , 2004, SODA '04.

[12]  Pedro M. Domingos,et al.  On the Optimality of the Simple Bayesian Classifier under Zero-One Loss , 1997, Machine Learning.

[13]  Alan M. Frieze,et al.  Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables , 2009, Random Struct. Algorithms.

[14]  Gaston H. Gonnet,et al.  An Analysis of the Karp-Rabin String Matching Algorithm , 1990, Inf. Process. Lett..

[15]  Allan Borodin,et al.  (Incremental) Priority Algorithms , 2002, SODA '02.

[16]  Jin Li,et al.  ChunkStash: Speeding Up Inline Storage Deduplication Using Flash Memory , 2010, USENIX Annual Technical Conference.

[17]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[18]  Berthold Vöcking,et al.  How asymmetry helps load balancing , 1999, JACM.

[19]  Christoforos E. Kozyrakis,et al.  The ZCache: Decoupling Ways and Associativity , 2010, 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture.

[20]  Babak Falsafi,et al.  Cuckoo directory: A scalable directory for many-core systems , 2011, 2011 IEEE 17th International Symposium on High Performance Computer Architecture.

[21]  Andrei Z. Broder,et al.  Using multiple hash functions to improve IP lookups , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[22]  Gaston H. Gonnet,et al.  Expected Length of the Longest Probe Sequence in Hash Code Searching , 1981, JACM.

[23]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[24]  Geoffrey I. Webb,et al.  Not So Naive Bayes: Aggregating One-Dependence Estimators , 2005, Machine Learning.

[25]  Rasmus Pagh,et al.  Cuckoo Hashing , 2001, Encyclopedia of Algorithms.

[26]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[27]  M. E. Maron,et al.  Automatic Indexing: An Experimental Inquiry , 1961, JACM.

[28]  Geoffrey Zweig,et al.  Syntactic Clustering of the Web , 1997, Comput. Networks.

[29]  Richard M. Karp,et al.  Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..

[30]  David E. Taylor,et al.  Longest prefix matching using bloom filters , 2006, TNET.

[31]  Graham Cormode,et al.  An improved data stream summary: the count-min sketch and its applications , 2004, J. Algorithms.

[32]  Mikkel Thorup.  Even strongly universal hashing is pretty fast , 2000, SODA '00.

[33]  Michael Mitzenmacher,et al.  BubbleSearch: A simple heuristic for improving priority-based greedy algorithms , 2006, Inf. Process. Lett..

[34]  M. Rabin.  Probabilistic algorithm for testing primality , 1980 .

[35]  Kai-Min Chung,et al.  Why simple hash functions work: exploiting the entropy in a data stream , 2008, SODA '08.

[36]  Paul G. Spirakis,et al.  Space Efficient Hash Tables with Worst Case Constant Access Time , 2003, Theory of Computing Systems.

[37]  Donald J. Newman,et al.  Simple Analytic Proof of the Prime Number Theorem , 1980 .

[38]  Andrea Montanari,et al.  Tight Thresholds for Cuckoo Hashing via XORSAT , 2009, ICALP.

[39]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[40]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..