default search action
Davin Choo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j1]Davin Choo
, Yan Hao Ling
Envy-free house allocation with minimum subsidy. Oper. Res. Lett. 54: 107103 (2024) - [c15]Davin Choo, Kirankumar Shiragur, Caroline Uhler:
Causal Discovery under Off-Target Interventions. AISTATS 2024: 1621-1629 - [c14]Davin Choo, Joy Qiping Yang, Arnab Bhattacharyya, Clément L. Canonne:
Learning bounded-degree polytrees with known skeleton. ALT 2024: 402-443 - [c13]Davin Choo, Themistoklis Gouleakis, Chun Kai Ling, Arnab Bhattacharyya:
Online bipartite matching with imperfect advice. ICML 2024 - [c12]Simina Brânzei, Davin Choo, Nicholas J. Recker:
The Sharp Power Law of Local Search on Expanders. SODA 2024: 1792-1809 - [i19]Davin Choo, Kirankumar Shiragur, Caroline Uhler
Causal Discovery under Off-Target Interventions. CoRR abs/2402.08229 (2024) - [i18]Davin Choo, Yan Hao Ling, Warut Suksompong, Nicholas Teh, Jian Zhang:
Envy-Free House Allocation with Minimum Subsidy. CoRR abs/2403.01162 (2024) - [i17]Davin Choo, Themis Gouleakis, Chun Kai Ling, Arnab Bhattacharyya:
Online bipartite matching with imperfect advice. CoRR abs/2405.09784 (2024) - [i16]Arnab Bhattacharyya, Davin Choo, Sutanu Gayen, Dimitrios Myrisiotis:
Learnability of Parameter-Bounded Bayes Nets. CoRR abs/2407.00927 (2024) - [i15]Davin Choo, Chun Kai Ling:
A short note about the learning-augmented secretary problem. CoRR abs/2410.06583 (2024) - 2023
- [c11]Davin Choo, Kirankumar Shiragur:
Subset verification and search algorithms for causal DAGs. AISTATS 2023: 4409-4442 - [c10]Anthimos Vardis Kandiros, Constantinos Daskalakis, Yuval Dagan, Davin Choo:
Learning and Testing Latent-Tree Ising Models Efficiently. COLT 2023: 1666-1729 - [c9]Davin Choo, Themistoklis Gouleakis, Arnab Bhattacharyya:
Active causal structure learning with advice. ICML 2023: 5838-5867 - [c8]Davin Choo, Kirankumar Shiragur:
New metrics and search algorithms for weighted causal DAGs. ICML 2023: 5868-5903 - [c7]Davin Choo, Kirankumar Shiragur:
Adaptivity Complexity for Causal Graph Discovery. UAI 2023: 391-402 - [i14]Davin Choo, Kirankumar Shiragur:
Subset verification and search algorithms for causal DAGs. CoRR abs/2301.03180 (2023) - [i13]Davin Choo, Kirankumar Shiragur:
New metrics and search algorithms for weighted causal DAGs. CoRR abs/2305.04445 (2023) - [i12]Simina Brânzei, Davin Choo, Nicholas J. Recker:
The Sharp Power Law of Local Search on Expanders. CoRR abs/2305.08269 (2023) - [i11]Davin Choo, Themis Gouleakis, Arnab Bhattacharyya:
Active causal structure learning with advice. CoRR abs/2305.19588 (2023) - [i10]Davin Choo, Kirankumar Shiragur:
Adaptivity Complexity for Causal Graph Discovery. CoRR abs/2306.05781 (2023) - [i9]Davin Choo, Joy Qiping Yang, Arnab Bhattacharyya, Clément L. Canonne:
Learning bounded-degree polytrees with known skeleton. CoRR abs/2310.06333 (2023) - 2022
- [c6]Arnab Bhattacharyya, Davin Choo, Rishikesh Gajjala, Sutanu Gayen, Yuhao Wang:
Learning Sparse Fixed-Structure Gaussian Bayesian Networks. AISTATS 2022: 9400-9429 - [c5]Davin Choo, Kirankumar Shiragur, Arnab Bhattacharyya:
Verification and search algorithms for causal DAGs. NeurIPS 2022 - [i8]Davin Choo, Kirankumar Shiragur, Arnab Bhattacharyya:
Verification and search algorithms for causal DAGs. CoRR abs/2206.15374 (2022) - [i7]Davin Choo, Yuval Dagan, Constantinos Daskalakis, Anthimos Vardis Kandiros:
Learning and Testing Latent-Tree Ising Models Efficiently. CoRR abs/2211.13291 (2022) - 2021
- [c4]Davin Choo, Tommaso d'Orsi:
The Complexity of Sparse Tensor PCA. NeurIPS 2021: 7993-8005 - [c3]Mélanie Cambus, Davin Choo
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs. DISC 2021: 15:1-15:18 - [i6]Mélanie Cambus, Davin Choo, Havu Miikonen, Jara Uitto:
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs. CoRR abs/2102.11660 (2021) - [i5]Davin Choo, Tommaso d'Orsi:
The Complexity of Sparse Tensor PCA. CoRR abs/2106.06308 (2021) - [i4]Arnab Bhattacharyya, Davin Choo, Rishikesh Gajjala, Sutanu Gayen, Yuhao Wang:
Learning Sparse Fixed-Structure Gaussian Bayesian Networks. CoRR abs/2107.10450 (2021) - 2020
- [c2]Davin Choo, Christoph Grunau
k-means++: few more steps yield constant approximation. ICML 2020: 1909-1917 - [i3]Davin Choo, Christoph Grunau, Julian Portmann, Václav Rozhon:
k-means++: few more steps yield constant approximation. CoRR abs/2002.07784 (2020)
2010 – 2019
- 2019
- [c1]Davin Choo, Mate Soos, Kian Ming Adam Chai, Kuldeep S. Meel:
Bosphorus: Bridging ANF and CNF Solvers. DATE 2019: 468-473 - 2018
- [i2]Jing Lim, Joshua Wong, Minn Xuan Wong, Lee Han Eric Tan, Hai Leong Chieu, Davin Choo, Neng Kai Nigel Neo
Chemical Structure Elucidation from Mass Spectrometry by Matching Substructures. CoRR abs/1811.07886 (2018) - [i1]Davin Choo, Mate Soos, Kian Ming Adam Chai, Kuldeep S. Meel:
BOSPHORUS: Bridging ANF and CNF Solvers. CoRR abs/1812.04580 (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-11-19 20:47 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: