default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames Glenn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Mykyta Solonko, James Glenn:
Toward Optimal Play of Cribbage. CoG 2023: 1-4- 2020
- [c10]James Glenn, Rob Brunstad:
Automatic Playtesting for Yahtzee. CoG 2020: 760-763 - [c9]Dave W. Binkley, James Glenn, Abdullah Alsharif, Phil McMinn:
An Investigation into the Effect of Control and Data Dependence Paths on Predicate Testability. SCAM 2020: 160-170
2010 – 2019
- 2014
- [c8]Frank Paiva, James Glenn, Karen Mazidi, Robert Talbot, Ruth Wylie, Michelene T. H. Chi, Erik Dutilly, Brandon Helding, Mingyu Lin, Susan Bell Trickett, Rodney D. Nielsen:
Comprehension SEEDING: Comprehension through Self Explanation, Enhanced Discussion, and INquiry Generation. Intelligent Tutoring Systems 2014: 283-293 - 2013
- [c7]James Glenn:
Evaluation scheduling in noisy environments. FOCI 2013: 68-75 - 2010
- [c6]James Glenn:
Optimizing Genetic Algorithm Parameters for a Stochastic Game. IJCCI (ICEC) 2010: 199-206
2000 – 2009
- 2008
- [j3]Haw-ren Fang, James Glenn, Clyde P. Kruskal:
Retrograde Approximation Algorithms for Jeopardy Stochastic Games. J. Int. Comput. Games Assoc. 31(2): 77-96 (2008) - [j2]William I. Gasarch, James Glenn, Clyde P. Kruskal:
Finding large 3-free sets I: The small n case. J. Comput. Syst. Sci. 74(4): 628-655 (2008) - [c5]James Glenn, Haw-ren Fang, Clyde P. Kruskal:
A Retrograde Approximation Algorithm for Multi-player Can't Stop. Computers and Games 2008: 252-263 - 2006
- [c4]James Glenn, Haw-ren Fang, Clyde P. Kruskal:
A Retrograde Approximation Algorithm for One-Player Can't Stop. Computers and Games 2006: 148-159 - [c3]Richard Beigel, William I. Gasarch, James Glenn:
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems. MFCS 2006: 146-156 - 2005
- [j1]James Glenn:
Review of "Teaching Statistics Using Baseball, by Jim Albert", MAA, 2003. SIGACT News 36(3): 19-21 (2005) - 2004
- [i1]William I. Gasarch, James Glenn, Andrey Utis:
The communication complexity of the Exact-N Problem revisited. Algebraic Methods in Computational Complexity 2004
1990 – 1999
- 1997
- [c2]James Glenn, William I. Gasarch:
Implementing WS1S via Finite Automata: Performance Issues. Workshop on Implementing Automata 1997: 75-86 - 1996
- [c1]James Glenn, William I. Gasarch:
Implementing WS1S via Finite Automata. Workshop on Implementing Automata 1996: 50-63
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
