Остановите войну!
for scientists:
default search action
Jakub Lacki
- > Home > Persons > Jakub Lacki
Publications
- 2024
- [i33]Lars Gottesbüren, Laxman Dhulipala, Rajesh Jayaram, Jakub Lacki:
Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search. CoRR abs/2403.01797 (2024) - 2023
- [j8]Laxman Dhulipala, Jakub Lacki, Jason Lee, Vahab Mirrokni:
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. Proc. ACM Manag. Data 1(3): 221:1-221:27 (2023) - [i30]Laxman Dhulipala, Jason Lee, Jakub Lacki, Vahab Mirrokni:
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. CoRR abs/2308.03578 (2023) - 2022
- [c27]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. NeurIPS 2022 - [i26]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic Depth. CoRR abs/2206.11654 (2022) - 2021
- [j7]Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni:
Scalable Community Detection via Parallel Correlation Clustering. Proc. VLDB Endow. 14(11): 2305-2313 (2021) - [j6]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. ACM Trans. Parallel Comput. 8(3): 13:1-13:25 (2021) - [c26]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. ICML 2021: 2676-2686 - [i24]Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni, Jessica Shi:
Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time. CoRR abs/2106.05610 (2021) - [i23]Jessica Shi, Laxman Dhulipala, David Eisenstat, Jakub Lacki, Vahab S. Mirrokni:
Scalable Community Detection via Parallel Correlation Clustering. CoRR abs/2108.01731 (2021) - 2020
- [j5]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. Proc. VLDB Endow. 13(13): 3588-3602 (2020) - [i19]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. CoRR abs/2009.11552 (2020) - 2019
- [c19]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. FOCS 2019: 1615-1636 - [c17]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. SPAA 2019: 59-68 - [i18]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Warren Schudy, Vahab S. Mirrokni:
Massively Parallel Computation via Remote Memory Access. CoRR abs/1905.07533 (2019) - [i15]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. CoRR abs/1910.05385 (2019)
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-04-07 22:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint