Search results
of Computer Science. pp. 442–47. doi:10.1109/SFCS.1989.63516. ISBN 0-8186-1982-1. S2CID 8057709. Retrieved 9 February 2016. {{cite book}}: |journal=...8 KB (850 words) - 02:20, 3 March 2024- Computer Society Press. pp. 540–545. doi:10.1109/SFCS.1989.63531. ISBN 0-8186-1982-1. Johnson, David S.; Aragon, Cecilia R.; McGeoch, Lyle A.; Schevon, Catherine...14 KB (1,148 words) - 15:29, 11 April 2024
Computer Society Press, pp. 540–545, doi:10.1109/SFCS.1989.63531, ISBN 0-8186-1982-1, archived (PDF) from the original on 2022-10-09 Cormen, Thomas H.; Leiserson...31 KB (3,098 words) - 12:28, 12 May 2024
Computer Society Press, pp. 540–545, doi:10.1109/SFCS.1989.63531, ISBN 0-8186-1982-1 Seidel, Raimund; Aragon, Cecilia R. (1996), "Randomized Search Trees"...23 KB (3,213 words) - 05:19, 18 April 2024- of Computer Science. pp. 540–545. doi:10.1109/SFCS.1989.63531. ISBN 0-8186-1982-1. Pugh, William (April 1989). Concurrent Maintenance of Skip Lists (PS...32 KB (4,173 words) - 21:10, 30 March 2024
Computer Science. FOCS. pp. 332–337. doi:10.1109/SFCS.1989.63499. ISBN 0-8186-1982-1. Lee, Yin-Tat; Sidford, Aaron (2015). Efficient inverse maintenance...60 KB (6,577 words) - 18:12, 15 June 2024- of Computer Science. pp. 216–221. doi:10.1109/SFCS.1989.63481. ISBN 0-8186-1982-1. S2CID 32686790. Shimozono, Shinichi (1997). "Finding optimal subgraphs...35 KB (5,456 words) - 11:27, 29 March 2024
