default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRustam Latypov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Conference and Workshop Papers
- 2024
[c15]Rustam Latypov
, Yannic Maus, Shreyas Pai, Jara Uitto:
Adaptive Massively Parallel Coloring in Sparse Graphs. PODC 2024: 508-518- 2023
- [c14]Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Optimal Deterministic Massively Parallel Connectivity on Forests. SODA 2023: 2589-2631 - [c13]Ayrat Nurutdinov, Rustam Latypov:
Dynamically Predicting Wi-Fi Coverage Mapping Using Bioinspired Neural Networks. SoftCOM 2023: 1-6 - [c12]Rustam Latypov, Jakub Lacki, Yannic Maus, Jara Uitto:
Adaptive Massively Parallel Connectivity in Optimal Space. SPAA 2023: 431-441 - [c11]Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi:
Fast Dynamic Programming in Trees in the MPC Model. SPAA 2023: 443-453 - [c10]Ayrat Nurutdinov, Rustam Latypov:
Bioinspired Neural Network for Simulation of Wave Propagation in Nonhomogeneous Media. TSP 2023: 230-233 - [c9]Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto:
Conditionally Optimal Parallel Coloring of Forests. DISC 2023: 23:1-23:20 - 2022
- [c8]Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Exponential Speedup over Locality in MPC with Optimal Memory. DISC 2022: 9:1-9:21 - 2021
- [c7]Rustam Latypov, Evgeni Stolov:
Speaker Diarization through Waveform and Neural Net. FRUCT 2021: 234-239 - [c6]Sebastian Brandt, Rustam Latypov, Jara Uitto:
Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. DISC 2021: 50:1-50:4 - 2019
- [c5]Rustam Latypov, Evgeni Stolov:
Neural Net as Pseudo-Inverse Filter in Speech Coding Problem. EWDTS 2019: 1-4 - [c4]Rustam Latypov, Evgeni Stolov:
A new watermarking method to protect blockchain records comprising small graphic files. TSP 2019: 668-671 - 2018
- [c3]Rustam Latypov, Evgeni Stolov:
A New Family of Controlled Ternary True Random Number Generators. EWDTS 2018: 1-6 - [c2]Rustam Latypov, Evgeni Stolov:
A New Method for Slant Calculation in Off-Line Handwriting Analysis. TSP 2018: 1-5 - 2017
- [c1]Rustam Latypov, Ruslan Nigmatullin, Evgeni Stolov:
Automatic Spoken Language Identification by Digital Signal Processing Methods. Tatar and Russian Languages. ICIST 2017: 539-549
Informal and Other Publications
- 2024
- [i13]Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto:
Adaptive Massively Parallel Coloring in Sparse Graphs. CoRR abs/2402.13755 (2024) - [i12]Nick Fischer, Bernhard Haeupler, Rustam Latypov, Antti Roeyskoe, Aurelio L. Sulser:
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths. CoRR abs/2410.20959 (2024) - 2023
- [i11]Jakub Lacki, Rustam Latypov, Yannic Maus, Jara Uitto:
Adaptive Massively Parallel Connectivity in Optimal Space. CoRR abs/2302.04033 (2023) - [i10]Chetan Gupta, Rustam Latypov, Yannic Maus, Shreyas Pai, Simo Särkkä, Jan Studený, Jukka Suomela, Jara Uitto, Hossein Vahidi:
Fast Dynamic Programming in Trees in the MPC Model. CoRR abs/2305.03693 (2023) - [i9]Christoph Grunau, Rustam Latypov, Yannic Maus, Shreyas Pai, Jara Uitto:
Conditionally Optimal Parallel Coloring of Forests. CoRR abs/2308.00355 (2023) - 2022
- [i8]Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Exponential Speedup Over Locality in MPC with Optimal Memory. CoRR abs/2208.09453 (2022) - [i7]Alkida Balliu, Rustam Latypov, Yannic Maus, Dennis Olivetti, Jara Uitto:
Optimal Deterministic Massively Parallel Connectivity on Forests. CoRR abs/2211.03530 (2022) - 2021
- [i6]Rustam Latypov, Jara Uitto:
Deterministic 3-Coloring of Trees in the Sublinear MPC model. CoRR abs/2105.13980 (2021) - [i5]Sebastian Brandt, Rustam Latypov, Jara Uitto:
Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees. CoRR abs/2112.09479 (2021) - 2020
- [i4]Rustam Latypov, Evgeni Stolov:
A New Method Towards Speech Files Local Features Investigation. CoRR abs/2006.03388 (2020) - 2019
- [i3]Rustam Latypov, Evgeni Stolov:
A new watermarking method to protect blockchain records comprising handwritten files. CoRR abs/1901.03065 (2019) - [i2]Rustam Latypov, Evgeni Stolov:
New Radon Transform Based Texture Features of Handwritten Document. CoRR abs/1901.03068 (2019) - [i1]Albert Galiev, Shamil Ishmukhametov, Rustam Latypov, Nikolai Prokopyev, Evgeni Stolov, Ilya Vlasov:
ARCHAIN: A Novel Blockchain Based Archival System. CoRR abs/1901.04225 (2019)
Coauthor Index
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 2025-01-09 13:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
