Robert H. Sloan

According to our database1, Robert H. Sloan
  • authored at least 93 papers between 1988 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
A Biology-themed Introductory CS Course at a Large, Diverse Public University.
Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

2017
Hydras: Directed hypergraphs and Horn formulas.
Theor. Comput. Sci., 2017

Measuring an artificial intelligence system's performance on a Verbal IQ test for young children.
J. Exp. Theor. Artif. Intell., 2017

Initial Experiences with a CS + Law Introduction to Computer Science (CS 1).
Proceedings of the 2017 ACM Conference on Innovation and Technology in Computer Science Education, 2017

2015
Hydras: Directed Hypergraphs and Horn Formulas.
CoRR, 2015

Measuring an Artificial Intelligence System's Performance on a Verbal IQ Test For Young Children.
CoRR, 2015

Who is watching you eat?: a noir preferences thriller.
AI Matters, 2015

2014
Preface to the special issue.
Ann. Math. Artif. Intell., 2014

Who is Watching You Eat?
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

2013
Verbal IQ of a Four-Year Old Achieved by an AI System.
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

Unauthorized Access - The Crisis in Online Privacy and Security.
CRC Press, ISBN: 978-1-43-983013-0, 2013

2012
On multiple-instance learning of halfspaces.
Inf. Process. Lett., 2012

Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs.
Discrete Mathematics & Theoretical Computer Science, 2012

Hydras: Directed Hypergraphs and Horn Formulas.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

Horn Belief Contraction: Remainders, Envelopes and Complexity.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Hydra formulas and directed hypergraphs: A preliminary report.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

An Approach to Evaluate AI Commonsense Reasoning Systems.
Proceedings of the Twenty-Fifth International Florida Artificial Intelligence Research Society Conference, 2012

2011
Horn Belief Contraction: Remainders, Envelopes and Complexity.
Proceedings of the Logical Formalizations of Commonsense Reasoning, 2011

2010
Horn Upper Bounds and Renaming.
JSAT, 2010

Reinforcement learning via approximation of the Q-function.
J. Exp. Theor. Artif. Intell., 2010

2009
Combinatorial Problems for Horn Clauses.
Proceedings of the Graph Theory, 2009

2008
On k-Term DNF with the Largest Number of Prime Implicants.
SIAM J. Discrete Math., 2008

Projective DNF formulae and their revision.
Discrete Applied Mathematics, 2008

CS 0.5: a better approach to introductory computer science for majors.
Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

Curriculum update from the ACM education board: CS2008 and a report on masters degrees.
Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

Combinatorial problems for Horn clauses.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Horn Complements: Towards Horn-to-Horn Belief Revision.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Revising threshold functions.
Theor. Comput. Sci., 2007

The joys of being an NSF program director.
SIGACT News, 2007

The inverse protein folding problem on 2D and 3D lattices.
Discrete Applied Mathematics, 2007

The computing ontology project: the computing education application.
Proceedings of the 38th SIGCSE Technical Symposium on Computer Science Education, 2007

An initiative to attract students to computing.
Proceedings of the 38th SIGCSE Technical Symposium on Computer Science Education, 2007

Horn Upper Bounds and Renaming.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

2006
On set systems with a threshold property.
Discrete Mathematics, 2006

Computing Curricula 2005: The Overview Report.
Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2006

A comprehensive representation of the computing and information disciplines.
Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2006

The Complexity of Discretionary Access Control.
Proceedings of the Advances in Information and Computer Security, 2006

Horn Upper Bounds of Random 3-CNF: A Computational Study.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2006

2005
A synthesis of computing concepts.
SIGCSE Bulletin, 2005

New Horn Revision Algorithms.
Journal of Machine Learning Research, 2005

Special issue on computational learning theory.
J. Comput. Syst. Sci., 2005

On k-term DNF with largest number of prime implicants
Electronic Colloquium on Computational Complexity (ECCC), 2005

A synthesis and ontology of all of computing.
Proceedings of the 36th SIGCSE Technical Symposium on Computer Science Education, 2005

Reinforcement Learning and Function Approximation.
Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, 2005

2004
Theory revision with queries: Horn, read-once, and parity formulas.
Artif. Intell., 2004

A Layered Design of Discretionary Access Controls with Decidable Safety Properties.
Proceedings of the 2004 IEEE Symposium on Security and Privacy (S&P 2004), 2004

