-
1
-
-
0024082546
-
Input/output complexity of sorting and related problems
-
DOI 10.1145/48529.48535
-
A. Aggarwal, J.S. Vitter, The input/output complexity of sorting and related problems, Communications of the ACM 31 (9) (1988) 1116-1127. (Pubitemid 18662481)
-
(1988)
Communications of the ACM
, vol.31
, Issue.9
, pp. 1116-1127
-
-
Aggarwal, A.1
Vitter, J.S.2
-
2
-
-
0000694935
-
Linear hash functions
-
N. Alon, M. Dietzfelbinger, P. Miltersen, E. Petrank, G. Tardos, Linear hash functions, Journal of the ACM 46 (5) (1999) 667-683.
-
(1999)
Journal of the ACM
, vol.46
, Issue.5
, pp. 667-683
-
-
Alon, N.1
Dietzfelbinger, M.2
Miltersen, P.3
Petrank, E.4
Tardos, G.5
-
3
-
-
0000156664
-
Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions
-
N. Alon, M. Naor, Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions, Algor-ithmica 16 (4-5) (1996) 434-449. (Pubitemid 126416936)
-
(1996)
Algorithmica (New York)
, vol.16
, Issue.4-5
, pp. 434-449
-
-
Alon, N.1
Naor, M.2
-
4
-
-
70350393266
-
Hash displace and compress
-
D. Belazzougui, F.C. Botelho, M. Dietzfelbinger, Hash, displace, and compress, in: 17th European Symposium on Algorithms (ESA'09), 2009, pp. 682-693.
-
(2009)
17th European Symposium on Algorithms (ESA'09)
, pp. 682-693
-
-
Belazzougui, D.1
Botelho, F.C.2
Dietzfelbinger, M.3
-
5
-
-
84869233789
-
Distributed perfect hashing for very large key sets
-
ACM Press
-
F. Botelho, D. Galinkin, W. Meira-Jr., N. Ziviani, Distributed perfect hashing for very large key sets, in: 3rd International ICST Conference on Scalable Information Systems (InfoScale'08), ACM Press, 2008.
-
(2008)
3rd International ICST Conference on Scalable Information Systems (InfoScale'08)
-
-
Botelho, F.1
Galinkin, D.2
Meira Jr., W.3
Ziviani, N.4
-
6
-
-
24944474715
-
A practical minimal perfect hashing method
-
Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005. Proceedings
-
F. Botelho, Y. Kohayakawa, N. Ziviani, A practical minimal perfect hashing method, in: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), vol. 3505, Springer, Lecture Notes in Computer Science, 2005, pp. 488-500. (Pubitemid 41322469)
-
(2005)
Lecture Notes in Computer Science
, vol.3503
, pp. 488-500
-
-
Botelho, F.C.1
Kohayakawa, Y.2
Ziviani, N.3
-
7
-
-
79953843470
-
Minimal perfect hashing: A competitive method for indexing internal memory
-
F. Botelho, A. Lacerda, G. Menezes, N. Ziviani, Minimal perfect hashing: a competitive method for indexing internal memory, Information Sciences 181 (13) (2011) 2608-2625.
-
(2011)
Information Sciences
, vol.181
, Issue.13
, pp. 2608-2625
-
-
Botelho, F.1
Lacerda, A.2
Menezes, G.3
Ziviani, N.4
-
8
-
-
38149010559
-
Simple and space-efficient minimal perfect hash functions
-
10th Workshop on Algorithms and Data Structures (WADS'07)
-
F. Botelho, R. Pagh, N. Ziviani, Simple and space-efficient minimal perfect hash functions, in: 10th Workshop on Algorithms and Data Structures (WADS'07), vol. 4619, Springer, Lecture Notes in Computer Science, 2007, pp. 139-150.
-
(2007)
Springer, Lecture Notes in Computer Science
, vol.4619
, pp. 139-150
-
-
Botelho, F.1
Pagh, R.2
Ziviani, N.3
-
9
-
-
84857341375
-
Cores of random r-partite hypergraphs
-
(April)
-
F. Botelho, N. Wormald, N. Ziviani, Cores of random r-partite hypergraphs, Information Processing Letters 112 (8-9(April)) (2012) 314-319, http://dx.doi.org/10.1016/j.ipl.2011.10.017.
-
(2012)
Information Processing Letters
, vol.112
, Issue.8-9
, pp. 314-319
-
-
Botelho, F.1
Wormald, N.2
Ziviani, N.3
-
13
-
-
15744368786
-
Perfect hashing schemes for mining association rules
-
DOI 10.1093/comjnl/bxh074
-
C.-C. Chang, C.-Y. Lin, A perfect hashing schemes for mining association rules, The Computer Journal 48 (2) (2005) 168-179. (Pubitemid 40414923)
-
(2005)
Computer Journal
, vol.48
, Issue.2
, pp. 168-179
-
-
Chang, C.-C.1
Lin, C.-Y.2
-
14
-
-
33644582610
-
Perfect hashing schemes for mining traversal patterns
-
C.-C. Chang, C.-Y. Lin, H. Chou, Perfect hashing schemes for mining traversal patterns, Journal of Fundamental Informaticae 70 (3) (2006) 185-202.
-
(2006)
Journal of Fundamental Informaticae
, vol.70
, Issue.3
, pp. 185-202
-
-
Chang, C.-C.1
Lin, C.-Y.2
Chou, H.3
-
15
-
-
1842473700
-
The bloomier filter: An efficient data structure for static support lookup tables
-
Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
-
B. Chazelle, J. Kilian, R. Rubinfeld, A. Tal, The bloomier filter: an efficient data structure for static support lookup tables, in: 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2004, pp. 30-39.
-
(2004)
15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04)
, pp. 30-39
-
-
Chazelle, B.1
Kilian, J.2
Rubinfeld, R.3
Tal, A.4
-
17
-
-
0346880188
-
Fundamental Study Perfect hashing
-
PII S0304397596001466
-
Z. Czech, G. Havas, B. Majewski, Fundamental study perfect hashing, Theoretical Computer Science 182 (1997) 1-143. (Pubitemid 127455844)
-
(1997)
Theoretical Computer Science
, vol.182
, Issue.1-2
, pp. 1-143
-
-
Czech, Z.J.1
Havas, G.2
Majewski, B.S.3
-
18
-
-
84869229085
-
Perfect hash functions for large web repositories
-
G. Kotsis, D. Taniar, S. Bressan, I.K. Ibrahim, S. Mokhtar (Eds.), Austrian Computer Society
-
A.M. Daoud, Perfect hash functions for large web repositories, in: G. Kotsis, D. Taniar, S. Bressan, I.K. Ibrahim, S. Mokhtar (Eds.), Seventh International Conference on Information Integration and Web Based Applications Services (iiWAS'05), vol. 196, Austrian Computer Society, 2005, pp. 1053-1063.
-
(2005)
Seventh International Conference on Information Integration and Web Based Applications Services (iiWAS'05)
, vol.196
, pp. 1053-1063
-
-
Daoud, A.M.1
-
19
-
-
84860839700
-
Polynomial hash functions are reliable
-
Springer-Verlag, London, U.K.
-
M. Dietzfelbinger, J. Gil, Y. Matias, N. Pippenger, Polynomial hash functions are reliable, in: 19th International Colloquium on Automata, Languages and Programming (ICALP'92), Springer-Verlag, London, UK, 1992, pp. 235-246.
-
(1992)
19th International Colloquium on Automata, Languages and Programming (ICALP'92)
, pp. 235-246
-
-
Dietzfelbinger, M.1
Gil, J.2
Matias, Y.3
Pippenger, N.4
-
20
-
-
84869223663
-
Simple minimal perfect hashing in less space, in: 9th European Symposium on Algorithms (ESA'01)
-
M. Dietzfelbinger, T. Hagerup, Simple minimal perfect hashing in less space, in: 9th European Symposium on Algorithms (ESA'01), Springer, Lecture Notes in Computer Science, vol. 2161, 2001, pp. 109-120.
-
(2001)
Springer, Lecture Notes in Computer Science
, vol.2161
, pp. 109-120
-
-
Dietzfelbinger, M.1
Hagerup, T.2
-
21
-
-
70449103308
-
Applications of a splitting trick
-
36th international colloquium on automata, languages and programming (ICALP'09)
-
M. Dietzfelbinger, M. Rink, Applications of a splitting trick, in: 36th International Colloquium on Automata, Languages and Programming (ICALP'09), vol. 5555, Springer, Lecture Notes in Computer Science, 2009, pp. 354-365.
-
(2009)
Springer, Lecture Notes in Computer Science
, vol.5555
, pp. 354-365
-
-
Dietzfelbinger, M.1
Rink, M.2
-
22
-
-
26444449945
-
Balanced allocation and dictionaries with tightly packed constant size bins
-
Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005. Proceedings
-
M. Dietzfelbinger, C. Weidling, Balanced allocation and dictionaries with tightly packed constant size bins, in: Proceedings of 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), 2005, pp. 166-178. (Pubitemid 41436099)
-
(2005)
Lecture Notes in Computer Science
, vol.3580
, pp. 166-178
-
-
Dietzfelbinger, M.1
Weidling, C.2
-
23
-
-
0038446821
-
Almost random graphs with simple hash functions
-
ACM, New York, NY, USA
-
M. Dietzfelbinger, P. Woelfel, Almost random graphs with simple hash functions, in: 35th Annual ACM Symposium on Theory of Computing (STOC'03), ACM, New York, NY, USA, 2003, pp. 629-638.
-
(2003)
35th Annual ACM Symposium on Theory of Computing (STOC'03)
, pp. 629-638
-
-
Dietzfelbinger, M.1
Woelfel, P.2
-
24
-
-
0023363021
-
Versatile data structure for edge-oriented graph algorithms
-
DOI 10.1145/214762.214769
-
J. Ebert, A versatile data structure for edge-oriented graph algorithms, Communications of the ACM 30 (1987) 513-519. (Pubitemid 17599087)
-
(1987)
Communications of the ACM
, vol.30
, Issue.6
, pp. 513-519
-
-
Ebert, J.1
-
26
-
-
84976812946
-
Practical minimal perfect hash functions for large databases
-
E. Fox, L.S. Heath, Q. Chen, A. Daoud, Practical minimal perfect hash functions for large databases, Communications of the ACM 35 (1) (1992) 105-121.
-
(1992)
Communications of the ACM
, vol.35
, Issue.1
, pp. 105-121
-
-
Fox, E.1
Heath, L.S.2
Chen, Q.3
Daoud, A.4
-
28
-
-
78649841467
-
Sorting and searching on the word RAM
-
STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science
-
T. Hagerup, Sorting and searching on the word RAM, in: 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS'98), Springer-Verlag, London, UK, 1998, pp. 366-398. (Pubitemid 128044803)
-
(1998)
Lecture Notes in Computer Science
, Issue.1373
, pp. 366-398
-
-
Hagerup, T.1
-
29
-
-
84957076793
-
Efficient minimal perfect hashing in nearly minimal space
-
STACS 2001
-
T. Hagerup, T. Tholey, Efficient minimal perfect hashing in nearly minimal space, in: 18th Symposium on Theoretical Aspects of Computer Science (STACS'01), vol. 2010, Springer, Lecture Notes in Computer Science, 2001, pp. 317-326. (Pubitemid 33241762)
-
(2001)
Lecture Notes in Computer Science
, Issue.2010
, pp. 317-326
-
-
Hagerup, T.1
Tholey, T.2
-
30
-
-
33747001690
-
The art of computer systems performance analysis: Techniques for experimental design
-
1st ed. John Wiley
-
R. Jain, The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation, and Modeling, 1st ed. John Wiley, 1991.
-
(1991)
Measurement, Simulation, and Modeling
-
-
Jain, R.1
-
31
-
-
38249037008
-
Poisson convergence and poisson processes with applications to random graphs
-
S. Janson, Poisson convergence and Poisson processes with applications to random graphs, Stochastic Processes and their Applications 26 (1987) 1-30.
-
(1987)
Stochastic Processes and Their Applications
, vol.26
, pp. 1-30
-
-
Janson, S.1
-
34
-
-
0032091597
-
Memory management during run generation in external sorting
-
P. Larson, G. Graefe, Memory management during run generation in external sorting, in: 1998 ACM SIGMOD International Conference on Management of Data, ACM Press, 1998, pp. 472-483. (Pubitemid 128655992)
-
(1998)
SIGMOD Record
, vol.27
, Issue.2
, pp. 472-483
-
-
Larson, P.-A.1
Graefe, G.2
-
35
-
-
50949096788
-
Perfect spatial hashing
-
DOI 10.1145/1141911.1141926, ACM Transactions on Graphics - Proceedings of ACM SIGGRAPH 2006
-
S. Lefebvre, H. Hoppe, Perfect spatial hashing, ACM Transactions on Graphics 25 (3) (2006) 579-588. (Pubitemid 44481017)
-
(2006)
ACM Transactions on Graphics
, vol.25
, Issue.3
, pp. 579-588
-
-
Lefebvre, S.1
Hoppe, H.2
-
36
-
-
4243157787
-
A family of perfect hashing methods
-
B. Majewski, N. Wormald, G. Havas, Z. Czech, A family of perfect hashing methods, The Computer Journal 39 (6) (1996) 547-554.
-
(1996)
The Computer Journal
, vol.39
, Issue.6
, pp. 547-554
-
-
Majewski, B.1
Wormald, N.2
Havas, G.3
Czech, Z.4
-
38
-
-
1842539405
-
The pure literal rule threshold and cores in random hypergraphs
-
Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
-
M. Molloy. The pure literal rule threshold and cores in random hypergraphs, in: 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2004, pp. 672-681.
-
(2004)
15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04)
, pp. 672-681
-
-
Molloy, M.1
-
39
-
-
0004168557
-
-
Cambridge University Press, New York, NY, USA
-
R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, New York, NY, USA, 1995.
-
(1995)
Randomized Algorithms
-
-
Motwani, R.1
Raghavan, P.2
-
41
-
-
84948981268
-
Hash and displace: Efficient evaluation of minimal perfect hash functions
-
R. Pagh, Hash and displace: efficient evaluation of minimal perfect hash functions, in: 6th Workshop on Algorithms and Data Structures (WADS'99), 1999, pp. 49-54.
-
(1999)
6th Workshop on Algorithms and Data Structures (WADS'99)
, pp. 49-54
-
-
Pagh, R.1
-
42
-
-
0036248032
-
Low redundancy in static dictionaries with constant query time
-
PII S0097539700369909
-
R. Pagh, Low redundancy in static dictionaries with constant query time, SIAM Journal on Computing 31 (2) (2001) 353-363. (Pubitemid 33782954)
-
(2001)
SIAM Journal on Computing
, vol.31
, Issue.2
, pp. 353-363
-
-
Pagh, R.1
-
44
-
-
0026837137
-
Improved bounds for covering complete uniform hypergraphs
-
J. Radhakrishnan, Improved bounds for covering complete uniform hypergraphs, Information Processing Letters 41 (1992) 203-207.
-
(1992)
Information Processing Letters
, vol.41
, pp. 203-207
-
-
Radhakrishnan, J.1
-
45
-
-
84968909171
-
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
-
Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
-
R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2002, pp. 233-242.
-
(2002)
13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02)
, pp. 233-242
-
-
Raman, R.1
Raman, V.2
Rao, S.S.3
-
46
-
-
0025507834
-
The spatial complexity of oblivious k-probe hash functions
-
(October))
-
J.P. Schmidt, A. Siegel, The spatial complexity of oblivious k-probe hash functions, SIAM Journal on Computing 19 (5(October)) (1990) 775-786.
-
(1990)
SIAM Journal on Computing
, vol.19
, Issue.5
, pp. 775-786
-
-
Schmidt, J.P.1
Siegel, A.2
-
47
-
-
0344941446
-
External memory algorithms and data structures
-
J. Abello, J.S. Vitter (Eds.) American Mathematical Society Press, Providence, R.I.
-
J.S. Vitter, External memory algorithms and data structures, in: J. Abello, J.S. Vitter (Eds.), External Memory Algorithms and Visualization, American Mathematical Society Press, Providence, RI, 1999, pp. 1-38.
-
(1999)
External Memory Algorithms and Visualization
, pp. 1-38
-
-
Vitter, J.S.1
-
48
-
-
33750091309
-
Maintaining external memory efficient hash tables
-
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 a
-
P. Woelfel, Maintaining external memory efficient hash tables, in: 10th International Workshop on Randomization and Computation (RANDOM'06), Springer, Lecture Notes in Computer Science, vol. 4110, 2006, pp. 508-519. (Pubitemid 44577557)
-
(2006)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.4110
, pp. 508-519
-
-
Woelfel, P.1
-
49
-
-
85066881368
-
Avoiding the disk bottleneck in the data domain deduplication file system
-
B. Zhu, K. Li, R.H. Patterson, Avoiding the disk bottleneck in the data domain deduplication file system, in: 6th USENIX Conference on File and Storage Technologies (FAST'08), 2008, pp. 269-282.
-
(2008)
6th USENIX Conference on File and Storage Technologies (FAST'08)
, pp. 269-282
-
-
Zhu, B.1
Li, K.2
Patterson, R.H.3
|