default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZoya Svitkina
Person information
- affiliation: Dartmouth College, Hanover, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Ravi Kumar, Manish Purohit, Zoya Svitkina:
Improving Online Algorithms via ML Predictions. CoRR abs/2407.17712 (2024)- 2023
- [c19]Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Efficient Caching with Reserves via Marking. ICALP 2023: 80:1-80:20 - [i10]Sharat Ibrahimpur
, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Efficient Caching with Reserves via Marking. CoRR abs/2305.02508 (2023) - [i9]Ce Jin, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
New Tools for Peak Memory Scheduling. CoRR abs/2312.13526 (2023) - 2022
- [c18]Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Caching with Reserves. APPROX/RANDOM 2022: 52:1-52:16 - [c17]Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Scheduling with Communication Delay in Near-Linear Time. STACS 2022: 47:1-47:23 - [i8]Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Caching with Reserves. CoRR abs/2207.05975 (2022) - 2021
- [i7]Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Scheduling with Communication Delay in Near-Linear Time. CoRR abs/2108.02770 (2021) - 2020
- [c16]Biswaroop Maiti, Rajmohan Rajaraman, David Stalfa, Zoya Svitkina, Aravindan Vijayaraghavan:
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay. FOCS 2020: 834-845 - [c15]Ravi Kumar, Manish Purohit, Zoya Svitkina, Erik Vee:
Interleaved Caching with Access Graphs. SODA 2020: 1846-1858 - [i6]Biswaroop Maiti, Rajmohan Rajaraman, David Stalfa, Zoya Svitkina, Aravindan Vijayaraghavan:
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay. CoRR abs/2004.10776 (2020)
2010 – 2019
- 2019
- [c14]Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee:
Semi-Online Bipartite Matching. ITCS 2019: 50:1-50:20 - [c13]Ravi Kumar, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Efficient Rematerialization for Deep Networks. NeurIPS 2019: 15146-15155 - 2018
- [c12]Manish Purohit, Zoya Svitkina, Ravi Kumar:
Improving Online Algorithms via ML Predictions. NeurIPS 2018: 9684-9693 - [i5]Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee:
Semi-Online Bipartite Matching. CoRR abs/1812.00134 (2018) - 2016
- [j9]Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina:
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem. Algorithmica 75(1): 53-83 (2016) - 2015
- [j8]Yossi Azar, Lisa Fleischer, Kamal Jain, Vahab S. Mirrokni, Zoya Svitkina:
Optimal Coordination Mechanisms for Unrelated Machine Scheduling. Oper. Res. 63(3): 489-500 (2015) - 2013
- [j7]Chien-Chung Huang, Zoya Svitkina:
Donation Center Location Problem. Algorithmica 66(1): 187-210 (2013) - [j6]Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina:
Asymmetric Traveling Salesman Path and Directed Latency Problems. SIAM J. Comput. 42(4): 1596-1619 (2013) - 2012
- [c11]Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina:
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem. SWAT 2012: 237-248 - 2011
- [j5]Zoya Svitkina, Lisa Fleischer:
Submodular Approximation: Sampling-based Algorithms and Lower Bounds. SIAM J. Comput. 40(6): 1715-1737 (2011) - 2010
- [j4]S. Muthukrishnan, Martin Pál, Zoya Svitkina:
Stochastic Models for Budget Optimization in Search-Based Advertising. Algorithmica 58(4): 1022-1044 (2010) - [j3]Zoya Svitkina, Éva Tardos:
Facility location with hierarchical facility costs. ACM Trans. Algorithms 6(2): 37:1-37:22 (2010) - [j2]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On distributing symmetric streaming computations. ACM Trans. Algorithms 6(4): 66:1-66:19 (2010) - [j1]Zoya Svitkina:
Lower-bounded facility location. ACM Trans. Algorithms 6(4): 69:1-69:16 (2010) - [c10]Lisa Fleischer, Zoya Svitkina:
Preference-constrained Oriented Matching. ANALCO 2010: 66-73 - [c9]Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina:
Asymmetric Traveling Salesman Path and Directed Latency Problems. SODA 2010: 419-428
2000 – 2009
- 2009
- [c8]Chien-Chung Huang, Zoya Svitkina:
Donation Center Location Problem. FSTTCS 2009: 227-238 - [i4]Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina:
Asymmetric Traveling Salesman Path and Directed Latency Problems. CoRR abs/0907.0726 (2009) - 2008
- [c7]Zoya Svitkina, Lisa Fleischer:
Submodular Approximation: Sampling-based Algorithms and Lower Bounds. FOCS 2008: 697-706 - [c6]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On distributing symmetric streaming computations. SODA 2008: 710-719 - [c5]Zoya Svitkina:
Lower-bounded facility location. SODA 2008: 1154-1163 - [i3]Zoya Svitkina, Lisa Fleischer:
Submodular approximation: sampling-based algorithms and lower bounds. CoRR abs/0805.1071 (2008) - 2007
- [b1]Zoya Svitkina:
Approximation Algorithms for new graph partitioning and facility location problems. Cornell University, USA, 2007 - [c4]S. Muthukrishnan, Martin Pál, Zoya Svitkina:
Stochastic Models for Budget Optimization in Search-Based Advertising. WINE 2007: 131-142 - 2006
- [c3]Zoya Svitkina, Éva Tardos:
Facility location with hierarchical facility costs. SODA 2006: 153-161 - [i2]Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On the Complexity of Processing Massive, Unordered, Distributed Data. CoRR abs/cs/0611108 (2006) - [i1]S. Muthukrishnan, Martin Pál, Zoya Svitkina:
Stochastic Models for Budget Optimization in Search-Based Advertising. CoRR abs/cs/0612072 (2006) - 2005
- [c2]Ara Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina:
Unbalanced Graph Cuts. ESA 2005: 191-202 - 2004
- [c1]Zoya Svitkina, Éva Tardos:
Min-Max Multiway Cut. APPROX-RANDOM 2004: 207-218
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-20 23:04 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:
