![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2024
- Mehrdad Ghadiri
, Yin Tat Lee
, Swati Padmanabhan
, William Swartworth
, David P. Woodruff
, Guanghao Ye
:
Improving the Bit Complexity of Communication for Distributed Convex Optimization. STOC 2024: 1130-1140 - Mehrdad Ghadiri, Yin Tat Lee, Swati Padmanabhan, William Swartworth, David P. Woodruff, Guanghao Ye:
Improving the Bit Complexity of Communication for Distributed Convex Optimization. CoRR abs/2403.19146 (2024) - Guy Kornowski, Swati Padmanabhan, Kai Wang, Zhe Zhang, Suvrit Sra:
First-Order Methods for Linearly Constrained Bilevel Optimization. CoRR abs/2406.12771 (2024) - 2023
- Swati Padmanabhan, David P. Woodruff, Richard Zhang:
Computing Approximate 𝓁p Sensitivities. NeurIPS 2023 - Zhe Feng
, Swati Padmanabhan
, Di Wang
:
Online Bidding Algorithms for Return-on-Spend Constrained Advertisers✱. WWW 2023: 3550-3560 - Swati Padmanabhan
, David P. Woodruff, Qiuyi (Richard) Zhang:
Computing Approximate 𝓁p Sensitivities. CoRR abs/2311.04158 (2023) - 2022
- Damek Davis, Dmitriy Drusvyatskiy, Yin Tat Lee, Swati Padmanabhan, Guanghao Ye:
A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions. NeurIPS 2022 - Jelena Diakonikolas, Chenghui Li, Swati Padmanabhan, Chaobing Song:
A Fast Scale-Invariant Algorithm for Non-negative Least Squares with Non-negative Data. NeurIPS 2022 - Sally Dong, Haotian Jiang, Yin Tat Lee, Swati Padmanabhan, Guanghao Ye:
Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity. NeurIPS 2022 - Maryam Fazel, Yin Tat Lee, Swati Padmanabhan, Aaron Sidford:
Computing Lewis Weights to High Precision. SODA 2022: 2723-2742 - Jelena Diakonikolas, Chenghui Li, Swati Padmanabhan
, Chaobing Song:
A Fast Scale-Invariant Algorithm for Non-negative Least Squares with Non-negative Data. CoRR abs/2203.03808 (2022) - Sally Dong, Haotian Jiang, Yin Tat Lee, Swati Padmanabhan
, Guanghao Ye:
Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity. CoRR abs/2208.03811 (2022) - Zhe Feng, Swati Padmanabhan
, Di Wang:
Online Bidding Algorithms for Return-on-Spend Constrained Advertisers. CoRR abs/2208.13713 (2022) - 2021
- Maryam Fazel, Yin Tat Lee, Swati Padmanabhan
, Aaron Sidford:
Computing Lewis Weights to High Precision. CoRR abs/2110.15563 (2021) - 2020
- Yin Tat Lee, Swati Padmanabhan:
An $\widetilde\mathcalO(m/\varepsilon3.5)$-Cost Algorithm for Semidefinite Programs with Diagonal Constraints. COLT 2020: 3069-3119 - Haotian Jiang, Tarun Kathuria, Yin Tat Lee, Swati Padmanabhan, Zhao Song:
A Faster Interior Point Method for Semidefinite Programming. FOCS 2020: 910-918 - Arun Jambulapati, Yin Tat Lee, Jerry Li, Swati Padmanabhan, Kevin Tian:
Positive semidefinite programming: mixed, parallel, and width-independent. STOC 2020: 789-802 - Arun Jambulapati, Yin Tat Lee, Jerry Li, Swati Padmanabhan
, Kevin Tian:
Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent. CoRR abs/2002.04830 (2020) - Haotian Jiang, Tarun Kathuria, Yin Tat Lee, Swati Padmanabhan
, Zhao Song:
A Faster Interior Point Method for Semidefinite Programming. CoRR abs/2009.10217 (2020) - 2019
- Yin Tat Lee, Swati Padmanabhan
:
An Õ(m/ε3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints. CoRR abs/1903.01859 (2019) - 2014
- Aishwarya Ganesan, Swati Rallapalli, Krishna Chintalapudi, Venkata N. Padmanabhan, Lili Qiu:
Demo: tracking user browsing on a demo floor. MobiCom 2014: 271-274 - Swati Rallapalli, Aishwarya Ganesan, Krishna Chintalapudi, Venkata N. Padmanabhan, Lili Qiu:
Enabling physical analytics in retail stores using smart glasses. MobiCom 2014: 115-126 - 2012
- Onur Mudanyali, Swati Padmanabhan, Stoyan Dimitrov, Isa Navruz, Uzair Sikora, Aydogan Ozcan:
Smart rapid diagnostics test reader running on a cell-phone for real-time mapping of epidemics. mHealthSys@SenSys 2012: 1:1-1:6 - 2008
- Deepak P, Anuradha Bhamidipaty, Swati Challa:
Intelligent user assistance for cost effective usage of mobile phone. IUI 2008: 317-320
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 09:23 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint