default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDamian Straszak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i17]Albert Garreta, Adam Gagol, Aikaterini-Panagiota Stouka, Damian Straszak, Michal Zajac:
COMMON: Order Book with Privacy. IACR Cryptol. ePrint Arch. 2023: 1868 (2023)- 2022
- [j3]Damian Straszak, Nisheeth K. Vishnoi:
Iteratively reweighted least squares and slime mold dynamics: connection and convergence. Math. Program. 194(1): 685-717 (2022) - 2021
- [i16]Daniel Kane, Andreas Fackler, Adam Gagol, Damian Straszak:
Highway: Efficient Consensus with Flexible Finality. CoRR abs/2101.02159 (2021) - 2020
- [j2]Javad B. Ebrahimi
, Damian Straszak, Nisheeth K. Vishnoi:
Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration. SIAM J. Comput. 49(6): 1249-1270 (2020) - [i15]Adam Gagol, Jedrzej Kula, Damian Straszak, Michal Swietek:
Threshold ECDSA for Decentralized Asset Custody. IACR Cryptol. ePrint Arch. 2020: 498 (2020)
2010 – 2019
- 2019
- [j1]Damian Straszak, Nisheeth K. Vishnoi:
Belief Propagation, Bethe Approximation and Polynomials. IEEE Trans. Inf. Theory 65(7): 4353-4363 (2019) - [c13]Adam Gagol, Damian Lesniak, Damian Straszak, Michal Swietek:
Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes. AFT 2019: 214-228 - [c12]Damian Straszak, Nisheeth K. Vishnoi:
Maximum Entropy Distributions: Bit Complexity and Stability. COLT 2019: 2861-2891 - [i14]Adam Gagol, Damian Lesniak, Damian Straszak, Michal Swietek:
Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes. CoRR abs/1908.05156 (2019) - 2018
- [b1]Damian Straszak:
New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials. EPFL, Switzerland, 2018 - [c11]L. Elisa Celis, Damian Straszak, Nisheeth K. Vishnoi:
Ranking with Fairness Constraints. ICALP 2018: 28:1-28:15 - [c10]L. Elisa Celis, Vijay Keswani, Damian Straszak, Amit Deshpande, Tarun Kathuria, Nisheeth K. Vishnoi:
Fair and Diverse DPP-Based Data Summarization. ICML 2018: 715-724 - [i13]L. Elisa Celis, Vijay Keswani, Damian Straszak, Amit Deshpande, Tarun Kathuria, Nisheeth K. Vishnoi:
Fair and Diverse DPP-based Data Summarization. CoRR abs/1802.04023 (2018) - 2017
- [c9]Damian Straszak, Nisheeth K. Vishnoi:
Belief propagation, bethe approximation and polynomials. Allerton 2017: 666-671 - [c8]L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Damian Straszak, Nisheeth K. Vishnoi:
On the Complexity of Constrained Determinantal Point Processes. APPROX-RANDOM 2017: 36:1-36:22 - [c7]Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi:
Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration. FOCS 2017: 1020-1031 - [c6]Damian Straszak, Nisheeth K. Vishnoi:
Real stable polynomials and matroids: optimization and counting. STOC 2017: 370-383 - [i12]Damian Straszak, Nisheeth K. Vishnoi:
On Convex Programming Relaxations for the Permanent. CoRR abs/1701.01419 (2017) - [i11]L. Elisa Celis, Damian Straszak, Nisheeth K. Vishnoi:
Ranking with Fairness Constraints. CoRR abs/1704.06840 (2017) - [i10]Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi:
Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration. CoRR abs/1707.02757 (2017) - [i9]Damian Straszak, Nisheeth K. Vishnoi:
Belief Propagation, Bethe Approximation and Polynomials. CoRR abs/1708.02581 (2017) - [i8]Damian Straszak, Nisheeth K. Vishnoi:
Computing Maximum Entropy Distributions Everywhere. CoRR abs/1711.02036 (2017) - 2016
- [c5]Damian Straszak, Nisheeth K. Vishnoi:
On a Natural Dynamics for Linear Programming. ITCS 2016: 291 - [c4]Damian Straszak, Nisheeth K. Vishnoi:
Natural Algorithms for Flow Problems. SODA 2016: 1868-1883 - [i7]Damian Straszak, Nisheeth K. Vishnoi:
IRLS and Slime Mold: Equivalence and Convergence. CoRR abs/1601.02712 (2016) - [i6]Damian Straszak, Nisheeth K. Vishnoi:
Generalized Determinantal Point Processes: The Linear Case. CoRR abs/1608.00554 (2016) - [i5]Damian Straszak, Nisheeth K. Vishnoi:
Real Stable Polynomials and Matroids: Optimization and Counting. CoRR abs/1611.04548 (2016) - 2015
- [c3]Pawel Gawrychowski, Damian Straszak:
Strong Inapproximability of the Shortest Reset Word. MFCS (1) 2015: 243-255 - [c2]Aleksander Madry, Damian Straszak, Jakub Tarnawski:
Fast Generation of Random Spanning Trees and the Effective Resistance Metric. SODA 2015: 2019-2036 - [i4]Aleksander Madry, Damian Straszak, Jakub Tarnawski:
Fast Generation of Random Spanning Trees and the Effective Resistance Metric. CoRR abs/1501.00267 (2015) - [i3]Damian Straszak, Nisheeth K. Vishnoi:
On a Natural Dynamics for Linear Programming. CoRR abs/1511.07020 (2015) - 2014
- [i2]Pawel Gawrychowski, Damian Straszak:
Strong inapproximability of the shortest reset word. CoRR abs/1408.5248 (2014) - 2013
- [c1]Pawel Gawrychowski, Damian Straszak:
Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching. ISAAC 2013: 78-88 - [i1]Pawel Gawrychowski, Damian Straszak:
Beating O(nm) in approximate LZW-compressed pattern matching. CoRR abs/1308.6509 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
