Jakub Tetek

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 38

Top Topics

Sampling Strategies

Minimum Spanning Trees

Differentially Private

Top Venues

Publications

Christian Janos Lebeda, Jakub Tetek
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch. SIGMOD Rec. 53 (1) (2024)
Richard Hladík, Jakub Tetek
Near-Universally-Optimal Differentially Private Minimum Spanning Trees. CoRR (2024)
Lorenzo Beretta, Jakub Tetek
Better Sum Estimation via Weighted Sampling. ACM Trans. Algorithms 20 (3) (2024)
Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
Fast and Simple Sorting Using Partial Information. CoRR (2024)
Richard Hladík, Jakub Tetek
Smooth Sensitivity Revisited: Towards Optimality. CoRR (2024)
Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps. CoRR (2023)
Christian Janos Lebeda, Jakub Tetek
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch. PODS (2023)
Shyam Narayanan, Jakub Tetek
Estimating the Effective Support Size in Constant Query Complexity. SOSA (2023)
Talya Eden, Shyam Narayanan, Jakub Tetek
Sampling an Edge in Sublinear Time Exactly and Optimally. SOSA (2023)
Christian Janos Lebeda, Jakub Tetek
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch. CoRR (2023)
Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek
Bias Reduction for Sum Estimation. APPROX/RANDOM (2023)
Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek
A Nearly Tight Analysis of Greedy k-means++. SODA (2023)
Jacob Holm, Jakub Tetek
Massively Parallel Computation on Embedded Planar Graphs. SODA (2023)
Jacob Holm, Jakub Tetek
Massively Parallel Computation and Sublinear-Time Algorithms for Embedded Planar Graphs. CoRR (2022)
Shyam Narayanan, Jakub Tetek
Estimating the Effective Support Size in Constant Query Complexity. CoRR (2022)
Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek
A Nearly Tight Analysis of Greedy k-means++. CoRR (2022)
Talya Eden, Shyam Narayanan, Jakub Tetek
Sampling an Edge in Sublinear Time Exactly and Optimally. CoRR (2022)
Jakub Tetek, Mikkel Thorup
Edge sampling and graph parameter estimation via vertex neighborhood accesses. STOC (2022)
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
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations. CoRR (2022)
Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek
Bias Reduction for Sum Estimation. CoRR (2022)
Lorenzo Beretta, Jakub Tetek
Better Sum Estimation via Weighted Sampling. SODA (2022)
Jakub Tetek
Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private. CoRR (2022)
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
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations. SC (2022)
Jakub Tetek
Approximate Triangle Counting via Sampling and Fast Matrix Multiplication. ICALP (2022)
Jakub Tetek, Mikkel Thorup
Sampling and Counting Edges via Vertex Accesses. CoRR (2021)
Kasper Green Larsen, Rasmus Pagh, Jakub Tetek
CountSketches, Feature Hashing and the Median of Three. ICML (2021)
Jakub Tetek, Marek Sklenka, Tomas Gavenciak
Performance of Bounded-Rational Agents With the Ability to Self-Modify. SafeAI@AAAI (2021)
Kasper Green Larsen, Rasmus Pagh, Jakub Tetek
CountSketches, Feature Hashing and the Median of Three. CoRR (2021)
Jakub Tetek
Approximate Triangle Counting via Sampling and Fast Matrix Multiplication. CoRR (2021)
Lorenzo Beretta, Jakub Tetek
Better Sum Estimation via Weighted Sampling. CoRR (2021)
Jakub Tetek, Marek Sklenka, Tomas Gavenciak
Performance of Bounded-Rational Agents With the Ability to Self-Modify. CoRR (2020)
Jakub Tetek
Sampling an Edge Uniformly in Sublinear Time. CoRR (2020)
Martin Hora, Václav Koncický, Jakub Tetek
Theoretical Model of Computation and Algorithms for FPGA-Based Hardware Accelerators. TAMC (2019)
Tomas Gavenciak, Jakub Tetek
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts. TAMC (2019)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer
On the Simultaneous Minimum Spanning Trees Problem. CALDAM (2018)
Martin Hora, Václav Koncický, Jakub Tetek
Theoretical Model of Computation and Algorithms for FPGA-based Hardware Accelerators. CoRR (2018)
Tomas Gavenciak, Jakub Tetek
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts. CoRR (2018)
Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer
On the Simultaneous Minimum Spanning Trees Problem. CoRR (2017)