default search action
Robert H. Sloan
Person information
- affiliation: University of Illinois at Chicago, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
- [c52]Robert H. Sloan, Valerie Barr, Heather Bort, Mark Guzdial
, Ran Libeskind-Hadas, Richard Warner:
CS + X Meets CS 1: Strongly Themed Intro Courses. SIGCSE 2020: 960-961
2010 – 2019
- 2018
- [j36]Robert H. Sloan, Richard Warner:
When Is an Algorithm Transparent? Predictive Analytics, Privacy, and Public Policy. IEEE Secur. Priv. 16(3): 18-25 (2018) - [c51]Tanya Y. Berger-Wolf, Boris Igic, Cynthia Bagier Taylor, Robert H. Sloan, Rachel Poretsky:
A Biology-themed Introductory CS Course at a Large, Diverse Public University. SIGCSE 2018: 233-238 - 2017
- [j35]Stellan Ohlsson, Robert H. Sloan, György Turán, Aaron Urasky:
Measuring an artificial intelligence system's performance on a Verbal IQ test for young children. J. Exp. Theor. Artif. Intell. 29(4): 679-693 (2017) - [j34]Robert H. Sloan, Despina Stasi, György Turán:
Hydras: Directed hypergraphs and Horn formulas. Theor. Comput. Sci. 658: 417-428 (2017) - [c50]Robert H. Sloan, Cynthia Bagier Taylor, Richard Warner:
Initial Experiences with a CS + Law Introduction to Computer Science (CS 1). ITiCSE 2017: 40-45 - 2015
- [j33]Judy Goldsmith, Nicholas Mattei, Robert H. Sloan:
Who is watching you eat?: a noir preferences thriller. AI Matters 1(4): 13-22 (2015) - [i5]Robert H. Sloan, Despina Stasi, György Turán:
Hydras: Directed Hypergraphs and Horn Formulas. CoRR abs/1504.07753 (2015) - [i4]Stellan Ohlsson, Robert H. Sloan, György Turán, Aaron Urasky:
Measuring an Artificial Intelligence System's Performance on a Verbal IQ Test For Young Children. CoRR abs/1509.03390 (2015) - 2014
- [j32]Robert H. Sloan:
Preface to the special issue. Ann. Math. Artif. Intell. 71(4): 279-281 (2014) - [c49]Judy Goldsmith, Nicholas Mattei, Robert H. Sloan:
Who is Watching You Eat? MPREF@AAAI 2014 - 2013
- [b2]Robert H. Sloan, Richard Warner:
Unauthorized Access - The Crisis in Online Privacy and Security. CRC Press 2013, ISBN 978-1-43-983013-0, pp. I-XXIII, 1-374 - [c48]Stellan Ohlsson, Robert H. Sloan, György Turán, Aaron Urasky:
Verbal IQ of a Four-Year Old Achieved by an AI System. AAAI (Late-Breaking Developments) 2013 - 2012
- [j31]Robert H. Sloan, Despina Stasi, György Turán:
Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs. Discret. Math. Theor. Comput. Sci. 14(2): 29-36 (2012) - [j30]Dimitrios I. Diochnos
On multiple-instance learning of halfspaces. Inf. Process. Lett. 112(23): 933-936 (2012) - [c47]Stellan Ohlsson, Robert H. Sloan, György Turán, Daniel Uber, Aaron Urasky:
An Approach to Evaluate AI Commonsense Reasoning Systems. FLAIRS 2012 - [c46]Despina Stasi, Robert H. Sloan, György Turán:
Hydra formulas and directed hypergraphs: A preliminary report. ISAIM 2012 - [c45]Kira V. Adaricheva, Robert H. Sloan, Balázs Szörényi, György Turán:
Horn Belief Contraction: Remainders, Envelopes and Complexity. KR 2012 - [c44]Robert H. Sloan, Despina Stasi, György Turán:
Hydras: Directed Hypergraphs and Horn Formulas. WG 2012: 237-248 - 2011
- [c43]Kira V. Adaricheva, Robert H. Sloan, Balázs Szörényi, György Turán:
Horn Belief Contraction: Remainders, Envelopes and Complexity. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning 2011 - 2010
- [j29]Marina Langlois, Robert H. Sloan:
Reinforcement learning via approximation of the Q-function. J. Exp. Theor. Artif. Intell. 22(3): 219-235 (2010) - [j28]Marina Langlois, Robert H. Sloan, György Turán:
Horn Upper Bounds and Renaming. J. Satisf. Boolean Model. Comput. 7(1): 1-15 (2010) - [p1]Robert H. Sloan, Balázs Szörényi, György Turán, Yves Crama, Peter L. Hammer:
Learning Boolean Functions with Queries. Boolean Models and Methods 2010: 221-256
2000 – 2009
- 2009
- [c42]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
- [j27]Robert H. Sloan, Balázs Szörényi, György Turán:
Projective DNF formulae and their revision. Discret. Appl. Math. 156(4): 530-544 (2008) - [j26]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. Discret. Math. 21(4): 987-998 (2008) - [c41]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 - [c40]Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán:
Combinatorial problems for Horn clauses. ISAIM 2008 - [c39]Robert H. Sloan, Patrick Troy:
CS 0.5: a better approach to introductory computer science for majors. SIGCSE 2008: 271-275 - [c38]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 - 2007
- [j25]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. Discret. Appl. Math. 155(6-7): 719-732 (2007) - [j24]Robert H. Sloan:
The joys of being an NSF program director. SIGACT News 38(1): 7-8 (2007) - [j23]Robert H. Sloan, Balázs Szörényi, György Turán:
Revising threshold functions. Theor. Comput. Sci. 382(3): 198-208 (2007) - [c37]Marina Langlois, Robert H. Sloan, György Turán:
Horn Upper Bounds and Renaming. SAT 2007: 80-93 - [c36]Lillian N. Cassel, Andrew D. McGettrick, Gordon Davies, Heikki Topi
An initiative to attract students to computing. SIGCSE 2007: 133-134 - [c35]Lillian N. Cassel, Robert H. Sloan, Gordon Davies, Heikki Topi
The computing ontology project: the computing education application. SIGCSE 2007: 519-520 - 2006
- [j22]Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán:
On set systems with a threshold property. Discret. Math. 306(23): 3097-3111 (2006) - [c34]Marina Langlois, Robert H. Sloan, György Turán:
Horn Upper Bounds of Random 3-CNF: A Computational Study. AI&M 2006 - [c33]Stephen Dranger, Robert H. Sloan, Jon A. Solworth:
The Complexity of Discretionary Access Control. IWSEC 2006: 405-420 - [c32]Lillian N. Cassel, Andrew D. McGettrick, Robert H. Sloan:
A comprehensive representation of the computing and information disciplines. SIGCSE 2006: 199-200 - [c31]Russell L. Shackelford, Andrew D. McGettrick, Robert H. Sloan, Heikki Topi
Computing Curricula 2005: The Overview Report. SIGCSE 2006: 456-457 - 2005
- [j21]Robert H. Sloan:
Special issue on computational learning theory. J. Comput. Syst. Sci. 70(4): 433-434 (2005) - [j20]Judy Goldsmith, Robert H. Sloan:
New Horn Revision Algorithms. J. Mach. Learn. Res. 6: 1919-1938 (2005) - [j19]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. ACM SIGCSE Bull. 37(4): 162-172 (2005) - [c30]Marina Irodova, Robert H. Sloan:
Reinforcement Learning and Function Approximation. FLAIRS 2005: 455-460 - [c29]Lillian N. Cassel, Russell L. Shackelford, Robert H. Sloan:
A synthesis and ontology of all of computing. SIGCSE 2005: 65-66 - [i3]Robert H. Sloan, Balázs Szörényi, György Turán:
On k-term DNF with largest number of prime implicants. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j18]Judy Goldsmith
Theory revision with queries: Horn, read-once, and parity formulas. Artif. Intell. 156(2): 139-176 (2004) - [c28]Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán:
New Revision Algorithms. ALT 2004: 395-409 - [c27]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 - [c26]Jon A. Solworth, Robert H. Sloan:
Security Property Based Administrative Controls. ESORICS 2004: 244-259 - [c25]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 - [c24]Jon A. Solworth, Robert H. Sloan:
A Layered Design of Discretionary Access Controls with Decidable Safety Properties. S&P 2004: 56- - 2003
- [c23]Robert H. Sloan, Balázs Szörényi, György Turán:
Projective DNF Formulae and Their Revision. COLT 2003: 625-639 - [c22]John Impagliazzo, Robert H. Sloan, Andrew D. McGettrick, Pradip K. Srimani:
Computer engineering computing curricula. SIGCSE 2003: 355-356 - [i2]Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán:
Theory Revision with Queries: Horn, Read-once, and Parity Formulas. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j17]Judy Goldsmith
Theory Revision with Queries: DNF Formulas. Mach. Learn. 47(2-3): 257-295 (2002) - [j16]Robert H. Sloan:
NSF report: theory of computing program. SIGACT News 33(1): 28 (2002) - [j15]Robert H. Sloan:
NSF report: theory of computing program. SIGACT News 33(2): 27-28 (2002) - [j14]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) - [c21]Eric Roberts, C. Fay Cover, Gordon Davies, Michael Schneider, Robert H. Sloan:
Computing Curricula 2001 implementing the recommendations. SIGCSE 2002: 167-168 - [e1]Jyrki Kivinen, Robert H. Sloan:
Computational Learning Theory, 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002, Proceedings. Lecture Notes in Computer Science 2375, Springer 2002, ISBN 3-540-43836-X [contents] - 2001
- [j13]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
- [c20]Judy Goldsmith, Robert H. Sloan:
The Complexity of Model Aggregation. AIPS 2000: 122-129 - [c19]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 - [c18]Judy Goldsmith, Robert H. Sloan:
More theory revision with queries (extended abstract). STOC 2000: 441-448
1990 – 1999
- 1999
- [c17]Thomas S. Messerges, Ezzy A. Dabbish, Robert H. Sloan:
Power Analysis Attacks of Modular Exponentiation in Smartcards. CHES 1999: 144-157 - [c16]Robert H. Sloan, György Turán:
On Theory Revision with Queries. COLT 1999: 41-52 - [c15]Carl K. Chang, Gerald L. Engel, Willis King, Eric Roberts, Russell L. Shackelford, Robert H. Sloan, Pradip K. Srimani:
Curriculum 2001: bringing the future to the classroom. ITiCSE-WGR 1999: 70-73 - 1998
- [j12]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) - [j11]A. Prasad Sistla, Ouri Wolfson
Towards a Theory of Cost Management for Digital Libraries and Electronic Commerce. ACM Trans. Database Syst. 23(4): 411-452 (1998) - [i1]Robert H. Sloan, Ken Takata, György Turán:
On frequent sets of Boolean matrices. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j10]Robert H. Sloan, Ugo A. Buy:
Stubborn Sets for Real-Time Petri Nets. Formal Methods Syst. Des. 11(1): 23-40 (1997) - [j9]Dana Angluin, Martins Krikis, Robert H. Sloan, György Turán:
Malicious Omissions and Errors in Answers to Membership Queries. Mach. Learn. 28(2-3): 211-255 (1997) - [c14]Tamás Horváth, Robert H. Sloan, György Turán:
Learning Logic Programs by Using the Product Homomorphism Method. COLT 1997: 10-20 - [c13]Robert H. Sloan, György Turán:
Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs. EuroCOLT 1997: 38-50 - 1996
- [j8]Robert H. Sloan, Ugo A. Buy:
Reduction Rules for Time Petri Nets. Acta Informatica 33(7): 687-706 (1996) - [c12]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 - 1995
- [j7]Sally A. Goldman, Robert H. Sloan:
Can PAC Learning Algorithms Tolerate Random Attribute Noise? Algorithmica 14(1): 70-84 (1995) - [j6]Robert H. Sloan:
Four Types of Noise in Data for PAC Learning. Inf. Process. Lett. 54(3): 157-162 (1995) - 1994
- [j5]Ronald L. Rivest, Robert H. Sloan:
A Formal Model of Hierarchical Concept Learning. Inf. Comput. 114(1): 88-114 (1994) - [j4]Sally A. Goldman, Robert H. Sloan:
The Power of Self-Directed Learning. Mach. Learn. 14(1): 271-294 (1994) - [c11]Robert H. Sloan, György Turán:
Learning with Queries but Incomplete Information (Extended Abstract). COLT 1994: 237-245 - [c10]Ugo A. Buy, Robert H. Sloan:
Analysis of Real-Time Programs with Simple Time Petri Nets. ISSTA 1994: 228-239 - [c9]Yixiu Huang, Robert H. Sloan, Ouri Wolfson:
Divergence Caching in Client Server Architectures. PDIS 1994: 131-139 - 1993
- [j3]Ronald L. Rivest, Robert H. Sloan:
On Choosing between Experimenting and Thinking when Learning. Inf. Comput. 106(1): 1-25 (1993) - [c8]Ugo A. Buy, Robert H. Sloan:
A Petri-Net -Based Approach to Real-Time Program Analysis. IWSSD 1993: 56-60 - 1992
- [j2]David P. Helmbold, Robert H. Sloan, Manfred K. Warmuth:
Learning Integer Lattices. SIAM J. Comput. 21(2): 240-266 (1992) - [c7]Robert H. Sloan:
Corrigendum to Types of Noise in Data for Concept Learning. COLT 1992: 450 - 1990
- [j1]David P. Helmbold, Robert H. Sloan, Manfred K. Warmuth:
Learning Nested Differences of Intersection-Closed Concept Classes. Mach. Learn. 5: 165-196 (1990) - [c6]David P. Helmbold, Robert H. Sloan, Manfred K. Warmuth:
Learning Integer Lattices. COLT 1990: 288-302
1980 – 1989
- 1989
- [b1]Robert H. Sloan:
Computational learning theory: new models and algorithms. Massachusetts Institute of Technology, Cambridge, MA, USA, 1989 - [c5]David P. Helmbold, Robert H. Sloan, Manfred K. Warmuth:
Learning Nested Differences of Intersection-Closed Concept Classes. COLT 1989: 41-56 - 1988
- [c4]Ronald L. Rivest, Robert H. Sloan:
Learning Complicated Concepts Reliably and Usefully. AAAI 1988: 635-640 - [c3]Ronald L. Rivest, Robert H. Sloan:
Learning Complicated Concepts Reliably and Usefully. COLT 1988: 69-79 - [c2]Robert H. Sloan:
Types of Noise in Data for Concept Learning. COLT 1988: 91-96 - [c1]Ronald L. Rivest, Robert H. Sloan:
A New Model for Inductive Inference. TARK 1988: 13-28
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: