| 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 | 39 | 2017 |
| Forming reasonably optimal groups:(FROG) M Craig, D Horton, F Pitt Proceedings of the 16th ACM international conference on Supporting group …, 2010 | 36 | 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 | 27 | 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 |
