| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Judy Goldsmith 27 Judy Goldsmith, Robert H. Sloan , György Turán : Theory Revision with Queries: DNF Formulas. Machine Learning 47 (2-3): 257-295 (2002) 26 Alex Dekhtyar , Judy Goldsmith, Sean R. Hawkes : Semistructured Probalistic Databases. SSDBM 2001 : 36-45 25 Judy Goldsmith, Robert H. Sloan : The Complexity of Model Aggregation. AIPS 2000 : 122-129 24 Judy Goldsmith, Robert H. Sloan , Balazs Szorenyi , György Turán : Improved Algorithms for Theory Revision with Queries. COLT 2000 : 236-247 23 Judy Goldsmith, Robert H. Sloan : More theory revision with queries (extended abstract). STOC 2000 : 441-448 22 Judy Goldsmith, Mitsunori Ogihara , Jörg Rothe : Tally NP Sets and Easy Census Functions. Information and Computation 158 (1): 29-52 (2000) 21 Martin Mundhenk , Judy Goldsmith, Christopher Lusena , Eric Allender : Complexity of finite-horizon Markov decision process problems. JACM 47 (4): 681-720 (2000) 20 Judy Goldsmith, Martin Mundhenk : Complexity Issues in Markov Decision Processes. IEEE Conference on Computational Complexity 1998 : 272-280 19 Judy Goldsmith, Mitsunori Ogihara , Jörg Rothe : Tally NP Sets and Easy Census Functions. MFCS 1998 : 483-492 18 Michael L. Littman , Judy Goldsmith, Martin Mundhenk : The Computational Complexity of Probabilistic Planning. JAIR 9 : 1-36 (1998) 17 Richard Beigel , Judy Goldsmith: Downward Separation Fails Catastrophically for Limited Nondeterminism Classes. SIAM J. Comput. 27 (5): 1420-1429 (1998) 16 Lance Fortnow , Judy Goldsmith, Matthew A. Levy , Stephen Mahaney : L-Printable Sets. SIAM J. Comput. 28 (1): 137-151 (1998) 15 Stephen A. Bloch , Jonathan F. Buss , Judy Goldsmith: Sharply Bounded Alternation and Quasilinear Time. Theory of Computing Systems 31 (2): 187-214 (1998) 14 Martin Mundhenk , Judy Goldsmith, Eric Allender : The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. MFCS 1997 : 129-138 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. Information Processing Letters 57 (3): 137-143 (1996) 10 Richard Beigel , Judy Goldsmith: Downward separation fails catastrophically for limited nondeterminism classes. Structure in Complexity Theory Conference 1994 : 134-138 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. Information and Computation 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. JCSS 46 (3): 349-362 (1993) 6 Jonathan F. Buss , Judy Goldsmith: Nondeterminism Within P. SIAM J. Comput. 22 (3): 560-572 (1993) 5 Judy Goldsmith, Lane A. Hemachandra , Kenneth Kunen : Polynomial-Time Compression. Computational Complexity 2 : 18-39 (1992) 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) 1 Judy Goldsmith, Deborah Joseph : Three Results on the Polynomial Isomorphism of Complete Sets. FOCS 1986 : 390-397  DiSC'02 © 2003 Association for Computing Machinery |
