"Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time."

Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak (2025)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2504.00544

access: open

type: Informal or Other Publication

metadata version: 2025-05-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2504-00544
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2504-00544
Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time. CoRR abs/2504.00544 (2025)

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.