default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZachary Chase 0001
Person information
- affiliation: Technion, Faculty of Mathematics, Israel
- affiliation (former): University of Oxford, Mathematical Institute, Oxford, UK
- affiliation (2015 - 2019): California Institute of Technology, Department of Mathematics, Pasadena, CA, USA
Other persons with the same name
- Zachary Chase 0002 — Arizona State University, Ira A. Fulton Schools of Engineering, Mesa, AZ, USA
- Zachary Chase 0003 — University of California San Diego, Department of Computer Science and Engineering, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c6]Zachary Chase, Idan Mehalel:
Deterministic Apple Tasting. COLT 2025: 888-923- 2024
- [c5]Zachary Chase, Bogdan Chornomaz, Steve Hanneke, Shay Moran, Amir Yehudayoff:
Dual VC Dimension Obstructs Sample Compression by Embeddings. COLT 2024: 923-946 - [c4]Zachary Chase
, Bogdan Chornomaz, Shay Moran, Amir Yehudayoff:
Local Borsuk-Ulam, Stability, and Replicability. STOC 2024: 1769-1780 - [i8]Zachary Chase, Bogdan Chornomaz, Steve Hanneke, Shay Moran, Amir Yehudayoff:
Dual VC Dimension Obstructs Sample Compression by Embeddings. CoRR abs/2405.17120 (2024) - [i7]Zachary Chase, Idan Mehalel:
Deterministic Apple Tasting. CoRR abs/2410.10404 (2024) - 2023
- [c3]Zachary Chase, Shay Moran, Amir Yehudayoff:
Stability and Replicability in Learning. FOCS 2023: 2430-2439 - [i6]Zachary Chase, Shay Moran, Amir Yehudayoff:
Replicability and stability in learning. CoRR abs/2304.03757 (2023) - [i5]Zachary Chase, Bogdan Chornomaz, Shay Moran, Amir Yehudayoff:
Local Borsuk-Ulam, Stability, and Replicability. CoRR abs/2311.01599 (2023) - 2021
- [c2]Zachary Chase:
Separating words and trace reconstruction. STOC 2021: 21-31 - 2020
- [i4]Zachary Chase:
A New Upper Bound for Separating Words. CoRR abs/2007.12097 (2020) - [i3]Zachary Chase:
New Upper Bounds for Trace Reconstruction. CoRR abs/2009.03296 (2020)
2010 – 2019
- 2019
- [c1]Zachary Chase, Siddharth Prasad:
Learning Time Dependent Choice. ITCS 2019: 62:1-62:19 - [i2]Zachary Chase:
Experimental Evidence for Asymptotic Non-Optimality of Comb Adversary Strategy. CoRR abs/1912.01548 (2019) - 2018
- [j1]Zachary Chase:
On the Iterates of Digit Maps. Integers 18: A86 (2018) - [i1]Zachary Chase, Siddharth Prasad:
Learning Time Dependent Choice. CoRR abs/1809.03154 (2018)
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-08-21 01: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:
