default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason Gaitonde
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Jason Gaitonde
, Elchanan Mossel:
A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width. STOC 2024: 503-514- [i12]Jason Gaitonde, Elchanan Mossel:
Sample-Efficient Linear Regression with Self-Selection Bias. CoRR abs/2402.14229 (2024) - [i11]Jason Gaitonde, Ankur Moitra, Elchanan Mossel:
Efficiently Learning Markov Random Fields from Dynamics. CoRR abs/2409.05284 (2024) - [i10]Jason Gaitonde, Elchanan Mossel:
Comparison Theorems for the Mixing Times of Systematic and Random Scan Dynamics. CoRR abs/2410.11136 (2024) - 2023
- [j1]Jason Gaitonde, Éva Tardos:
The Price of Anarchy of Strategic Queuing Systems. J. ACM 70(3): 20:1-20:63 (2023) - [c7]Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, Aleksandrs Slivkins:
Budget Pacing in Repeated Auctions: Regret and Efficiency Without Convergence. ITCS 2023: 52:1-52:1 - [i9]Jason Gaitonde, Elchanan Mossel:
A Unified Approach to Learning Ising Models: Beyond Independence and Bounded Width. CoRR abs/2311.09197 (2023) - 2022
- [c6]Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, Ruizhe Zhang:
Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. APPROX/RANDOM 2022: 16:1-16:24 - [i8]Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, Ruizhe Zhang:
Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. CoRR abs/2205.00644 (2022) - [i7]Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, Aleksandrs Slivkins:
Budget Pacing in Repeated Auctions: Regret and Efficiency without Convergence. CoRR abs/2205.08674 (2022) - 2021
- [c5]Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty:
Fractional Pseudorandom Generators from Any Fourier Level. CCC 2021: 10:1-10:24 - [c4]Jason Gaitonde, Jon M. Kleinberg, Éva Tardos:
Polarization in Geometric Opinion Dynamics. EC 2021: 499-519 - [c3]Jason Gaitonde, Éva Tardos:
Virtues of Patience in Strategic Queuing Systems. EC 2021: 520-540 - [i6]Jason Gaitonde, Jon M. Kleinberg, Éva Tardos:
Polarization in Geometric Opinion Dynamics. CoRR abs/2106.12459 (2021) - 2020
- [c2]Jason Gaitonde, Éva Tardos:
Stability and Learning in Strategic Queuing Systems. EC 2020: 319-347 - [c1]Jason Gaitonde, Jon M. Kleinberg, Éva Tardos:
Adversarial Perturbations of Opinion Dynamics in Networks. EC 2020: 471-472 - [i5]Jason Gaitonde, Éva Tardos:
Stability and Learning in Strategic Queuing Systems. CoRR abs/2003.07009 (2020) - [i4]Jason Gaitonde, Jon M. Kleinberg, Éva Tardos:
Adversarial Perturbations of Opinion Dynamics in Networks. CoRR abs/2003.07010 (2020) - [i3]Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty:
Fractional Pseudorandom Generators from Any Fourier Level. CoRR abs/2008.01316 (2020) - [i2]Jason Gaitonde, Éva Tardos:
Virtues of Patience in Strategic Queuing Systems. CoRR abs/2011.10205 (2020) - [i1]Eshan Chattopadhyay, Jason Gaitonde, Abhishek Shetty:
Fractional Pseudorandom Generators from the $k$th Fourier Level. Electron. Colloquium Comput. Complex. TR20 (2020)
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-04-03 00:20 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:
