| Nifty assignments N Parlante, J Zelenski, D Feinberg, K Mishra, J Hug, K Wayne, ... Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science …, 2017 | 41 | 2017 |
| Forming reasonably optimal groups: (FROG) M Craig, D Horton, F Pitt Proceedings of the 2010 ACM International Conference on Supporting Group …, 2010 | 39 | 2010 |
| Designing computer science competency statements: A process and curriculum model for the 21st century A Clear, T Clear, A Vichare, T Charles, S Frezza, M Gutica, B Lunt, ... Proceedings of the Working Group Reports on Innovation and Technology in …, 2020 | 36 | 2020 |
| A quantifier-free theory based on a string algebra for NC1. F Pitt Proof Complexity and Feasible Arithmetics, 229-252, 1996 | 7 | 1996 |
| A quantifier-free string theory for ALogTime reasoning F Pitt arXiv preprint cs/0702160, 2007 | 5 | 2007 |
| Developing competency statements for computer science curricula: The way ahead A Clear, T Clear, A Vichare, T Charles, S Frezza, M Gutica, B Lunt, ... Proceedings of the 2020 ACM Conference on Innovation and Technology in …, 2020 | 4 | 2020 |
| UT-Thesis Class File Example F Pitt University of Toronto, 2012 | | 2012 |
| DIMACS Series ir Discrete Mathematics and Theoretical Computer Science Volume 39, 1998 F Pitt Proof Complexity and Feasible Arithmetics: DIMACS Workshop, April 21-24 …, 0 | | |
