default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYassine Hamoudi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Yassine Hamoudi
, Qipeng Liu, Makrand Sinha:
The NISQ Complexity of Collision Finding. EUROCRYPT (4) 2024: 3-32- [i11]Yassine Hamoudi, Qipeng Liu, Makrand Sinha:
The NISQ Complexity of Collision Finding. IACR Cryptol. ePrint Arch. 2024: 360 (2024) - 2023
- [j2]Yassine Hamoudi, Frédéric Magniez:
Quantum Time-Space Tradeoff for Finding Multiple Collision Pairs. ACM Trans. Comput. Theory 15(1-2): 1-22 (2023) - [c7]Arjan Cornelissen, Yassine Hamoudi:
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions. SODA 2023: 1245-1264 - 2022
- [c6]Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha:
Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming. ESA 2022: 6:1-6:18 - [c5]Arjan Cornelissen, Yassine Hamoudi, Sofiène Jerbi:
Near-optimal Quantum algorithms for multivariate mean estimation. STOC 2022: 33-43 - [i10]Arjan Cornelissen, Yassine Hamoudi:
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions. CoRR abs/2207.08643 (2022) - [i9]Yassine Hamoudi:
Preparing Many Copies of a Quantum State in the Black-Box Model. CoRR abs/2207.11014 (2022) - [i8]Yassine Hamoudi, Qipeng Liu, Makrand Sinha:
Quantum-Classical Tradeoffs in the Random Oracle Model. CoRR abs/2211.12954 (2022) - 2021
- [c4]Yassine Hamoudi:
Quantum Sub-Gaussian Mean Estimator. ESA 2021: 50:1-50:17 - [c3]Yassine Hamoudi, Frédéric Magniez:
Quantum Time-Space Tradeoff for Finding Multiple Collision Pairs. TQC 2021: 1:1-1:21 - [i7]Yassine Hamoudi:
Quantum Sub-Gaussian Mean Estimator. CoRR abs/2108.12172 (2021) - [i6]Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha:
Classical and quantum dynamic programming for Subset-Sum and variants. CoRR abs/2111.07059 (2021) - [i5]Arjan Cornelissen, Yassine Hamoudi, Sofiène Jerbi:
Near-Optimal Quantum Algorithms for Multivariate Mean Estimation. CoRR abs/2111.09787 (2021) - 2020
- [i4]Yassine Hamoudi, Frédéric Magniez:
Quantum Time-Space Tradeoffs by Recording Queries. CoRR abs/2002.08944 (2020)
2010 – 2019
- 2019
- [j1]Yassine Hamoudi, Patrick Rebentrost, Ansis Rosmanis, Miklos Santha:
Quantum and classical algorithms for approximate submodular function minimization. Quantum Inf. Comput. 19(15&16): 1325-1349 (2019) - [c2]Yassine Hamoudi, Frédéric Magniez:
Quantum Chebyshev's Inequality and Applications. ICALP 2019: 69:1-69:16 - [i3]Yassine Hamoudi, Patrick Rebentrost, Ansis Rosmanis, Miklos Santha:
Quantum and Classical Algorithms for Approximate Submodular Function Minimization. CoRR abs/1907.05378 (2019) - 2018
- [c1]Yassine Hamoudi:
Simultaneous Multiparty Communication Protocols for Composed Functions. MFCS 2018: 14:1-14:15 - [i2]Yassine Hamoudi, Frédéric Magniez:
Quantum Chebyshev's Inequality and Applications. CoRR abs/1807.06456 (2018) - 2017
- [i1]Yassine Hamoudi:
Simultaneous Multiparty Communication Complexity of Composed Functions. CoRR abs/1710.01969 (2017)
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 2025-01-21 00:23 CET 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:
