![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Applied and Computational Topology, Volume 1
Volume 1, Number 1, September 2017
- Dmitry N. Kozlov:
Structure theory of flip graphs with applications to Weak Symmetry Breaking. 1-55 - Joel Hass, Patrice Koehl:
Comparing shapes of genus-zero surfaces. 57-87 - Jacek Skryzalin
, Gunnar E. Carlsson:
Numeric invariants from multidimensional persistence. 89-119 - Dan Burghelea
, Stefan Haller
:
Topology of angle valued maps, bar codes and Jordan blocks. 121-197
Volume 1, Number 2, December 2017
- Daniel C. Cohen, Lucile Vandembroucq
:
Topological complexity of the Klein bottle. 199-213 - Michael J. Catanzaro, Vladimir Y. Chernyak, John R. Klein:
A higher Boltzmann distribution. 215-240 - Andrew Robinson, Katharine Turner
:
Hypothesis testing for topological data analysis. 241-261 - Chaim Even-Zohar:
Models of random knots. 263-296
Volume 1, Numbers 3-4, June 2018
- Peter Franek
, Marek Krcál, Hubert Wagner:
Solving equations and optimization problems with uncertainty. 297-330 - Omer Bobrowski
, Matthew Kahle:
Topology of random geometric complexes: a survey. 331-364 - Amit Patel:
Generalized persistence diagrams. 397-419 - Ippei Obayashi
, Yasuaki Hiraoka, Masao Kimura
:
Persistence diagrams with linear machine learning models. 421-449 - Vikram Saraph
, Maurice Herlihy, Eli Gafni:
An algorithmic approach to the asynchronous computability theorem. 451-474
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.