Follow
Jakub Tětek
Title
Cited by
Cited by
Year
Edge sampling and graph parameter estimation via vertex neighborhood accesses
J Tětek, M Thorup
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
13*2022
Approximate triangle counting via sampling and fast matrix multiplication
J Tětek
49th EATCS International Colloquium on Automata, Languages and Programming …, 2022
92022
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch
C Janos Lebeda, J Tětek
arXiv e-prints, arXiv: 2301.02457, 2023
7*2023
Probgraph: High-performance and high-accuracy graph mining with probabilistic set representations
M Besta, C Miglioli, PS Labini, J Tětek, P Iff, R Kanakagiri, S Ashkboos, ...
SC22: International Conference for High Performance Computing, Networking …, 2022
72022
Countsketches, feature hashing and the median of three
KG Larsen, R Pagh, J Tětek
International Conference on Machine Learning, 6011-6020, 2021
62021
A nearly tight analysis of greedy k-means++
C Grunau, AA Özüdoğru, V Rozhoň, J Tětek
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
52023
Additive noise mechanisms for making randomized approximation algorithms differentially private
J Tětek
arXiv preprint arXiv:2211.03695, 2022
52022
Better sum estimation via weighted sampling
L Beretta, J Tětek
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
42022
Theoretical model of computation and algorithms for FPGA-based hardware accelerators
M Hora, V Končický, J Tětek
Theory and Applications of Models of Computation: 15th Annual Conference …, 2019
32019
Massively Parallel Computation on Embedded Planar Graphs
J Holm, J Tětek
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
2*2023
Performance of Bounded-Rational Agents With the Ability to Self-Modify
J Tětek, M Sklenka, T Gavenčiak
SafeAI @ AAAI Conference on Artificial Intelligence 2021, 2021
22021
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
B Haeupler, R Hladík, V Rozhoň, R Tarjan, J Tětek
arXiv preprint arXiv:2311.11793, 2023
12023
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts
T Gavenčiak, J Tětek
International Conference on Theory and Applications of Models of Computation …, 2019
12019
Fast and Simple Sorting Using Partial Information
B Haeupler, R Hladík, J Iacono, V Rozhon, R Tarjan, J Tětek
arXiv preprint arXiv:2404.04552, 2024
2024
Sampling an Edge in Sublinear Time Exactly and Optimally
T Eden, S Narayanan, J Tětek
Symposium on Simplicity in Algorithms (SOSA), 253-260, 2023
2023
Estimating the Effective Support Size in Constant Query Complexity
S Narayanan, J Tětek
Symposium on Simplicity in Algorithms (SOSA), 242-252, 2023
2023
Bias Reduction for Sum Estimation
T Eden, JBT Houen, S Narayanan, W Rosenbaum, J Tětek
arXiv preprint arXiv:2208.01197, 2022
2022
Compact I/O-Efficient Graph Representations
J Tětek
Univerzita Karlova, Matematicko-fyzikální fakulta, 2019
2019
On the Simultaneous Minimum Spanning Trees Problem
M Konečný, S Kučera, J Novotná, J Pekárek, M Smolík, J Tětek, M Töpfer
Conference on Algorithms and Discrete Applied Mathematics, 235-248, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–19