대한전자공학회:학술대회논문집 (Proceedings of the IEEK Conference)
- 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
- /
- Pages.165-168
- /
- 2000
A Linear-Time Algorithm to Find the First Overlap in a Binary Word
- Park, Thomas H. (Router Software Team, Router Technology Department, Electronics and Telecommunications Research Institute)
- 발행 : 2000.06.01
초록
First, we give a linear-time algorithm to find the first overlap in an arbitrary binary word. Second, we implement the algorithm in the C language and show that the number of comparisons in this algorithm is less than 31n, where n
키워드