


default search action
Vaidehi Srinivas
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Conference and Workshop Papers
- 2025
- [c5]Avrim Blum, Vaidehi Srinivas:
Competitive strategies to use "warm start" algorithms with predictions. SODA 2025: 3775-3801 - 2024
- [c4]Quanquan C. Liu, Vaidehi Srinivas:
The Predicted-Updates Dynamic Model: Offline, Incremental, and Decremental to Fully Dynamic Transformations. COLT 2024: 3582-3641 - [c3]Aditya Bhaskara
, Eric Evert
, Vaidehi Srinivas
, Aravindan Vijayaraghavan
:
New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries. STOC 2024: 375-386 - 2022
- [c2]Liam O'Carroll, Vaidehi Srinivas, Aravindan Vijayaraghavan:
The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound. NeurIPS 2022 - [c1]Vaidehi Srinivas, David P. Woodruff, Ziyu Xu, Samson Zhou:
Memory bounds for the experts problem. STOC 2022: 1158-1171
Informal and Other Publications
- 2024
- [i5]Aditya Bhaskara, Eric Evert, Vaidehi Srinivas, Aravindan Vijayaraghavan:
New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries. CoRR abs/2405.01517 (2024) - [i4]Vaidehi Srinivas, Avrim Blum:
Competitive strategies to use "warm start" algorithms with predictions. CoRR abs/2405.03661 (2024) - 2023
- [i3]Quanquan C. Liu, Vaidehi Srinivas:
The Predicted-Deletion Dynamic Model: Taking Advantage of ML Predictions, for Free. CoRR abs/2307.08890 (2023) - 2022
- [i2]Vaidehi Srinivas, David P. Woodruff, Ziyu Xu, Samson Zhou:
Memory Bounds for the Experts Problem. CoRR abs/2204.09837 (2022) - [i1]Liam O'Carroll, Vaidehi Srinivas, Aravindan Vijayaraghavan:
The Burer-Monteiro SDP method can fail even above the Barvinok-Pataki bound. CoRR abs/2211.12389 (2022)
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 22:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint