Judy Goldsmith

	2009
70		Peng Dai, Judy Goldsmith: Finding Best k Policies. ADT 2009: 144-155
69		Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe: The Complexity of Probabilistic Lobbying. ADT 2009: 86-97
68		John Mark Agosta, Russell Almond, Dennis M. Buede, Marek J. Druzdzel, Judy Goldsmith, Silja Renooij: Workshop summary: Seventh annual workshop on Bayes applications. ICML 2009: 163
67		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)
66		Alex Dekhtyar, Judy Goldsmith, Beth Goldstein, Krol Kevin Mathias, Cynthia Isenhour: Planning for success: The interdisciplinary approach to building Bayesian models. Int. J. Approx. Reasoning 50(3): 416-428 (2009)
	2008
65		Peng Dai, Alexander L. Strehl, Judy Goldsmith: Expediting RL by using graphical structures. AAMAS (3) 2008: 1325-1328
64		David Krieg, Patricia Jacovino, Judy Goldsmith, Beth Goldstein: A bottom-up approach to welfare case management decision support software. DG.O 2008: 397-398
63		Liangrong Yi, Raphael A. Finkel, Judy Goldsmith: Planning for Welfare to Work. FLAIRS Conference 2008: 696-701
62		Judy Goldsmith, Matthias Hagen, Martin Mundhenk: Complexity of DNF minimization and isomorphism testing for monotone formulas. Inf. Comput. 206(6): 760-775 (2008)
61		Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson: The Computational Complexity of Dominance and Consistency in CP-Nets. J. Artif. Intell. Res. (JAIR) 33: 403-432 (2008)
	2007
60		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-WS.org 2007
59		Liangrong Yi, Judy Goldsmith: Automatic Generation of Four-part Harmony. BMA 2007
58		Peng Dai, Judy Goldsmith: Multi-Threaded BLAO* Algorithm. FLAIRS Conference 2007: 56-61
57		Peng Dai, Judy Goldsmith: Topological Value Iteration Algorithm for Markov Decision Processes. IJCAI 2007: 1860-1865
56		Judy Goldsmith, Martin Mundhenk: Competition Adds Complexity. NIPS 2007
	2006
55		Krol Kevin Mathias, Casey Lengacher, Derek Williams, Austin Cornett, Alex Dekhtyar, Judy Goldsmith: Factored MDP Elicitation and Plan Display. AAAI 2006
	2005
54		Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson: The computational complexity of dominance and consistency in CP-nets. IJCAI 2005: 144-149
53		Judy Goldsmith, Matthias Hagen, Martin Mundhenk: Complexity of DNF and Isomorphism of Monotone Formulas. MFCS 2005: 410-421
52		Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith: A Framework for Management of Semistructured Probabilistic Data. J. Intell. Inf. Syst. 25(3): 293-332 (2005)
51		Judy Goldsmith, Robert H. Sloan: New Horn Revision Algorithms. Journal of Machine Learning Research 6: 1919-1938 (2005)
	2004
50		Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán: New Revision Algorithms. ALT 2004: 395-409
49		Judy Goldsmith: Preferences and Domination. Algebraic Methods in Computational Complexity 2004
48		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)
47		Wenzhong Zhao, Jiangyu Li, Erik Jessup, Alex Dekhtyar, Judy Goldsmith: Building Bayes Nets with Semistructured Probabilistic DBMS. EMISA Forum 24(1): 28-29 (2004)
46		Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith: Databases for interval probabilities. Int. J. Intell. Syst. 19(9): 789-815 (2004)
	2003
45		Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith: Query Algebra Operations for Interval Probabilities. DEXA 2003: 527-536
44		Judy Goldsmith, Alex Dekhtyar, Wenzhong Zhao: Can Probabilistic Databases Help Elect Qualified Officials? FLAIRS Conference 2003: 501-505
43		Venkata Deepti Kiran Bhuma, Judy Goldsmith: Bidirectional LAO* algorithm. IICAI 2003: 980-992
42		Jignesh Doshi, Judy Goldsmith: Revising Unique Explanations. MAICS 2003: 24-30
41		Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán: Theory Revision with Queries: Horn, Read-once, and Parity Formulas Electronic Colloquium on Computational Complexity (ECCC)(039): (2003)
40		Alex Dekhtyar, Judy Goldsmith, Janice L. Pearce: When Plans Distinguish Bayes Nets. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 11(Supplement-2): 1-24 (2003)
	2002
