Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Tetek, Jakub
27  Ergebnisse:
Personensuche X
?
1

Better Sum Estimation via Weighted Sampling:

Beretta, Lorenzo ; Tětek, Jakub
ACM Transactions on Algorithms.  20 (2024)  3 - p. 1-33 , 2024
Link: https://doi.org/10.1145/..
 
?
2

Better Differentially Private Approximate Histograms and He..:

Janos Lebeda, Christian ; Tetek, Jakub
ACM SIGMOD Record.  53 (2024)  1 - p. 7-14 , 2024
Link: https://doi.org/10.1145/..
 
?
3

Better Differentially Private Approximate Histograms and He..:

, In: Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,
Lebeda, Christian Janos ; Tetek, Jakub - p. 79-88 , 2023
Link: https://dl.acm.org/doi/1..
 
?
4

ProbGraph: High-Performance and High-Accuracy Graph Mining ..:

, In: SC22: International Conference for High Performance Computing, Networking, Storage and Analysis,
Besta, Maciej ; Miglioli, Cesare ; Labini, Paolo Sylos... - p. 1-17 , 2022
Link: https://doi.org/10.1109/..
 
?
5

Edge sampling and graph parameter estimation via vertex nei..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Tětek, Jakub ; Thorup, Mikkel - p. 1116-1129 , 2022
Link: https://dl.acm.org/doi/1..
 
?
6

Theoretical Model of Computation and Algorithms for FPGA-Ba..:

, In: Lecture Notes in Computer Science; Theory and Applications of Models of Computation,
Hora, Martin ; Končický, Václav ; Tětek, Jakub - p. 295-312 , 2019
Link: https://doi.org/10.1007/..
 
?
7

Compact I/O-Efficient Representation of Separable Graphs an..:

, In: Lecture Notes in Computer Science; Theory and Applications of Models of Computation,
Gavenčiak, Tomáš ; Tětek, Jakub - p. 222-241 , 2019
Link: https://doi.org/10.1007/..
 
?
8

Better Differentially Private Approximate Histograms and He..:

Lebeda, Christian Janos ; Tětek, Jakub
https://pure.itu.dk/portal/da/publications/a7408031-3c5d-4be6-8246-8aeba0fe61de.  , 2023
Link: https://pure.itu.dk/port..
 
?
9

Universal Optimality of Dijkstra via Beyond-Worst-Case Heap:

Haeupler, Bernhard ; Hladík, Richard ; Rozhoň, Václav..
http://arxiv.org/abs/2311.11793.  , 2023
Link: http://arxiv.org/abs/231..
 
?
10

Better Differentially Private Approximate Histograms and He..:

Lebeda, Christian Janos ; Tětek, Jakub
http://arxiv.org/abs/2301.02457.  , 2023
Link: http://arxiv.org/abs/230..
 
?
11

Sampling an Edge in Sublinear Time Exactly and Optimally:

Eden, Talya ; Narayanan, Shyam ; Tětek, Jakub
http://arxiv.org/abs/2211.04981.  , 2022
Link: http://arxiv.org/abs/221..
 
?
12

Additive Noise Mechanisms for Making Randomized Approximati..:

Tětek, Jakub
http://arxiv.org/abs/2211.03695.  , 2022
Link: http://arxiv.org/abs/221..
 
?
13

Bias Reduction for Sum Estimation:

Eden, Talya ; Houen, Jakob Bæk Tejs ; Narayanan, Shyam..
http://arxiv.org/abs/2208.01197.  , 2022
Link: http://arxiv.org/abs/220..
 
?
14

Massively Parallel Computation on Embedded Planar Graphs:

Holm, Jacob ; Tětek, Jakub
http://arxiv.org/abs/2204.09035.  , 2022
Link: http://arxiv.org/abs/220..
 
?
15

ProbGraph: High-Performance and High-Accuracy Graph Mining ..:

Besta, Maciej ; Miglioli, Cesare ; Labini, Paolo Sylos...
http://arxiv.org/abs/2208.11469.  , 2022
Link: http://arxiv.org/abs/220..
 
1-15