Simon Apers - RankMe

50 papers A* 5A 7Journal 34Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Quantum Speedups for Linear Programming via Interior Point Methods. SIAM J. Comput. Simon Apers, Sander Gribling
2025	A	`conf`	Directed st-Connectivity with Few Paths Is in Quantum Logspace. CCC Simon Apers, Roman Edenhofer
2025	—	`conf`	Holey Graphs: Very Large Betti Numbers are Testable. SOFSEM (2) Dániel Szabó, Simon Apers
2025	A*	`conf`	How to Compute the Volume in Low Dimension? ICALP Arjan Cornelissen, Simon Apers, Sander Gribling
2025	J	`jnl`	How to compute the volume in low dimension? CoRR Arjan Cornelissen, Simon Apers, Sander Gribling
2025	A	`conf`	Quantum Property Testing in Sparse Directed Graphs. APPROX/RANDOM Simon Apers, Frédéric Magniez, Sayantan Sen, Dániel Szabó
2025	A*	`conf`	Quantum Speedup for Sampling Random Spanning Trees. ICALP Simon Apers, Minbo Gao, Zhengfeng Ji, Chenghua Liu
2025	J	`jnl`	Quantum Speedup for Sampling Random Spanning Trees. CoRR Simon Apers, Minbo Gao, Zhengfeng Ji, Chenghua Liu
2025	J	`jnl`	Randomized and quantum approximate matrix multiplication. CoRR Simon Apers, Arjan Cornelissen, Samson Wang
2024	—	`conf`	(Quantum) Complexity of Testing Signed Graph Clusterability. TQC Kuo-Chin Chen, Simon Apers, Min-Hsiu Hsieh
2024	J	`jnl`	Directed st-connectivity with few paths is in quantum logspace. CoRR Roman Edenhofer, Simon Apers
2024	J	`jnl`	Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps. J. Mach. Learn. Res. Simon Apers, Sander Gribling, Dániel Szilágyi
2024	J	`jnl`	Holey graphs: very large Betti numbers are testable. CoRR Dániel Szabó, Simon Apers
2024	J	`jnl`	On computing approximate Lewis weights. CoRR Simon Apers, Sander Gribling, Aaron Sidford
2024	J	`jnl`	Quantum property testing in sparse directed graphs. CoRR Simon Apers, Frédéric Magniez, Sayantan Sen, Dániel Szabó
2024	J	`jnl`	Quantum walks, the discrete wave equation and Chebyshev polynomials. CoRR Simon Apers, Laurent Miclo
2023	A	`conf`	(No) Quantum Space-Time Tradeoff for USTCON. ESA Simon Apers, Stacey Jeffery, Galina Pass, Michael Walter
2023	J	`jnl`	(Quantum) complexity of testing signed graph clusterability. CoRR Kuo-Chin Chen, Simon Apers, Min-Hsiu Hsieh
2023	J	`jnl`	A (simple) classical algorithm for estimating Betti numbers. Quantum Simon Apers, Sander Gribling, Sayantan Sen, Dániel Szabó
2023	J	`jnl`	Quantum speedups for linear programming via interior point methods. CoRR Simon Apers, Sander Gribling
2023	A*	`conf`	Testing Cluster Properties of Signed Graphs. WWW Florian Adriaens, Simon Apers
2022	J	`jnl`	(No) Quantum space-time tradeoff for USTCON. CoRR Simon Apers, Stacey Jeffery, Galina Pass, Michael Walter
2022	J	`jnl`	A (simple) classical algorithm for estimating Betti numbers. CoRR Simon Apers, Sayantan Sen, Dániel Szabó
2022	A*	`conf`	Cut Query Algorithms with Star Contraction. FOCS Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai
2022	J	`jnl`	Cut query algorithms with star contraction. CoRR Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai
2022	J	`jnl`	Elfs, trees and quantum walks. CoRR Simon Apers, Stephen Piddock
2022	A	`conf`	Finding the KT Partition of a Weighted Graph in Near-Linear Time. APPROX/RANDOM Simon Apers, Pawel Gawrychowski, Troy Lee
2022	J	`jnl`	Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps. CoRR Simon Apers, Sander Gribling, Dániel Szilágyi
2022	J	`jnl`	Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving. SIAM J. Comput. Simon Apers, Ronald de Wolf
2022	J	`jnl`	Quantum XYZ Product Codes. Quantum Anthony Leverrier, Simon Apers, Christophe Vuillot
2021	A	`conf`	A Unified Framework of Quantum Walk Search. STACS Simon Apers, András Gilyén, Stacey Jeffery
2021	J	`jnl`	A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs. CoRR Simon Apers, Arinta Auza, Troy Lee
2021	J	`jnl`	Finding the KT partition of a weighted graph in near-linear time. CoRR Simon Apers, Pawel Gawrychowski, Troy Lee
2021	J	`jnl`	Quadratic speedup for spatial search by continuous-time quantum walk. CoRR Simon Apers, Shantanav Chakraborty, Leonardo Novo, Jérémie Roland
2021	A	`conf`	Quantum Complexity of Minimum Cut. CCC Simon Apers, Troy Lee
2021	J	`jnl`	Testing properties of signed graphs. CoRR Florian Adriaens, Simon Apers
2020	J	`jnl`	Expansion Testing using Quantum Fast-Forwarding and Seed Sets. Quantum Simon Apers
2020	A*	`conf`	Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving. FOCS Simon Apers, Ronald de Wolf
2020	J	`jnl`	Quantum query complexity of edge connectivity. CoRR Simon Apers, Troy Lee
2019	J	`jnl`	A Unified Framework of Quantum Walk Search. CoRR Simon Apers, András Gilyén, Stacey Jeffery
2019	J	`jnl`	Expansion Testing using Quantum Fast-Forwarding and Seed Sets. CoRR Simon Apers
2019	J	`jnl`	Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving. CoRR Simon Apers, Ronald de Wolf
2019	A	`conf`	Quantum Walk Sampling by Growing Seed Sets. ESA Simon Apers
2019	J	`jnl`	Quantum Walk Sampling by Growing Seed Sets. CoRR Simon Apers
2019	J	`jnl`	Quantum fast-forwarding: Markov chains and graph property testing. Quantum Inf. Comput. Simon Apers, Alain Sarlette
2017	J	`jnl`	Accelerating Consensus by Spectral Clustering and Polynomial Filters. IEEE Trans. Control. Netw. Syst. Simon Apers, Alain Sarlette
2017	—	`conf`	Bounding the Convergence Time of Local Probabilistic Evolution. GSI Simon Apers, Alain Sarlette, Francesco Ticozzi
2017	J	`jnl`	Bounding the convergence time of local probabilistic evolution. CoRR Simon Apers, Alain Sarlette, Francesco Ticozzi
2017	—	`conf`	When does memory speed-up mixing? CDC Simon Apers, Alain Sarlette, Francesco Ticozzi
2015	J	`jnl`	Accelerating Consensus by Spectral Clustering and Polynomial Filters. CoRR Simon Apers, Alain Sarlette