39		Judy Goldsmith, Robert H. Sloan, György Turán: Theory Revision with Queries: DNF Formulas. Machine Learning 47(2-3): 257-295 (2002)
	2001
38		Alex Dekhtyar, Judy Goldsmith, Sean R. Hawkes: Semistructured Probalistic Databases. SSDBM 2001: 36-45
37		Christopher Lusena, Judy Goldsmith, Martin Mundhenk: Nonapproximability Results for Partially Observable Markov Decision Processes. J. Artif. Intell. Res. (JAIR) 14: 83-103 (2001)
	2000
36		Judy Goldsmith, Robert H. Sloan: The Complexity of Model Aggregation. AIPS 2000: 122-129
35		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
34		Judy Goldsmith, Robert H. Sloan: More theory revision with queries (extended abstract). STOC 2000: 441-448
33		Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe: Tally NP Sets and Easy Census Functions. Inf. Comput. 158(1): 29-52 (2000)
32		Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender: Complexity of finite-horizon Markov decision process problems. J. ACM 47(4): 681-720 (2000)
31		Judy Goldsmith: Book review: Theory of Computing: A Gentle Introduction by Kinber and Smith (Prentice-Hall, 2001). SIGACT News 31(3): 19-22 (2000)
30		Christopher Lusena, Judy Goldsmith, Martin Mundhenk: Nonapproximability Results for Partially Observable Markov Decision Processes Universität Trier, Mathematik/Informatik, Forschungsbericht 00-12: (2000)
	1999
29		Christopher Lusena, Tong Li, Shelia Sittinger, Chris Wells, Judy Goldsmith: My Brain is Full: When More Memory Helps. UAI 1999: 374-381
28		John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan: An Algorithm for the Class of Pure Implicational Formulas. Discrete Applied Mathematics 96-97: 89-106 (1999)
27		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
26		Judy Goldsmith, Martin Mundhenk: Complexity Issues in Markov Decision Processes. IEEE Conference on Computational Complexity 1998: 272-280
25		Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe: Tally NP Sets and Easy Census Functions. MFCS 1998: 483-492
24		Michael L. Littman, Judy Goldsmith, Martin Mundhenk: The Computational Complexity of Probabilistic Planning CoRR cs.AI/9808101: (1998)
23		Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe: Tally NP Sets and Easy Census Functions CoRR cs.CC/9809002: (1998)
22		Michael L. Littman, Judy Goldsmith, Martin Mundhenk: The Computational Complexity of Probabilistic Planning. J. Artif. Intell. Res. (JAIR) 9: 1-36 (1998)
21		Richard Beigel, Judy Goldsmith: Downward Separation Fails Catastrophically for Limited Nondeterminism Classes. SIAM J. Comput. 27(5): 1420-1429 (1998)
20		Lance Fortnow, Judy Goldsmith, Matthew A. Levy, Stephen R. Mahaney: L-Printable Sets. SIAM J. Comput. 28(1): 137-151 (1998)
19		Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith: Sharply Bounded Alternation and Quasilinear Time. Theory Comput. Syst. 31(2): 187-214 (1998)
	1997
18		Martin Mundhenk, Judy Goldsmith, Eric Allender: The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. MFCS 1997: 129-138
17		Judy Goldsmith, Michael L. Littman, Martin Mundhenk: The Complexity of Plan Existence and Evaluation in Probabilistic Domains. UAI 1997: 182-189
	1996
16		Lance Fortnow, Judy Goldsmith, Stephen R. Mahaney: L-Printable Sets. IEEE Conference on Computational Complexity 1996: 97-106
15		Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith: Sharply Bounded Alternation within P Electronic Colloquium on Computational Complexity (ECCC) 3(11): (1996)
14		Judy Goldsmith, Steven Homer: Scalability and the Isomorphism Problem. Inf. Process. Lett. 57(3): 137-143 (1996)
13		Judy Goldsmith, Matthew A. Levy, Martin Mundhenk: Limited nondeterminism. SIGACT News 27(2): 20-29 (1996)
12		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)
	1994
11		Richard Beigel, Judy Goldsmith: Downward separation fails catastrophically for limited nondeterminism classes. Structure in Complexity Theory Conference 1994: 134-138
10		Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith: How hard are n2-hard problems? SIGACT News 25(2): 83-85 (1994)
	1993
