| Year |
Citation |
Score |
| 2018 |
Burton E, Goldsmith J, Mattei N. How to teach computer ethics through science fiction Communications of the Acm. 61: 54-64. DOI: 10.1145/3154485 |
0.579 |
|
| 2017 |
Allen TE, Goldsmith J, Justice HE, Mattei N, Raines K. Uniform Random Generation and Dominance Testing for CP-Nets Journal of Artificial Intelligence Research. 59: 771-813. DOI: 10.1613/Jair.5455 |
0.606 |
|
| 2017 |
Burton E, Goldsmith J, Koenig S, Kuipers B, Mattei N, Walsh T. Ethical Considerations in Artificial Intelligence Courses Ai Magazine. 38: 22. DOI: 10.1609/Aimag.V38I2.2731 |
0.596 |
|
| 2017 |
Siler C, Miles LH, Goldsmith J. The Complexity of Campaigning Annales Des TéLéCommunications. 153-165. DOI: 10.1007/978-3-319-67504-6_11 |
0.422 |
|
| 2014 |
Goldsmith J, Mattei N. Fiction as an introduction to computer science research Acm Transactions On Computing Education. 14. DOI: 10.1145/2576873 |
0.582 |
|
| 2014 |
Binkele-Raible D, Erdélyi G, Fernau H, Goldsmith J, Mattei N, Rothe J. The complexity of probabilistic lobbying Discrete Optimization. 11: 1-21. DOI: 10.1016/J.Disopt.2013.10.003 |
0.658 |
|
| 2013 |
Dodson T, Mattei N, Guerin JT, Goldsmith J. An english-language argumentation interface for explanation generation with Markov decision processes in the domain of academic advising Acm Transactions On Interactive Intelligent Systems. 3. DOI: 10.1145/2513564 |
0.654 |
|
| 2012 |
Mattei N, Goldsmith J, Klapper A. On the complexity of bribery and manipulation in tournaments with uncertain information Proceedings of the 25th International Florida Artificial Intelligence Research Society Conference, Flairs-25. 549-554. DOI: 10.1016/J.Jal.2015.03.004 |
0.672 |
|
| 2010 |
Yi L, Goldsmith J. Decision-theoretic harmony: a first step International Journal of Approximate Reasoning. 51: 263-274. DOI: 10.1016/J.Ijar.2009.06.014 |
0.51 |
|
| 2010 |
Dai P, Goldsmith J. Ranking policies in discrete Markov decision processes Annals of Mathematics and Artificial Intelligence. 59: 107-123. DOI: 10.1007/S10472-010-9216-8 |
0.416 |
|
| 2009 |
Dekhtyar A, Goldsmith J, Goldstein B, Mathias KK, Isenhour C. Planning for success: The interdisciplinary approach to building Bayesian models International Journal of Approximate Reasoning. 50: 416-428. DOI: 10.1016/J.Ijar.2008.05.005 |
0.714 |
|
| 2008 |
Goldsmith J, Lang J, Truszczynski M, Wilson N. The computational complexity of dominance and consistency in CP-Nets Journal of Artificial Intelligence Research. 33: 403-432. DOI: 10.1613/Jair.2627 |
0.41 |
|
| 2008 |
Goldsmith J, Hagen M, Mundhenk M. Complexity of DNF minimization and isomorphism testing for monotone formulas Information & Computation. 206: 760-775. DOI: 10.1016/J.Ic.2008.03.002 |
0.359 |
|
| 2003 |
Dekhtyar A, Goldsmith J, Pearce JL. When plans distinguish Bayes nets International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems. 11: 1-24. DOI: 10.1142/S0218488503002417 |
0.391 |
|
| 2001 |
Lusena C, Goldsmith J, Mundhenk M. Nonapproximability results for partially observable Markov decision processes Journal of Artificial Intelligence Research. 14: 83-103. DOI: 10.1613/Jair.714 |
0.66 |
|
| 2000 |
Mundhenk M, Goldsmith J, Lusena C, Allender E. Complexity of finite-horizon Markov decision process problems Journal of the Acm. 47: 681-720. DOI: 10.1145/347476.347480 |
0.665 |
|
| 1998 |
Littman ML, Goldsmith J, Mundhenk M. The computational complexity of probabilistic planning Journal of Artificial Intelligence Research. 9: 1-36. DOI: 10.1613/Jair.505 |
0.352 |
|
| 1998 |
Bloch SA, Buss JF, Goldsmith J. Sharply Bounded Alternation and Quasilinear Time Theory of Computing Systems \/ Mathematical Systems Theory. 31: 187-214. DOI: 10.1007/S002240000085 |
0.351 |
|
| 1998 |
Goldsmith J, Ogihara M, Rothe J. Tally NP sets and easy census functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1450: 483-492. DOI: 10.1006/Inco.1999.2810 |
0.33 |
|
| 1996 |
Allender E, Feigenbaum J, Goldsmith J, Pitassi T, Rudich S. The future of computational complexity theory: part II Acm Sigact News. 27: 3-7. DOI: 10.1145/242581.242582 |
0.303 |
|
| 1996 |
Goldsmith J, Homer S. Scalability and the isomorphism problem Information Processing Letters. 57: 137-143. DOI: 10.1016/0020-0190(95)00204-9 |
0.301 |
|
| 1993 |
Buss JF, Goldsmith J. Nondeterminism within P Siam Journal On Computing. 22: 560-572. DOI: 10.1137/0222038 |
0.308 |
|
| 1992 |
Goldsmith J, Kunen K, Hemachandra LA. Polynomial-time compression Computational Complexity. 2: 18-39. DOI: 10.1007/Bf01276437 |
0.329 |
|
| 1991 |
Goldsmith J, Hemachandra LA, Joseph D, Young P. Near-Testable Sets Siam Journal On Computing. 20: 506-523. DOI: 10.1137/0220033 |
0.33 |
|
| Show low-probability matches. |