Jakub Tetek

Bias Reduction for Sum Estimation

Eden, T., Tejs Houen, J. B., 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