Jakub Tetek
Ph.d.-stipendiat
Algorithms and Complexity
Universitetsparken 1
2100 København Ø
1 - 3 ud af 3Pr. side: 10
- 2022
- Udgivet
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
- Udgivet
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
- Udgivet
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
ID: 284196742