default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSpencer Compton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c7]Moses Charikar, Spencer Compton, Chirag Pabbaraju:
Embedding Probability Distributions into Low Dimensional ℓ1: Tree Ising Models via Truncated Metrics. SODA 2025: 3210-3266- 2024
- [j2]Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld:
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. Algorithmica 86(9): 2997-3026 (2024) - [c6]Spencer Compton
, Gregory Valiant:
Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variances. STOC 2024: 194-200 - [i8]Samuel Sokota, Dylan Sam, Christian Schröder de Witt, Spencer Compton, Jakob N. Foerster, J. Zico Kolter:
Computing Low-Entropy Couplings for Large-Support Distributions. CoRR abs/2405.19540 (2024) - 2023
- [c5]Spencer Compton, Dmitriy Katz, Benjamin Qi, Kristjan H. Greenewald, Murat Kocaoglu:
Minimum-Entropy Coupling Approximation Guarantees Beyond the Majorization Barrier. AISTATS 2023: 10445-10469 - [c4]Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld:
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. ICALP 2023: 45:1-45:16 - [i7]Spencer Compton, Dmitriy Katz, Benjamin Qi, Kristjan H. Greenewald, Murat Kocaoglu:
Minimum-Entropy Coupling Approximation Guarantees Beyond the Majorization Barrier. CoRR abs/2302.11838 (2023) - [i6]Spencer Compton, Gregory Valiant:
Near-Optimal Mean Estimation with Unknown, Heteroskedastic Variances. CoRR abs/2312.02417 (2023) - [i5]Moses Charikar, Spencer Compton, Chirag Pabbaraju:
Average-Case Dimensionality Reduction in 𝓁1: Tree Ising Models. CoRR abs/2312.02435 (2023) - 2022
- [c3]Spencer Compton, Kristjan H. Greenewald, Dmitriy A. Katz, Murat Kocaoglu:
Entropic Causal Inference: Graph Identifiability. ICML 2022: 4311-4343 - [c2]Spencer Compton:
A Tighter Approximation Guarantee for Greedy Minimum Entropy Coupling. ISIT 2022: 168-173 - [i4]Spencer Compton:
A Tighter Approximation Guarantee for Greedy Minimum Entropy Coupling. CoRR abs/2203.05108 (2022) - 2021
- [i3]Spencer Compton, Murat Kocaoglu, Kristjan H. Greenewald, Dmitriy Katz:
Entropic Causal Inference: Identifiability and Finite Sample Results. CoRR abs/2101.03501 (2021) - 2020
- [j1]Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang:
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. J. Inf. Process. 28: 987-1007 (2020) - [c1]Spencer Compton, Murat Kocaoglu, Kristjan H. Greenewald, Dmitriy Katz:
Entropic Causal Inference: Identifiability and Finite Sample Results. NeurIPS 2020 - [i2]Jeffrey Bosboom, Charlotte Chen, Lily Chung, Spencer Compton, Michael J. Coulombe, Erik D. Demaine, Martin L. Demaine, Ivan Tadeu Ferreira Antunes Filho, Dylan H. Hendrickson, Adam Hesterberg, Calvin Hsu, William Hu, Oliver Korten, Zhezheng Luo, Lillian Zhang:
Edge Matching with Inequalities, Triangles, Unknown Shape, and Two Players. CoRR abs/2002.03887 (2020) - [i1]Spencer Compton, Slobodan Mitrovic, Ronitt Rubinfeld:
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. CoRR abs/2012.15002 (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-01-29 21:15 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:
