On finding a stable roommate, job, or spouse: a case study crossing the boundaries of computer science courses
暂无分享,去创建一个
[1] Alan W. Biermann,et al. An overview course in academic computer science: a new approach for teaching nonmajors , 1990, SIGCSE '90.
[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[3] Niklaus Wirth,et al. Algorithms + Data Structures = Programs , 1976 .
[4] Robert W. Irving,et al. The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.
[5] James F. Korsh. Data structures, algorithms, and program style , 1986 .
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Richard E. Pattis. Textbook errors in binary searching , 1988, SIGCSE '88.
[8] Robert Sedgewick,et al. Algorithms in C , 1990 .
[9] Richard E. Pattis. A philosophy and example of CS-1 programming projects , 1990, SIGCSE '90.
[10] Michael J. Quinn,et al. A note on two parallel algorithms to solve the stable marriage problem , 1985, BIT.
[11] Allen B. Tucker,et al. Computing curricula 1991: Report of the ACM/IEEE-CS Joint Curriculum Task Force , 1991 .
[12] A. Roth. The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.
[13] Rick Decker,et al. A survey course in computer science using HyperCard , 1990, SIGCSE '90.
[14] Martin Dyer,et al. The Stable Marriage Problem: Structure and Algorithms , 1991 .