Çѱ¹Á¤º¸Åë½ÅÇÐȸ ³í¹®Áö (Journal of the Korea Institute of Information and Communication Engineering)
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
TPSACA¸¦ ÀÌ¿ëÇÑ ¿ÏÀü ÇØ½Ì ¾Ë°í¸®Áò |
¿µ¹®Á¦¸ñ(English Title) |
Perfect Hashing Algorithm Using TPSACA |
ÀúÀÚ(Author) |
±è¼®ÅÂ
À̼®±â
ÃÖ¾ð¼÷
Á¶¼ºÁø
Seok-Tae Kim
Seok-ki Lee
Un-Sook Choi
Sung-Jin Cho
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 08 NO. 06 PP. 1047 ~ 1054 (2004. 10) |
Çѱ۳»¿ë (Korean Abstract) |
ÄÄÇ»ÅÍ °úÇп¡¼ÀÇ Áß¿äÇÑ ¹®Á¦ÁßÀÇ Çϳª°¡ 'Á¤º¸¸¦ ¾î¶»°Ô Àß ÀúÀåÇÏ°í È¿°úÀûÀ¸·Î °Ë»öÇÒ ¼ö Àִ°¡' ÀÌ´Ù. ÀÌ·¯ÇÑ ¹®Á¦¸¦ ÇØ°áÇÏ´Â ±â¼úÀÌ ÇؽÌÀÌ´Ù. º» ³í¹®¿¡¼´Â µÎ °³ÀÇ Á÷ÀüÀÚ¿Í ÇϳªÀÇ ²ø°³¸¦ °®´Â ¼±Çü ¼¿·ê¶ó ¿ÀÅ丶Ÿ¿Í ±×°ÍÀÇ ¿©¿ø ¼¿·ê¶ó ¿ÀÅ丶ŸÀÇ Æ¯¼ºÀ» ÀÌ¿ëÇÏ¿© ¸¸µé¾îÁø Æ®¸®±¸¼º ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. ¶ÇÇÑ, MRT °³³äÀ» ÀÌ¿ëÇÑ µÎ °³ÀÇ Á÷ÀüÀÚ¿Í ÇϳªÀÇ ²ø°³¸¦ °®´Â ¼±Çü ¼¿·ê¶ó ¿ÀÅ丶Ÿ¸¦ ±â¹ÝÀ¸·Î ÇÏ´Â ¿ÏÀü ÇØ½Ì ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
One of the fundamental problems in computer science is how to store information so that it can be searched and retrieved efficiently. Hashing is a technique which solves this problem. In this paper, we propose a tree construction algorithm using linear two-predecessor single attractor cellular automata C and its complemented cellular automata. Also by using the concept of MRT we give a perfect hasing algorithm based on C.
|
Å°¿öµå(Keyword) |
¼¿·ê¶ó ¿ÀÅ丶Ÿ
¼±Çü nongroup CA
Attractor
Á÷ÀüÀÚ
TPSACA
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|