메뉴 건너뛰기




Volumn 790 LNCS, Issue , 1994, Pages 153-165

Graphs, Hypergraphs and Hashing

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

EID: 84943296694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57899-4_49     Document Type: Conference Paper
Times cited : (15)

References (50)
  • 3
    • 0025626679 scopus 로고
    • Perfect hashing using sparse matrix packing
    • M.D. Brain and A.L. Tharp. Perfect hashing using sparse matrix packing. Information Systems, 15 (1990) 281-290.
    • (1990) Information Systems , vol.15 , pp. 281-290
    • Brain, M.D.1    Tharp, A.L.2
  • 7
    • 0022149623 scopus 로고
    • An interactive system for finding perfect hash functions
    • N. Cercone, J. Boates, and M. Krause. An interactive system for finding perfect hash functions. IEEE Software, 2 (1985) 38-53.
    • (1985) IEEE Software , vol.2 , pp. 38-53
    • Cercone, N.1    Boates, J.2    Krause, M.3
  • 8
    • 0025997793 scopus 로고
    • Letter oriented perfect hashing scheme based upon sparse table compression
    • C-C. Chang and T-C. Wu. Letter oriented perfect hashing scheme based upon sparse table compression. Software — Practice and Experience, 21 (1991) 35-49.
    • (1991) Software — Practice and Experience , vol.21 , pp. 35-49
    • Chang, C.-C.1    Wu, T.-C.2
  • 9
    • 84976678241 scopus 로고
    • The study of an ordered minimal perfect hashing scheme
    • C.C. Chang. The study of an ordered minimal perfect hashing scheme. Communications of the ACM, 27 (1984) 384-387.
    • (1984) Communications of the ACM , vol.27 , pp. 384-387
    • Chang, C.C.1
  • 10
    • 0023964847 scopus 로고
    • An ordered minimal perfect hashing scheme with single parameter
    • C.C. Chang and C.H. Chang. An ordered minimal perfect hashing scheme with single parameter. Information Processing Letters, 27 (1988) 79-83.
    • (1988) Information Processing Letters , vol.27 , pp. 79-83
    • Chang, C.C.1    Chang, C.H.2
  • 11
    • 0026244388 scopus 로고
    • On the design of a machine independent perfect hashing
    • C.C. Chang, C.Y. Chen, and J.K. Jan. On the design of a machine independent perfect hashing. The Computer Journal, 34 (1991) 469-474.
    • (1991) The Computer Journal , vol.34 , pp. 469-474
    • Chang, C.C.1    Chen, C.Y.2    Jan, J.K.3
  • 12
    • 0022735348 scopus 로고
    • A letter-oriented minimal perfect hashing scheme
    • C.C. Chang and R.C.T. Lee. A letter-oriented minimal perfect hashing scheme. The Computer Journal, 29 (1986) 277-281.
    • (1986) The Computer Journal , vol.29 , pp. 277-281
    • Chang, C.C.1    Lee, R.C.T.2
  • 13
    • 0018918579 scopus 로고
    • Minimal perfect hash functions made simple
    • R.J. Cichelli. Minimal perfect hash functions made simple. Communications of the ACM, 23 (1980) 17-19.
    • (1980) Communications of the ACM , vol.23 , pp. 17-19
    • Cichelli, R.J.1
  • 14
    • 84976683170 scopus 로고
    • A letter oriented minimal perfect hashing function
    • C.R. Cook and R.R. Oldehoeft. A letter oriented minimal perfect hashing function. SIGPLAN Notices, 17 (1982) 18-27.
    • (1982) SIGPLAN Notices , vol.17 , pp. 18-27
    • Cook, C.R.1    Oldehoeft, R.R.2
  • 16
    • 0027112822 scopus 로고
    • An optimal algorithm for generating minimal perfect hash functions
    • Z.J. Czech, G. Havas, and B.S. Majewski. An optimal algorithm for generating minimal perfect hash functions. Information Processing Letters, 43 (1992) 257-264.
    • (1992) Information Processing Letters , vol.43 , pp. 257-264
    • Czech, Z.J.1    Havas, G.2    Majewski, B.S.3
  • 17
    • 0347040425 scopus 로고
    • Generating a minimal perfect hashing function in O(M 2) time
    • Z.J. Czech and B.S. Majewski. Generating a minimal perfect hashing function in O(m 2) time. Archiwum Informatyki, 4 (1992) 3-20.
    • (1992) Archiwum Informatyki , vol.4 , pp. 3-20
    • Czech, Z.J.1    Majewski, B.S.2
  • 21
    • 0039824525 scopus 로고
    • Types of cycles in hypergraphs
    • R. Duke. Types of cycles in hypergraphs. Ann. Discrete Math., 27 (1985) 399-418.
    • (1985) Ann. Discrete Math. , vol.27 , pp. 399-418
    • Duke, R.1
  • 22
    • 0001847481 scopus 로고
    • On the evolution of random graphs
    • Reprinted in J.H. Spencer, editor, The Art of Counting: Selected Writings, Mathematicians of Our Time, 574-617. Cambridge, Mass.: MIT Press, 1973
    • P. Erdős and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci., 5 (1960) 17-61. Reprinted in J.H. Spencer, editor, The Art of Counting: Selected Writings, Mathematicians of Our Time, 574-617. Cambridge, Mass.: MIT Press, 1973.
    • (1960) Publ. Math. Inst. Hung. Acad. Sci , vol.5 , pp. 17-61
    • Erdős, P.1    Rényi, A.2
  • 25
    • 84976812946 scopus 로고
    • Practical minimal perfect hash functions for large databases
    • E.A. Fox, L.S. Heath, Q. Chen, and A.M. Daoud. Practical minimal perfect hash functions for large databases. Communications of the ACM, 35 (1992) 105-121.
    • (1992) Communications of the ACM , vol.35 , pp. 105-121
    • Fox, E.A.1    Heath, L.S.2    Chen, Q.3    Daoud, A.M.4
  • 26
    • 0021467937 scopus 로고
    • Storing a sparse table with O(1) worst case access time
    • M.L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31 (1984) 538-544.
    • (1984) Journal of the ACM , vol.31 , pp. 538-544
    • Fredman, M.L.1    Komlós, J.2    Szemerédi, E.3
  • 28
    • 0346410239 scopus 로고
    • An algebraic approach to Cichelli's perfect hashing
    • M. Gori and G. Soda. An algebraic approach to Cichelli's perfect hashing. BIT, 29 (1989) 209-214.
    • (1989) BIT , vol.29 , pp. 209-214
    • Gori, M.1    Soda, G.2
  • 29
    • 0022660495 scopus 로고
    • Finding minimal perfect hash functions
    • G. Haggard and K. Karplus. Finding minimal perfect hash functions. ACM SIGCSE Bulletin, 18 (1986) 191-193.
    • (1986) ACM SIGCSE Bulletin , vol.18 , pp. 191-193
    • Haggard, G.1    Karplus, K.2
  • 30
    • 4243167224 scopus 로고
    • Technical Report 234, The University of Queensland, Key Centre for Software Technology, Queensland
    • G. Havas and B.S. Majewski. Optimal algorithms for minimal perfect hashing. Technical Report 234, The University of Queensland, Key Centre for Software Technology, Queensland, 1992.
    • (1992) Optimal Algorithms for Minimal Perfect Hashing
    • Havas, G.1    Majewski, B.S.2
  • 32
    • 0019675613 scopus 로고
    • Reciprocal hashing: A method for generating minimal perfect hashing functions
    • G. Jaeschke. Reciprocal hashing: A method for generating minimal perfect hashing functions. Communications of the ACM, 24 (1981) 829-833.
    • (1981) Communications of the ACM , vol.24 , pp. 829-833
    • Jaeschke, G.1
  • 34
    • 0024088662 scopus 로고
    • Hashing for dynamic and static internal tables
    • T.G. Lewis and C.R. Cook. Hashing for dynamic and static internal tables. Computer, 21(1988) 45-56.
    • (1988) Computer , vol.21 , pp. 45-56
    • Lewis, T.G.1    Cook, C.R.2
  • 38
    • 0025436178 scopus 로고
    • Fast hashing of variable-length text strings
    • P.K. Pearson. Fast hashing of variable-length text strings. Communications of the ACM, 33 (1990) 677-680.
    • (1990) Communications of the ACM , vol.33 , pp. 677-680
    • Pearson, P.K.1
  • 39
    • 0022061262 scopus 로고
    • A polynomial time generator for minimal perfect hash functions
    • T.J. Sager. A polynomial time generator for minimal perfect hash functions. Communications of the ACM, 28 (1985) 523-532.
    • (1985) Communications of the ACM , vol.28 , pp. 523-532
    • Sager, T.J.1
  • 42
    • 0025507834 scopus 로고
    • The spatial complexity of oblivious k-probe hash functions
    • J.P. Schmidt and A. Siegel. The spatial complexity of oblivious k-probe hash functions. SIAM Journal on Computing, 19 (1990) 775-786.
    • (1990) SIAM Journal on Computing , vol.19 , pp. 775-786
    • Schmidt, J.P.1    Siegel, A.2
  • 43
    • 0024768554 scopus 로고
    • On universal classes of fast high performance hash functions, their timespace trade-off, and their applications
    • A. Siegel. On universal classes of fast high performance hash functions, their timespace trade-off, and their applications. In 30th Annual Symposium on Foundations of Computer Science — FOCS'89, 20-25, 1989.
    • (1989) 30Th Annual Symposium on Foundations of Computer Science — FOCS'89 , pp. 20-25
    • Siegel, A.1
  • 44
    • 65749117216 scopus 로고
    • On tape versus core: An application of space efficient hash functions to the invariance of space
    • Washington, DC
    • C. Slot and P. van Emde Boas. On tape versus core: An application of space efficient hash functions to the invariance of space. In 16th Annual ACM Symposium on Theory of Computing — STOC'84, 391-400, Washington, DC, 1984.
    • (1984) 16Th Annual ACM Symposium on Theory of Computing — STOC'84 , pp. 391-400
    • Slot, C.1    van Emde Boas, P.2
  • 46
    • 0017551771 scopus 로고
    • Perfect hashing functions: A single probe retrieving method for static sets
    • R. Sprugnoli. Perfect hashing functions: A single probe retrieving method for static sets. Communications of the ACM, 20 (1977) 841-850.
    • (1977) Communications of the ACM , vol.20 , pp. 841-850
    • Sprugnoli, R.1
  • 49
    • 0345778997 scopus 로고
    • Minimal perfect hashing in polynomial time
    • V.G. Winters. Minimal perfect hashing in polynomial time. BIT, 30 (1990) 235-244.
    • (1990) BIT , vol.30 , pp. 235-244
    • Winters, V.G.1
  • 50
    • 0021852532 scopus 로고
    • A backtracking method for constructing perfect hash functions from a set of mapping functions
    • W.P. Yang and M.W. Du. A backtracking method for constructing perfect hash functions from a set of mapping functions. BIT, 25 (1985) 148-164.
    • (1985) BIT , vol.25 , pp. 148-164
    • Yang, W.P.1    Du, M.W.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.