Baeza-Yates, Ricardo. 2004. “A Fast Set Intersection Algorithm for
Sorted Sequences.” In Combinatorial Pattern Matching: 15th
Annual Symposium, CPM 2004, Istanbul, Turkey, July 5-7, 2004.
Proceedings 15, 400–408. Springer.
Barbay, Jérémy, and Claire Kenyon. 2002. “Adaptive Intersection
and t-Threshold Problems.” In Proceedings of the Thirteenth
Annual ACM-SIAM Symposium on Discrete Algorithms, 390–99. SODA ’02.
USA: Society for Industrial; Applied Mathematics.
Barbay, Jérémy, Alejandro López-Ortiz, and Tyler Lu. 2006. “Faster
Adaptive Set Intersections for Text Searching.” In
Experimental Algorithms: 5th International Workshop, WEA 2006, Cala
Galdana, Menorca, Spain, May 24-27, 2006. Proceedings 5, 146–57.
Springer.
Barbay, Jérémy, Alejandro López-Ortiz, Tyler Lu, and Alejandro Salinger.
2010. “An Experimental Investigation of Set Intersection
Algorithms for Text Searching.” Journal of Experimental
Algorithmics (JEA) 14: 3–7.
Bentley, Jon Louis, and Andrew Chi-Chih Yao. 1976. “An Almost
Optimal Algorithm for Unbounded Searching.” Information
Processing Letters 5 (SLAC-PUB-1679).
Cook, Curtis R, and Do Jin Kim. 1980. “Best Sorting Algorithm for
Nearly Sorted Lists.” Communications of the ACM 23 (11):
620–24.
Cormen, Thomas H, Charles E Leiserson, Ronald L Rivest, and Clifford
Stein. 2022. Introduction to Algorithms. MIT press.
Demaine, Erik D, Alejandro López-Ortiz, and J Ian Munro. 2001.
“Experiments on Adaptive Set Intersections for Text Retrieval
Systems.” In Algorithm Engineering and Experimentation: Third
International Workshop, ALENEX 2001 Washington, DC, USA, January 5–6,
2001 Revised Papers 3, 91–104. Springer.
Demaine, Erik D, Alejandro López-Ortiz, and J Ian Munro. 2000.
“Adaptive Set Intersections, Unions, and Differences.” In
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete
Algorithms, 743–52.
Estivill-Castro, Vladmir, and Derick Wood. 1992. “A Survey of
Adaptive Sorting Algorithms.” ACM Computing Surveys
(CSUR) 24 (4): 441–76.
Hwang, Frank K., and Shen Lin. 1971. “Optimal Merging of 2
Elements with n Elements.” Acta Informatica 1 (2):
145–58.
Knuth, Donald. 1998. The Art of Computer Programming, Vol. 3 (2nd
Ed): Sorting and Searching. Vol. 3. Redwood City, CA, USA.: Addison
Wesley Longman Publishing Co. Inc.
Loeser, Rudolf. 1974. “Some Performance Tests of
‘Quicksort’ and Descendants.” Communications of
the ACM 17 (3): 143–52.
MacKay, David JC. 2003. Information Theory, Inference and Learning
Algorithms. Cambridge university press.
Pugh, William. 1990. “Skip Lists: A Probabilistic Alternative to
Balanced Trees.” Commun. ACM 33 (6): 668–76. https://doi.org/10.1145/78973.78977.
Scott, Jennifer, and Miroslav Tůma. 2023. “An Introduction to
Sparse Matrices.” In Algorithms for Sparse Linear
Systems, 1–18. Cham: Springer International Publishing. https://doi.org/10.1007/978-3-031-25820-6_1.