Judy Goldsmith

According to our database1, Judy Goldsmith authored at least 119 papers between 1986 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
SIGCSE Reads 2019: Discussion and Q & A.
Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019

The Heart of the Matter: Patient Autonomy as a Model for the Wellbeing of Technology Users.
Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, 2019

2018
How to teach computer ethics through science fiction.
Commun. ACM, 2018

Decentralized Multiagent Approach for Hedonic Games.
Proceedings of the Multi-Agent Systems - 16th European Conference, 2018

Regulating Artificial Intelligence: Proposal for a Global Solution.
Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society, 2018

The Heart of the Matter: Patient Autonomy as a Model for the Wellbeing of Technology Users.
Proceedings of the 2018 AAAI Spring Symposia, 2018

2017
Uniform Random Generation and Dominance Testing for CP-Nets.
J. Artif. Intell. Res., 2017

Ethical Considerations in Artificial Intelligence Courses.
AI Magazine, 2017

Learning Tree-Structured CP-Nets with Local Search.
Proceedings of the Thirtieth International Florida Artificial Intelligence Research Society Conference, 2017

The Complexity of Campaigning.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

Why Teaching Ethics to AI Practitioners Is Important.
Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

Why Teaching Ethics to AI Practitioners Is Important.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
A Tool to Graphically Edit CP-Nets.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Model AI Assignments 2016.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Using "The Machine Stops" for Teaching Ethics in Artificial Intelligence and Computer Science.
Proceedings of the AI, 2016

Generating CP-Nets Uniformly at Random.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
On the complexity of bribery and manipulation in tournaments with uncertain information.
J. Applied Logic, 2015

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

SIGCSE Reads: Time for Book Discussion (Abstract Only).
Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

Stability in Role Based Hedonic Games.
Proceedings of the Twenty-Eighth International Florida Artificial Intelligence Research Society Conference, 2015

Probabilistic Copeland Tournaments.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Reasoning with PCP-nets in a Multi-Agent Context.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Beyond Theory and Data in Preference Modeling: Bringing Humans into the Loop.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Teaching AI Ethics Using Science Fiction.
Proceedings of the Artificial Intelligence and Ethics, 2015

2014
Fiction as an Introduction to Computer Science Research.
TOCE, 2014

The complexity of probabilistic lobbying.
Discrete Optimization, 2014

Online discussions: improving education in CS?
Proceedings of the 45th ACM Technical Symposium on Computer Science Education, 2014

Using science fiction in CS courses (abstract only).
Proceedings of the 45th ACM Technical Symposium on Computer Science Education, 2014

A Model for Intransitive Preferences.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

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

Voting with Rank Dependent Scoring Rules.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Counting, Ranking, and Randomly Generating CP-Nets.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

2013
Uncertain Data: Representations, Query Processing, and Applications.
Proceedings of the Advances in Probabilistic Databases for Uncertain Information Management, 2013

An English-Language Argumentation Interface for Explanation Generation with Markov Decision Processes in the Domain of Academic Advising.
TiiS, 2013

Algorithms, approximation, and empirical studies in behavioral and computational social choice - Preface.
Ann. Math. Artif. Intell., 2013

Approximation of Lorenz-Optimal Solutions in Multiobjective Markov Decision Processes.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Teaching graphics for games using Microsoft XNA.
Proceedings of the 18th International Conference on Computer Games: AI, 2013

Updates and Uncertainty in CP-Nets.
Proceedings of the AI 2013: Advances in Artificial Intelligence, 2013

Roles and Teams Hedonic Game.
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

Learning CP-net Preferences Online from User Queries.
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

Approximation of Lorenz-Optimal Solutions in Multiobjective Markov Decision Processes.
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

Learning CP-Net Preferences Online from User Queries.
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012
Science fiction in computer science education.
Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information.
Proceedings of the Twenty-Fifth International Florida Artificial Intelligence Research Society Conference, 2012

On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information.
Proceedings of the Machine Aggregation of Human Judgment, 2012

2011
Topological Value Iteration Algorithms.
J. Artif. Intell. Res., 2011

A Natural Language Argumentation Interface for Explanation Generation in Markov Decision Processes.
Proceedings of the Explanation-aware Computing, 2011

A Natural Language Argumentation Interface for Explanation Generation in Markov Decision Processes.
Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

2010
Decision-theoretic harmony: A first step.
Int. J. Approx. Reasoning, 2010

Introduction to the special issue on Bayesian model views.
Int. J. Approx. Reasoning, 2010

Ranking policies in discrete Markov decision processes.
Ann. Math. Artif. Intell., 2010

2009
Planning for success: The interdisciplinary approach to building Bayesian models.
Int. J. Approx. Reasoning, 2009

Workshop summary: Seventh annual workshop on Bayes applications.
Proceedings of the 26th Annual International Conference on Machine Learning, 2009

