default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Apers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Kuo-Chin Chen, Simon Apers, Min-Hsiu Hsieh
:
(Quantum) Complexity of Testing Signed Graph Clusterability. TQC 2024: 8:1-8:16- [i22]Dániel Szabó, Simon Apers:
Holey graphs: very large Betti numbers are testable. CoRR abs/2401.06109 (2024) - [i21]Simon Apers, Laurent Miclo:
Quantum walks, the discrete wave equation and Chebyshev polynomials. CoRR abs/2402.07809 (2024) - [i20]Simon Apers, Sander Gribling, Aaron Sidford:
On computing approximate Lewis weights. CoRR abs/2404.02881 (2024) - [i19]Roman Edenhofer, Simon Apers:
Directed st-connectivity with few paths is in quantum logspace. CoRR abs/2408.12473 (2024) - 2023
- [j6]Simon Apers, Sander Gribling, Sayantan Sen, Dániel Szabó:
A (simple) classical algorithm for estimating Betti numbers. Quantum 7: 1202 (2023) - [c10]Simon Apers, Stacey Jeffery, Galina Pass, Michael Walter:
(No) Quantum Space-Time Tradeoff for USTCON. ESA 2023: 10:1-10:17 - [c9]Florian Adriaens, Simon Apers:
Testing Cluster Properties of Signed Graphs. WWW 2023: 49-59 - [i18]Simon Apers, Sander Gribling:
Quantum speedups for linear programming via interior point methods. CoRR abs/2311.03215 (2023) - [i17]Kuo-Chin Chen, Simon Apers, Min-Hsiu Hsieh:
(Quantum) complexity of testing signed graph clusterability. CoRR abs/2311.10480 (2023) - 2022
- [j5]Anthony Leverrier, Simon Apers, Christophe Vuillot:
Quantum XYZ Product Codes. Quantum 6: 766 (2022) - [j4]Simon Apers, Ronald de Wolf:
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving. SIAM J. Comput. 51(6): 1703-1742 (2022) - [c8]Simon Apers, Pawel Gawrychowski, Troy Lee:
Finding the KT Partition of a Weighted Graph in Near-Linear Time. APPROX/RANDOM 2022: 32:1-32:14 - [c7]Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai:
Cut Query Algorithms with Star Contraction. FOCS 2022: 507-518 - [i16]Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai:
Cut query algorithms with star contraction. CoRR abs/2201.05674 (2022) - [i15]Simon Apers, Sander Gribling, Dániel Szilágyi:
Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps. CoRR abs/2209.12771 (2022) - [i14]Simon Apers, Sayantan Sen, Dániel Szabó:
A (simple) classical algorithm for estimating Betti numbers. CoRR abs/2211.09618 (2022) - [i13]Simon Apers, Stephen Piddock:
Elfs, trees and quantum walks. CoRR abs/2211.16379 (2022) - [i12]Simon Apers, Stacey Jeffery, Galina Pass, Michael Walter:
(No) Quantum space-time tradeoff for USTCON. CoRR abs/2212.00094 (2022) - 2021
- [c6]Simon Apers, Troy Lee:
Quantum Complexity of Minimum Cut. CCC 2021: 28:1-28:33 - [c5]Simon Apers, András Gilyén, Stacey Jeffery:
A Unified Framework of Quantum Walk Search. STACS 2021: 6:1-6:13 - [i11]Florian Adriaens, Simon Apers:
Testing properties of signed graphs. CoRR abs/2102.07587 (2021) - [i10]Simon Apers, Arinta Auza, Troy Lee:
A sublinear time quantum algorithm for s-t minimum cut on dense simple graphs. CoRR abs/2110.15587 (2021) - [i9]Simon Apers, Pawel Gawrychowski, Troy Lee:
Finding the KT partition of a weighted graph in near-linear time. CoRR abs/2111.01378 (2021) - [i8]Simon Apers, Shantanav Chakraborty, Leonardo Novo, Jérémie Roland:
Quadratic speedup for spatial search by continuous-time quantum walk. CoRR abs/2112.12746 (2021) - 2020
- [j3]Simon Apers:
Expansion Testing using Quantum Fast-Forwarding and Seed Sets. Quantum 4: 323 (2020) - [c4]Simon Apers, Ronald de Wolf:
Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving. FOCS 2020: 637-648 - [i7]Simon Apers, Troy Lee:
Quantum query complexity of edge connectivity. CoRR abs/2011.09823 (2020)
2010 – 2019
- 2019
- [j2]Simon Apers, Alain Sarlette:
Quantum fast-forwarding: Markov chains and graph property testing. Quantum Inf. Comput. 19(3&4): 181-213 (2019) - [c3]Simon Apers:
Quantum Walk Sampling by Growing Seed Sets. ESA 2019: 9:1-9:12 - [i6]Simon Apers:
Quantum Walk Sampling by Growing Seed Sets. CoRR abs/1904.11446 (2019) - [i5]Simon Apers:
Expansion Testing using Quantum Fast-Forwarding and Seed Sets. CoRR abs/1907.02369 (2019) - [i4]Simon Apers, Ronald de Wolf:
Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving. CoRR abs/1911.07306 (2019) - [i3]Simon Apers, András Gilyén, Stacey Jeffery:
A Unified Framework of Quantum Walk Search. CoRR abs/1912.04233 (2019) - 2017
- [j1]Simon Apers, Alain Sarlette:
Accelerating Consensus by Spectral Clustering and Polynomial Filters. IEEE Trans. Control. Netw. Syst. 4(3): 544-554 (2017) - [c2]Simon Apers, Alain Sarlette, Francesco Ticozzi:
When does memory speed-up mixing? CDC 2017: 4940-4945 - [c1]Simon Apers, Alain Sarlette, Francesco Ticozzi:
Bounding the Convergence Time of Local Probabilistic Evolution. GSI 2017: 754-762 - [i2]Simon Apers, Alain Sarlette, Francesco Ticozzi:
Bounding the convergence time of local probabilistic evolution. CoRR abs/1711.06024 (2017) - 2015
- [i1]Simon Apers, Alain Sarlette:
Accelerating Consensus by Spectral Clustering and Polynomial Filters. CoRR abs/1503.01269 (2015)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
