PUBLICATIONS

• N. Bshouty, R. Cleve, R. Gavaldà , S. Kannan, C. Tamon, Oracles and Queries that are Sufficient for Exact Learning, Journal of Computer and System Sciences 52(3):421-433, 1996.
• N. Bshouty, C. Tamon, On the Fourier Spectrum of Monotone Functions, Journal of the Association for Computing Machinery 43(4):747-770, 1996.
• N. Bshouty, C. Tamon, D. Wilson, On Learning Decision Trees with Large Output Domains, Algorithmica 20(1):77-100, 1998.
• N. Bshouty, C. Tamon, D. Wilson, On Learning Width Two Branching Programs, Information Processing Letter 65(4):217-222, 1998.
• N. Bshouty, C. Tamon, D. Wilson, Learning Matrix Functions over Rings, Algorithmica 22(1/2):91-111, 1998.
• N. Bshouty, J. Jackson, C. Tamon, Uniform-Distribution Attribute Noise Learnability, Information and Computation 187(2):277-290, 2003.
• A.Ahmadi, R. Belk, C. Tamon, C. Wendler, On Mixing in Continuous-Time Quantum Walks on Some Circulant Graphs, Quantum Information and Computation 3(6):611-618, 2003.
• N. Bshouty, J. Jackson, C. Tamon, More Efficient PAC-Learning of DNF with Membership Queries under the Uniform Distribution, Journal of Computer and System Sciences 68(1):205-234, 2004.
• D. ben-Avraham, E. Bollt, C. Tamon, One-dimensional continuous-time quantum walks, Quantum Information Processing 3(1-5):295-308, 2004.
• N. Bshouty, J. Jackson, C. Tamon, Exploring learnability between exact and PAC, Journal of Computer and System Sciences 70(4):471-484, 2005.
• L. Fedichkin, D. Solenov, C. Tamon, Mixing and Decoherence in Continuous-Time Quantum Walks on Cycles, Quantum Information and Computation 6(3):263-276, 2006.
• P. Lo, S. Rajaram, D. Schepens, D. Sullivan, C. Tamon, J. Ward, Mixing of Quantum Walk on Circulant Bunkbeds, Quantum Information and Computation 6(4&5):370-381, 2006.
• W. Carlson, A. Ford, E. Harris, J. Rosen, C. Tamon, K. Wrobel, Universal Mixing of Quantum Walk on Graphs, Quantum Information and Computation 7(8):738-751, 2007.
• W. Adamczak, K. Andrew, L. Bergen, D. Ethier, P. Hernberg, J. Lin, C. Tamon Non-uniform mixing of quantum walk on cycles, International Journal of Quantum Information 5(6):781-793, 2007.

• C. Tamon, Learning with the Aid of an Oracle, Encyclopedia of Algorithms, M.-Y. Kao (editor), Springer (2008), 423-425.

• N. Bshouty, R. Cleve, S. Kannan, C. Tamon, Oracles and Queries that are Sufficient for Exact Learning, Proc. 7th Annual ACM Conference on Computational Learning Theory, ACM Press (1994), 130-139.
• N. Bshouty, C. Tamon, On the Fourier Spectrum of Monotone Functions, Proc. 27th Annual ACM Symposium on the Theory of Computing, ACM Press (1995), 219-228.
• N. Bshouty, C. Tamon, D. Wilson, On Learning Decision Trees with Large Output Domains, Proc. 8th Annual Conference on Computational Learning Theory, ACM Press (1995), 190-197.
• N. Bshouty, C. Tamon, D. Wilson, On Learning Width Two Branching Programs, Proc. 9th Annual Conference on Computational Learning Theory, ACM Press (1996), 224-227.
• N. Bshouty, C. Tamon, D. Wilson, Learning Matrix Functions over Rings, Proc. 3rd European Conference on Computational Learning Theory, Shai Ben-David (ed.), Lecture Notes in Computer Science 1208, Springer (1997), 27-37.
• F. Bergadano, N. Bshouty, C. Tamon, S. Varricchio, On Learning Branching Programs and Small Depth Circuits, Proc. 3rd European Conference on Computational Learning Theory, Shai Ben-David (ed.), Lecture Notes in Computer Science 1208, Springer (1997), 150-161.
• N. Bshouty, J. Jackson, C. Tamon, Uniform-Distribution Attribute Noise Learnability, Proc. 12th Annual Conference on Computational Learning Theory, ACM Press (1999), 75-80.
• N. Bshouty, J. Jackson, C. Tamon, More Efficient PAC-Learning of DNF with Membership Queries under the Uniform Distribution, Proc. 12th Annual Conference on Computational Learning Theory, ACM Press (1999), 286-295.
• C. Tamon, J. Xiang, On the Boosting Pruning problem, Proc. 11th European Conference on Machine Learning, Ramon Lopez de Mantaras and Enric Plaza (eds.), Lecture Notes in Computer Science 1810, Springer (2000), 404-412.
• C. Tamon, T. Yamakami, Quantum Computation Relative to Oracles, Proc. 2nd International Conference on Unconventional Models of Computation, Ioannis Antoniou, Cristian Calude, and Michael J. Dinneen (eds.), Springer (2000), 273-288.
• J. Jackson, C. Tamon, T. Yamakami, Quantum DNF Learnability Revisited, Proc. 8th Annual International Conference on Computing and Combinatorics, Oscar H. Ibarra and Louxin Zhang (eds.), Lecture Notes in Computer Science 2387, Springer (2002), 595-604.
• N. Bshouty, J. Jackson, C. Tamon, Exploring learnability between exact and PAC, Proc. 15th Annual Conference on Computational Learning Theory, Jyrki Kivinen and Robert A. Sloan (eds.), Lecture Notes in Computer Science 2375, Springer (2002), 244-254.

1. M. Day, S. Good, H. Graves, A. Shehu, C. Tamon, C. Vanderwaart, On Totally Shattered and Hyperuniversal Graphs, REU manuscript (2001). [pdf]
2. M. Dalton, L. Paget-Seekins, C. Tamon, D. VanNort, B. White, Total Shatterings of Graphs, REU manuscript (2000). [pdf]