On Space Bounded Server Algorithms. - Ganesh R. Baliga; Anil M. Shende (ICCI, 1993)

Learning with Higher Order Additional Information. - Ganesh R. Baliga; John Case (AII/ALT, 1994)

Machine Learning of Higher-Order Programs. - Ganesh R. Baliga; John Case; Sanjay Jain 001; Mandayam Suraj (J. Symb. Log., 1994)

Language Learning with Some Negative Information. - Ganesh R. Baliga; John Case; Sanjay Jain 001 (J. Comput. Syst. Sci., 1995)

Synthesizing Enumeration Techniques for Language Learning. - Ganesh R. Baliga; John Case; Sanjay Jain 001 (COLT, 1996)

Learning-Theoretic Perspectives of Acceptable Numberings. - Ganesh R. Baliga; Anil M. Shende (Ann. Math. Artif. Intell., 1996)

Learnability: Admissible, Co-Finite, and Hypersimple Languages. - Ganesh R. Baliga; John Case (J. Comput. Syst. Sci., 1996)

Learning from Multiple Sources of Inaccurate Data. - Ganesh R. Baliga; Sanjay Jain 001; Arun Sharma 001 (SIAM J. Comput., 1997)

A CS1 maze lab, using joysticks and MIPPETs. - Don C. Stone; Seth D. Bergmann; Ganesh R. Baliga; A. Michael Berman; John L. Schmalzel (SIGCSE, 1999)

The Synthesis of Language Learners. - Ganesh R. Baliga; John Case; Sanjay Jain 001 (Inf. Comput., 1999)

Unlearning Helps. - Ganesh R. Baliga; John Case; Wolfgang Merkle; Frank Stephan 001 (ICALP, 2000)

Using real-world objects to motivate OOP in a CS1 lab. - Andrea F. Lobo; Ganesh R. Baliga; Seth D. Bergmann; Don C. Stone; Amol Shah (J. Comput. Sci. Coll., 2000)

NP-completeness for all computer science undergraduates: a novel project-based curriculum. - Andrea F. Lobo; Ganesh R. Baliga (J. Comput. Sci. Coll., 2006)

When unlearning helps. - Ganesh R. Baliga; John Case; Wolfgang Merkle; Frank Stephan 001; Rolf Wiehagen (Inf. Comput., 2008)

Revitalizing CS hardware curricula: object oriented hardware design. - Ganesh R. Baliga; John Robinson; Leigh Weiss (J. Comput. Sci. Coll., 2010)

Leveraging hardware description languages and spiral learning in an introductory computer architecture course. - John Robinson; Ganesh R. Baliga (J. Comput. Sci. Coll., 2010)

Developing a project-based curriculum for the design and analysis of algorithms for intractable problems. - Andrea F. Lobo; Ganesh R. Baliga (J. Comput. Sci. Coll., 2012)

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 (SIGCSE, 2014)

Teaching algorithm design and intractability: a project-based curriculum focused on the traveling salesperson problem. - Andrea F. Lobo; Ganesh R. Baliga (J. Comput. Sci. Coll., 2014)

A project-based curriculum for algorithm design and intractability centered on the traveling salesperson problem. - Andrea F. Lobo; Ganesh R. Baliga (J. Comput. Sci. Coll., 2014)

Assessment of a project-based curriculum for algorithm design and NP-completeness centered on the traveling salesperson problem. - Andrea F. Lobo; Ganesh R. Baliga (J. Comput. Sci. Coll., 2016)

A project-based curriculum for algorithm design and np-completeness centered on the Sudoku problem. - Andrea F. Lobo; Ganesh R. Baliga (J. Comput. Sci. Coll., 2017)