Ganesh Baliga

Orcid: 0000-0002-5910-6251

According to our database1, Ganesh Baliga authored at least 13 papers between 1993 and 2014.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
Teach algorithm design and intractability with a project-based curriculum centered on a single intractable problem: three domains to choose from (abstract only).
Proceedings of the 45th ACM Technical Symposium on Computer Science Education, 2014

2008
When unlearning helps.
Inf. Comput., 2008

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

1999
The Synthesis of Language Learners.
Inf. Comput., 1999

A CS1 maze lab, using joysticks and MIPPETs.
Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education, 1999

1997
Learning from Multiple Sources of Inaccurate Data.
SIAM J. Comput., 1997

1996
Learnability: Admissible, Co-Finite, and Hypersimple Languages.
J. Comput. Syst. Sci., 1996

Learning-Theoretic Perspectives of Acceptable Numberings.
Ann. Math. Artif. Intell., 1996

Synthesizing Enumeration Techniques for Language Learning.
Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

1995
Language Learning with Some Negative Information.
J. Comput. Syst. Sci., 1995

1994
Machine Learning of Higher-Order Programs.
J. Symb. Log., 1994

Learning with Higher Order Additional Information.
Proceedings of the Algorithmic Learning Theory, 1994

1993
On Space Bounded Server Algorithms.
Proceedings of the Computing and Information, 1993


  Loading...