UB Paderborn / Katalog / Suche / in CDI

Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time

SIAM journal on computing, 2018-01, Vol.47 (6), p.2315-2336

2018

Volltextzugriff (PDF)

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, p.919-930

2020

Volltextzugriff (PDF)

Numerical Composition of Differential Privacy

The journal of privacy and confidentiality, 2024-02, Vol.14 (1)

2024

Volltextzugriff (PDF)

Private Convex Optimization via Exponential Mechanism

The journal of privacy and confidentiality, 2024-02, Vol.14 (1)

2024

Volltextzugriff (PDF)

Faster Matroid Intersection

2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, p.1146-1168

2019

Volltextzugriff (PDF)

Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile

SIAM journal on computing, 2017-01, Vol.46 (3), p.890-910

2017

Volltextzugriff (PDF)

Differentially Private Fine-tuning of Language Models

The journal of privacy and confidentiality, 2024-06, Vol.14 (2)

2024

Volltextzugriff (PDF)

Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems

2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013, p.147-156

2013

Volltextzugriff (PDF)

Solving Linear Programs in the Current Matrix Multiplication Time

Journal of the ACM, 2021-02, Vol.68 (1), p.1-39

2021

Volltextzugriff (PDF)

Geodesic Walks in Polytopes

SIAM journal on computing, 2022-04, Vol.51 (2), p.STOC17-400-STOC17-488

2022

Volltextzugriff (PDF)

Efficient Inverse Maintenance and Faster Algorithms for Linear Programming

2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 2015, p.230-249

2015

Volltextzugriff (PDF)

Solving linear programs in the current matrix multiplication time

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019, p.938-942

2019

Volltextzugriff (PDF)

A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization

2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 2015, p.1049-1065

2015

Volltextzugriff (PDF)

Eldan's Stochastic Localization and the KLS Hyperplane Conjecture: An Improved Lower Bound for Expansion

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017, p.998-1007

2017

Volltextzugriff (PDF)

Eldan's stochastic localization and the KLS conjecture: Isoperimetry, concentration and mixing

Annals of mathematics, 2024-05, Vol.199 (3)

2024

Volltextzugriff (PDF)

Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, p.1115-1121

2018

Volltextzugriff (PDF)

Kernel-based Methods for Bandit Convex Optimization

Journal of the ACM, 2021-08, Vol.68 (4), p.1-35

2021

Volltextzugriff (PDF)

Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time

2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 2015, p.250-269

2015

Volltextzugriff (PDF)

A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path

Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, p.1784-1797

2021

Volltextzugriff (PDF)

Strong self-concordance and sampling

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, p.1212-1222

2020

Volltextzugriff (PDF)

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, p.1904-1917

2023

Volltextzugriff (PDF)

Optimal Convergence Rates for Convex Distributed Optimization in Networks

Journal of machine learning research, 2019-01, Vol.20, p.1-31

2019

Volltextzugriff (PDF)

Short-step methods are not strongly polynomial-time

Mathematical programming, 2024, Vol.207 (1-2), p.733-746

2024

Volltextzugriff (PDF)

A Faster Interior Point Method for Semidefinite Programming

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, p.910-918

2020

Volltextzugriff (PDF)

Solving tall dense linear programs in nearly linear time

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, p.775-788

2020

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs

Numerical Composition of Differential Privacy

Private Convex Optimization via Exponential Mechanism

Faster Matroid Intersection

Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion Profile

Differentially Private Fine-tuning of Language Models

Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems

Solving Linear Programs in the Current Matrix Multiplication Time

Geodesic Walks in Polytopes

Efficient Inverse Maintenance and Faster Algorithms for Linear Programming

Solving linear programs in the current matrix multiplication time

A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization

Eldan's Stochastic Localization and the KLS Hyperplane Conjecture: An Improved Lower Bound for Expansion

Eldan's stochastic localization and the KLS conjecture: Isoperimetry, concentration and mixing

Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation

Kernel-based Methods for Bandit Convex Optimization

Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time

A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central path

Strong self-concordance and sampling

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method

Optimal Convergence Rates for Convex Distributed Optimization in Networks

Short-step methods are not strongly polynomial-time

A Faster Interior Point Method for Semidefinite Programming

Solving tall dense linear programs in nearly linear time

Suchergebnisse filtern