default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJesse Goodman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Jesse Goodman, Xin Li, David Zuckerman:
Improved Condensers for Chor-Goldreich Sources. FOCS 2024: 1513-1549- [c8]Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani:
Extractors for Polynomial Sources over 𝔽2. ITCS 2024: 28:1-28:24 - [i17]Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro:
Low-Degree Polynomials Are Good Extractors. CoRR abs/2405.10297 (2024) - [i16]Jesse Goodman, Xin Li, David Zuckerman:
Improved Condensers for Chor-Goldreich Sources. CoRR abs/2410.08142 (2024) - [i15]Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro:
Low-Degree Polynomials Are Good Extractors. Electron. Colloquium Comput. Complex. TR24 (2024) - [i14]Jesse Goodman, Xin Li, David Zuckerman:
Improved Condensers for Chor-Goldreich Sources. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [i13]Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani:
Extractors for Polynomial Sources over F2. CoRR abs/2309.11019 (2023) - [i12]Eshan Chattopadhyay, Jesse Goodman, Mohit Gurumukhani:
Extractors for Polynomial Sources over $\mathbb{F}_2$. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j1]Alexandre M. Bayen, Jesse Goodman
, Eugene Vinitsky:
On the approximability of Time Disjoint Walks. J. Comb. Optim. 44(3): 1615-1636 (2022) - [c7]Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
Low-Degree Polynomials Extract From Local Sources. ICALP 2022: 10:1-10:20 - [c6]Eshan Chattopadhyay, Jesse Goodman, David Zuckerman:
The Space Complexity of Sampling. ITCS 2022: 40:1-40:23 - [i11]Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
Low-Degree Polynomials Extract from Local Sources. CoRR abs/2205.13725 (2022) - [i10]Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
Low-Degree Polynomials Extract from Local Sources. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c5]Eshan Chattopadhyay, Jesse Goodman:
Improved Extractors for Small-Space Sources. FOCS 2021: 610-621 - [c4]Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao:
Affine Extractors for Almost Logarithmic Entropy. FOCS 2021: 622-633 - [i9]Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao:
Affine Extractors for Almost Logarithmic Entropy. Electron. Colloquium Comput. Complex. TR21 (2021) - [i8]Eshan Chattopadhyay, Jesse Goodman, David Zuckerman:
The Space Complexity of Sampling. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c3]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, David Zuckerman:
Extractors and Secret Sharing Against Bounded Collusion Protocols. FOCS 2020: 1226-1242 - [c2]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Extractors for adversarial sources via extremal hypergraphs. STOC 2020: 1184-1197 - [i7]Eshan Chattopadhyay, Jesse Goodman:
Explicit Extremal Designs and Applications to Extractors. CoRR abs/2007.07772 (2020) - [i6]Eshan Chattopadhyay, Jesse Goodman:
Explicit Extremal Designs and Applications to Extractors. Electron. Colloquium Comput. Complex. TR20 (2020) - [i5]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols. Electron. Colloquium Comput. Complex. TR20 (2020) - [i4]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Leakage-Resilient Extractors and Secret-Sharing against Bounded Collusion Protocols. IACR Cryptol. ePrint Arch. 2020: 478 (2020)
2010 – 2019
- 2019
- [i3]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Extractors for Adversarial Sources via Extremal Hypergraphs. Electron. Colloquium Comput. Complex. TR19 (2019) - [i2]Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Extractors for Adversarial Sources via Extremal Hypergraphs. IACR Cryptol. ePrint Arch. 2019: 1450 (2019) - 2018
- [c1]Alexandre M. Bayen, Jesse Goodman, Eugene Vinitsky:
On the Approximability of Time Disjoint Walks. COCOA 2018: 62-78 - [i1]Alexandre M. Bayen, Jesse Goodman, Eugene Vinitsky:
On the Approximability of Time Disjoint Walks. CoRR abs/1812.10837 (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 2024-12-10 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:
