Acknowledgement
이 논문은 2024년도 정부(교육부)의 재원으로 한국연구재단의 지원을 받아 연구되었음(NRF-2022R1I1A1A0107117 독립단편영화를 위한 반응형 웹 기반 OTT 플랫폼 및 인공지능기반 영화 화질 개선기술 개발).
References
- R. E. Neapolitan, "Foundations of algorithms," 5th ed., Jones&Bartlett Learning, 2009.
- J. He et al., "Dynamic data structures for a direct search algorithm," Computational Optimization and Applications, Vol.23, pp.5-25, 2002.
- R. A. Finkel and J. L. Bentley, "Quad trees a data structure for retrieval on composite keys," Acta Informatica, Vol.4, pp.1-9, 1974.
- C. S. Kim, "The development of the application program generator based on meta-data," The KIPS Transactions: Part D, Vol.13, No.1, pp.97-102, 2024.
- C. Althoff, "The self-taught computer scientist: The Beginner's guide to data Structures&Algorithms," 1st ed., Wiley, 2021.
- N. Parlante, "Linked list basics," Stanford CS Education Library 1:25, 2001.
- V. P. Parmar, and C. K. Kumbharana, "Comparing linear search and binary search algorithms to search an element from a linear list implemented through static array, dynamic array and linked list," International Journal of Computer Applications, Vol.121, No.3, pp.13-17, 2015.
- Parlante, Nick., Linked List Problems [Internet], http://cslibrary.stanford.edu/105/LinkedListProblems.pdf
- P. F. Dietz, "Maintaining order in a linked list," Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp.122-127, 1982.
- W. D. Maurer and T. G. Lewis, "Hash table methods," ACM Computing Surveys, Vol7, No.1, pp.5-19, 1975.
- S. Y. Kim, "Estimation of performance for random binary search trees," Journal of the Korea Computer Industry Society, Vol.2, No.2, pp.203-210, 2001.
- J. A. Bondy, "Graph theory with applications," 3rd ed., Elsevier Science Ltd, 1984.
- N. G. de Bruijn, "Asymptotic methods in analysis," 4th ed., Courier Corporation, 1981.
- S. Kurgalin and S. Borzunov, "The discrete math workbook: A companion manual using python," 2nd ed., Springer Nature, pp.357-375, 2020.
- T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to algorithms," McGraw-Hill, 2nd ed., 2001.
- M. T. Goodrich and R. Tamassia, "Algorithm design: Foundations, analysis, and internet examples," Wiley, 2002.
- J. Kleinberg and E. Tardos. "Algorithm Design," Addison Wesley, 2006.
- A. Levitin, "Introduction to the design & analysis of algorithms," Addison Wesley, 2nd edition, 2007.
- W. Le Yi and G. G. Yin, "Time and space complexity in feedback systems: Recent progress and challenges," Proceedings of the 29th Chinese Control Conference, pp. 6209-6214, 2010.
- M. J. North, "A time and space complexity analysis of model integration," Proceedings of the Winter Simulation Conference, pp.1644-1651, 2014.
- R. Lesuisse, "Some lessons drawn from the history of the binary search algorithm," The Computer Journal, Vol.26, No.2, pp.154-163, 1983.
- G. Micha and I. Ozsvald, "High performance python: Practical performant programming for humans," 2nd ed., O'Reilly, 2020.