| 2014 | SIGCSE | Teach algorithm design and intractability with a project-based curriculum centered on a single intractable problem: three domains to choose from (abstract only). | Andrea F. Lobo, Ganesh R. Baliga |
| 2000 | ICALP | Unlearning Helps. | Ganesh R. Baliga, John Case, Wolfgang Merkle, Frank Stephan |
| 1999 | SIGCSE | A CS1 maze lab, using joysticks and MIPPETs. | Don C. Stone, Seth D. Bergmann, Ganesh R. Baliga, A. Michael Berman, John L. Schmalzel |
| 1996 | COLT | Synthesizing Enumeration Techniques for Language Learning. | Ganesh R. Baliga, John Case, Sanjay Jain |
| 1994 | ALT | Learning with Higher Order Additional Information. | Ganesh R. Baliga, John Case |
| 1993 | ICALP | Learnability: Admissible, Co-finite, and Hypersimple Languages. | Ganesh R. Baliga, John Case |
| 1993 | ICCI | On Space Bounded Server Algorithms. | Ganesh R. Baliga, Anil M. Shende |
| 1993 | STACS | Language Learning With Some Negative Information. | Ganesh R. Baliga, John Case, Sanjay Jain |
| 1992 | LFCS | Machine Learning of Higher Order Programs. | Ganesh R. Baliga, John Case, Sanjay Jain, Mandayam Suraj |