Daniel Zink

According to our database, Daniel Zink authored at least 9 papers between 1998 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Affine reductions for LPs and SDPs.

Gábor Braun, Sebastian Pokutta, Daniel Zink

Math. Program., 2019

2017

A reduction framework for approximate extended formulations and a faster algorithm for convex optimization.

Daniel Zink

PhD thesis, 2017

Conditional Accelerated Lazy Stochastic Gradient Descent.

Guanghui Lan, Sebastian Pokutta, Yi Zhou, Daniel Zink

Proceedings of the 34th International Conference on Machine Learning, 2017

Lazifying Conditional Gradient Algorithms.

Gábor Braun, Sebastian Pokutta, Daniel Zink

Proceedings of the 34th International Conference on Machine Learning, 2017

2016

The matching problem has no small symmetric SDP.

Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Inapproximability of Combinatorial Problems via Small LPs and SDPs.

Gábor Braun, Sebastian Pokutta, Daniel Zink

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

2014

LP and SDP inapproximability of combinatorial problems.

Gábor Braun, Sebastian Pokutta, Daniel Zink

CoRR, 2014

1999

PrairieKNOW: a tool to assist the study, creation, and growth of community networks.

Noshir S. Contractor, Ann Peterson Bishop, Daniel Zink

Proceedings of the Human-Computer Interaction: Communication, 1999

1998

IKNOW: A Tool to Assist and Study the Creation, Maintenance, and Dissolution of Knowledge Networks.

Noshir S. Contractor, Daniel Zink, Michael Chan

Proceedings of the Community Computing and Support Systems, 1998