9		Judy Goldsmith, Deborah Joseph: Relativized Isomorphisms of NP-Complete Sets. Computational Complexity 3: 186-205 (1993)
8		Judy Goldsmith, Deborah Joseph, Paul Young: Using Self-Reducibilities to Characterize Polynomial Time Inf. Comput. 104(2): 288-308 (1993)
7		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)
6		Jonathan F. Buss, Judy Goldsmith: Nondeterminism Within P. SIAM J. Comput. 22(3): 560-572 (1993)
	1992
5		Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen: Polynomial-Time Compression. Computational Complexity 2: 18-39 (1992)
	1991
4		Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen: On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. FSTTCS 1991: 212-223
3		Jonathan F. Buss, Judy Goldsmith: Nondterminism Within P. STACS 1991: 348-359
2		Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young: Near-Testable Sets. SIAM J. Comput. 20(3): 506-523 (1991)
	1986
1		Judy Goldsmith, Deborah Joseph: Three Results on the Polynomial Isomorphism of Complete Sets FOCS 1986: 390-397

Coauthor Index

1	John Mark Agosta	[68]
2	Eric Allender	[12] [18] [27] [32]
3	Russell Almond	[68]
4	Richard Beigel	[11] [21]
5	Venkata Deepti Kiran Bhuma	[43]
6	Stephen A. Bloch	[10] [15] [19]
7	Dennis M. Buede	[68]
8	Jonathan F. Buss	[3] [6] [10] [15] [19]
9	Austin Cornett	[55]
10	Peng Dai	[57] [58] [65] [70]
11	Alex Dekhtyar	[38] [40] [44] [45] [46] [47] [52] [55] [66]
12	Jignesh Doshi	[42]
13	Marek J. Druzdzel	[68]
14	Gábor Erdélyi	[67] [69]
15	Joan Feigenbaum	[12]
16	Henning Fernau	[67] [69]
17	Raphael A. Finkel	[63]
18	Lance Fortnow	[16] [20]
19	John V. Franco	[28]
20	Beth Goldstein	[64] [66]
21	Matthias Hagen	[53] [62]
22	Sean R. Hawkes	[38]
23	Lane A. Hemaspaandra (Lane A. Hemachandra)	[2] [4] [5]
24	Steven Homer	[14]
25	Cynthia Isenhour	[66]
26	Patricia Jacovino	[64]
27	Erik Jessup	[47]
28	Deborah Joseph	[1] [2] [7] [8] [9]
29	David Krieg	[64]
30	Kenneth Kunen	[4] [5]
31	Jérôme Lang	[54] [61]
32	Kathryn B. Laskey	[60]
33	Casey Lengacher	[55]
34	Matthew A. Levy	[13] [20]
35	Jiangyu Li	[47]
36	Tong Li	[29]
37	Michael L. Littman	[17] [22] [24]
38	Christopher Lusena	[27] [29] [30] [32] [37]
39	Stephen R. Mahaney	[16] [20]
40	Suzanne M. Mahoney	[60]
41	Krol Kevin Mathias	[55] [66]
42	Nicholas Mattei	[67] [69]
43	Martin Mundhenk	[13] [17] [18] [22] [24] [26] [27] [30] [32] [37] [53] [56] [62]
44	Mitsunori Ogihara (Mitsunori Ogiwara)	[23] [25] [33]
45	Janice L. Pearce	[40]
46	Toniann Pitassi	[12]
47	Daniel Raible	[67] [69]
48	Silja Renooij	[68]
49	Jörg Rothe	[23] [25] [33] [67] [69]
50	Steven Rudich	[12]
51	John S. Schlipf	[28]
52	Shelia Sittinger	[29]
53	Robert H. Sloan	[34] [35] [36] [39] [41] [48] [50] [51]
54	Ewald Speckenmeyer	[28]
55	Alexander L. Strehl	[65]
56	Ramjee P. Swaminathan	[28]
57	Balázs Szörényi	[35] [41] [48] [50]
58	Miroslaw Truszczynski	[54] [61]
59	György Turán	[35] [39] [41] [48] [50]
60	Chris Wells	[29]
61	Derek Williams	[55]
62	Nic Wilson	[54] [61]
63	Liangrong Yi	[59] [63]
64	Paul Young	[2] [7] [8]
65	Wenzhong Zhao	[44] [45] [46] [47] [52]

Colors in the list of coauthors