 | 2009 |
|---|
| 68 |       | Marina Langlois,
Dhruv Mubayi,
Robert H. Sloan,
György Turán:
Combinatorial Problems for Horn Clauses.
Graph Theory, Computational Intelligence and Thought 2009: 54-65 |
| 2008 |
|---|
| 67 |  | Marina Langlois,
Robert H. Sloan,
Balázs Szörényi,
György Turán:
Horn Complements: Towards Horn-to-Horn Belief Revision.
AAAI 2008: 466-471 |
| 66 | | Robert H. Sloan,
Patrick Troy:
CS 0.5: a better approach to introductory computer science for majors.
SIGCSE 2008: 271-275 |
| 65 | | Lillian N. Cassel,
Michael E. Caspersen,
Gordon Davies,
Renée McCauley,
Andrew D. McGettrick,
Arthur B. Pyster,
Robert H. Sloan:
Curriculum update from the ACM education board: CS2008 and a report on masters degrees.
SIGCSE 2008: 530-531 |
| 64 | | Robert H. Sloan,
Balázs Szörényi,
György Turán:
Projective DNF formulae and their revision.
Discrete Applied Mathematics 156(4): 530-544 (2008) |
| 63 | | Robert H. Sloan,
Balázs Szörényi,
György Turán:
On k-Term DNF with the Largest Number of Prime Implicants.
SIAM J. Discrete Math. 21(4): 987-998 (2008) |
| 2007 |
|---|
| 62 | | Marina Langlois,
Robert H. Sloan,
György Turán:
Horn Upper Bounds and Renaming.
SAT 2007: 80-93 |
| 61 | | Lillian N. Cassel,
Andrew D. McGettrick,
Gordon Davies,
Heikki Topi,
Robert H. Sloan:
An initiative to attract students to computing.
SIGCSE 2007: 133-134 |
| 60 | | Lillian N. Cassel,
Robert H. Sloan,
Gordon Davies,
Heikki Topi,
Andrew D. McGettrick:
The computing ontology project: the computing education application.
SIGCSE 2007: 519-520 |
| 59 | | Piotr Berman,
Bhaskar DasGupta,
Dhruv Mubayi,
Robert H. Sloan,
György Turán,
Yi Zhang:
The inverse protein folding problem on 2D and 3D lattices.
Discrete Applied Mathematics 155(6-7): 719-732 (2007) |
| 58 | | Robert H. Sloan:
The joys of being an NSF program director.
SIGACT News 38(1): 7-8 (2007) |
| 57 | | Robert H. Sloan,
Balázs Szörényi,
György Turán:
Revising threshold functions.
Theor. Comput. Sci. 382(3): 198-208 (2007) |
| 2006 |
|---|
| 56 | | Stephen Dranger,
Robert H. Sloan,
Jon A. Solworth:
The Complexity of Discretionary Access Control.
IWSEC 2006: 405-420 |
| 55 | | Lillian N. Cassel,
Andrew D. McGettrick,
Robert H. Sloan:
A comprehensive representation of the computing and information disciplines.
SIGCSE 2006: 199-200 |
| 54 | | Russell L. Shackelford,
Andrew D. McGettrick,
Robert H. Sloan,
Heikki Topi,
Gordon Davies,
Reza Kamali,
James Cross,
John Impagliazzo,
Richard J. LeBlanc,
Barry M. Lunt:
Computing Curricula 2005: The Overview Report.
SIGCSE 2006: 456-457 |
| 53 | | Zoltán Füredi,
Robert H. Sloan,
Ken Takata,
György Turán:
On set systems with a threshold property.
Discrete Mathematics 306(23): 3097-3111 (2006) |
| 2005 |
|---|
| 52 | | Marina Irodova,
Robert H. Sloan:
Reinforcement Learning and Function Approximation.
FLAIRS Conference 2005: 455-460 |
| 51 | | Lillian N. Cassel,
Russell L. Shackelford,
Robert H. Sloan:
A synthesis and ontology of all of computing.
SIGCSE 2005: 65-66 |
| 50 | | Robert H. Sloan,
Balázs Szörényi,
György Turán:
On k-term DNF with largest number of prime implicants
Electronic Colloquium on Computational Complexity (ECCC)(023): (2005) |
| 49 | | Robert H. Sloan:
Special issue on computational learning theory.
J. Comput. Syst. Sci. 70(4): 433-434 (2005) |
| 48 | | Judy Goldsmith,
Robert H. Sloan:
New Horn Revision Algorithms.
Journal of Machine Learning Research 6: 1919-1938 (2005) |
| 47 | | Lillian N. Cassel,
Anneke Hacquebard,
Andrew D. McGettrick,
Gordon Davies,
Richard J. LeBlanc,
Charles Riedesel,
Yaakov L. Varol,
Gail T. Finley,
Samuel Mann,
Robert H. Sloan:
A synthesis of computing concepts.
SIGCSE Bulletin 37(4): 162-172 (2005) |
| 2004 |
|---|
| 46 | | Judy Goldsmith,
Robert H. Sloan,
Balázs Szörényi,
György Turán:
New Revision Algorithms.
ALT 2004: 395-409 |
| 45 | | Piotr Berman,
Bhaskar DasGupta,
Dhruv Mubayi,
Robert H. Sloan,
György Turán,
Yi Zhang:
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices.
CPM 2004: 244-253 |
| 44 | | Jon A. Solworth,
Robert H. Sloan:
Security Property Based Administrative Controls.
ESORICS 2004: 244-259 |
| 43 | | Jon A. Solworth,
Robert H. Sloan:
A Layered Design of Discretionary Access Controls with Decidable Safety Properties.
IEEE Symposium on Security and Privacy 2004: 56- |
| 42 | | Russell L. Shackelford,
Lillian N. Cassel,
James H. Cross II,
John Impagliazzo,
Eydie Lawson,
Richard J. LeBlanc,
Andrew D. McGettrick,
Robert H. Sloan,
Heikki Topi:
Computing curricula 2004: the overview project.
SIGCSE 2004: 501 |
| 41 | | Judy Goldsmith,
Robert H. Sloan,
Balázs Szörényi,
György Turán:
Theory revision with queries: Horn, read-once, and parity formulas.
Artif. Intell. 156(2): 139-176 (2004) |
| 2003 |
|---|
| 40 | | Robert H. Sloan,
Balázs Szörényi,
György Turán:
Projective DNF Formulae and Their Revision.
COLT 2003: 625-639 |
| 39 | | John Impagliazzo,
Robert H. Sloan,
Andrew D. McGettrick,
Pradip K. Srimani:
Computer engineering computing curricula.
SIGCSE 2003: 355-356 |
| 38 | | Judy Goldsmith,
Robert H. Sloan,
Balázs Szörényi,
György Turán:
Theory Revision with Queries: Horn, Read-once, and Parity Formulas
Electronic Colloquium on Computational Complexity (ECCC)(039): (2003) |
| 2002 |
|---|
| 37 | | Jyrki Kivinen,
Robert H. Sloan:
Computational Learning Theory, 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002, Proceedings
Springer 2002 |
| 36 | | Eric Roberts,
C. Fay Cover,
Gordon Davies,
Michael Schneider,
Robert H. Sloan:
Computing Curricula 2001 implementing the recommendations.
SIGCSE 2002: 167-168 |
| 35 | | Thomas S. Messerges,
Ezzy A. Dabbish,
Robert H. Sloan:
Examining Smart-Card Security under the Threat of Power Analysis Attacks.
IEEE Trans. Computers 51(5): 541-552 (2002) |
| 34 | | Judy Goldsmith,
Robert H. Sloan,
György Turán:
Theory Revision with Queries: DNF Formulas.
Machine Learning 47(2-3): 257-295 (2002) |
| 2001 |
|---|
| 33 | | Ugo A. Buy,
Robert H. Sloan:
Automatic Real-Time Analysis of Reactive Systems with the PARTS Toolset.
Autom. Softw. Eng. 8(3-4): 227-273 (2001) |
| 2000 |
|---|
| 32 | | Judy Goldsmith,
Robert H. Sloan:
The Complexity of Model Aggregation.
AIPS 2000: 122-129 |
| 31 | | Judy Goldsmith,
Robert H. Sloan,
Balázs Szörényi,
György Turán:
Improved Algorithms for Theory Revision with Queries.
COLT 2000: 236-247 |
| 30 | | Judy Goldsmith,
Robert H. Sloan:
More theory revision with queries (extended abstract).
STOC 2000: 441-448 |
| 1999 |
|---|
| 29 | | Thomas S. Messerges,
Ezzy A. Dabbish,
Robert H. Sloan:
Power Analysis Attacks of Modular Exponentiation in Smartcards.
CHES 1999: 144-157 |
| 28 | | Robert H. Sloan,
György Turán:
On Theory Revision with Queries.
COLT 1999: 41-52 |
| 1998 |
|---|
| 27 | | A. Prasad Sistla,
Ouri Wolfson,
Yelena Yesha,
Robert H. Sloan:
Towards a Theory of Cost Management for Digital Libraries and Electronic Commerce.
ACM Trans. Database Syst. 23(4): 411-452 (1998) |
| 26 | | Robert H. Sloan,
Ken Takata,
György Turán:
On Frequent Sets of Boolean Matrices.
Ann. Math. Artif. Intell. 24(1-4): 193-209 (1998) |
| 25 | | Robert H. Sloan,
Ken Takata,
György Turán:
On frequent sets of Boolean matrices
Electronic Colloquium on Computational Complexity (ECCC) 5(61): (1998) |
| 1997 |
|---|
| 24 | | Tamás Horváth,
Robert H. Sloan,
György Turán:
Learning Logic Programs by Using the Product Homomorphism Method.
COLT 1997: 10-20 |
| 23 | | Robert H. Sloan,
György Turán:
Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs.
EuroCOLT 1997: 38-50 |
| 22 | | Robert H. Sloan,
Ugo A. Buy:
Stubborn Sets for Real-Time Petri Nets.
Formal Methods in System Design 11(1): 23-40 (1997) |
| 21 | | Dana Angluin,
Martins Krikis,
Robert H. Sloan,
György Turán:
Malicious Omissions and Errors in Answers to Membership Queries.
Machine Learning 28(2-3): 211-255 (1997) |
| 1996 |
|---|
| 20 | | Tamás Horváth,
Robert H. Sloan,
György Turán:
Learning Logic Programs with Random Classification Noise.
Inductive Logic Programming Workshop 1996: 315-336 |
| 19 | | Robert H. Sloan,
Ugo A. Buy:
Reduction Rules for Time Petri Nets.
Acta Inf. 33(7): 687-706 (1996) |
| 1995 |
|---|
| 18 | | Sally A. Goldman,
Robert H. Sloan:
Can PAC Learning Algorithms Tolerate Random Attribute Noise?
Algorithmica 14(1): 70-84 (1995) |
| 17 | | Robert H. Sloan:
Four Types of Noise in Data for PAC Learning.
Inf. Process. Lett. 54(3): 157-162 (1995) |
| 1994 |
|---|
| 16 | | Robert H. Sloan,
György Turán:
Learning with Queries but Incomplete Information (Extended Abstract).
COLT 1994: 237-245 |
| 15 | | Ugo A. Buy,
Robert H. Sloan:
Analysis of Real-Time Programs with Simple Time Petri Nets.
ISSTA 1994: 228-239 |
| 14 | | Yixiu Huang,
Robert H. Sloan,
Ouri Wolfson:
Divergence Caching in Client Server Architectures.
PDIS 1994: 131-139 |
| 13 | | Ronald L. Rivest,
Robert H. Sloan:
A Formal Model of Hierarchical Concept Learning
Inf. Comput. 114(1): 88-114 (1994) |
| 12 | | Sally A. Goldman,
Robert H. Sloan:
The Power of Self-Directed Learning.
Machine Learning 14(1): 271-294 (1994) |
| 1993 |
|---|
| 11 | | Ugo A. Buy,
Robert H. Sloan:
A Petri-Net -Based Approach to Real-Time Program Analysis.
IWSSD 1993: 56-61 |
| 10 | | Ronald L. Rivest,
Robert H. Sloan:
On Choosing between Experimenting and Thinking when Learning
Inf. Comput. 106(1): 1-25 (1993) |
| 1992 |
|---|
| 9 | | Robert H. Sloan:
Corrigendum to Types of Noise in Data for Concept Learning.
COLT 1992: 450 |
| 8 | | David P. Helmbold,
Robert H. Sloan,
Manfred K. Warmuth:
Learning Integer Lattices.
SIAM J. Comput. 21(2): 240-266 (1992) |
| 1990 |
|---|
| 7 | | David P. Helmbold,
Robert H. Sloan,
Manfred K. Warmuth:
Learning Integer Lattices.
COLT 1990: 288-302 |
| 6 | | David P. Helmbold,
Robert H. Sloan,
Manfred K. Warmuth:
Learning Nested Differences of Intersection-Closed Concept Classes.
Machine Learning 5: 165-196 (1990) |
| 1989 |
|---|
| 5 | | David P. Helmbold,
Robert H. Sloan,
Manfred K. Warmuth:
Learning Nested Differences of Intersection-Closed Concept Classes.
COLT 1989: 41-56 |
| 1988 |
|---|
| 4 | | Ronald L. Rivest,
Robert H. Sloan:
Learning Complicated Concepts Reliably and Usefully.
AAAI 1988: 635-640 |
| 3 | | Ronald L. Rivest,
Robert H. Sloan:
Learning Complicated Concepts Reliably and Usefully.
COLT 1988: 69-79 |
| 2 | | Robert H. Sloan:
Types of Noise in Data for Concept Learning.
COLT 1988: 91-96 |
| 1 | | Ronald L. Rivest,
Robert H. Sloan:
A New Model for Inductive Inference.
TARK 1988: 13-28 |