The Complexity of Probabilistic Lobbying.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

Finding Best k Policies.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008
Complexity of DNF minimization and isomorphism testing for monotone formulas.
Inf. Comput., 2008

Preference Handling for Artificial Intelligence.
AI Magazine, 2008

Planning for Welfare to Work.
Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, 2008

A bottom-up approach to welfare case management decision support software.
Proceedings of the 9th Annual International Conference on Digital Government Research, 2008

Expediting RL by using graphical structures.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

2007
AAAI-07 Workshop Reports.
AI Magazine, 2007

Automatic Generation of Four-part Harmony.
Proceedings of the Fifth UAI Bayesian Modeling Applications Workshop (UAI-AW 2007), 2007

Competition Adds Complexity.
Proceedings of the Advances in Neural Information Processing Systems 20, 2007

Topological Value Iteration Algorithm for Markov Decision Processes.
Proceedings of the IJCAI 2007, 2007

Multi-Threaded BLAO* Algorithm.
Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference, 2007

2006
Factored MDP Elicitation and Plan Display.
Proceedings of the Proceedings, 2006

2005
New Horn Revision Algorithms.
J. Mach. Learn. Res., 2005

A Framework for Management of Semistructured Probabilistic Data.
J. Intell. Inf. Syst., 2005

Complexity of DNF and Isomorphism of Monotone Formulas.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

The computational complexity of dominance and consistency in CP-nets.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Adaptive Decision Support for Planning under Hard and Soft Constraints.
Proceedings of the Challenges to Decision Support in a Changing World, 2005

2004
Databases for interval probabilities.
Int. J. Intell. Syst., 2004

Building Bayes Nets with Semistructured Probabilistic DBMS.
EMISA Forum, 2004

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

Preferences and Domination.
Proceedings of the Algebraic Methods in Computational Complexity, 10.-15. October 2004, 2004

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

2003
When Plans Distinguish Bayes Nets.
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2003

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

Revising Unique Explanations.
Proceedings of the MAICS 2003, 2003

Bidirectional LAO* algorithm.
Proceedings of the 1st Indian International Conference on Artificial Intelligence, 2003

Can Probabilistic Databases Help Elect Qualified Officials?
Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference, 2003

Query Algebra Operations for Interval Probabilities.
Proceedings of the Database and Expert Systems Applications, 14th International Conference, 2003

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

2001
Nonapproximability Results for Partially Observable Markov Decision Processes.
J. Artif. Intell. Res., 2001

Semistructured Probalistic Databases.
Proceedings of the 13th International Conference on Scientific and Statistical Database Management, 2001

2000
Nonapproximability Results for Partially Observable Markov Decision Processes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 2000

Book review: Theory of Computing: A Gentle Introduction by Kinber and Smith (Prentice-Hall, 2001).
SIGACT News, 2000

Complexity of finite-horizon Markov decision process problems.
J. ACM, 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
Complexity of Finite-Horizon Markov Decision process Problems.
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1999

An Algorithm for the Class of Pure Implicational Formulas.
Discrete Applied Mathematics, 1999

My Brain is Full: When More Memory Helps.
Proceedings of the UAI '99: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, Stockholm, Sweden, July 30, 1999

1998
L-Printable Sets.
SIAM J. Comput., 1998

Sharply Bounded Alternation and Quasilinear Time.
Theory Comput. Syst., 1998

The Computational Complexity of Probabilistic Planning.
J. Artif. Intell. Res., 1998

Tally NP Sets and Easy Census Functions.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Complexity Issues in Markov Decision Processes.
Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997
The Complexity of Plan Existence and Evaluation in Probabilistic Domains.
Proceedings of the UAI '97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 1997

The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996
Limited nondeterminism.
SIGACT News, 1996

The future of computational complexity theory: part II.
SIGACT News, 1996

Scalability and the Isomorphism Problem.
Inf. Process. Lett., 1996

Sharply Bounded Alternation within P
Electronic Colloquium on Computational Complexity (ECCC), 1996

Sharply Bounded Alternation within P.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

L-Printable Sets.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1994
How hard are n2-hard problems?
SIGACT News, 1994

Downward separation fails catastrophically for limited nondeterminism classes.
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993
Using Self-Reducibilities to Characterize Polynomial Time
Inf. Comput., June, 1993

Nondeterminism Within P.
SIAM J. Comput., 1993

A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy.
J. Comput. Syst. Sci., 1993

Relativized Isomorphisms of NP-Complete Sets.
Computational Complexity, 1993

1992
Polynomial-Time Compression.
Computational Complexity, 1992

1991
Near-Testable Sets.
SIAM J. Comput., 1991

Nondterminism Within P.
Proceedings of the STACS 91, 1991

On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1987
Near-testable, P-cheatable, and P-terse sets.
Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986
Three Results on the Polynomial Isomorphism of Complete Sets
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986


  Loading...