Computing curricula 2004: the overview project.
Proceedings of the 35th SIGCSE Technical Symposium on Computer Science Education, 2004

Security Property Based Administrative Controls.
Proceedings of the Computer Security, 2004

The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

New Revision Algorithms.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003
Theory Revision with Queries: Horn, Read-once, and Parity Formulas
Electronic Colloquium on Computational Complexity (ECCC), 2003

Computer engineering computing curricula.
Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, 2003

Projective DNF Formulae and Their Revision.
Proceedings of the Computational Learning Theory and Kernel Machines, 2003

2002
Examining Smart-Card Security under the Threat of Power Analysis Attacks.
IEEE Trans. Computers, 2002

NSF report: theory of computing program.
SIGACT News, 2002

NSF report: theory of computing program.
SIGACT News, 2002

Theory Revision with Queries: DNF Formulas.
Machine Learning, 2002

Computing Curricula 2001 implementing the recommendations.
Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education, 2002, Cincinnati, Kentucky, USA, February 27, 2002

2001
Automatic Real-Time Analysis of Reactive Systems with the PARTS Toolset.
Autom. Softw. Eng., 2001

2000
More theory revision with queries (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Improved Algorithms for Theory Revision with Queries.
Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000

The Complexity of Model Aggregation.
Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 2000

1999
Curriculum 2001: bringing the future to the classroom.
SIGCSE Bulletin, 1999

On Theory Revision with Queries.
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

Power Analysis Attacks of Modular Exponentiation in Smartcards.
Proceedings of the Cryptographic Hardware and Embedded Systems, 1999

1998
Towards a Theory of Cost Management for Digital Libraries and Electronic Commerce.
ACM Trans. Database Syst., 1998

On frequent sets of Boolean matrices
Electronic Colloquium on Computational Complexity (ECCC), 1998

On Frequent Sets of Boolean Matrices.
Ann. Math. Artif. Intell., 1998

1997
Malicious Omissions and Errors in Answers to Membership Queries.
Machine Learning, 1997

Stubborn Sets for Real-Time Petri Nets.
Formal Methods in System Design, 1997

Learning from Incomplete Boundary Queries Using Split Graphs and Hypergraphs.
Proceedings of the Computational Learning Theory, Third European Conference, 1997

Learning Logic Programs by Using the Product Homomorphism Method.
Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

1996
Reduction Rules for Time Petri Nets.
Acta Inf., 1996

Learning Logic Programs with Random Classification Noise.
Proceedings of the Inductive Logic Programming, 6th International Workshop, 1996

1995
Four Types of Noise in Data for PAC Learning.
Inf. Process. Lett., 1995

Can PAC Learning Algorithms Tolerate Random Attribute Noise?
Algorithmica, 1995

1994
A Formal Model of Hierarchical Concept Learning
Inf. Comput., October, 1994

The Power of Self-Directed Learning.
Machine Learning, 1994

Divergence Caching in Client Server Architectures.
Proceedings of the Third International Conference on Parallel and Distributed Information Systems (PDIS 94), 1994

Analysis of Real-Time Programs with Simple Time Petri Nets.
Proceedings of the 1994 International Symposium on Software Testing and Analysis, 1994

Learning with Queries but Incomplete Information (Extended Abstract).
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993
On Choosing between Experimenting and Thinking when Learning
Inf. Comput., September, 1993

A Petri-Net -Based Approach to Real-Time Program Analysis.
Proceedings of the 7th International Workshop on Software Specification and Design, 1993

1992
Learning Integer Lattices.
SIAM J. Comput., 1992

Corrigendum to Types of Noise in Data for Concept Learning.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1990
Learning Nested Differences of Intersection-Closed Concept Classes.
Machine Learning, 1990

Learning Integer Lattices.
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989
Computational learning theory: new models and algorithms.
PhD thesis, 1989

Learning Nested Differences of Intersection-Closed Concept Classes.
Proceedings of the Second Annual Workshop on Computational Learning Theory, 1989

1988
A New Model for Inductive Inference.
Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, 1988

Types of Noise in Data for Concept Learning.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

Learning Complicated Concepts Reliably and Usefully.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

Learning Complicated Concepts Reliably and Usefully.
Proceedings of the 7th National Conference on Artificial Intelligence. St. Paul, 1988


  Loading...