default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnur Nigmetov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Arnur Nigmetov
, Aditi S. Krishnapriyan, Nicole Sanderson, Dmitriy Morozov:
Topological regularization via persistence-sensitive optimization. Comput. Geom. 120: 102086 (2024)- [j3]Arnur Nigmetov, Dmitriy Morozov:
Topological Optimization with Big Steps. Discret. Comput. Geom. 72(1): 310-344 (2024) - [c7]Annan Yu, Arnur Nigmetov, Dmitriy Morozov, Michael W. Mahoney, N. Benjamin Erichson:
Robustifying State-space Models for Long Sequences via Approximate Diagonalization. ICLR 2024 - [c6]Jie Ye, Jaime Cernuda, Neeraj Rajesh, Keith Bateman, Orcun Yildiz, Tom Peterka, Arnur Nigmetov, Dmitriy Morozov, Xian-He Sun, Anthony Kougkas, Bogdan Nicolae:
Viper: A High-Performance I/O Framework for Transparently Updating, Storing, and Transferring Deep Neural Network Models. ICPP 2024: 812-821 - [i8]Orcun Yildiz, Dmitriy Morozov, Arnur Nigmetov, Bogdan Nicolae, Tom Peterka:
Wilkins: HPC In Situ Workflows Made Easy. CoRR abs/2404.03591 (2024) - 2023
- [c5]Tom Peterka, Dmitriy Morozov, Arnur Nigmetov, Orcun Yildiz, Bogdan Nicolae, Philip E. Davis:
LowFive: In Situ Data Transport for High-Performance Workflows. IPDPS 2023: 985-995 - [i7]Arnur Nigmetov, Dmitriy Morozov:
Fast Merge Tree Computation via SYCL. CoRR abs/2301.10838 (2023) - [i6]Annan Yu, Arnur Nigmetov, Dmitriy Morozov, Michael W. Mahoney, N. Benjamin Erichson:
Robustifying State-space Models for Long Sequences via Approximate Diagonalization. CoRR abs/2310.01698 (2023) - 2022
- [i5]Arnur Nigmetov, Dmitriy Morozov:
Topological Optimization with Big Steps. CoRR abs/2203.16748 (2022) - 2020
- [j2]Michael Kerber, Arnur Nigmetov:
Metric Spaces with Expensive Distances. Int. J. Comput. Geom. Appl. 30(2): 141-165 (2020) - [c4]Michael Kerber, Arnur Nigmetov:
Efficient Approximation of the Matching Distance for 2-Parameter Persistence. SoCG 2020: 53:1-53:16 - [c3]Dmitriy Morozov, Arnur Nigmetov:
Towards Lockfree Persistent Homology. SPAA 2020: 555-557 - [i4]Arnur Nigmetov, Aditi S. Krishnapriyan, Nicole Sanderson, Dmitriy Morozov:
Topological Regularization via Persistence-Sensitive Optimization. CoRR abs/2011.05290 (2020)
2010 – 2019
- 2019
- [c2]Arnur Nigmetov, Dmitriy Morozov:
Local-global merge tree computation with local exchanges. SC 2019: 60:1-60:13 - [i3]Michael Kerber, Arnur Nigmetov:
Metric Spaces with Expensive Distances. CoRR abs/1901.08805 (2019) - [i2]Michael Kerber, Arnur Nigmetov:
Efficient Approximation of the Matching Distance for 2-parameter persistence. CoRR abs/1912.05826 (2019) - 2017
- [j1]Michael Kerber, Dmitriy Morozov, Arnur Nigmetov:
Geometry Helps to Compare Persistence Diagrams. ACM J. Exp. Algorithmics 22 (2017) - 2016
- [c1]Michael Kerber, Dmitriy Morozov, Arnur Nigmetov:
Geometry Helps to Compare Persistence Diagrams. ALENEX 2016: 103-112 - [i1]Michael Kerber, Dmitriy Morozov, Arnur Nigmetov:
Geometry Helps to Compare Persistence Diagrams. CoRR abs/1606.03357 (2016)
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 2024-08-29 20:59 CEST 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:
