Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Damian Straszak
@article{DBLP:journals/iacr/GarretaGSSZ23,
author = {Albert Garreta and
Adam Gagol and
Aikaterini{-}Panagiota Stouka and
Damian Straszak and
Michal Zajac},
title = {{COMMON:} Order Book with Privacy},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1868},
year = {2023},
url = {https://eprint.iacr.org/2023/1868},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/GarretaGSSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/StraszakV22,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
title = {Iteratively reweighted least squares and slime mold dynamics: connection
and convergence},
journal = {Math. Program.},
volume = {194},
number = {1},
pages = {685--717},
year = {2022},
url = {https://doi.org/10.1007/s10107-021-01644-z},
doi = {10.1007/S10107-021-01644-Z},
timestamp = {Tue, 05 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/StraszakV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-02159,
author = {Daniel Kane and
Andreas Fackler and
Adam Gagol and
Damian Straszak},
title = {Highway: Efficient Consensus with Flexible Finality},
journal = {CoRR},
volume = {abs/2101.02159},
year = {2021},
url = {https://arxiv.org/abs/2101.02159},
eprinttype = {arXiv},
eprint = {2101.02159},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-02159.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EbrahimiSV20,
author = {Javad B. Ebrahimi and
Damian Straszak and
Nisheeth K. Vishnoi},
title = {Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {6},
pages = {1249--1270},
year = {2020},
url = {https://doi.org/10.1137/19M1309523},
doi = {10.1137/19M1309523},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/EbrahimiSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/GagolKSS20,
author = {Adam Gagol and
Jedrzej Kula and
Damian Straszak and
Michal Swietek},
title = {Threshold {ECDSA} for Decentralized Asset Custody},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {498},
year = {2020},
url = {https://eprint.iacr.org/2020/498},
timestamp = {Wed, 27 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/GagolKSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/StraszakV19,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
title = {Belief Propagation, Bethe Approximation and Polynomials},
journal = {{IEEE} Trans. Inf. Theory},
volume = {65},
number = {7},
pages = {4353--4363},
year = {2019},
url = {https://doi.org/10.1109/TIT.2019.2901854},
doi = {10.1109/TIT.2019.2901854},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/StraszakV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aft/GagolLSS19,
author = {Adam Gagol and
Damian Lesniak and
Damian Straszak and
Michal Swietek},
title = {Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine
Nodes},
booktitle = {Proceedings of the 1st {ACM} Conference on Advances in Financial Technologies,
{AFT} 2019, Zurich, Switzerland, October 21-23, 2019},
pages = {214--228},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3318041.3355467},
doi = {10.1145/3318041.3355467},
timestamp = {Thu, 11 Mar 2021 17:04:51 +0100},
biburl = {https://dblp.org/rec/conf/aft/GagolLSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/StraszakV19,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
editor = {Alina Beygelzimer and
Daniel Hsu},
title = {Maximum Entropy Distributions: Bit Complexity and Stability},
booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix,
AZ, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {99},
pages = {2861--2891},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v99/straszak19a.html},
timestamp = {Mon, 08 Jul 2019 16:13:41 +0200},
biburl = {https://dblp.org/rec/conf/colt/StraszakV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-05156,
author = {Adam Gagol and
Damian Lesniak and
Damian Straszak and
Michal Swietek},
title = {Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine
Nodes},
journal = {CoRR},
volume = {abs/1908.05156},
year = {2019},
url = {http://arxiv.org/abs/1908.05156},
eprinttype = {arXiv},
eprint = {1908.05156},
timestamp = {Mon, 19 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-05156.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ch/Straszak18,
author = {Damian Straszak},
title = {New Algorithmic Paradigms for Discrete Problems using Dynamical Systems
and Polynomials},
school = {EPFL, Switzerland},
year = {2018},
url = {https://doi.org/10.5075/epfl-thesis-8357},
doi = {10.5075/EPFL-THESIS-8357},
timestamp = {Tue, 02 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ch/Straszak18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CelisSV18,
author = {L. Elisa Celis and
Damian Straszak and
Nisheeth K. Vishnoi},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Ranking with Fairness Constraints},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {28:1--28:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.28},
doi = {10.4230/LIPICS.ICALP.2018.28},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/CelisSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/CelisKS0KV18,
author = {L. Elisa Celis and
Vijay Keswani and
Damian Straszak and
Amit Deshpande and
Tarun Kathuria and
Nisheeth K. Vishnoi},
editor = {Jennifer G. Dy and
Andreas Krause},
title = {Fair and Diverse DPP-Based Data Summarization},
booktitle = {Proceedings of the 35th International Conference on Machine Learning,
{ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July
10-15, 2018},
series = {Proceedings of Machine Learning Research},
volume = {80},
pages = {715--724},
publisher = {{PMLR}},
year = {2018},
url = {http://proceedings.mlr.press/v80/celis18a.html},
timestamp = {Wed, 03 Apr 2019 18:17:30 +0200},
biburl = {https://dblp.org/rec/conf/icml/CelisKS0KV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-04023,
author = {L. Elisa Celis and
Vijay Keswani and
Damian Straszak and
Amit Deshpande and
Tarun Kathuria and
Nisheeth K. Vishnoi},
title = {Fair and Diverse DPP-based Data Summarization},
journal = {CoRR},
volume = {abs/1802.04023},
year = {2018},
url = {http://arxiv.org/abs/1802.04023},
eprinttype = {arXiv},
eprint = {1802.04023},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-04023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/StraszakV17,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
title = {Belief propagation, bethe approximation and polynomials},
booktitle = {55th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2017, Monticello, IL, USA, October 3-6, 2017},
pages = {666--671},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/ALLERTON.2017.8262801},
doi = {10.1109/ALLERTON.2017.8262801},
timestamp = {Wed, 16 Oct 2019 14:14:55 +0200},
biburl = {https://dblp.org/rec/conf/allerton/StraszakV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CelisDKSV17,
author = {L. Elisa Celis and
Amit Deshpande and
Tarun Kathuria and
Damian Straszak and
Nisheeth K. Vishnoi},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {On the Complexity of Constrained Determinantal Point Processes},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {36:1--36:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.36},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.36},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/CelisDKSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EbrahimiSV17,
author = {Javad B. Ebrahimi and
Damian Straszak and
Nisheeth K. Vishnoi},
editor = {Chris Umans},
title = {Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {1020--1031},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.98},
doi = {10.1109/FOCS.2017.98},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EbrahimiSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/StraszakV17,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {Real stable polynomials and matroids: optimization and counting},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {370--383},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055457},
doi = {10.1145/3055399.3055457},
timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
biburl = {https://dblp.org/rec/conf/stoc/StraszakV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/StraszakV17,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
title = {On Convex Programming Relaxations for the Permanent},
journal = {CoRR},
volume = {abs/1701.01419},
year = {2017},
url = {http://arxiv.org/abs/1701.01419},
eprinttype = {arXiv},
eprint = {1701.01419},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/StraszakV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CelisSV17,
author = {L. Elisa Celis and
Damian Straszak and
Nisheeth K. Vishnoi},
title = {Ranking with Fairness Constraints},
journal = {CoRR},
volume = {abs/1704.06840},
year = {2017},
url = {http://arxiv.org/abs/1704.06840},
eprinttype = {arXiv},
eprint = {1704.06840},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CelisSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EbrahimiSV17,
author = {Javad B. Ebrahimi and
Damian Straszak and
Nisheeth K. Vishnoi},
title = {Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration},
journal = {CoRR},
volume = {abs/1707.02757},
year = {2017},
url = {http://arxiv.org/abs/1707.02757},
eprinttype = {arXiv},
eprint = {1707.02757},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EbrahimiSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-02581,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
title = {Belief Propagation, Bethe Approximation and Polynomials},
journal = {CoRR},
volume = {abs/1708.02581},
year = {2017},
url = {http://arxiv.org/abs/1708.02581},
eprinttype = {arXiv},
eprint = {1708.02581},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-02581.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-02036,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
title = {Computing Maximum Entropy Distributions Everywhere},
journal = {CoRR},
volume = {abs/1711.02036},
year = {2017},
url = {http://arxiv.org/abs/1711.02036},
eprinttype = {arXiv},
eprint = {1711.02036},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-02036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/StraszakV16,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
editor = {Madhu Sudan},
title = {On a Natural Dynamics for Linear Programming},
booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical
Computer Science, Cambridge, MA, USA, January 14-16, 2016},
pages = {291},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2840728.2840762},
doi = {10.1145/2840728.2840762},
timestamp = {Tue, 14 Jun 2022 13:12:41 +0200},
biburl = {https://dblp.org/rec/conf/innovations/StraszakV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/StraszakV16,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
editor = {Robert Krauthgamer},
title = {Natural Algorithms for Flow Problems},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1868--1883},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch131},
doi = {10.1137/1.9781611974331.CH131},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/StraszakV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/StraszakV16,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
title = {{IRLS} and Slime Mold: Equivalence and Convergence},
journal = {CoRR},
volume = {abs/1601.02712},
year = {2016},
url = {http://arxiv.org/abs/1601.02712},
eprinttype = {arXiv},
eprint = {1601.02712},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/StraszakV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/StraszakV16a,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
title = {Generalized Determinantal Point Processes: The Linear Case},
journal = {CoRR},
volume = {abs/1608.00554},
year = {2016},
url = {http://arxiv.org/abs/1608.00554},
eprinttype = {arXiv},
eprint = {1608.00554},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/StraszakV16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/StraszakV16b,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
title = {Real Stable Polynomials and Matroids: Optimization and Counting},
journal = {CoRR},
volume = {abs/1611.04548},
year = {2016},
url = {http://arxiv.org/abs/1611.04548},
eprinttype = {arXiv},
eprint = {1611.04548},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/StraszakV16b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GawrychowskiS15,
author = {Pawel Gawrychowski and
Damian Straszak},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {Strong Inapproximability of the Shortest Reset Word},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9234},
pages = {243--255},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48057-1\_19},
doi = {10.1007/978-3-662-48057-1\_19},
timestamp = {Sun, 02 Jun 2019 21:25:38 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GawrychowskiS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MadryST15,
author = {Aleksander Madry and
Damian Straszak and
Jakub Tarnawski},
editor = {Piotr Indyk},
title = {Fast Generation of Random Spanning Trees and the Effective Resistance
Metric},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {2019--2036},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.134},
doi = {10.1137/1.9781611973730.134},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/MadryST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MadryST15,
author = {Aleksander Madry and
Damian Straszak and
Jakub Tarnawski},
title = {Fast Generation of Random Spanning Trees and the Effective Resistance
Metric},
journal = {CoRR},
volume = {abs/1501.00267},
year = {2015},
url = {http://arxiv.org/abs/1501.00267},
eprinttype = {arXiv},
eprint = {1501.00267},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MadryST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/StraszakV15,
author = {Damian Straszak and
Nisheeth K. Vishnoi},
title = {On a Natural Dynamics for Linear Programming},
journal = {CoRR},
volume = {abs/1511.07020},
year = {2015},
url = {http://arxiv.org/abs/1511.07020},
eprinttype = {arXiv},
eprint = {1511.07020},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/StraszakV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiS14,
author = {Pawel Gawrychowski and
Damian Straszak},
title = {Strong inapproximability of the shortest reset word},
journal = {CoRR},
volume = {abs/1408.5248},
year = {2014},
url = {http://arxiv.org/abs/1408.5248},
eprinttype = {arXiv},
eprint = {1408.5248},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GawrychowskiS13,
author = {Pawel Gawrychowski and
Damian Straszak},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Beating {\textdollar}{\textbackslash}mathcal\{O\}(nm){\textdollar}
in Approximate LZW-Compressed Pattern Matching},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {78--88},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_8},
doi = {10.1007/978-3-642-45030-3\_8},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GawrychowskiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GawrychowskiS13,
author = {Pawel Gawrychowski and
Damian Straszak},
title = {Beating O(nm) in approximate LZW-compressed pattern matching},
journal = {CoRR},
volume = {abs/1308.6509},
year = {2013},
url = {http://arxiv.org/abs/1308.6509},
eprinttype = {arXiv},
eprint = {1308.6509},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GawrychowskiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 01:39 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:
