-
3
-
-
0016518897
-
Efficient string matching: An aid to bibliographic search
-
A. V. Aho and M. J. Corasick, Efficient string matching: An aid to bibliographic search, Communications of the ACM, 18 (1975), pp. 333-340.
-
(1975)
Communications of the ACM
, vol.18
, pp. 333-340
-
-
Aho, A.V.1
Corasick, M.J.2
-
4
-
-
72249085354
-
FAWN: A fast array of wimpy nodes
-
Big Sky, MT, Oct
-
D. G. Andersen, J. Franklin, M. Kaminsky, A. Phanishayee, L. Tan, and V. Vasudevan, FAWN: A fast array of wimpy nodes, in Proc. 22nd ACM Symposium on Operating Systems Principles (SOSP), Big Sky, MT, Oct. 2009.
-
(2009)
Proc. 22nd ACM Symposium on Operating Systems Principles (SOSP)
-
-
Andersen, D.G.1
Franklin, J.2
Kaminsky, M.3
Phanishayee, A.4
Tan, L.5
Vasudevan, V.6
-
5
-
-
0014814325
-
Space/time trade-offs in hash coding with allowable errors
-
B. H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, 13 (1970), pp. 422-426.
-
(1970)
Communications of the ACM
, vol.13
, pp. 422-426
-
-
Bloom, B.H.1
-
7
-
-
85076777802
-
SplitScreen: Enabling efficient, distributed malware detection
-
San Jose, CA, Apr
-
S. K. Cha, I. Moraru, J. Jang, J. Truelove, D. Brumley, and D. G. Andersen, SplitScreen: Enabling efficient, distributed malware detection, in Proc. 7th USENIX NSDI, San Jose, CA, Apr. 2010.
-
(2010)
Proc. 7th USENIX NSDI
-
-
Cha, S.K.1
Moraru, I.2
Jang, J.3
Truelove, J.4
Brumley, D.5
Andersen, D.G.6
-
8
-
-
1842473700
-
The bloomier filter: An eficient data structure for static support lookup tables
-
B. Chazelle, J. Kilian, R. Rubinfeld, A. Tal, and O. Boy, The bloomier filter: An eficient data structure for static support lookup tables, in In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 30-39.
-
(2004)
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
, pp. 30-39
-
-
Chazelle, B.1
Kilian, J.2
Rubinfeld, R.3
Tal, A.4
Boy, O.5
-
11
-
-
84976228809
-
A string matching algorithm fast on the average
-
London, UK, Springer-Verlag
-
B. Commentz-Walter, A string matching algorithm fast on the average, in Proceedings of the 6th Colloquium, on Automata, Languages and Programming, London, UK, 1979, Springer-Verlag, pp. 118-132.
-
(1979)
Proceedings of the 6th Colloquium, on Automata, Languages and ProGramming
, pp. 118-132
-
-
Commentz-Walter, B.1
-
12
-
-
0032178083
-
Summary cache: A scalable wide-area web cache sharing protocol
-
Canada, Sept
-
L. Fan, P. Cao, J. Almeida, and A. Z. Broder, Summary cache: A scalable wide-area Web cache sharing protocol, in Proc. ACM SIGCOMM, Vancouver, British Columbia, Canada, Sept. 1998, pp. 254-265.
-
(1998)
Proc. ACM SIGCOMM, Vancouver, British Columbia
, pp. 254-265
-
-
Fan, L.1
Cao, P.2
Almeida, J.3
Broder, A.Z.4
-
13
-
-
36348934004
-
Building high accuracy bloom filters using partitioned hashing
-
F. Hao, M. Kodialam, and T. V. Lakshman, Building high accuracy bloom filters using partitioned hashing, SIGMETRICS Performance Evaluation Review, (2007), pp. 277-288.
-
(2007)
SIGMETRICS Performance EvalUation Review
, pp. 277-288
-
-
Hao, F.1
Kodialam, M.2
Lakshman, T.V.3
-
17
-
-
52349121903
-
Same performance: Building a better bloom filter
-
Less hashing, same performance: Building a better bloom filter, Random Structures & Algorithms, 33 (2008), pp. 187-218.
-
(2008)
Random Structures & AlgoRithms
, vol.33
, pp. 187-218
-
-
Hashing, L.1
-
18
-
-
77955099121
-
Profiling and accelerating string matching algorithms in three network content security applications
-
P.-c. Lin, Z.-x. Li, Y.-d. Lin, and Y.-c. Lai, Profiling and accelerating string matching algorithms in three network content security applications, IEEE Communications Surveys & Tutorials, 8 (2006).
-
(2006)
IEEE Communications Surveys & Tutorials
, vol.8
-
-
Lin, P.-C.1
Li, Z.-X.2
Lin, Y.-D.3
Lai, Y.-C.4
-
19
-
-
0642342576
-
Tacg a grep for dna
-
H. Mangalam, tacg a grep for dna, BMC Bioinformatics, 3 (2002), p. 8.
-
(2002)
BMC Bioinformatics
, vol.3
, pp. 8
-
-
Mangalam, H.1
-
20
-
-
84957686939
-
Approximate multiple string search
-
Springer-Verlag
-
R. Muth and U. Manber, Approximate multiple string search, in Proceedings CPM'96, LNCS 1075, Springer-Verlag, 1996, pp. 75-86.
-
(1996)
Proceedings CPM'96, LNCS 1075
, pp. 75-86
-
-
Muth, R.1
Manber, U.2
-
21
-
-
37149047145
-
Cache-, hashand space-eficient bloom filters
-
Springer Berlin/Heidelberg
-
F. Putze, P. Sanders, and S. Johannes, Cache-, hashand space-eficient bloom filters, in Experimental Algorithms, Springer Berlin/Heidelberg, 2007, pp. 108-121.
-
(2007)
Experimental Algorithms
, pp. 108-121
-
-
Putze, F.1
Sanders, P.2
Johannes, S.3
|