A quantifier-free theory based on a string algebra for NC1. - François Pitt (Proof Complexity and Feasible Arithmetics, 1996)

A quantifier-free string theory for ALOGTIME reasoning. - François Pitt (2000)

A Quantifier-Free String Theory for ALOGTIME Reasoning - François Pitt (CoRR, 2007)

Forming reasonably optimal groups: (FROG). - Michelle Craig; Diane Horton; François Pitt (GROUP, 2010)

Nifty Assignments. - Nick Parlante; Julie Zelenski; Dave Feinberg; Kunal Mishra; Josh Hug; Kevin Wayne; Michael Guerzhoy; Jackie Chi Kit Cheung; François Pitt (SIGCSE, 2017)

Developing Competency Statements for Computer Science Curricula: The Way Ahead. - Alison Clear; Tony Clear; Abhijat Vichare; Thea Charles; Stephen Frezza; Mirela Gutica; Barry M. Lunt; Francesco Maiorana; Arnold Pears; François Pitt; Charles Riedesel; Justyna Szynkiewicz (ITiCSE, 2020)

Designing Computer Science Competency Statements: A Process and Curriculum Model for the 21st Century. - Alison Clear; Tony Clear; Abhijat Vichare; Thea Charles; Stephen Frezza; Mirela Gutica; Barry M. Lunt; Francesco Maiorana; Arnold Pears; François Pitt; Charles Riedesel; Justyna Szynkiewicz (ITiCSE-WGR, 2020)