Janardhan Kulkarni

Fatemehsadat Mireshghallah

Victor Reis

Thomas Rothvoss

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Privately Aligning Language Models with Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Privacy-Preserving In-Context Learning with Differentially Private Few-Shot Generation.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Differentially Private Synthetic Data via Foundation Model APIs 1: Images.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023

Individual Privacy Accounting for Differentially Private Stochastic Gradient Descent.

[BibT_eX]

[DOI]

Trans. Mach. Learn. Res., 2023

TinyGSM: achieving >80% on GSM8k with small language models.

[BibT_eX]

[DOI]

CoRR, 2023

Classification with Partially Private Features.

[BibT_eX]

[DOI]

Zeyu Shen

Anilesh K. Krishnaswamy

Fatemehsadat Mireshghallah

CoRR, 2023

Exploring the Limits of Differentially Private Deep Learning with Group-wise Clipping.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Assessing Privacy Risks in Language Models: A Case Study on Summarization Tasks.

[BibT_eX]

[DOI]

Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2023, 2023

2022

Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

Fully Dynamic (Δ +1)-Coloring in <i>O</i>(1) Update Time.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

Per-Instance Privacy Accounting for Differentially Private Stochastic Gradient Descent.

[BibT_eX]

[DOI]

CoRR, 2022

On the Hardness of Scheduling With Non-Uniform Communication Delays.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Looking Beyond GPUs for DNN Scheduling on Multi-Tenant Clusters.

[BibT_eX]

[DOI]

Proceedings of the 16th USENIX Symposium on Operating Systems Design and Implementation, 2022

Differentially Private Model Compression.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

When Does Differentially Private Learning Not Suffer in High Dimensions?

[BibT_eX]

[DOI]

Xuechen Li

Daogao Liu

Tatsunori B. Hashimoto

Huseyin A. Inan

Yin Tat Lee

Abhradeep Guha Thakurta

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

Differentially Private Set Union.

[BibT_eX]

[DOI]

J. Priv. Confidentiality, 2021

Synergy: Resource Sensitive DNN Scheduling in Multi-Tenant Clusters.

[BibT_eX]

[DOI]

CoRR, 2021

Private Non-smooth Empirical Risk Minimization and Stochastic Convex Optimization in Subquadratic Steps.

[BibT_eX]

[DOI]

Yin Tat Lee

Daogao Liu

CoRR, 2021

Scheduling Opportunistic Links in Two-Tiered Reconfigurable Datacenters.

[BibT_eX]

[DOI]

Stefan Schmid

Pawel Schmidt

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Private Non-smooth ERM and SCO in Subquadratic Steps.

[BibT_eX]

[DOI]

Yin Tat Lee

Daogao Liu

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Differentially Private n-gram Extraction.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Fast and Memory Efficient Differentially Private-SGD via JL Projections.

[BibT_eX]

[DOI]

Uthaipon Tantipongpipat

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Accuracy, Interpretability, and Differential Privacy via Explainable Boosting.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Differentially Private Correlation Clustering.

[BibT_eX]

[DOI]

Mark Bun

Marek Eliás

Proceedings of the 38th International Conference on Machine Learning, 2021

Consistent k-Median: Simpler, Better and Robust.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

Prior-free multi-unit auctions with ordered bidders.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

The Power of Recourse: Better Algorithms for Facility Location in Online and Dynamic Models.

[BibT_eX]

[DOI]

CoRR, 2020

Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Differentially Private Release of Synthetic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Privately Learning Markov Random Fields.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Scheduling with Communication Delays via LP Hierarchies and Clustering.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Locally Private Hypothesis Selection.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2020

On the Facility Location Problem in Online and Dynamic Models.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2020

2019

Tight Bounds for Online Vector Scheduling.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Fully Dynamic (Δ+1)-Coloring in Constant Update Time.

[BibT_eX]

[DOI]

CoRR, 2019

Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization.

[BibT_eX]

[DOI]

Haotian Jiang

Sahil Singla

CoRR, 2019

Non-clairvoyantly Scheduling to Minimize Convex Functions.

[BibT_eX]

[DOI]

Algorithmica, 2019

Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time.

[BibT_eX]

[DOI]

Shashwat Garg

Shi Li

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time.

[BibT_eX]

[DOI]

Uriel Feige

Shi Li

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Deterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊2) Amortized Update Time.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Locally Private Gaussian Estimation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints.

[BibT_eX]

[DOI]

J. ACM, 2018

Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε<sup>2</sup>) Amortized Update Time.

[BibT_eX]

[DOI]

CoRR, 2018

A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems.

[BibT_eX]

[DOI]

Nikhil R. Devanur

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models.

[BibT_eX]

[DOI]

Shi Li

Proceedings of the Approximation, 2018

2017

Truth and Regret in Online Scheduling.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Collecting Telemetry Data Privately.

[BibT_eX]

[DOI]

Bolin Ding

Sergey Yekhanin

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Minimum Birkhoff-von Neumann Decomposition.

[BibT_eX]

[DOI]

Euiwoong Lee

Mohit Singh

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

Do the Hard Stuff First: Scheduling Dependent Computations in Data-Analytics Clusters.

[BibT_eX]

[DOI]

CoRR, 2016

Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines.

[BibT_eX]

[DOI]

Shravan Matthur Narayanamurthy

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

ProjecToR: Agile Reconfigurable Data Center Interconnect.

[BibT_eX]

[DOI]

Pierre-Alexandre Blanche

Houman Rastegarfar

Madeleine Glick

Daniel C. Kilper

Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

Morpheus: Towards Automated SLOs for Enterprise Clusters.

[BibT_eX]

[DOI]

Sangeetha Abdu Jyothi

Carlo Curino

Ishai Menache

Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation, 2016

GRAPHENE: Packing and Dependency-Aware Scheduling for Data-Parallel Clusters.

[BibT_eX]

[DOI]

Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation, 2016

Competitive Analysis of Constrained Queueing Systems.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2016

2015

Dynamic Coordination Mechanisms: [Extended Abstract].

[BibT_eX]

[DOI]

Vahab S. Mirrokni

SIGMETRICS Perform. Evaluation Rev., 2015

Minimizing Flow-Time on Unrelated Machines.

[BibT_eX]

[DOI]

Nikhil Bansal

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time.

[BibT_eX]

[DOI]

Benjamin Moseley

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Robust Price of Anarchy Bounds via LP and Fenchel Duality.

[BibT_eX]

[DOI]

Vahab S. Mirrokni

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Competitive Flow Time Algorithms for Polyhedral Scheduling.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Coordination mechanisms from (almost) all scheduling policies.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2014

Coordination Mechanisms for Selfish Routing over Time on a Tree.

[BibT_eX]

[DOI]

Vahab S. Mirrokni

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

Near-optimal multi-unit auctions with ordered bidders.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Constant-Competitive Prior-Free Auction with Ordered Bidders

[BibT_eX]

[DOI]

Xiaoming Xu

CoRR, 2012

Algorithms for Cost-Aware Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

2011

On Allocations with Negative Externalities.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

2010

New epsilon-net constructions.

[BibT_eX]

[DOI]

Sathish Govindarajan

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Small strong epsilon nets.

[BibT_eX]

[DOI]

Pradeesha Ashok

Sathish Govindarajan

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2008

On the Decidability of Model-Checking Information Flow Properties.

[BibT_eX]

[DOI]

Deepak D'Souza

Raveendra Holla