Jakub Tetek

According to our database, Jakub Tetek authored at least 26 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Better Sum Estimation via Weighted Sampling.

Lorenzo Beretta, Jakub Tetek

ACM Trans. Algorithms, July, 2024

Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch.

Christian Janos Lebeda, Jakub Tetek

SIGMOD Rec., March, 2024

Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space.

Christian Janos Lebeda, Jakub Tetek

CoRR, 2024

Bidirectional Dijkstra's Algorithm is Instance-Optimal.

Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek

CoRR, 2024

Smooth Sensitivity Revisited: Towards Optimality.

Richard Hladík, Jakub Tetek

CoRR, 2024

Near-Universally-Optimal Differentially Private Minimum Spanning Trees.

Richard Hladík, Jakub Tetek

CoRR, 2024

Fast and Simple Sorting Using Partial Information.

Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek

CoRR, 2024

Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation.

Shyam Narayanan, Václav Rozhon, Jakub Tetek, Mikkel Thorup

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps.

Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private.

Jakub Tetek

Proceedings of the Approximation, 2024

2023

Estimating the Effective Support Size in Constant Query Complexity.

Shyam Narayanan, Jakub Tetek

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Sampling an Edge in Sublinear Time Exactly and Optimally.

Talya Eden, Shyam Narayanan, Jakub Tetek

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Massively Parallel Computation on Embedded Planar Graphs.

Jacob Holm, Jakub Tetek

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

A Nearly Tight Analysis of Greedy k-means++.

Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Bias Reduction for Sum Estimation.

Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek

Proceedings of the Approximation, 2023

2022

Massively Parallel Computation and Sublinear-Time Algorithms for Embedded Planar Graphs.

Jacob Holm, Jakub Tetek

CoRR, 2022

Edge sampling and graph parameter estimation via vertex neighborhood accesses.

Jakub Tetek, Mikkel Thorup

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations.

Maciej Besta, Cesare Miglioli, Paolo Sylos Labini, Jakub Tetek, Patrick Iff, Raghavendra Kanakagiri, Saleh Ashkboos, Kacper Janda, Michal Podstawski, Grzegorz Kwasniewski, Niels Gleinig, Flavio Vella, Onur Mutlu, Torsten Hoefler

Proceedings of the SC22: International Conference for High Performance Computing, 2022

Approximate Triangle Counting via Sampling and Fast Matrix Multiplication.

Jakub Tetek

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Sampling and Counting Edges via Vertex Accesses.

Jakub Tetek, Mikkel Thorup

CoRR, 2021

CountSketches, Feature Hashing and the Median of Three.

Kasper Green Larsen, Rasmus Pagh, Jakub Tetek

Proceedings of the 38th International Conference on Machine Learning, 2021

Performance of Bounded-Rational Agents With the Ability to Self-Modify.

Jakub Tetek, Marek Sklenka, Tomas Gavenciak

Proceedings of the Workshop on Artificial Intelligence Safety 2021 (SafeAI 2021) co-located with the Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2021), 2021

2020

Sampling an Edge Uniformly in Sublinear Time.

Jakub Tetek

CoRR, 2020

2019

Theoretical Model of Computation and Algorithms for FPGA-Based Hardware Accelerators.

Martin Hora, Václav Koncický, Jakub Tetek

Proceedings of the Theory and Applications of Models of Computation, 2019

Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts.

Tomas Gavenciak, Jakub Tetek

Proceedings of the Theory and Applications of Models of Computation, 2019

2018

On the Simultaneous Minimum Spanning Trees Problem.

Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018