|
Search the dblp DataBase
Robert H. Sloan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Yixiu Huang, Robert H. Sloan, Ouri Wolfson
Divergence Caching in Client Server Architectures. [Citation Graph (2, 14)][DBLP] PDIS, 1994, pp:131-139 [Conf]
- Ronald L. Rivest, Robert H. Sloan
Learning Complicated Concepts Reliably and Usefully. [Citation Graph (0, 0)][DBLP] AAAI, 1988, pp:635-640 [Conf]
- Judy Goldsmith, Robert H. Sloan
The Complexity of Model Aggregation. [Citation Graph (0, 0)][DBLP] AIPS, 2000, pp:122-129 [Conf]
- Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
New Revision Algorithms. [Citation Graph (0, 0)][DBLP] ALT, 2004, pp:395-409 [Conf]
- Thomas S. Messerges, Ezzy A. Dabbish, Robert H. Sloan
Power Analysis Attacks of Modular Exponentiation in Smartcards. [Citation Graph (0, 0)][DBLP] CHES, 1999, pp:144-157 [Conf]
- Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
Improved Algorithms for Theory Revision with Queries. [Citation Graph (0, 0)][DBLP] COLT, 2000, pp:236-247 [Conf]
- David P. Helmbold, Robert H. Sloan, Manfred K. Warmuth
Learning Nested Differences of Intersection-Closed Concept Classes. [Citation Graph (0, 0)][DBLP] COLT, 1989, pp:41-56 [Conf]
- David P. Helmbold, Robert H. Sloan, Manfred K. Warmuth
Learning Integer Lattices. [Citation Graph (0, 0)][DBLP] COLT, 1990, pp:288-302 [Conf]
- Tamás Horváth, Robert H. Sloan, György Turán
Learning Logic Programs by Using the Product Homomorphism Method. [Citation Graph (0, 0)][DBLP] COLT, 1997, pp:10-20 [Conf]
- Ronald L. Rivest, Robert H. Sloan
Learning Complicated Concepts Reliably and Usefully. [Citation Graph (0, 0)][DBLP] COLT, 1988, pp:69-79 [Conf]
- Robert H. Sloan
Types of Noise in Data for Concept Learning. [Citation Graph (0, 0)][DBLP] COLT, 1988, pp:91-96 [Conf]
- Robert H. Sloan
Corrigendum to Types of Noise in Data for Concept Learning. [Citation Graph (0, 0)][DBLP] COLT, 1992, pp:450- [Conf]
- Robert H. Sloan, Balázs Szörényi, György Turán
Projective DNF Formulae and Their Revision. [Citation Graph (0, 0)][DBLP] COLT, 2003, pp:625-639 [Conf]
- Robert H. Sloan, György Turán
Learning with Queries but Incomplete Information (Extended Abstract). [Citation Graph (0, 0)][DBLP] COLT, 1994, pp:237-245 [Conf]
- Robert H. Sloan, György Turán
On Theory Revision with Queries. [Citation Graph (0, 0)][DBLP] COLT, 1999, pp:41-52 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] CPM, 2004, pp:244-253 [Conf]
- Jon A. Solworth, Robert H. Sloan
Security Property Based Administrative Controls. [Citation Graph (0, 0)][DBLP] ESORICS, 2004, pp:244-259 [Conf]
- Robert H. Sloan, György Turán
Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs. [Citation Graph (0, 0)][DBLP] EuroCOLT, 1997, pp:38-50 [Conf]
- Marina Irodova, Robert H. Sloan
Reinforcement Learning and Function Approximation. [Citation Graph (0, 0)][DBLP] FLAIRS Conference, 2005, pp:455-460 [Conf]
- Tamás Horváth, Robert H. Sloan, György Turán
Learning Logic Programs with Random Classification Noise. [Citation Graph (0, 0)][DBLP] Inductive Logic Programming Workshop, 1996, pp:315-336 [Conf]
- Ugo A. Buy, Robert H. Sloan
Analysis of Real-Time Programs with Simple Time Petri Nets. [Citation Graph (0, 0)][DBLP] ISSTA, 1994, pp:228-239 [Conf]
- Stephen Dranger, Robert H. Sloan, Jon A. Solworth
The Complexity of Discretionary Access Control. [Citation Graph (0, 0)][DBLP] IWSEC, 2006, pp:405-420 [Conf]
- Ugo A. Buy, Robert H. Sloan
A Petri-Net -Based Approach to Real-Time Program Analysis. [Citation Graph (0, 0)][DBLP] IWSSD, 1993, pp:56-61 [Conf]
- Lillian N. Cassel, Russell L. Shackelford, Robert H. Sloan
A synthesis and ontology of all of computing. [Citation Graph (0, 0)][DBLP] SIGCSE, 2005, pp:65-66 [Conf]
- John Impagliazzo, Robert H. Sloan, Andrew D. McGettrick, Pradip K. Srimani
Computer engineering computing curricula. [Citation Graph (0, 0)][DBLP] SIGCSE, 2003, pp:355-356 [Conf]
- Eric Roberts, C. Fay Cover, Gordon Davies, Michael Schneider, Robert H. Sloan
Computing Curricula 2001 implementing the recommendations. [Citation Graph (0, 0)][DBLP] SIGCSE, 2002, pp:167-168 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] SIGCSE, 2004, pp:501- [Conf]
- Lillian N. Cassel, Robert H. Sloan, Gordon Davies, Heikki Topi, Andrew D. McGettrick
The computing ontology project: the computing education application. [Citation Graph (0, 0)][DBLP] SIGCSE, 2007, pp:519-520 [Conf]
- Lillian N. Cassel, Andrew D. McGettrick, Gordon Davies, Heikki Topi, Robert H. Sloan
An initiative to attract students to computing. [Citation Graph (0, 0)][DBLP] SIGCSE, 2007, pp:133-134 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] SIGCSE, 2006, pp:456-457 [Conf]
- Lillian N. Cassel, Andrew D. McGettrick, Robert H. Sloan
A comprehensive representation of the computing and information disciplines. [Citation Graph (0, 0)][DBLP] SIGCSE, 2006, pp:199-200 [Conf]
- Jon A. Solworth, Robert H. Sloan
A Layered Design of Discretionary Access Controls with Decidable Safety Properties. [Citation Graph (0, 0)][DBLP] IEEE Symposium on Security and Privacy, 2004, pp:56-0 [Conf]
- Judy Goldsmith, Robert H. Sloan
More theory revision with queries (extended abstract). [Citation Graph (0, 0)][DBLP] STOC, 2000, pp:441-448 [Conf]
- Ronald L. Rivest, Robert H. Sloan
A New Model for Inductive Inference. [Citation Graph (0, 0)][DBLP] TARK, 1988, pp:13-28 [Conf]
- Robert H. Sloan, Ugo A. Buy
Reduction Rules for Time Petri Nets. [Citation Graph (0, 0)][DBLP] Acta Inf., 1996, v:33, n:7, pp:687-706 [Journal]
- Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
Theory revision with queries: Horn, read-once, and parity formulas. [Citation Graph (0, 0)][DBLP] Artif. Intell., 2004, v:156, n:2, pp:139-176 [Journal]
- Sally A. Goldman, Robert H. Sloan
Can PAC Learning Algorithms Tolerate Random Attribute Noise? [Citation Graph (0, 0)][DBLP] Algorithmica, 1995, v:14, n:1, pp:70-84 [Journal]
- Robert H. Sloan, Ken Takata, György Turán
On Frequent Sets of Boolean Matrices. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1998, v:24, n:1-4, pp:193-209 [Journal]
- Ugo A. Buy, Robert H. Sloan
Automatic Real-Time Analysis of Reactive Systems with the PARTS Toolset. [Citation Graph (0, 0)][DBLP] Autom. Softw. Eng., 2001, v:8, n:3-4, pp:227-273 [Journal]
- 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. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:719-732 [Journal]
- Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán
On set systems with a threshold property. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:23, pp:3097-3111 [Journal]
- Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
Theory Revision with Queries: Horn, Read-once, and Parity Formulas [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:039, pp:- [Journal]
- Robert H. Sloan, Balázs Szörényi, György Turán
On k-term DNF with largest number of prime implicants [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:023, pp:- [Journal]
- Robert H. Sloan, Ken Takata, György Turán
On frequent sets of Boolean matrices [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:61, pp:- [Journal]
- Robert H. Sloan, Ugo A. Buy
Stubborn Sets for Real-Time Petri Nets. [Citation Graph (0, 0)][DBLP] Formal Methods in System Design, 1997, v:11, n:1, pp:23-40 [Journal]
- Ronald L. Rivest, Robert H. Sloan
On Choosing between Experimenting and Thinking when Learning [Citation Graph (0, 0)][DBLP] Inf. Comput., 1993, v:106, n:1, pp:1-25 [Journal]
- Ronald L. Rivest, Robert H. Sloan
A Formal Model of Hierarchical Concept Learning [Citation Graph (0, 0)][DBLP] Inf. Comput., 1994, v:114, n:1, pp:88-114 [Journal]
- Robert H. Sloan
Four Types of Noise in Data for PAC Learning. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:54, n:3, pp:157-162 [Journal]
- Robert H. Sloan
Special issue on computational learning theory. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:70, n:4, pp:433-434 [Journal]
- Judy Goldsmith, Robert H. Sloan
New Horn Revision Algorithms. [Citation Graph (0, 0)][DBLP] Journal of Machine Learning Research, 2005, v:6, n:, pp:1919-1938 [Journal]
- Dana Angluin, Martins Krikis, Robert H. Sloan, György Turán
Malicious Omissions and Errors in Answers to Membership Queries. [Citation Graph (0, 0)][DBLP] Machine Learning, 1997, v:28, n:2-3, pp:211-255 [Journal]
- Sally A. Goldman, Robert H. Sloan
The Power of Self-Directed Learning. [Citation Graph (0, 0)][DBLP] Machine Learning, 1994, v:14, n:1, pp:271-294 [Journal]
- Judy Goldsmith, Robert H. Sloan, György Turán
Theory Revision with Queries: DNF Formulas. [Citation Graph (0, 0)][DBLP] Machine Learning, 2002, v:47, n:2-3, pp:257-295 [Journal]
- David P. Helmbold, Robert H. Sloan, Manfred K. Warmuth
Learning Nested Differences of Intersection-Closed Concept Classes. [Citation Graph (0, 0)][DBLP] Machine Learning, 1990, v:5, n:, pp:165-196 [Journal]
- David P. Helmbold, Robert H. Sloan, Manfred K. Warmuth
Learning Integer Lattices. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1992, v:21, n:2, pp:240-266 [Journal]
- Thomas S. Messerges, Ezzy A. Dabbish, Robert H. Sloan
Examining Smart-Card Security under the Threat of Power Analysis Attacks. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 2002, v:51, n:5, pp:541-552 [Journal]
- A. Prasad Sistla, Ouri Wolfson, Yelena Yesha, Robert H. Sloan
Towards a Theory of Cost Management for Digital Libraries and Electronic Commerce. [Citation Graph (0, 20)][DBLP] ACM Trans. Database Syst., 1998, v:23, n:4, pp:411-452 [Journal]
- Marina Langlois, Robert H. Sloan, György Turán
Horn Upper Bounds and Renaming. [Citation Graph (0, 0)][DBLP] SAT, 2007, pp:80-93 [Conf]
- Robert H. Sloan, Balázs Szörényi, György Turán
Revising threshold functions. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:382, n:3, pp:198-208 [Journal]
Horn Complements: Towards Horn-to-Horn Belief Revision. [Citation Graph (, )][DBLP]
Combinatorial Problems for Horn Clauses. [Citation Graph (, )][DBLP]
CS 0.5: a better approach to introductory computer science for majors. [Citation Graph (, )][DBLP]
Curriculum update from the ACM education board: CS2008 and a report on masters degrees. [Citation Graph (, )][DBLP]
Projective DNF formulae and their revision. [Citation Graph (, )][DBLP]
Search in 0.419secs, Finished in 0.424secs
|