Jakub Tetek

Bias Reduction for Sum Estimation

Eden, T., Houen, Jakob Bæk Tejs, Narayanan, S., Rosenbaum, W. & Tetek, Jakub, sep. 2023, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023. Megow, N. & Smith, A. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 1-21 62. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 275).

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

A Nearly Tight Analysis of Greedy k-means++

Grunau, C., Özüdoğru, A. A., Rozhoň, V. & Tetek, Jakub, 2023, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Bansal, N. & Nagarajan, V. (red.). Society for Industrial and Applied Mathematics, s. 1012-1070

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

Estimating the Effective Support Size in Constant Query Complexity

Narayanan, S. & Tetek, Jakub, 2023, Proceedings, 2023 Symposium on Simplicity in Algorithms (SOSA). Kavitha, T. & Mehlhorn, K. (red.). Society for Industrial and Applied Mathematics, s. 242-252

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

Massively Parallel Computation on Embedded Planar Graphs

Holm, Jacob & Tetek, Jakub, 2023, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Bansal, N. & Nagarajan, V. (red.). Society for Industrial and Applied Mathematics, s. 4373-4408

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

Sampling an Edge in Sublinear Time Exactly and Optimally

Eden, T., Narayanan, S. & Tetek, Jakub, 2023, Proceedings, 2023 Symposium on Simplicity in Algorithms (SOSA). Kavitha, T. & Mehlhorn, K. (red.). Society for Industrial and Applied Mathematics, s. 253-260

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

Approximate Triangle Counting via Sampling and Fast Matrix Multiplication

Tetek, Jakub, 2022, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Bojanczyk, M., Merelli, E. & Woodruff, D. P. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 20 s. 107. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 229).

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

Edge sampling and graph parameter estimation via vertex neighborhood accesses

Tetek, Jakub & Thorup, Mikkel, 2022, STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Leonardi, S. & Gupta, A. (red.). Association for Computing Machinery, Inc., s. 1116-1129 14 s.

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

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

Besta, M., Miglioli, C., Labini, P. S., Tetek, Jakub, Iff, P., Kanakagiri, R., Ashkboos, S., Janda, K., Podstawski, M., Kwasniewski, G., Gleinig, N., Vella, F., Mutlu, O. & Hoefler, T., 2022, Proceedings of SC 2022: International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, s. 1-17 (International Conference for High Performance Computing, Networking, Storage and Analysis, SC, Bind 2022-November).

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt

CountSketches, Feature Hashing and the Median of Three

Larsen, K. G., Pagh, Rasmus & Tetek, Jakub, 2021, Proceedings of the 38 th International Conference on Machine Learning. Meila, M. & Zhang, T. (red.). PMLR, s. 6011-6020 (Proceedings of Machine Learning Research, Bind 139).

Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt