Judy Goldsmith

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

Colors in the list of coauthors