Real-Time Performance of Sorting Algorithms
暂无分享,去创建一个
[1] Peter P. Puschner,et al. Computing Maximum Task Execution Times — A Graph-Based Approach , 1997, Real-Time Systems.
[2] July , 1890, The Hospital.
[3] Sharad Malik,et al. Efficient microarchitecture modeling and path analysis for real-time software , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.
[4] B. Monien,et al. Data structures and efficient algorithms , 1992, Lecture Notes in Computer Science.
[5] David B. Whalley,et al. A retargetable technique for predicting execution time , 1992, [1992] Proceedings Real-Time Systems Symposium.
[6] Guy E. Blelloch,et al. A comparison of sorting algorithms for the connection machine CM-2 , 1991, SPAA '91.
[7] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[8] Philippe Flajolet,et al. An introduction to the analysis of algorithms , 1995 .
[9] Donald E. Knuth,et al. The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .
[10] M. Degroot,et al. Probability and Statistics , 2021, Examining an Operational Approach to Teaching Probability.
[11] Chang Yun Park,et al. Predicting program execution times by analyzing static and dynamic program paths , 1993, Real-Time Systems.
[12] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[13] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[14] Richard M. Karp,et al. A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .