default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakub Tetek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Christian Janos Lebeda, Jakub Tetek:
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch. SIGMOD Rec. 53(1): 7-14 (2024)- [j1]Lorenzo Beretta
, Jakub Tetek:
Better Sum Estimation via Weighted Sampling. ACM Trans. Algorithms 20(3): 27 (2024) - [c18]Jakub Tetek:
Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private. APPROX/RANDOM 2024: 73:1-73:20 - [c17]Shyam Narayanan, Václav Rozhon, Jakub Tetek, Mikkel Thorup:
Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation. FOCS 2024: 658-688 - [c16]Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps. FOCS 2024: 2099-2130 - [i24]Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Fast and Simple Sorting Using Partial Information. CoRR abs/2404.04552 (2024) - [i23]Richard Hladík, Jakub Tetek:
Near-Universally-Optimal Differentially Private Minimum Spanning Trees. CoRR abs/2404.15035 (2024) - [i22]Richard Hladík, Jakub Tetek:
Smooth Sensitivity Revisited: Towards Optimality. CoRR abs/2407.05067 (2024) - [i21]Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Bidirectional Dijkstra's Algorithm is Instance-Optimal. CoRR abs/2410.14638 (2024) - [i20]Shyam Narayanan, Václav Rozhon, Jakub Tetek, Mikkel Thorup:
Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation. CoRR abs/2410.14643 (2024) - [i19]Christian Janos Lebeda, Jakub Tetek:
Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space. CoRR abs/2410.22123 (2024) - 2023
- [c15]Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek:
Bias Reduction for Sum Estimation. APPROX/RANDOM 2023: 62:1-62:21 - [c14]Christian Janos Lebeda, Jakub Tetek:
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch. PODS 2023: 79-88 - [c13]Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek:
A Nearly Tight Analysis of Greedy k-means++. SODA 2023: 1012-1070 - [c12]Jacob Holm, Jakub Tetek:
Massively Parallel Computation on Embedded Planar Graphs. SODA 2023: 4373-4408 - [c11]Shyam Narayanan, Jakub Tetek:
Estimating the Effective Support Size in Constant Query Complexity. SOSA 2023: 242-252 - [c10]Talya Eden, Shyam Narayanan, Jakub Tetek:
Sampling an Edge in Sublinear Time Exactly and Optimally. SOSA 2023: 253-260 - [i18]Christian Janos Lebeda, Jakub Tetek:
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch. CoRR abs/2301.02457 (2023) - [i17]Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps. CoRR abs/2311.11793 (2023) - 2022
- [c9]Jakub Tetek:
Approximate Triangle Counting via Sampling and Fast Matrix Multiplication. ICALP 2022: 107:1-107:20 - [c8]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: 43:1-43:17 - [c7]Lorenzo Beretta, Jakub Tetek:
Better Sum Estimation via Weighted Sampling. SODA 2022: 2303-2338 - [c6]Jakub Tetek, Mikkel Thorup:
Edge sampling and graph parameter estimation via vertex neighborhood accesses. STOC 2022: 1116-1129 - [i16]Jacob Holm, Jakub Tetek:
Massively Parallel Computation and Sublinear-Time Algorithms for Embedded Planar Graphs. CoRR abs/2204.09035 (2022) - [i15]Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon, Jakub Tetek:
A Nearly Tight Analysis of Greedy k-means++. CoRR abs/2207.07949 (2022) - [i14]Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek:
Bias Reduction for Sum Estimation. CoRR abs/2208.01197 (2022) - [i13]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 abs/2208.11469 (2022) - [i12]Jakub Tetek:
Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private. CoRR abs/2211.03695 (2022) - [i11]Talya Eden, Shyam Narayanan, Jakub Tetek:
Sampling an Edge in Sublinear Time Exactly and Optimally. CoRR abs/2211.04981 (2022) - [i10]Shyam Narayanan, Jakub Tetek:
Estimating the Effective Support Size in Constant Query Complexity. CoRR abs/2211.11344 (2022) - 2021
- [c5]Jakub Tetek, Marek Sklenka, Tomas Gavenciak:
Performance of Bounded-Rational Agents With the Ability to Self-Modify. SafeAI@AAAI 2021 - [c4]Kasper Green Larsen, Rasmus Pagh, Jakub Tetek:
CountSketches, Feature Hashing and the Median of Three. ICML 2021: 6011-6020 - [i9]Kasper Green Larsen, Rasmus Pagh, Jakub Tetek:
CountSketches, Feature Hashing and the Median of Three. CoRR abs/2102.02193 (2021) - [i8]Jakub Tetek:
Approximate Triangle Counting via Sampling and Fast Matrix Multiplication. CoRR abs/2104.08501 (2021) - [i7]Jakub Tetek, Mikkel Thorup:
Sampling and Counting Edges via Vertex Accesses. CoRR abs/2107.03821 (2021) - [i6]Lorenzo Beretta, Jakub Tetek:
Better Sum Estimation via Weighted Sampling. CoRR abs/2110.14948 (2021) - 2020
- [i5]Jakub Tetek:
Sampling an Edge Uniformly in Sublinear Time. CoRR abs/2009.11178 (2020) - [i4]Jakub Tetek, Marek Sklenka, Tomas Gavenciak:
Performance of Bounded-Rational Agents With the Ability to Self-Modify. CoRR abs/2011.06275 (2020)
2010 – 2019
- 2019
- [c3]Tomas Gavenciak, Jakub Tetek:
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts. TAMC 2019: 222-241 - [c2]Martin Hora, Václav Koncický, Jakub Tetek:
Theoretical Model of Computation and Algorithms for FPGA-Based Hardware Accelerators. TAMC 2019: 295-312 - 2018
- [c1]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: 235-248 - [i3]Martin Hora, Václav Koncický, Jakub Tetek:
Theoretical Model of Computation and Algorithms for FPGA-based Hardware Accelerators. CoRR abs/1807.03611 (2018) - [i2]Tomas Gavenciak, Jakub Tetek:
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts. CoRR abs/1811.06749 (2018) - 2017
- [i1]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 abs/1712.00253 (2017)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:40 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:
