The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Judy Goldsmith: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jonathan F. Buss, Judy Goldsmith
    Nondeterminism Within P. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:3, pp:560-572 [Journal]
  2. Krol Kevin Mathias, Casey Lengacher, Derek Williams, Austin Cornett, Alex Dekhtyar, Judy Goldsmith
    Factored MDP Elicitation and Plan Display. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  3. Judy Goldsmith, Robert H. Sloan
    The Complexity of Model Aggregation. [Citation Graph (0, 0)][DBLP]
    AIPS, 2000, pp:122-129 [Conf]
  4. Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
    New Revision Algorithms. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:395-409 [Conf]
  5. Richard Beigel, Judy Goldsmith
    Downward separation fails catastrophically for limited nondeterminism classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:134-138 [Conf]
  6. Lance Fortnow, Judy Goldsmith, Stephen R. Mahaney
    L-Printable Sets. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:97-106 [Conf]
  7. Judy Goldsmith, Martin Mundhenk
    Complexity Issues in Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:272-280 [Conf]
  8. Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
    Improved Algorithms for Theory Revision with Queries. [Citation Graph (0, 0)][DBLP]
    COLT, 2000, pp:236-247 [Conf]
  9. Judy Goldsmith
    Preferences and Domination. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods in Computational Complexity, 2004, pp:- [Conf]
  10. Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith
    Query Algebra Operations for Interval Probabilities. [Citation Graph (0, 0)][DBLP]
    DEXA, 2003, pp:527-536 [Conf]
  11. Judy Goldsmith, Alex Dekhtyar, Wenzhong Zhao
    Can Probabilistic Databases Help Elect Qualified Officials? [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2003, pp:501-505 [Conf]
  12. Judy Goldsmith, Deborah Joseph
    Three Results on the Polynomial Isomorphism of Complete Sets [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:390-397 [Conf]
  13. Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen
    On the Structure and Complexity of Infinite Sets with Minimal Perfect Hash Functions. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:212-223 [Conf]
  14. Venkata Deepti Kiran Bhuma, Judy Goldsmith
    Bidirectional LAO* algorithm. [Citation Graph (0, 0)][DBLP]
    IICAI, 2003, pp:980-992 [Conf]
  15. Judy Goldsmith, Jérôme Lang, Miroslaw Truszczynski, Nic Wilson
    The computational complexity of dominance and consistency in CP-nets. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:144-149 [Conf]
  16. Peng Dai, Judy Goldsmith
    Topological Value Iteration Algorithm for Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:1860-1865 [Conf]
  17. Jignesh Doshi, Judy Goldsmith
    Revising Unique Explanations. [Citation Graph (0, 0)][DBLP]
    MAICS, 2003, pp:24-30 [Conf]
  18. Judy Goldsmith, Matthias Hagen, Martin Mundhenk
    Complexity of DNF and Isomorphism of Monotone Formulas. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:410-421 [Conf]
  19. Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
    Tally NP Sets and Easy Census Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:483-492 [Conf]
  20. Martin Mundhenk, Judy Goldsmith, Eric Allender
    The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:129-138 [Conf]
  21. Alex Dekhtyar, Judy Goldsmith, Sean R. Hawkes
    Semistructured Probalistic Databases. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2001, pp:36-45 [Conf]
  22. Jonathan F. Buss, Judy Goldsmith
    Nondterminism Within P. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:348-359 [Conf]
  23. Judy Goldsmith, Robert H. Sloan
    More theory revision with queries (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:441-448 [Conf]
  24. Judy Goldsmith, Michael L. Littman, Martin Mundhenk
    The Complexity of Plan Existence and Evaluation in Probabilistic Domains. [Citation Graph (0, 0)][DBLP]
    UAI, 1997, pp:182-189 [Conf]
  25. Christopher Lusena, Tong Li, Shelia Sittinger, Chris Wells, Judy Goldsmith
    My Brain is Full: When More Memory Helps. [Citation Graph (0, 0)][DBLP]
    UAI, 1999, pp:374-381 [Conf]
  26. Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
    Theory revision with queries: Horn, read-once, and parity formulas. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:156, n:2, pp:139-176 [Journal]
  27. Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen
    Polynomial-Time Compression. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:18-39 [Journal]
  28. Judy Goldsmith, Deborah Joseph
    Relativized Isomorphisms of NP-Complete Sets. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:186-205 [Journal]
  29. Michael L. Littman, Judy Goldsmith, Martin Mundhenk
    The Computational Complexity of Probabilistic Planning [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  30. Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
    Tally NP Sets and Easy Census Functions [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  31. John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan
    An Algorithm for the Class of Pure Implicational Formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:96, n:, pp:89-106 [Journal]
  32. Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán
    Theory Revision with Queries: Horn, Read-once, and Parity Formulas [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:039, pp:- [Journal]
  33. Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
    Sharply Bounded Alternation within P [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:11, pp:- [Journal]
  34. Judy Goldsmith, Deborah Joseph, Paul Young
    Using Self-Reducibilities to Characterize Polynomial Time [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:104, n:2, pp:288-308 [Journal]
  35. Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
    Tally NP Sets and Easy Census Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:158, n:1, pp:29-52 [Journal]
  36. Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith
    Databases for interval probabilities. [Citation Graph (0, 0)][DBLP]
    Int. J. Intell. Syst., 2004, v:19, n:9, pp:789-815 [Journal]
  37. Alex Dekhtyar, Judy Goldsmith, Janice L. Pearce
    When Plans Distinguish Bayes Nets. [Citation Graph (0, 0)][DBLP]
    International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2003, v:11, n:Supplement-2, pp:1-24 [Journal]
  38. Judy Goldsmith, Steven Homer
    Scalability and the Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:3, pp:137-143 [Journal]
  39. Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender
    Complexity of finite-horizon Markov decision process problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:4, pp:681-720 [Journal]
  40. Michael L. Littman, Judy Goldsmith, Martin Mundhenk
    The Computational Complexity of Probabilistic Planning. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 1998, v:9, n:, pp:1-36 [Journal]
  41. Christopher Lusena, Judy Goldsmith, Martin Mundhenk
    Nonapproximability Results for Partially Observable Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2001, v:14, n:, pp:83-103 [Journal]
  42. Judy Goldsmith, Deborah Joseph, Paul Young
    A Note on Bi-immunity and p-Closeness of p-Cheatable Sets in P/Poy. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:46, n:3, pp:349-362 [Journal]
  43. Wenzhong Zhao, Alex Dekhtyar, Judy Goldsmith
    A Framework for Management of Semistructured Probabilistic Data. [Citation Graph (0, 0)][DBLP]
    J. Intell. Inf. Syst., 2005, v:25, n:3, pp:293-332 [Journal]
  44. Judy Goldsmith, Robert H. Sloan
    New Horn Revision Algorithms. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2005, v:6, n:, pp:1919-1938 [Journal]
  45. Judy Goldsmith, Robert H. Sloan, György Turán
    Theory Revision with Queries: DNF Formulas. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2002, v:47, n:2-3, pp:257-295 [Journal]
  46. Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
    Sharply Bounded Alternation and Quasilinear Time. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:2, pp:187-214 [Journal]
  47. Richard Beigel, Judy Goldsmith
    Downward Separation Fails Catastrophically for Limited Nondeterminism Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:5, pp:1420-1429 [Journal]
  48. Lance Fortnow, Judy Goldsmith, Matthew A. Levy, Stephen R. Mahaney
    L-Printable Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:137-151 [Journal]
  49. Judy Goldsmith, Lane A. Hemachandra, Deborah Joseph, Paul Young
    Near-Testable Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:506-523 [Journal]
  50. Peng Dai, Judy Goldsmith
    Multi-Threaded BLAO* Algorithm. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2007, pp:56-61 [Conf]

  51. Expediting RL by using graphical structures. [Citation Graph (, )][DBLP]


  52. A bottom-up approach to welfare case management decision support software. [Citation Graph (, )][DBLP]


  53. Planning for Welfare to Work. [Citation Graph (, )][DBLP]


  54. Workshop summary: Seventh annual workshop on Bayes applications. [Citation Graph (, )][DBLP]


  55. Competition Adds Complexity. [Citation Graph (, )][DBLP]


  56. Automatic Generation of Four-part Harmony. [Citation Graph (, )][DBLP]


  57. The Complexity of Probabilistic Lobbying. [Citation Graph (, )][DBLP]


  58. Finding Best k Policies. [Citation Graph (, )][DBLP]


  59. The Complexity of Probabilistic Lobbying [Citation Graph (, )][DBLP]


  60. Building Bayes Nets with Semistructured Probabilistic DBMS. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002