default search action
Joshua Cook
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Joshua Cook, Eric Ron, Dmitri Svetlov, Luis U. Aguilera, Brian Munsky:
Sequential design of single-cell experiments to identify discrete stochastic models for gene expression. CDC 2024: 7778-7785 - [c12]Joshua Cook, Dana Moshkovitz:
Explicit Time and Space Efficient Encoders Exist Only with Random Access. CCC 2024: 5:1-5:54 - [c11]Joshua Cook
, Kagan Tumer
Learning Aligned Local Evaluations For Better Credit Assignment In Cooperative Coevolution. GECCO 2024 - [c10]Joshua Cook
Multidimensional Archive Of The State Space. GECCO Companion 2024: 267-270 - [i7]Joshua Cook, Dana Moshkovitz:
Explicit Time and Space Efficient Encoders Exist Only With Random Access. Electron. Colloquium Comput. Complex. TR24 (2024) - [i6]Joshua Cook, Dana Moshkovitz:
Time and Space Efficient Deterministic Decoders. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c9]Joshua Cook, Ron D. Rothblum:
Efficient Interactive Proofs for Non-Deterministic Bounded Space. APPROX/RANDOM 2023: 47:1-47:22 - [c8]Joshua Cook, Dana Moshkovitz:
Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE. APPROX/RANDOM 2023: 55:1-55:22 - [c7]Joshua Cook, Tristan Scheiner, Kagan Tumer:
Multi-Team Fitness Critics For Robust Teaming. AAMAS 2023: 2406-2408 - [c6]Joshua Cook
Leveraging Fitness Critics To Learn Robust Teamwork. GECCO 2023: 429-437 - [i5]Joshua Cook, Ron D. Rothblum:
Efficient Interactive Proofs for Non-Deterministic Bounded Space. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c5]Joshua Cook:
More Verifier Efficient Interactive Protocols for Bounded Space. FSTTCS 2022: 14:1-14:18 - [c4]Joshua Cook, Kagan Tumer:
Fitness shaping for multiple teams. GECCO 2022: 332-340 - [i4]Joshua Cook:
More Verifier Efficient Interactive Protocols For Bounded Space. Electron. Colloquium Comput. Complex. TR22 (2022) - [i3]Joshua Cook, Dana Moshkovitz:
Tighter MA/1 Circuit Lower Bounds From Verifier Efficient PCPs for PSPACE. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c3]Joshua Cook, Kagan Tumer:
Ad hoc teaming through evolution. GECCO Companion 2021: 89-90 - [i2]Joshua Cook:
Unitarization Through Approximate Basis. CoRR abs/2104.00785 (2021) - 2020
- [c2]Joshua Cook:
Size Bounds on Low Depth Circuits for Promise Majority. FSTTCS 2020: 19:1-19:14 - [i1]Joshua Cook:
Size Bounds on Low Depth Circuits for Promise Majority. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2017
- [c1]Joshua Cook, Collin F. Lynch, Andrew Hicks, Behrooz Mostafavi:
Task and Timing: Separating Procedural and Tactical Knowledge in Student Models. EDM 2017
2000 – 2009
- 2007
- [j1]Kim-Phuong L. Vu, Robert W. Proctor, Abhilasha Bhargav-Spantzel, Bik-Lam (Belin) Tai, Joshua Cook, E. Eugene Schultz:
Improving password security and memorability to protect personal and organizational information. Int. J. Hum. Comput. Stud. 65(8): 744-757 (2007)
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 2025-03-05 20:51 CET 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: