Journal of the ACM Bibliography

Selected papers that cite this one

• Dana Angluin and Michael Kharitonov. When won't membership queries help? Journal of Computer and System Sciences, 50(2):336-355, April 1995.

• Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, and Stefano Varricchio. On the applications of multiplicity automata in learning. In 37th Annual Symposium on Foundations of Computer Science, pages 349-358, Burlington, Vermont, 14-16 October 1996. IEEE.

• Jan C. Bioch and Toshihide Ibaraki. Complexity of identification and dualization of positive Boolean functions. Information and Computation, 123(1):50-63, 15 November 1995.

• Avrim Blum, Lisa Hellerstein, and Nick Littlestone. Learning in the presence of finitely or infinitely many irrelevant attributes. Journal of Computer and System Sciences, 50(1):32-40, February 1995.

• Endre Boros, Peter L. Hammer, Toshihide Ibaraki, and Kazuhiko Kawakami. Polynomial-time recognition of 2-monotonic positive Boolean functions given by an oracle. SIAM Journal on Computing, 26(1):93-109, January 1997.

• Nader H. Bshouty and Richard Cleve. Interpolating arithmetic read-once formulas in parallel. SIAM Journal on Computing, 27(2):401-413, March 1998.

• Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, and Christino Tamon. Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences, 52(3):421-433, June 1996.

• Nader H. Bshouty, Sally A. Goldman, Thomas R. Hancock, and Sleiman Matar. Asking questions to minimize errors. Journal of Computer and System Sciences, 52(2):268-286, April 1996.

• Nader Bshouty and Lisa Hellerstein. Attribute-efficient learning in query and mistake-bound models. Journal of Computer and System Sciences, 56(3):310-319, April 1998.

• Nader H. Bshouty, Thomas R. Hancock, and Lisa Hellerstein. Learning arithmetic read-once formulas. SIAM Journal on Computing, 24(4):706-735, August 1995.

• Nader H. Bshouty, Thomas R. Hancock, and Lisa Hellerstein. Learning Boolean read-once formulas over generalized bases. Journal of Computer and System Sciences, 50(3):521-542, June 1995.

• Zhixiang Chen and Steven Homer. Learning counting functions with queries. Theoretical Computer Science, 180(1-2):155-168, 10 June 1997.

• Aaron Feigelson and Lisa Hellerstein. Conjunctions of unate DNF formulas: Learning and structure. Information and Computation, 140(2):203-228, 1 February 1998.

• Michael Frazier, Sally Goldman, Nina Mishra, and Leonard Pitt. Learning from a consistently ignorant teacher. Journal of Computer and System Sciences, 52(3):471-492, June 1996.

• Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan, and Dawn Wilkins. How many queries are needed to learn? In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 190-199, Las Vegas, Nevada, 29 May-1 June 1995.

• Lisa Hellerstein, Krishnan Pillaipakkamnatt, Vijay Raghavan, and Dawn Wilkins. How many queries are needed to learn? Journal of the ACM, 43(5):840-862, September 1996.

• Atsuyoshi Nakamura and Naoki Abe. Exact learning of linear combinations of monotone terms from function value queries. Theoretical Computer Science, 137(1):159-176, 9 January 1995.

• Krishnan Pillaipakkamnatt and Vijay Raghavan. Read-twice DNF formulas are properly learnable. Information and Computation, 122(2):236-267, 1 November 1995.

Selected references

• Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75(2):87-106, November 1987.

• Dana Angluin, Michael Frazier, and Leonard Pitt. Learning conjunctions of Horn clauses (extended abstract). In 31st Annual Symposium on Foundations of Computer Science, volume I, pages 186-192, St. Louis, Missouri, 22-24 October 1990. IEEE.

• Dana Angluin and Michael Kharitonov. When won't membership queries help? (extended abstract). In Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, pages 444-454, New Orleans, Louisiana, 6-8 May 1991.

• Richard M. Karp, Eli Upfal, and Avi Wigderson. Are search and decision problems computationally equivalent? In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 464-475, Providence, Rhode Island, 6-8 May 1985.

• Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant. On the learnability of Boolean formulae. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 285-295, New York City, 25-27 May 1987.

• Michael Kearns and Leslie G. Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 433-444, Seattle, Washington, 15-17 May 1989.

• Leonard Pitt and Leslie G. Valiant. Computational limitations on learning from examples. Journal of the ACM, 35(4):965-984, October 1988.

Shortcuts: