David Durfee

Orcid: 0000-0002-8551-0426

According to our database1, David Durfee authored at least 25 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Instance-Specific Asymmetric Sensitivity in Differential Privacy.
CoRR, 2023

mSAM: Micro-Batch-Averaged Sharpness-Aware Minimization.
CoRR, 2023

Unbounded Differentially Private Quantile and Maximum Estimation.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Improving Wireless Power Transfer Efficiency for Distributed Brain Implants using Auto-Tune OVP.
Proceedings of the IEEE Biomedical Circuits and Systems Conference, 2023

2022
Improved Deep Neural Network Generalization Using m-Sharpness-Aware Minimization.
CoRR, 2022

Heterogeneous Calibration: A post-hoc model-agnostic framework for improved generalization.
CoRR, 2022

2021
LinkedIn's Audience Engagements API: A Privacy Preserving Data Analytics System at Scale.
J. Priv. Confidentiality, 2021

2020
Algorithmic Manipulation of Probability Distributions for Networks and Mechanisms.
PhD thesis, 2020

Determinant-Preserving Sparsification of SDDM Matrices.
SIAM J. Comput., 2020

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Individual Sensitivity Preprocessing for Data Privacy.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Optimal Differential Privacy Composition for Exponential Mechanisms.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Optimal Differential Privacy Composition for Exponential Mechanisms and the Cost of Adaptivity.
CoRR, 2019

Efficient Second-Order Shape-Constrained Function Fitting.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Fully dynamic spectral vertex sparsifiers and applications.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Practical Differentially Private Top-k Selection with Pay-what-you-get Composition.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Fully Dynamic Effective Resistances.
CoRR, 2018

Nearly Tight Bounds for Sandpile Transience on the Grid.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

$\ell_1$ Regression using Lewis Weights Preconditioning and Stochastic Gradient Descent.
Proceedings of the Conference On Learning Theory, 2018

2017
$\ell_1$ Regression using Lewis Weights Preconditioning.
CoRR, 2017

Tight Bounds for Sandpile Transience on the Two-Dimensional Grid up to Polylogarithmic Factors.
CoRR, 2017

Sampling random spanning trees faster than matrix multiplication.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
On Fully Dynamic Graph Sparsifiers.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
On the Complexity of Nash Equilibria in Anonymous Games.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015


  Loading...