default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimothy Chu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]Timothy Chu, Zhao Song, Chiwun Yang:
How to Protect Copyright Data in Optimization of Large Language Models? AAAI 2024: 17871-17879- 2023
- [j1]Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang:
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions. SIAM J. Comput. 52(6): S18-85 (2023) - [i10]Timothy Chu, Gary L. Miller, Noel Walkington:
Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Buser. CoRR abs/2305.06541 (2023) - [i9]Timothy Chu, Zhao Song, Chiwun Yang:
How to Protect Copyright Data in Optimization of Large Language Models? CoRR abs/2308.12247 (2023) - [i8]Timothy Chu, Zhao Song, Chiwun Yang:
Fine-tune Language Models to Approximate Unbiased In-context Learning. CoRR abs/2310.03331 (2023) - 2022
- [b1]Timothy Chu:
Machine Learning: Metrics and Embeddings. Carnegie Mellon University, USA, 2022 - 2020
- [c3]Josh Alman, Timothy Chu, Aaron Schild, Zhao Song:
Algorithms and Hardness for Linear Algebra on Geometric Graphs. FOCS 2020: 541-552 - [c2]Timothy Chu, Gary L. Miller, Donald R. Sheehy:
Exact computation of a manifold metric, via Lipschitz Embeddings and Shortest Paths on a Graph. SODA 2020: 411-425 - [i7]Timothy Chu, Gary L. Miller, Noel J. Walkington, Alex L. Wang:
Weighted Cheeger and Buser Inequalities, with Applications to Clustering and Cutting Probability Densities. CoRR abs/2004.09589 (2020) - [i6]Josh Alman, Timothy Chu, Aaron Schild, Zhao Song:
Algorithms and Hardness for Linear Algebra on Geometric Graphs. CoRR abs/2011.02466 (2020) - [i5]Timothy Chu, Gary L. Miller, Shyam Narayanan, Mark Sellke:
Functions that Preserve Manhattan Distances. CoRR abs/2011.11503 (2020)
2010 – 2019
- 2018
- [c1]Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva
, Saurabh Sawlani, Junxing Wang:
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. FOCS 2018: 361-372 - [i4]Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, Junxing Wang:
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions. CoRR abs/1805.12051 (2018) - [i3]Timothy Chu, Michael B. Cohen, Jakub W. Pachocki, Richard Peng:
Constant Arboricity Spectral Sparsifiers. CoRR abs/1808.05662 (2018) - 2017
- [i2]Timothy Chu, Gary L. Miller, Donald R. Sheehy:
Intrinsic Metrics: Nearest Neighbor and Edge Squared Distances. CoRR abs/1709.07797 (2017) - 2013
- [i1]Alex Chen, Timothy Chu, Nathan Pinsker:
Computing the Longest Increasing Subsequence of a Sequence Subject to Dynamic Insertion. CoRR abs/1309.7724 (2013)
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-04-25 05:57 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:
