Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jakub Tetek
@inproceedings{DBLP:conf/approx/EdenHNRT23,
author = {Talya Eden and
Jakob B{\ae}k Tejs Houen and
Shyam Narayanan and
Will Rosenbaum and
Jakub Tetek},
editor = {Nicole Megow and
Adam D. Smith},
title = {Bias Reduction for Sum Estimation},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {62:1--62:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.62},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.62},
timestamp = {Sat, 09 Sep 2023 00:04:38 +0200},
biburl = {https://dblp.org/rec/conf/approx/EdenHNRT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/LebedaT23,
author = {Christian Janos Lebeda and
Jakub Tetek},
editor = {Floris Geerts and
Hung Q. Ngo and
Stavros Sintos},
title = {Better Differentially Private Approximate Histograms and Heavy Hitters
using the Misra-Gries Sketch},
booktitle = {Proceedings of the 42nd {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2023, Seattle, WA, USA, June 18-23, 2023},
pages = {79--88},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3584372.3588673},
doi = {10.1145/3584372.3588673},
timestamp = {Thu, 15 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/LebedaT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GrunauORT23,
author = {Christoph Grunau and
Ahmet Alper {\"{O}}z{\"{u}}dogru and
V{\'{a}}clav Rozhon and
Jakub Tetek},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {A Nearly Tight Analysis of Greedy k-means++},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {1012--1070},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch39},
doi = {10.1137/1.9781611977554.CH39},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GrunauORT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HolmT23,
author = {Jacob Holm and
Jakub Tetek},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Massively Parallel Computation on Embedded Planar Graphs},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {4373--4408},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch167},
doi = {10.1137/1.9781611977554.CH167},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/HolmT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/NarayananT23,
author = {Shyam Narayanan and
Jakub Tetek},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Estimating the Effective Support Size in Constant Query Complexity},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {242--252},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch22},
doi = {10.1137/1.9781611977585.CH22},
timestamp = {Mon, 20 Mar 2023 16:52:56 +0100},
biburl = {https://dblp.org/rec/conf/sosa/NarayananT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/EdenNT23,
author = {Talya Eden and
Shyam Narayanan and
Jakub Tetek},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {Sampling an Edge in Sublinear Time Exactly and Optimally},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {253--260},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch23},
doi = {10.1137/1.9781611977585.CH23},
timestamp = {Mon, 20 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/EdenNT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-02457,
author = {Christian Janos Lebeda and
Jakub Tetek},
title = {Better Differentially Private Approximate Histograms and Heavy Hitters
using the Misra-Gries Sketch},
journal = {CoRR},
volume = {abs/2301.02457},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.02457},
doi = {10.48550/ARXIV.2301.02457},
eprinttype = {arXiv},
eprint = {2301.02457},
timestamp = {Tue, 10 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-02457.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-11793,
author = {Bernhard Haeupler and
Richard Hlad{\'{\i}}k and
V{\'{a}}clav Rozhon and
Robert E. Tarjan and
Jakub Tetek},
title = {Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps},
journal = {CoRR},
volume = {abs/2311.11793},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.11793},
doi = {10.48550/ARXIV.2311.11793},
eprinttype = {arXiv},
eprint = {2311.11793},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-11793.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Tetek22,
author = {Jakub Tetek},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Approximate Triangle Counting via Sampling and Fast Matrix Multiplication},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {107:1--107:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.107},
doi = {10.4230/LIPICS.ICALP.2022.107},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Tetek22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sc/BestaMLTIKAJPKGVMH22,
author = {Maciej Besta and
Cesare Miglioli and
Paolo Sylos Labini and
Jakub Tetek and
Patrick Iff and
Raghavendra Kanakagiri and
Saleh Ashkboos and
Kacper Janda and
Michal Podstawski and
Grzegorz Kwasniewski and
Niels Gleinig and
Flavio Vella and
Onur Mutlu and
Torsten Hoefler},
editor = {Felix Wolf and
Sameer Shende and
Candace Culhane and
Sadaf R. Alam and
Heike Jagode},
title = {ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic
Set Representations},
booktitle = {{SC22:} International Conference for High Performance Computing, Networking,
Storage and Analysis, Dallas, TX, USA, November 13-18, 2022},
pages = {43:1--43:17},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/SC41404.2022.00048},
doi = {10.1109/SC41404.2022.00048},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sc/BestaMLTIKAJPKGVMH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BerettaT22,
author = {Lorenzo Beretta and
Jakub Tetek},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Better Sum Estimation via Weighted Sampling},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {2303--2338},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.93},
doi = {10.1137/1.9781611977073.93},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/BerettaT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TetekT22,
author = {Jakub Tetek and
Mikkel Thorup},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Edge sampling and graph parameter estimation via vertex neighborhood
accesses},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1116--1129},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520059},
doi = {10.1145/3519935.3520059},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/TetekT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2204-09035,
author = {Jacob Holm and
Jakub Tetek},
title = {Massively Parallel Computation and Sublinear-Time Algorithms for Embedded
Planar Graphs},
journal = {CoRR},
volume = {abs/2204.09035},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2204.09035},
doi = {10.48550/ARXIV.2204.09035},
eprinttype = {arXiv},
eprint = {2204.09035},
timestamp = {Mon, 25 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2204-09035.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-07949,
author = {Christoph Grunau and
Ahmet Alper {\"{O}}z{\"{u}}dogru and
V{\'{a}}clav Rozhon and
Jakub Tetek},
title = {A Nearly Tight Analysis of Greedy k-means++},
journal = {CoRR},
volume = {abs/2207.07949},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.07949},
doi = {10.48550/ARXIV.2207.07949},
eprinttype = {arXiv},
eprint = {2207.07949},
timestamp = {Tue, 19 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-07949.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-01197,
author = {Talya Eden and
Jakob B{\ae}k Tejs Houen and
Shyam Narayanan and
Will Rosenbaum and
Jakub Tetek},
title = {Bias Reduction for Sum Estimation},
journal = {CoRR},
volume = {abs/2208.01197},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.01197},
doi = {10.48550/ARXIV.2208.01197},
eprinttype = {arXiv},
eprint = {2208.01197},
timestamp = {Tue, 09 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-01197.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-11469,
author = {Maciej Besta and
Cesare Miglioli and
Paolo Sylos Labini and
Jakub Tetek and
Patrick Iff and
Raghavendra Kanakagiri and
Saleh Ashkboos and
Kacper Janda and
Michal Podstawski and
Grzegorz Kwasniewski and
Niels Gleinig and
Flavio Vella and
Onur Mutlu and
Torsten Hoefler},
title = {ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic
Set Representations},
journal = {CoRR},
volume = {abs/2208.11469},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.11469},
doi = {10.48550/ARXIV.2208.11469},
eprinttype = {arXiv},
eprint = {2208.11469},
timestamp = {Tue, 30 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-11469.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03695,
author = {Jakub Tetek},
title = {Additive Noise Mechanisms for Making Randomized Approximation Algorithms
Differentially Private},
journal = {CoRR},
volume = {abs/2211.03695},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03695},
doi = {10.48550/ARXIV.2211.03695},
eprinttype = {arXiv},
eprint = {2211.03695},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03695.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-04981,
author = {Talya Eden and
Shyam Narayanan and
Jakub Tetek},
title = {Sampling an Edge in Sublinear Time Exactly and Optimally},
journal = {CoRR},
volume = {abs/2211.04981},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.04981},
doi = {10.48550/ARXIV.2211.04981},
eprinttype = {arXiv},
eprint = {2211.04981},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-04981.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-11344,
author = {Shyam Narayanan and
Jakub Tetek},
title = {Estimating the Effective Support Size in Constant Query Complexity},
journal = {CoRR},
volume = {abs/2211.11344},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.11344},
doi = {10.48550/ARXIV.2211.11344},
eprinttype = {arXiv},
eprint = {2211.11344},
timestamp = {Thu, 24 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-11344.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/TetekSG21,
author = {Jakub Tetek and
Marek Sklenka and
Tomas Gavenciak},
editor = {Hu{\'{a}}scar Espinoza and
John A. McDermid and
Xiaowei Huang and
Mauricio Castillo{-}Effen and
Xin Cynthia Chen and
Jos{\'{e}} Hern{\'{a}}ndez{-}Orallo and
Se{\'{a}}n {\'{O}} h{\'{E}}igeartaigh and
Richard Mallah},
title = {Performance of Bounded-Rational Agents With the Ability to Self-Modify},
booktitle = {Proceedings of the Workshop on Artificial Intelligence Safety 2021
(SafeAI 2021) co-located with the Thirty-Fifth {AAAI} Conference on
Artificial Intelligence {(AAAI} 2021), Virtual, February 8, 2021},
series = {{CEUR} Workshop Proceedings},
volume = {2808},
publisher = {CEUR-WS.org},
year = {2021},
url = {https://ceur-ws.org/Vol-2808/Paper\_26.pdf},
timestamp = {Fri, 10 Mar 2023 16:22:15 +0100},
biburl = {https://dblp.org/rec/conf/aaai/TetekSG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/LarsenPT21,
author = {Kasper Green Larsen and
Rasmus Pagh and
Jakub Tetek},
editor = {Marina Meila and
Tong Zhang},
title = {CountSketches, Feature Hashing and the Median of Three},
booktitle = {Proceedings of the 38th International Conference on Machine Learning,
{ICML} 2021, 18-24 July 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {139},
pages = {6011--6020},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v139/larsen21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/LarsenPT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-02193,
author = {Kasper Green Larsen and
Rasmus Pagh and
Jakub Tetek},
title = {CountSketches, Feature Hashing and the Median of Three},
journal = {CoRR},
volume = {abs/2102.02193},
year = {2021},
url = {https://arxiv.org/abs/2102.02193},
eprinttype = {arXiv},
eprint = {2102.02193},
timestamp = {Tue, 09 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-02193.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-08501,
author = {Jakub Tetek},
title = {Approximate Triangle Counting via Sampling and Fast Matrix Multiplication},
journal = {CoRR},
volume = {abs/2104.08501},
year = {2021},
url = {https://arxiv.org/abs/2104.08501},
eprinttype = {arXiv},
eprint = {2104.08501},
timestamp = {Mon, 26 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-08501.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-03821,
author = {Jakub Tetek and
Mikkel Thorup},
title = {Sampling and Counting Edges via Vertex Accesses},
journal = {CoRR},
volume = {abs/2107.03821},
year = {2021},
url = {https://arxiv.org/abs/2107.03821},
eprinttype = {arXiv},
eprint = {2107.03821},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-03821.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-14948,
author = {Lorenzo Beretta and
Jakub Tetek},
title = {Better Sum Estimation via Weighted Sampling},
journal = {CoRR},
volume = {abs/2110.14948},
year = {2021},
url = {https://arxiv.org/abs/2110.14948},
eprinttype = {arXiv},
eprint = {2110.14948},
timestamp = {Thu, 25 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-14948.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-11178,
author = {Jakub Tetek},
title = {Sampling an Edge Uniformly in Sublinear Time},
journal = {CoRR},
volume = {abs/2009.11178},
year = {2020},
url = {https://arxiv.org/abs/2009.11178},
eprinttype = {arXiv},
eprint = {2009.11178},
timestamp = {Wed, 30 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-11178.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-06275,
author = {Jakub Tetek and
Marek Sklenka and
Tomas Gavenciak},
title = {Performance of Bounded-Rational Agents With the Ability to Self-Modify},
journal = {CoRR},
volume = {abs/2011.06275},
year = {2020},
url = {https://arxiv.org/abs/2011.06275},
eprinttype = {arXiv},
eprint = {2011.06275},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-06275.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/GavenciakT19,
author = {Tomas Gavenciak and
Jakub Tetek},
editor = {T. V. Gopal and
Junzo Watada},
title = {Compact I/O-Efficient Representation of Separable Graphs and Optimal
Tree Layouts},
booktitle = {Theory and Applications of Models of Computation - 15th Annual Conference,
{TAMC} 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11436},
pages = {222--241},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-14812-6\_14},
doi = {10.1007/978-3-030-14812-6\_14},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/GavenciakT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/HoraKT19,
author = {Martin Hora and
V{\'{a}}clav Koncick{\'{y}} and
Jakub Tetek},
editor = {T. V. Gopal and
Junzo Watada},
title = {Theoretical Model of Computation and Algorithms for FPGA-Based Hardware
Accelerators},
booktitle = {Theory and Applications of Models of Computation - 15th Annual Conference,
{TAMC} 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11436},
pages = {295--312},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-14812-6\_18},
doi = {10.1007/978-3-030-14812-6\_18},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/HoraKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/KonecnyKNPSTT18,
author = {Matej Konecn{\'{y}} and
Stanislav Kucera and
Jana Novotn{\'{a}} and
Jakub Pek{\'{a}}rek and
Martin Smol{\'{\i}}k and
Jakub Tetek and
Martin T{\"{o}}pfer},
editor = {B. S. Panda and
Partha P. Goswami},
title = {On the Simultaneous Minimum Spanning Trees Problem},
booktitle = {Algorithms and Discrete Applied Mathematics - 4th International Conference,
{CALDAM} 2018, Guwahati, India, February 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10743},
pages = {235--248},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-74180-2\_20},
doi = {10.1007/978-3-319-74180-2\_20},
timestamp = {Wed, 09 Jun 2021 08:38:40 +0200},
biburl = {https://dblp.org/rec/conf/caldam/KonecnyKNPSTT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-03611,
author = {Martin Hora and
V{\'{a}}clav Koncick{\'{y}} and
Jakub Tetek},
title = {Theoretical Model of Computation and Algorithms for FPGA-based Hardware
Accelerators},
journal = {CoRR},
volume = {abs/1807.03611},
year = {2018},
url = {http://arxiv.org/abs/1807.03611},
eprinttype = {arXiv},
eprint = {1807.03611},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-03611.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-06749,
author = {Tomas Gavenciak and
Jakub Tetek},
title = {Compact I/O-Efficient Representation of Separable Graphs and Optimal
Tree Layouts},
journal = {CoRR},
volume = {abs/1811.06749},
year = {2018},
url = {http://arxiv.org/abs/1811.06749},
eprinttype = {arXiv},
eprint = {1811.06749},
timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-06749.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-00253,
author = {Matej Konecn{\'{y}} and
Stanislav Kucera and
Jana Novotn{\'{a}} and
Jakub Pek{\'{a}}rek and
Martin Smol{\'{\i}}k and
Jakub Tetek and
Martin T{\"{o}}pfer},
title = {On the Simultaneous Minimum Spanning Trees Problem},
journal = {CoRR},
volume = {abs/1712.00253},
year = {2017},
url = {http://arxiv.org/abs/1712.00253},
eprinttype = {arXiv},
eprint = {1712.00253},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-00253.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-02-06 23:38 CET 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:
