When does memory speed-up mixing? - Simon Apers; Alain Sarlette; Francesco Ticozzi (CDC, 2017)

Bounding the Convergence Time of Local Probabilistic Evolution. - Simon Apers; Alain Sarlette; Francesco Ticozzi (GSI, 2017)

Accelerating Consensus by Spectral Clustering and Polynomial Filters. - Simon Apers; Alain Sarlette (IEEE Trans. Control. Netw. Syst., 2017)

Quantum Walk Sampling by Growing Seed Sets. - Simon Apers (ESA, 2019)

Quantum fast-forwarding: Markov chains and graph property testing. - Simon Apers; Alain Sarlette (Quantum Inf. Comput., 2019)

Quantum query complexity of edge connectivity. - Simon Apers; Troy Lee (CoRR, 2020)

Expansion Testing using Quantum Fast-Forwarding and Seed Sets. - Simon Apers (Quantum, 2020)

Quantum Complexity of Minimum Cut. - Simon Apers; Troy Lee (CCC, 2021)

A Unified Framework of Quantum Walk Search. - Simon Apers; András Gilyén; Stacey Jeffery (STACS, 2021)

Testing properties of signed graphs. - Florian Adriaens; Simon Apers (CoRR, 2021)

A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs. - Simon Apers; Arinta Auza; Troy Lee (CoRR, 2021)

Quadratic speedup for spatial search by continuous-time quantum walk. - Simon Apers; Shantanav Chakraborty; Leonardo Novo; Jérémie Roland (CoRR, 2021)

Finding the KT Partition of a Weighted Graph in Near-Linear Time. - Simon Apers; Pawel Gawrychowski; Troy Lee (APPROX/RANDOM, 2022)

Cut Query Algorithms with Star Contraction. - Simon Apers; Yuval Efron; Pawel Gawrychowski; Troy Lee; Sagnik Mukhopadhyay; Danupon Nanongkai (FOCS, 2022)

Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps. - Simon Apers; Sander Gribling; Dániel Szilágyi (CoRR, 2022)

A (simple) classical algorithm for estimating Betti numbers. - Simon Apers; Sayantan Sen; Dániel Szabó (CoRR, 2022)

Elfs, trees and quantum walks. - Simon Apers; Stephen Piddock (CoRR, 2022)

Quantum XYZ Product Codes. - Anthony Leverrier; Simon Apers; Christophe Vuillot (Quantum, 2022)

Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving. - Simon Apers; Ronald de Wolf (SIAM J. Comput., 2022)

(No) Quantum Space-Time Tradeoff for USTCON. - Simon Apers; Stacey Jeffery; Galina Pass; Michael Walter 005 (ESA, 2023)

Testing Cluster Properties of Signed Graphs. - Florian Adriaens; Simon Apers (WWW, 2023)

Quantum speedups for linear programming via interior point methods. - Simon Apers; Sander Gribling (CoRR, 2023)

A (simple) classical algorithm for estimating Betti numbers. - Simon Apers; Sander Gribling; Sayantan Sen; Dániel Szabó (Quantum, 2023)

(Quantum) Complexity of Testing Signed Graph Clusterability. - Kuo-Chin Chen; Simon Apers; Min-Hsiu Hsieh (TQC, 2024)

Quantum walks, the discrete wave equation and Chebyshev polynomials. - Simon Apers; Laurent Miclo (CoRR, 2024)

On computing approximate Lewis weights. - Simon Apers; Sander Gribling; Aaron Sidford (CoRR, 2024)

Quantum property testing in sparse directed graphs. - Simon Apers; Frédéric Magniez; Sayantan Sen; Dániel Szabó (CoRR, 2024)

Directed st-Connectivity with Few Paths Is in Quantum Logspace. - Simon Apers; Roman Edenhofer (CCC, 2025)

Quantum Speedup for Sampling Random Spanning Trees. - Simon Apers; Minbo Gao; Zhengfeng Ji; Chenghua Liu (ICALP, 2025)

How to Compute the Volume in Low Dimension? - Arjan Cornelissen; Simon Apers; Sander Gribling (ICALP, 2025)

Holey Graphs: Very Large Betti Numbers are Testable. - Dániel Szabó; Simon Apers (SOFSEM (2), 2025)