Guillaume Houry

Orcid: 0000-0002-1918-0545

According to our database1, Guillaume Houry authored at least 9 papers between 2022 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Gromov-Wasserstein at Scale, Beyond Squared Norms.
CoRR, February, 2026

2025
Expected Complexity of Barcode Reduction.
J. Appl. Comput. Topol., December, 2025

Untangling Vascular Trees for Surgery and Interventional Radiology.
Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2025, 2025

2024
An Empirical Study of Self-Supervised Learning with Wasserstein Distance.
Entropy, 2024

Keeping it sparse: Computing Persistent Homology revisited.
Comput. Geom. Topol., 2024

Fast 1-Wasserstein distance approximations using greedy strategies.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
An Empirical Study of Simplicial Representation Learning with Wasserstein Distance.
CoRR, 2023

2022
Keeping it sparse: Computing Persistent Homology revised.
CoRR, 2022

Average Complexity of Matrix Reduction for Clique Filtrations.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022


  Loading...