Arnur Nigmetov

Orcid: 0000-0003-4823-5311

According to our database1, Arnur Nigmetov authored at least 13 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Topological Optimization with Big Steps.
Discret. Comput. Geom., July, 2024

Distributed Computation of Persistent Cohomology.
CoRR, 2024

Wilkins: HPC In Situ Workflows Made Easy.
CoRR, 2024

Topological regularization via persistence-sensitive optimization.
Comput. Geom., 2024

Viper: A High-Performance I/O Framework for Transparently Updating, Storing, and Transferring Deep Neural Network Models.
Proceedings of the 53rd International Conference on Parallel Processing, 2024

Robustifying State-space Models for Long Sequences via Approximate Diagonalization.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Fast Merge Tree Computation via SYCL.
CoRR, 2023

LowFive: In Situ Data Transport for High-Performance Workflows.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

2020
Metric Spaces with Expensive Distances.
Int. J. Comput. Geom. Appl., 2020

Towards Lockfree Persistent Homology.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Efficient Approximation of the Matching Distance for 2-Parameter Persistence.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Local-global merge tree computation with local exchanges.
Proceedings of the International Conference for High Performance Computing, 2019

2017
Geometry Helps to Compare Persistence Diagrams.
ACM J. Exp. Algorithmics, 2017


  Loading...