1. Fast probabilistic algorithms for Hamiltonian circuits and matchings;Angluin;J. Comput. System Sci.,1979
2. Realistic parallel algorithms: priority queue operations and selection for the BSP* model, Euro-Par ’96 Parallel Processing;Baumker,1996
3. J. Biswas, J.C. Browne, Simultaneous update of priority structures, in: Proc. 1987 Internat. Conf. on Parallel Processing, St. Charles, IL, 1987, pp. 124–131.
4. Time bounds for selection;Blum;J. Comput. System Sci.,1973
5. Random Graphs;Bollobás,1984