default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJudy Goldsmith
Person information
- affiliation: University of Kentucky, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c102]Valerie Summet
, Rebecca Bates, Judy Goldsmith, Nanette Veilleux, Colleen M. Lewis:
SIGCSE Reads 2025: The New Science of Learning. SIGCSE (2) 2025: 1713-1714- [c101]Rebecca Bates, Judy Goldsmith, Valerie Summet, Nanette Veilleux:
SIGCSE Reads 2025: Community Connections through Fiction. SIGCSE (2) 2025: 1716 - 2024
- [j49]Judy Goldsmith, Jörg Rothe:
Coalition formation games - preface. Ann. Math. Artif. Intell. 92(3): 535-537 (2024) - [j48]Nathan Arnold, Sarah H. Snider, Judy Goldsmith:
Socially conscious stability for tiered coalition formation games. Ann. Math. Artif. Intell. 92(3): 539-580 (2024) - [c100]Kathleen Timmerman, Judy Goldsmith, Brent Harrison, Zongming Fei:
Designing Inclusive AI Certifications. AAAI Spring Symposia 2024: 536-543 - [c99]Nathan Arnold, Judy Goldsmith:
Core Stability and Nash Stability in k-Tiered Coalition Formation Games. ADT 2024: 243-257 - [c98]Nathan Arnold, Nicholas Fluty, Ryan D. Flores, Judy Goldsmith, Brent Harrison:
Evaluating the Stability of the Smogon Tier List for Competitive Pokémon Battling. EXAG@AIIDE 2024 - [c97]Nicholas Fluty, Ryan D. Flores, Judy Goldsmith, Brent Harrison:
An Empirical Analysis of the Validity of Competitive Pokémon Rule Sets. EXAG@AIIDE 2024 - [c96]Pearson Garner, Aaron Lin, Ruby Harris, Brent Harrison, Judy Goldsmith:
ArmA 3 Billeting as a Coalition Formation Game. EXAG@AIIDE 2024 - [c95]Nanette Veilleux, Rebecca Bates, Judy Goldsmith, Valerie Summet:
Mentoring, AI, and the End of Affirmative Action: Connecting with SIGCSE Reads. SIGCSE (2) 2024: 1922 - 2023
- [j47]William Bailey, Judy Goldsmith, Brent Harrison, Siyao Xu:
Fast approximate bi-objective Pareto sets with quality bounds. Auton. Agents Multi Agent Syst. 37(1): 5 (2023) - [c94]Emanuelle Burton, Judy Goldsmith, Nicholas Mattei, Cory Siler, Sara-Jo Swiatek:
Teaching Computer Science Ethics Using Science Fiction. SIGCSE (2) 2023: 1184 - [c93]Rebecca Bates, Judy Goldsmith, Valerie Summet, Nanette Veilleux:
SIGCSE Reads 2023: Cultural Connections through Fiction. SIGCSE (2) 2023: 1222-1223 - 2022
- [j46]Olivia Johanna Erdélyi, Judy Goldsmith:
Regulating artificial intelligence: Proposal for a global solution. Gov. Inf. Q. 39(4): 101748 (2022) - [c92]Nathan Arnold, Judy Goldsmith, Sarah H. Snider:
Extensions to Tiered Coalition Formation Games. FLAIRS 2022 - [c91]Kshitija Taywade, Brent Harrison, Adib Bagh, Judy Goldsmith:
Modelling Cournot Games as Multi-agent Multi-armed Bandits. FLAIRS 2022 - [c90]Christian Addington, Jacob Schlueter, Judy Goldsmith:
The Power of Symmetry for Nash Stable Additively Separable Hedonic Games. ISAIM 2022 - [c89]Nathan Arnold, Sarah H. Snider, Judy Goldsmith:
Extensions on Tiered Coalition Formation Games. ISAIM 2022 - [c88]Rebecca Bates, Emanuelle Burton, Valerie Summet, Nanette Veilleux, Judy Goldsmith:
SIGCSE Reads 2022: Using Challenging Stories in your Classroom. SIGCSE (2) 2022: 1061-1062 - [c87]Rasika Bhalerao, Emanuelle Burton, Stacy A. Doore, Judy Goldsmith:
Learning Outcomes and Assessments for Ethical Computing. SIGCSE (2) 2022: 1182 - [i22]Kshitija Taywade, Brent Harrison, Judy Goldsmith:
Using Non-Stationary Bandits for Learning in Repeated Cournot Games with Non-Stationary Demand. CoRR abs/2201.00486 (2022) - 2021
- [j45]Cristina Cornelio, Judy Goldsmith, Umberto Grandi, Nicholas Mattei, Francesca Rossi, Kristen Brent Venable:
Reasoning with PCP-Nets. J. Artif. Intell. Res. 72: 1103-1161 (2021) - [c86]Patrick Shepherd, Isaac Batts, Judy Goldsmith, Emory Hufbauer, Mia Weaver, Angela Zhang:
Software for Agent-based Network Simulation and Visualization. AAAI 2021: 16103-16105 - [c85]Kshitija Taywade, Judy Goldsmith, Brent Harrison:
Multi-agent Reinforcement Learning for Decentralized Stable Matching. ADT 2021: 375-389 - [c84]Jacob Schlueter, Christian Addington, Judy Goldsmith:
Anchored Team Formation Games. FLAIRS 2021 - [c83]Rebecca Bates, Valerie Summet, Nanette Veilleux, Judy Goldsmith:
SIGCSE Reads 2021: Using the Stories in your Classroom. SIGCSE 2021: 465-466 - [i21]Edith Elkind, Judy Goldsmith, Anja Rey, Jörg Rothe:
Coalition Formation Games (Dagstuhl Seminar 21331). Dagstuhl Reports 11(7): 1-15 (2021) - 2020
- [c82]Judy Goldsmith, Emanuelle Burton, David M. Dueber, Beth Goldstein, Shannon Sampson, Michael D. Toland:
Assessing Ethical Thinking about AI. AAAI 2020: 13525-13528 - [c81]Patrick Shepherd, Judy Goldsmith:
A Reinforcement Learning Approach to Strategic Belief Revelation with Social Influence. AAAI 2020: 13734-13735 - [c80]Patrick Shepherd, Mia Weaver, Judy Goldsmith:
An Investigation into the Sensitivity of Social Opinion Networks to Heterogeneous Goals and Preferences. ASONAM 2020: 673-677 - [c79]Jacob Schlueter, Judy Goldsmith:
Internal Stability in Hedonic Games. FLAIRS 2020: 154-159 - [c78]Jacob Schlueter, Judy Goldsmith:
Super Altruistic Hedonic Games. FLAIRS 2020: 160-165 - [c77]Kshitija Taywade, Judy Goldsmith, Brent Harrison:
Decentralized Marriage Models. FLAIRS 2020: 213-216 - [c76]Dave Mobley, Judy Goldsmith, Brent Harrison:
Discovering Hierarchies for Reinforcement Learning Using Data Mining. FLAIRS 2020: 392-395 - [c75]Rebecca Bates, Valerie Summet, Nanette Veilleux, Judy Goldsmith, David D. Levine:
SIGCSE Reads 2020: Author Discussion and Q & A. SIGCSE 2020: 325-326 - [c74]Emanuelle Burton, David Dueber, Judy Goldsmith, Beth Goldstein, Shannon Sampson, Michael D. Toland:
Assessment of CS Students' Ethical Reasoning Skills. SIGCSE 2020: 1406 - [i20]Kshitija Taywade, Judy Goldsmith, Brent Harrison:
Reinforcement Learning for Decentralized Stable Matching. CoRR abs/2005.01117 (2020) - [i19]Olivia Johanna Erdélyi, Judy Goldsmith:
Regulating Artificial Intelligence: Proposal for a Global Solution. CoRR abs/2005.11072 (2020) - [i18]Patrick Shepherd, Mia Weaver, Judy Goldsmith:
Opinion Diffusion Software with Strategic Opinion Revelation and Unfriending. CoRR abs/2006.12572 (2020)
2010 – 2019
- 2019
- [c73]Emanuelle Burton, Kristel Clayville, Judy Goldsmith, Nicholas Mattei:
The Heart of the Matter: Patient Autonomy as a Model for the Wellbeing of Technology Users. AIES 2019: 13-19 - [c72]Rebecca Bates, Valerie Summet, Nanette Veilleux, Judy Goldsmith, Naomi Kritzer:
SIGCSE Reads 2019: Discussion and Q & A. SIGCSE 2019: 336-337 - 2018
- [j44]Emanuelle Burton, Judy Goldsmith, Nicholas Mattei:
How to teach computer ethics through science fiction. Commun. ACM 61(8): 54-64 (2018) - [c71]Emanuelle Burton, Kristel Clayville, Judy Goldsmith, Nicholas Mattei:
The Heart of the Matter: Patient Autonomy as a Model for the Wellbeing of Technology Users. AAAI Spring Symposia 2018 - [c70]Olivia Johanna Erdélyi, Judy Goldsmith:
Regulating Artificial Intelligence: Proposal for a Global Solution. AIES 2018: 95-101 - [c69]Kshitija Taywade, Judy Goldsmith, Brent Harrison:
Decentralized Multiagent Approach for Hedonic Games. EUMAS 2018: 220-232 - 2017
- [j43]Emanuelle Burton, Judy Goldsmith, Sven Koenig, Benjamin Kuipers, Nicholas Mattei, Toby Walsh:
Ethical Considerations in Artificial Intelligence Courses. AI Mag. 38(2): 22-34 (2017) - [j42]Thomas E. Allen, Judy Goldsmith, Hayden Elizabeth Justice, Nicholas Mattei, Kayla Raines:
Uniform Random Generation and Dominance Testing for CP-Nets. J. Artif. Intell. Res. 59: 771-813 (2017) - [c68]Judy Goldsmith, Emanuelle Burton:
Why Teaching Ethics to AI Practitioners Is Important. AAAI 2017: 4836-4840 - [c67]Judy Goldsmith, Emanuelle Burton:
Why Teaching Ethics to AI Practitioners Is Important. AAAI Workshops 2017 - [c66]Cory Siler, Luke Harold Miles, Judy Goldsmith:
The Complexity of Campaigning. ADT 2017: 153-165 - [c65]Thomas E. Allen, Cory Siler, Judy Goldsmith:
Learning Tree-Structured CP-Nets with Local Search. FLAIRS 2017: 8-13 - [i17]Emanuelle Burton, Judy Goldsmith, Sven Koenig, Benjamin Kuipers, Nicholas Mattei, Toby Walsh:
Ethical Considerations in Artificial Intelligence Courses. CoRR abs/1701.07769 (2017) - [i16]Cory Siler, Luke Harold Miles, Judy Goldsmith:
The Complexity of Campaigning. CoRR abs/1706.06243 (2017) - 2016
- [c64]Thomas E. Allen, Judy Goldsmith, Hayden Elizabeth Justice, Nicholas Mattei, Kayla Raines:
Generating CP-Nets Uniformly at Random. AAAI 2016: 872-878 - [c63]Emanuelle Burton, Judy Goldsmith, Nicholas Mattei:
Using "The Machine Stops" for Teaching Ethics in Artificial Intelligence and Computer Science. AAAI Workshop: AI, Ethics, and Society 2016 - [c62]Todd W. Neller, Laura E. Brown, James B. Marshall, Lisa Torrey, Nate Derbinsky, Andrew A. Ward, Thomas E. Allen, Judy Goldsmith, Nahom Muluneh:
Model AI Assignments 2016. AAAI 2016: 4139-4141 - [c61]Aidan Shafran, Sam Saarinen, Judy Goldsmith:
A Tool to Graphically Edit CP-Nets. AAAI 2016: 4387-4388 - 2015
- [j41]Judy Goldsmith, Nicholas Mattei, Robert H. Sloan:
Who is watching you eat?: a noir preferences thriller. AI Matters 1(4): 13-22 (2015) - [j40]Nicholas Mattei, Judy Goldsmith, Andrew Klapper, Martin Mundhenk:
On the complexity of bribery and manipulation in tournaments with uncertain information. J. Appl. Log. 13(4): 557-581 (2015) - [c60]Emanuelle Burton, Judy Goldsmith, Nicholas Mattei:
Teaching AI Ethics Using Science Fiction. AAAI Workshop: AI and Ethics 2015 - [c59]Thomas E. Allen, Muye Chen, Judy Goldsmith, Nicholas Mattei, Anna Popova, Michel Regenwetter, Francesca Rossi, Christopher E. Zwilling:
Beyond Theory and Data in Preference Modeling: Bringing Humans into the Loop. ADT 2015: 3-18 - [c58]Cristina Cornelio, Umberto Grandi, Judy Goldsmith, Nicholas Mattei, Francesca Rossi, Kristen Brent Venable:
Reasoning with PCP-nets in a Multi-Agent Context. AAMAS 2015: 969-977 - [c57]Sam Saarinen, Judy Goldsmith, Craig A. Tovey:
Probabilistic Copeland Tournaments. AAMAS 2015: 1851-1852 - [c56]Matthew Spradling, Judy Goldsmith:
Stability in Role Based Hedonic Games. FLAIRS 2015: 85-90 - [c55]Rebecca Bates, Judy Goldsmith, Valerie Summet:
SIGCSE Reads: Time for Book Discussion (Abstract Only). SIGCSE 2015: 702 - 2014
- [j39]Daniel Binkele-Raible, Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Jörg Rothe:
The complexity of probabilistic lobbying. Discret. Optim. 11: 1-21 (2014) - [j38]Judy Goldsmith, Nicholas Mattei:
Fiction as an Introduction to Computer Science Research. ACM Trans. Comput. Educ. 14(1): 4:1-4:14 (2014) - [c54]Thomas E. Allen, Judy Goldsmith, Nicholas Mattei:
Counting, Ranking, and Randomly Generating CP-Nets. MPREF@AAAI 2014 - [c53]Judy Goldsmith, Jérôme Lang, Nicholas Mattei, Patrice Perny:
Voting with Rank Dependent Scoring Rules. AAAI 2014: 698-704 - [c52]Judy Goldsmith, Nicholas Mattei, Robert H. Sloan:
Who is Watching You Eat? MPREF@AAAI 2014 - [c51]Sam Saarinen, Craig A. Tovey, Judy Goldsmith:
A Model for Intransitive Preferences. MPREF@AAAI 2014 - [c50]Radu Paul Mihail, Beth Rubin, Judy Goldsmith:
Online discussions: improving education in CS? SIGCSE 2014: 409-414 - [c49]Rebecca Bates, Judy Goldsmith, Valerie Summet, Nanette Veilleux:
Using science fiction in CS courses (abstract only). SIGCSE 2014: 736-737 - [i15]Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson:
The Computational Complexity of Dominance and Consistency in CP-Nets. CoRR abs/1401.3453 (2014) - [i14]Peng Dai, Mausam, Daniel Sabby Weld, Judy Goldsmith:
Topological Value Iteration Algorithms. CoRR abs/1401.3910 (2014) - 2013
- [j37]Judy Goldsmith, Jörg Rothe:
Algorithms, approximation, and empirical studies in behavioral and computational social choice - Preface. Ann. Math. Artif. Intell. 68(1-3): 3-4 (2013) - [j36]Thomas Dodson, Nicholas Mattei, Joshua T. Guerin, Judy Goldsmith:
An English-Language Argumentation Interface for Explanation Generation with Markov Decision Processes in the Domain of Academic Advising. ACM Trans. Interact. Intell. Syst. 3(3): 18:1-18:30 (2013) - [c48]Joshua T. Guerin, Thomas E. Allen, Judy Goldsmith:
Learning CP-Net Preferences Online from User Queries. AAAI (Late-Breaking Developments) 2013 - [c47]Patrice Perny, Paul Weng, Judy Goldsmith, Josiah Hanna:
Approximation of Lorenz-Optimal Solutions in Multiobjective Markov Decision Processes. AAAI (Late-Breaking Developments) 2013 - [c46]Joshua T. Guerin, Thomas E. Allen, Judy Goldsmith:
Learning CP-net Preferences Online from User Queries. ADT 2013: 208-220 - [c45]Matthew Spradling, Judy Goldsmith, Xudong Liu, Chandrima Dadi, Zhiyu Li:
Roles and Teams Hedonic Game. ADT 2013: 351-362 - [c44]Cristina Cornelio, Judy Goldsmith, Nicholas Mattei, Francesca Rossi, Kristen Brent Venable:
Updates and Uncertainty in CP-Nets. Australasian Conference on Artificial Intelligence 2013: 301-312 - [c43]Radu Paul Mihail, Judy Goldsmith, Nathan Jacobs, Jerzy W. Jaromczyk:
Teaching graphics for games using Microsoft XNA. CGAMES 2013: 36-40 - [c42]Patrice Perny, Paul Weng, Judy Goldsmith, Josiah Hanna:
Approximation of Lorenz-Optimal Solutions in Multiobjective Markov Decision Processes. UAI 2013 - [p1]Tingjian Ge, Alex Dekhtyar, Judy Goldsmith:
Uncertain Data: Representations, Query Processing, and Applications. Advances in Probabilistic Databases for Uncertain Information Management 2013: 67-108 - [i13]Christopher Lusena, Tong Li, Shelia Sittinger, Chris Wells, Judy Goldsmith:
My Brain is Full: When More Memory Helps. CoRR abs/1301.6715 (2013) - [i12]Judy Goldsmith, Michael L. Littman, Martin Mundhenk:
The Complexity of Plan Existence and Evaluation in Probabilistic Domains. CoRR abs/1302.1540 (2013) - [i11]Patrice Perny, Paul Weng, Judy Goldsmith, Josiah Hanna:
Approximation of Lorenz-Optimal Solutions in Multiobjective Markov Decision Processes. CoRR abs/1309.6856 (2013) - [i10]Nicholas Mattei, Thomas Dodson, Joshua T. Guerin, Judy Goldsmith, Joan M. Mazur:
Lessons Learned from Creating a Course Advising Tool. CoRR abs/1312.4113 (2013) - 2012
- [c41]Nicholas Scott Mattei, Judy Goldsmith, Andrew Klapper:
On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information. AAAI Fall Symposium: Machine Aggregation of Human Judgment 2012 - [c40]Nicholas Mattei, Judy Goldsmith, Andrew Klapper:
On the Complexity of Bribery and Manipulation in Tournaments with Uncertain Information. FLAIRS 2012 - [c39]Rebecca Bates, Judy Goldsmith, Rosalyn Berne, Valerie Summet, Nanette Veilleux:
Science fiction in computer science education. SIGCSE 2012: 161-162 - 2011
- [j35]Peng Dai, Mausam, Daniel S. Weld, Judy Goldsmith:
Topological Value Iteration Algorithms. J. Artif. Intell. Res. 42: 181-209 (2011) - [c38]Thomas Dodson, Nicholas Mattei, Judy Goldsmith:
A Natural Language Argumentation Interface for Explanation Generation in Markov Decision Processes. ADT 2011: 42-55 - [c37]Judy Goldsmith, Nicholas Mattei:
Science Fiction as an Introduction to AI Research. EAAI 2011: 1717-1722 - [c36]Thomas Dodson, Nicholas Mattei, Judy Goldsmith:
A Natural Language Argumentation Interface for Explanation Generation in Markov Decision Processes. ExaCt 2011: 1-10 - [i9]Judy Goldsmith, Christopher Lusena, Martin Mundhenk:
Nonapproximability Results for Partially Observable Markov Decision Processes. CoRR abs/1106.0242 (2011) - 2010
- [j34]Peng Dai, Judy Goldsmith:
Ranking policies in discrete Markov decision processes. Ann. Math. Artif. Intell. 59(1): 107-123 (2010) - [j33]Judy Goldsmith, Kathryn B. Laskey:
Introduction to the special issue on Bayesian model views. Int. J. Approx. Reason. 51(2): 165-166 (2010) - [j32]Liangrong Yi, Judy Goldsmith:
Decision-theoretic harmony: A first step. Int. J. Approx. Reason. 51(2): 263-274 (2010)
2000 – 2009
- 2009
- [j31]Alex Dekhtyar, Judy Goldsmith, Beth Goldstein, Krol Kevin Mathias, Cynthia Isenhour:
Planning for success: The interdisciplinary approach to building Bayesian models. Int. J. Approx. Reason. 50(3): 416-428 (2009) - [c35]Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe:
The Complexity of Probabilistic Lobbying. ADT 2009: 86-97 - [c34]Peng Dai, Judy Goldsmith:
Finding Best k Policies. ADT 2009: 144-155 - [c33]John Mark Agosta, Russell G. Almond, Dennis M. Buede, Marek J. Druzdzel, Judy Goldsmith, Silja Renooij:
Workshop summary: Seventh annual workshop on Bayes applications. ICML 2009: 3 - [i8]Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe:
The Complexity of Probabilistic Lobbying. CoRR abs/0906.4431 (2009) - 2008
- [j30]Judy Goldsmith, Ulrich Junker:
Preference Handling for Artificial Intelligence. AI Mag. 29(4): 9-12 (2008) - [j29]Judy Goldsmith, Matthias Hagen, Martin Mundhenk:
Complexity of DNF minimization and isomorphism testing for monotone formulas. Inf. Comput. 206(6): 760-775 (2008) - [j28]Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson:
The Computational Complexity of Dominance and Consistency in CP-Nets. J. Artif. Intell. Res. 33: 403-432 (2008) - [c32]Peng Dai, Alexander L. Strehl, Judy Goldsmith:
Expediting RL by using graphical structures. AAMAS (3) 2008: 1325-1328 - [c31]David Krieg, Patricia Jacovino, Judy Goldsmith, Beth Goldstein:
A bottom-up approach to welfare case management decision support software. DG.O 2008: 397-398 - [c30]Liangrong Yi, Raphael A. Finkel, Judy Goldsmith:
Planning for Welfare to Work. FLAIRS 2008: 696-701 - 2007
- [j27]Sarabjot Singh Anand, Daniel Bahls, Catherina Burghart, Mark H. Burstein, Huajun Chen, John Collins, Thomas G. Dietterich, Jon Doyle, Chris Drummond, William Elazmeh, Christopher W. Geib, Judy Goldsmith, Hans W. Guesgen, Jim Hendler, Dietmar Jannach, Nathalie Japkowicz, Ulrich Junker, Gal A. Kaminka, Alfred Kobsa, Jérôme Lang, David B. Leake, Lundy Lewis, Gerard Ligozat, Sofus A. Macskassy, Drew V. McDermott, Ted Metzler, Bamshad Mobasher, Ullas Nambiar, Zaiqing Nie, Klas Orsvärn, Barry O'Sullivan, David V. Pynadath, Jochen Renz, Rita V. Rodríguez, Thomas Roth-Berghofer, Stefan Schulz, Rudi Studer, Yimin Wang, Michael P. Wellman:
AAAI-07 Workshop Reports. AI Mag. 28(4): 119-128 (2007) - [c29]Peng Dai, Judy Goldsmith:
Multi-Threaded BLAO* Algorithm. FLAIRS 2007: 56-61 - [c28]Peng Dai, Judy Goldsmith:
Topological Value Iteration Algorithm for Markov Decision Processes. IJCAI 2007: 1860-1865 - [c27]Judy Goldsmith, Martin Mundhenk:
Competition Adds Complexity. NIPS 2007: 561-568 - [c26]Liangrong Yi, Judy Goldsmith:
Automatic Generation of Four-part Harmony. BMA 2007 - [e1]Kathryn B. Laskey, Suzanne M. Mahoney, Judy Goldsmith:
Proceedings of the Fifth UAI Bayesian Modeling Applications Workshop (UAI-AW 2007), Vancouver, British Columbia, Canada, July 19, 2007. CEUR Workshop Proceedings 268, CEUR-WS.org 2007 [contents] - 2006
- [c25]Krol Kevin Mathias, Casey Lengacher, Derek Williams, Austin Cornett, Alex Dekhtyar, Judy Goldsmith:
Factored MDP Elicitation and Plan Display. AAAI 2006: 1945-1946 - 2005
- [j26]Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith:
A Framework for Management of Semistructured Probabilistic Data. J. Intell. Inf. Syst. 25(3): 293-332 (2005) - [j25]Judy Goldsmith, Robert H. Sloan:
New Horn Revision Algorithms. J. Mach. Learn. Res. 6: 1919-1938 (2005) - [c24]Alex Dekhtyar, Raphael A. Finkel, Judy Goldsmith, Beth Goldstein, Cynthia Isenhour:
Adaptive Decision Support for Planning under Hard and Soft Constraints. AAAI Spring Symposium: Challenges to Decision Support in a Changing World 2005: 17-22 - [c23]Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson:
The computational complexity of dominance and consistency in CP-nets. IJCAI 2005: 144-149 - [c22]Judy Goldsmith, Matthias Hagen, Martin Mundhenk:
Complexity of DNF and Isomorphism of Monotone Formulas. MFCS 2005: 410-421 - 2004
- [j24]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) - [j23]Wenzhong Zhao, Jiangyu Li, Erik Jessup, Alex Dekhtyar, Judy Goldsmith:
Building Bayes Nets with Semistructured Probabilistic DBMS. EMISA Forum 24(1): 28-29 (2004) - [j22]Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith:
Databases for interval probabilities. Int. J. Intell. Syst. 19(9): 789-815 (2004) - [c21]Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán:
New Revision Algorithms. ALT 2004: 395-409 - [i7]Judy Goldsmith:
Preferences and Domination. Algebraic Methods in Computational Complexity 2004 - 2003
- [j21]Alex Dekhtyar, Judy Goldsmith, Janice L. Pearce:
When Plans Distinguish Bayes Nets. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 11(Supplement-2): 1-24 (2003) - [c20]Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith:
Query Algebra Operations for Interval Probabilities. DEXA 2003: 527-536 - [c19]Judy Goldsmith, Alex Dekhtyar, Wenzhong Zhao:
Can Probabilistic Databases Help Elect Qualified Officials? FLAIRS 2003: 501-505 - [c18]Venkata Deepti Kiran Bhuma, Judy Goldsmith:
Bidirectional LAO* algorithm. IICAI 2003: 980-992 - [c17]Jignesh Doshi, Judy Goldsmith:
Revising Unique Explanations. MAICS 2003: 24-30 - [i6]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
- [j20]Judy Goldsmith, Robert H. Sloan, György Turán:
Theory Revision with Queries: DNF Formulas. Mach. Learn. 47(2-3): 257-295 (2002) - 2001
- [j19]Christopher Lusena, Judy Goldsmith, Martin Mundhenk:
Nonapproximability Results for Partially Observable Markov Decision Processes. J. Artif. Intell. Res. 14: 83-103 (2001) - [c16]Alex Dekhtyar, Judy Goldsmith, Sean R. Hawkes:
Semistructured Probalistic Databases. SSDBM 2001: 36-45 - 2000
- [j18]Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe:
Tally NP Sets and Easy Census Functions. Inf. Comput. 158(1): 29-52 (2000) - [j17]Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender:
Complexity of finite-horizon Markov decision process problems. J. ACM 47(4): 681-720 (2000) - [j16]Judy Goldsmith:
Book review: Theory of Computing: A Gentle Introduction by Kinber and Smith (Prentice-Hall, 2001). SIGACT News 31(3): 19-22 (2000) - [c15]Judy Goldsmith, Robert H. Sloan:
The Complexity of Model Aggregation. AIPS 2000: 122-129 - [c14]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 - [c13]Judy Goldsmith, Robert H. Sloan:
More theory revision with queries (extended abstract). STOC 2000: 441-448 - [i5]Christopher Lusena, Judy Goldsmith, Martin Mundhenk:
Nonapproximability Results for Partially Observable Markov Decision Processes. Universität Trier, Mathematik/Informatik, Forschungsbericht 00-12 (2000)
1990 – 1999
- 1999
- [j15]John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan:
An Algorithm for the Class of Pure Implicational Formulas. Discret. Appl. Math. 96-97: 89-106 (1999) - [c12]Christopher Lusena, Tong Li, Shelia Sittinger, Chris Wells, Judy Goldsmith:
My Brain is Full: When More Memory Helps. UAI 1999: 374-381 - [i4]Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender:
Complexity of Finite-Horizon Markov Decision process Problems. Universität Trier, Mathematik/Informatik, Forschungsbericht 99-25 (1999) - 1998
- [j14]Michael L. Littman, Judy Goldsmith, Martin Mundhenk:
The Computational Complexity of Probabilistic Planning. J. Artif. Intell. Res. 9: 1-36 (1998) - [j13]Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith:
Sharply Bounded Alternation and Quasilinear Time. Theory Comput. Syst. 31(2): 187-214 (1998) - [j12]Richard Beigel, Judy Goldsmith:
Downward Separation Fails Catastrophically for Limited Nondeterminism Classes. SIAM J. Comput. 27(5): 1420-1429 (1998) - [j11]Lance Fortnow, Judy Goldsmith, Matthew A. Levy, Stephen R. Mahaney:
L-Printable Sets. SIAM J. Comput. 28(1): 137-151 (1998) - [c11]Judy Goldsmith, Martin Mundhenk:
Complexity Issues in Markov Decision Processes. CCC 1998: 272-280 - [c10]Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe:
Tally NP Sets and Easy Census Functions. MFCS 1998: 483-492 - [i3]Michael L. Littman, Judy Goldsmith, Martin Mundhenk:
The Computational Complexity of Probabilistic Planning. CoRR cs.AI/9808101 (1998) - [i2]Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe:
Tally NP Sets and Easy Census Functions. CoRR cs.CC/9809002 (1998) - 1997
- [c9]Martin Mundhenk, Judy Goldsmith, Eric Allender:
The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. MFCS 1997: 129-138 - [c8]Judy Goldsmith, Michael L. Littman, Martin Mundhenk:
The Complexity of Plan Existence and Evaluation in Probabilistic Domains. UAI 1997: 182-189 - 1996
- [j10]Judy Goldsmith, Steven Homer:
Scalability and the Isomorphism Problem. Inf. Process. Lett. 57(3): 137-143 (1996) - [j9]Judy Goldsmith, Matthew A. Levy, Martin Mundhenk:
Limited nondeterminism. SIGACT News 27(2): 20-29 (1996) - [j8]Eric Allender, Joan Feigenbaum, Judy Goldsmith, Toniann Pitassi, Steven Rudich:
The future of computational complexity theory: part II. SIGACT News 27(4): 3-7 (1996) - [c7]Lance Fortnow, Judy Goldsmith, Stephen R. Mahaney:
L-Printable Sets. CCC 1996: 97-106 - [c6]Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith:
Sharply Bounded Alternation within P. DMTCS 1996: 131-146 - [i1]Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith:
Sharply Bounded Alternation within P. Electron. Colloquium Comput. Complex. TR96 (1996) - 1994
- [j7]Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith:
How hard are n2-hard problems? SIGACT News 25(2): 83-85 (1994) - [c5]Richard Beigel, Judy Goldsmith:
Downward separation fails catastrophically for limited nondeterminism classes. SCT 1994: 134-138 - 1993
- [j6]Judy Goldsmith, Deborah Joseph:
Relativized Isomorphisms of NP-Complete Sets. Comput. Complex. 3: 186-205 (1993) - [j5]Judy Goldsmith, Deborah Joseph, Paul Young:
Using Self-Reducibilities to Characterize Polynomial Time. Inf. Comput. 104(2): 288-308 (1993) - [j4]Judy Goldsmith, Deborah Joseph, Paul Young:
A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy. J. Comput. Syst. Sci. 46(3): 349-362 (1993) - [j3]Jonathan F. Buss, Judy Goldsmith:
Nondeterminism Within P. SIAM J. Comput. 22(3): 560-572 (1993) - 1992
- [j2]Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen:
Polynomial-Time Compression. Comput. Complex. 2: 18-39 (1992) - 1991
- [j1]Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young:
Near-Testable Sets. SIAM J. Comput. 20(3): 506-523 (1991) - [c4]Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen:
On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. FSTTCS 1991: 212-223 - [c3]Jonathan F. Buss, Judy Goldsmith:
Nondterminism Within P. STACS 1991: 348-359
1980 – 1989
- 1987
- [c2]Judy Goldsmith, Deborah Joseph, Paul Young:
Self-Reducible, P-Selectlve, Near-Testable, Near-Testable, and P-Cheatable Sets: The Effect of Internal Structure on the Complexity of a Set. SCT 1987: 50-59 - 1986
- [c1]Judy Goldsmith, Deborah Joseph:
Three Results on the Polynomial Isomorphism of Complete Sets. FOCS 1986: 390-397
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 2025-04-16 22:21 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:
