| Computer Science Curricula 2013: Curriculum Guidelines for Undergraduate Degree Programs in Computer Science M Sahami, A Danyluk, S Fincher, K Fisher, D Grossman, E Hawthorne, ... Association for Computing Machinery (ACM)-IEEE Computer Society, 2013 | 182* | 2013 |
| Small disjuncts in action: learning to diagnose errors in the local loop of the telephone network AP Danyluk, F Provost Proc. of Tenth International Conference on Machine Learning, 81-88, 2014 | 103 | 2014 |
| The Use of Explanations for Similarity-based Learning. AP Danyluk IJCAI, 274-276, 1987 | 83 | 1987 |
| A library to support a graphics-based object-first approach to CS 1 KB Bruce, A Danyluk, T Murtagh ACM SIGCSE Bulletin 33 (1), 6-10, 2001 | 75 | 2001 |
| Finding new rules for incomplete theories: Explicit biases for induction with contextual information AP Danyluk Proceedings of the sixth international workshop on Machine learning, 34-36, 1989 | 56 | 1989 |
| Introducing concurrency in CS 1 KB Bruce, A Danyluk, T Murtagh Proceedings of the 41st ACM technical symposium on Computer science …, 2010 | 42 | 2010 |
| Event-driven programming is simple enough for CS1 KB Bruce, AP Danyluk, TP Murtagh ACM SIGCSE Bulletin 33 (3), 1-4, 2001 | 40 | 2001 |
| Java: An eventful approach KB Bruce, AP Danyluk, TP Murtagh Pearson Prentice Hall, 2006 | 39 | 2006 |
| Computer science curricula 2013 M Sahami, A Danyluk, S Fincher, K Fisher, D Grossman, E Hawthrone, ... Association for Computing Machinery and IEEE Computer Society, 2013 | 26 | 2013 |
| Why structural recursion should be taught before arrays in CS 1 KB Bruce, A Danyluk, T Murtagh ACM SIGCSE Bulletin 37 (1), 246-250, 2005 | 25 | 2005 |
| Event-driven programming facilitates learning standard programming concepts KB Bruce, A Danyluk Companion to the 19th annual ACM SIGPLAN conference on Object-oriented …, 2004 | 22 | 2004 |
| Learning from bad data F Provost, A Danyluk Proceedings of the ML-95 Workshop on Applying Machine Learning in Practice, 1995 | 17 | 1995 |
| Using robotics to motivate learning in an AI course for non-majors AP Danyluk AAAI spring symposium, March, 22-24, 2004 | 14 | 2004 |
| Case studies of liberal arts computer science programs D Baldwin, A Brady, A Danyluk, J Adams, A Lawrence ACM Transactions on Computing Education (TOCE) 10 (1), 4, 2010 | 13 | 2010 |
| Tuning numeric parameters to troubleshoot a telephone-network loop CJ Merz, MJ Pazzani, AP Danyluk IEEE Expert 11 (1), 44-49, 1996 | 12 | 1996 |
| Feature selection vs theory reformulation: A study of genetic refinement of knowledge-based neural networks BD Burns, AP Danyluk Machine Learning 38 (1-2), 89-107, 2000 | 10 | 2000 |
| Problem Definition, Data Cleaning, and Evaluation: A Classi er Learning Case Study F Provost, AP Danyluk Informatica, 1999 | 9 | 1999 |
| Off-topic detection in conversational telephone speech R Stewart, A Danyluk, Y Liu Proceedings of the HLT-NAACL 2006 Workshop on Analyzing Conversations in …, 2006 | 6 | 2006 |
| Java: An eventful approach K Bruce, A Danyluk, T Murtagh Journal of Computing Sciences in Colleges 19 (5), 64-65, 2004 | 6 | 2004 |
| Feature selection via probabilistic outputs A Danyluk, N Arnosti arXiv preprint arXiv:1206.6383, 2012 | 5 | 2012 |
