Ganesh R. Baliga

According to our database, Ganesh R. Baliga authored at least 22 papers between 1992 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2017

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

2016

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

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

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

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

Proceedings of the 45th ACM Technical Symposium on Computer Science Education, 2014

2012

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

2010

Leveraging hardware description languages and spiral learning in an introductory computer architecture course.

John Robinson, Ganesh R. Baliga

J. Comput. Sci. Coll., 2010

Revitalizing CS hardware curricula: object oriented hardware design.

Ganesh R. Baliga, John Robinson, Leigh Weiss

J. Comput. Sci. Coll., 2010

2008

When unlearning helps.

Ganesh R. Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen

Inf. Comput., 2008

2006

NP-completeness for all computer science undergraduates: a novel project-based curriculum.

Andrea F. Lobo, Ganesh R. Baliga

J. Comput. Sci. Coll., 2006

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

Unlearning Helps.

Ganesh R. Baliga, John Case, Wolfgang Merkle, Frank Stephan

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

The Synthesis of Language Learners.

Ganesh R. Baliga, John Case, Sanjay Jain

Inf. Comput., 1999

A CS1 maze lab, using joysticks and MIPPETs.

Don C. Stone, Seth D. Bergmann, Ganesh R. Baliga, A. Michael Berman, John L. Schmalzel

Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education, 1999

1996

Learning-Theoretic Perspectives of Acceptable Numberings.

Ganesh R. Baliga, Anil M. Shende

Ann. Math. Artif. Intell., 1996

Synthesizing Enumeration Techniques for Language Learning.

Ganesh R. Baliga, John Case, Sanjay Jain

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

1994

Learning with Higher Order Additional Information.

Ganesh R. Baliga, John Case

Proceedings of the Algorithmic Learning Theory, 1994

1993

Language Learning With Some Negative Information.

Ganesh R. Baliga, John Case, Sanjay Jain

Proceedings of the STACS 93, 1993

On Space Bounded Server Algorithms.

Ganesh R. Baliga, Anil M. Shende

Proceedings of the Computing and Information, 1993

Learnability: Admissible, Co-finite, and Hypersimple Languages.

Ganesh R. Baliga, John Case

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

Machine Learning of Higher Order Programs.

Ganesh R. Baliga, John Case, Sanjay Jain, Mandayam Suraj

Proceedings of the Logical Foundations of Computer Science, 1992

Learning from Multiple Sources of Inaccurate Data.

Ganesh R. Baliga, Sanjay Jain, Arun Sharma

Proceedings of the Analogical and Inductive Inference, 1992