Damian Straszak

Orcid: 0000-0003-4013-2270

According to our database1, Damian Straszak authored at least 23 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
COMMON: Order Book with Privacy.
IACR Cryptol. ePrint Arch., 2023

2022
Iteratively reweighted least squares and slime mold dynamics: connection and convergence.
Math. Program., 2022

2021
Highway: Efficient Consensus with Flexible Finality.
CoRR, 2021

2020
Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration.
SIAM J. Comput., 2020

Threshold ECDSA for Decentralized Asset Custody.
IACR Cryptol. ePrint Arch., 2020

2019
Belief Propagation, Bethe Approximation and Polynomials.
IEEE Trans. Inf. Theory, 2019

Maximum Entropy Distributions: Bit Complexity and Stability.
Proceedings of the Conference on Learning Theory, 2019

Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes.
Proceedings of the 1st ACM Conference on Advances in Financial Technologies, 2019

2018
New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials.
PhD thesis, 2018

Fair and Diverse DPP-Based Data Summarization.
Proceedings of the 35th International Conference on Machine Learning, 2018

Ranking with Fairness Constraints.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Computing Maximum Entropy Distributions Everywhere.
CoRR, 2017

On Convex Programming Relaxations for the Permanent.
CoRR, 2017

Real stable polynomials and matroids: optimization and counting.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

On the Complexity of Constrained Determinantal Point Processes.
Proceedings of the Approximation, 2017

2016
Generalized Determinantal Point Processes: The Linear Case.
CoRR, 2016

IRLS and Slime Mold: Equivalence and Convergence.
CoRR, 2016

Natural Algorithms for Flow Problems.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

On a Natural Dynamics for Linear Programming.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015
Fast Generation of Random Spanning Trees and the Effective Resistance Metric.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Strong Inapproximability of the Shortest Reset Word.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2013
Beating O(nm) in approximate LZW-compressed pattern matching.
CoRR, 2013

Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013


  Loading...