Jakub Tetek - RankMe

52 papers A* 10A 3C 2Journal 29Unranked 8

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