1. The Design and Analysis of Computer Algorithms;Aho,1974
2. Generating pseudo-random permutations and maximum flow algorithms;Alon;Inform. Process. Lett.,1990
3. Graphs and Hypergraphs;Berge,1970
4. Time bounds for selection;Blum;J. Comput. System Sci.,1973
5. G. S. Brodal, Worst-case efficient priority queues, in, Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, 52, 58