Zoya Svitkina

Orcid: 0009-0009-0977-6618

Affiliations:
  • Dartmouth College, Hanover, USA


According to our database1, Zoya Svitkina authored at least 24 papers between 2004 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Non-preemptive Throughput Maximization under Time-varying Capacity.
Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures, 2025

2023
New Tools for Peak Memory Scheduling.
CoRR, 2023

Efficient Caching with Reserves via Marking.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Scheduling with Communication Delay in Near-Linear Time.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Caching with Reserves.
Proceedings of the Approximation, 2022

2020
Interleaved Caching with Access Graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Efficient Rematerialization for Deep Networks.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Semi-Online Bipartite Matching.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018
Improving Online Algorithms via ML Predictions.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2015
Optimal Coordination Mechanisms for Unrelated Machine Scheduling.
Oper. Res., 2015

2012
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

2010
Asymmetric Traveling Salesman Path and Directed Latency Problems.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Preference-constrained Oriented Matching.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009
Donation Center Location Problem.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008
Lower-bounded facility location.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

On distributing symmetric streaming computations.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Submodular Approximation: Sampling-based Algorithms and Lower Bounds.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
Approximation Algorithms for new graph partitioning and facility location problems.
PhD thesis, 2007

Stochastic Models for Budget Optimization in Search-Based Advertising.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

2006
On the Complexity of Processing Massive, Unordered, Distributed Data
CoRR, 2006

Facility location with hierarchical facility costs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Unbalanced Graph Cuts.
Proceedings of the Algorithms, 2005

2004
Min-Max Multiway Cut.
Proceedings of the Approximation, 2004


  Loading...