default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDeeksha Adil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva:
Fast Algorithms for ℓp-Regression. J. ACM 71(5): 34:1-34:45 (2024)- [i9]Deeksha Adil, Thatchaphol Saranurak
:
Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method. CoRR abs/2402.17929 (2024) - [i8]Deeksha Adil, Shunhua Jiang, Rasmus Kyng:
Acceleration Meets Inverse Maintenance: Faster ℓ∞-Regression. CoRR abs/2409.20030 (2024) - 2022
- [i7]Deeksha Adil, Brian Bullins, Arun Jambulapati, Sushant Sachdeva:
Optimal Methods for Higher-Order Smooth Monotone Variational Inequalities. CoRR abs/2205.06167 (2022) - [i6]Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva:
Fast Algorithms for 𝓁p-Regression. CoRR abs/2211.03963 (2022) - 2021
- [c5]Deeksha Adil, Brian Bullins, Rasmus Kyng, Sushant Sachdeva:
Almost-Linear-Time Weighted 𝓁p-Norm Solvers in Slightly Dense Graphs via Sparsification. ICALP 2021: 9:1-9:15 - [c4]Deeksha Adil, Brian Bullins, Sushant Sachdeva:
Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization. NeurIPS 2021: 19122-19133 - [i5]Deeksha Adil, Brian Bullins, Rasmus Kyng, Sushant Sachdeva:
Almost-linear-time Weighted 𝓁p-norm Solvers in Slightly Dense Graphs via Sparsification. CoRR abs/2102.06977 (2021) - [i4]Deeksha Adil, Brian Bullins, Sushant Sachdeva:
Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization. CoRR abs/2107.02432 (2021) - 2020
- [c3]Deeksha Adil, Sushant Sachdeva:
Faster p-norm minimizing flows, via smoothed q-norm problems. SODA 2020: 892-910
2010 – 2019
- 2019
- [c2]Deeksha Adil, Richard Peng, Sushant Sachdeva:
Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression. NeurIPS 2019: 14166-14177 - [c1]Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva:
Iterative Refinement for ℓp-norm Regression. SODA 2019: 1405-1424 - [i3]Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva:
Iterative Refinement for 𝓁p-norm Regression. CoRR abs/1901.06764 (2019) - [i2]Deeksha Adil, Richard Peng, Sushant Sachdeva:
Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression. CoRR abs/1907.07167 (2019) - [i1]Deeksha Adil, Sushant Sachdeva:
Faster p-norm minimizing flows, via smoothed q-norm problems. CoRR abs/1910.10571 (2019) - 2018
- [j1]Deeksha Adil, Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
Parameterized algorithms for stable matching with ties and incomplete lists. Theor. Comput. Sci. 723: 1-10 (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-11 22:23 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:
