Countries citing papers authored by Judy Goldsmith
Since
Specialization
Citations
This map shows the geographic impact of Judy Goldsmith's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Judy Goldsmith with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Judy Goldsmith more than expected).
This network shows the impact of papers produced by Judy Goldsmith. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Judy Goldsmith. The network helps show where Judy Goldsmith may publish in the future.
Co-authorship network of co-authors of Judy Goldsmith
This figure shows the co-authorship network connecting the top 25 collaborators of Judy Goldsmith.
A scholar is included among the top collaborators of Judy Goldsmith based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Judy Goldsmith. Judy Goldsmith is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Finkel, Raphael A., et al.. (2008). Planning for Welfare to Work. The Florida AI Research Society. 696–701.1 indexed citations
9.
Dai, Peng & Judy Goldsmith. (2007). Multi-Threaded BLAO* Algorithm.. The Florida AI Research Society. 84(2). 56–61.1 indexed citations
10.
Goldsmith, Judy & Robert H. Sloan. (2007). The AI conference paper assignment problem. National Conference on Artificial Intelligence.26 indexed citations
11.
Dekhtyar, Alex, et al.. (2006). Factored MDP elicitation and plan display. DigitalCommons - CalPoly (California State Polytechnic University). 1945–1946.1 indexed citations
12.
Goldsmith, Judy & Robert H. Sloan. (2005). New Horn Revision Algorithms. Journal of Machine Learning Research. 6(64). 1919–1938.3 indexed citations
13.
Goldsmith, Judy, et al.. (2003). Can Probabilistic Databases Help Elect Qualified Officials. DigitalCommons - CalPoly (California State Polytechnic University). 501–505.3 indexed citations
Goldsmith, Judy, et al.. (2003). Bidirectional LAO* algorithm.. Indian International Conference on Artificial Intelligence. 62(3). 980–992.3 indexed citations
16.
Goldsmith, Judy, et al.. (2002). POET: The Online Preference Elicitation Tool ∗. DigitalCommons - CalPoly (California State Polytechnic University). 80–86.6 indexed citations
17.
Goldsmith, Judy, Robert H. Sloan, Balázs Szörényi, & György Turán. (2000). Improved Algorithms for Theory Revision with Queries. Conference on Learning Theory. 236–247.1 indexed citations
18.
Goldsmith, Judy & Robert H. Sloan. (2000). More Theory Revision with Queries.3 indexed citations
19.
Goldsmith, Judy & Robert H. Sloan. (2000). The Complexity of Model Aggregation.5 indexed citations
20.
Goldsmith, Judy, Michael L. Littman, & Martin Mundhenk. (1997). The complexity of plan existence and evaluation in robabilistic domains. arXiv (Cornell University). 182–189.12 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.