"Computing Connection Matrices via Persistence-Like Reductions."

Tamal K. Dey et al. (2024)

> Home

Details and statistics

DOI: 10.1137/23M1562469

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamads/DeyLMS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamads/DeyLMS24
Tamal K. Dey, Michal Lipinski, Marian Mrozek, Ryan Slechta:
Computing Connection Matrices via Persistence-Like Reductions. SIAM J. Appl. Dyn. Syst. 23(1): 81-97 (2024)

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.