Ganesh R. Baliga

26 papers A* 3A 3C 1Misc 1Journal 16Unranked 2
YearRankTypeTitle / Venue / Authors
2017 J jnl
A project-based curriculum for algorithm design and np-completeness centered on the Sudoku problem.
J. Comput. Sci. Coll.
Andrea F. Lobo, Ganesh R. Baliga
2016 J jnl
Assessment of a project-based curriculum for algorithm design and NP-completeness centered on the traveling salesperson problem.
J. Comput. Sci. Coll.
Andrea F. Lobo, Ganesh R. Baliga
2014 J jnl
A project-based curriculum for algorithm design and intractability centered on the traveling salesperson problem.
J. Comput. Sci. Coll.
Andrea F. Lobo, Ganesh R. Baliga
2014 A conf
Teach algorithm design and intractability with a project-based curriculum centered on a single intractable problem: three domains to choose from (abstract only).
SIGCSE
Andrea F. Lobo, Ganesh R. Baliga
2014 J jnl
Teaching algorithm design and intractability: a project-based curriculum focused on the traveling salesperson problem.
J. Comput. Sci. Coll.
Andrea F. Lobo, Ganesh R. Baliga
2012 J jnl
Developing a project-based curriculum for the design and analysis of algorithms for intractable problems.
J. Comput. Sci. Coll.
Andrea F. Lobo, Ganesh R. Baliga
2010 J jnl
Leveraging hardware description languages and spiral learning in an introductory computer architecture course.
J. Comput. Sci. Coll.
John Robinson, Ganesh R. Baliga
2010 J jnl
Revitalizing CS hardware curricula: object oriented hardware design.
J. Comput. Sci. Coll.
Ganesh R. Baliga, John Robinson, Leigh Weiss
2008 J jnl
When unlearning helps.
Inf. Comput.
Ganesh R. Baliga, John Case, Wolfgang Merkle, Frank Stephan, Rolf Wiehagen
2006 J jnl
NP-completeness for all computer science undergraduates: a novel project-based curriculum.
J. Comput. Sci. Coll.
Andrea F. Lobo, Ganesh R. Baliga
2000 A* conf
Unlearning Helps.
ICALP
Ganesh R. Baliga, John Case, Wolfgang Merkle, Frank Stephan
2000 J jnl
Using real-world objects to motivate OOP in a CS1 lab.
J. Comput. Sci. Coll.
Andrea F. Lobo, Ganesh R. Baliga, Seth D. Bergmann, Don C. Stone, Amol Shah
1999 A conf
A CS1 maze lab, using joysticks and MIPPETs.
SIGCSE
Don C. Stone, Seth D. Bergmann, Ganesh R. Baliga, A. Michael Berman, John L. Schmalzel
1999 J jnl
The Synthesis of Language Learners.
Inf. Comput.
Ganesh R. Baliga, John Case, Sanjay Jain
1997 J jnl
Learning from Multiple Sources of Inaccurate Data.
SIAM J. Comput.
Ganesh R. Baliga, Sanjay Jain, Arun Sharma
1996 J jnl
Learnability: Admissible, Co-Finite, and Hypersimple Languages.
J. Comput. Syst. Sci.
Ganesh R. Baliga, John Case
1996 J jnl
Learning-Theoretic Perspectives of Acceptable Numberings.
Ann. Math. Artif. Intell.
Ganesh R. Baliga, Anil M. Shende
1996 A* conf
Synthesizing Enumeration Techniques for Language Learning.
COLT
Ganesh R. Baliga, John Case, Sanjay Jain
1995 J jnl
Language Learning with Some Negative Information.
J. Comput. Syst. Sci.
Ganesh R. Baliga, John Case, Sanjay Jain
1994 — conf
Learning with Higher Order Additional Information.
AII/ALT
Ganesh R. Baliga, John Case
1994 J jnl
Machine Learning of Higher-Order Programs.
J. Symb. Log.
Ganesh R. Baliga, John Case, Sanjay Jain, Mandayam Suraj
1993 A conf
Language Learning With Some Negative Information.
STACS
Ganesh R. Baliga, John Case, Sanjay Jain
1993 A* conf
Learnability: Admissible, Co-finite, and Hypersimple Languages.
ICALP
Ganesh R. Baliga, John Case
1993 C conf
On Space Bounded Server Algorithms.
ICCI
Ganesh R. Baliga, Anil M. Shende
1992 — conf
Learning from Multiple Sources of Inaccurate Data.
AII
Ganesh R. Baliga, Sanjay Jain, Arun Sharma
1992 Misc conf
Machine Learning of Higher Order Programs.
LFCS
Ganesh R. Baliga, John Case, Sanjay Jain, Mandayam Suraj