default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIordanis Kerenidis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j27]Sohum Thakkar, Skander Kazdaghli, Natansh Mathur, Iordanis Kerenidis, André J. Ferreira-Martins, Samurai Brito:
Improved financial forecasting via quantum machine learning. Quantum Mach. Intell. 6(1): 27 (2024)- [j26]El Amine Cherrat
, Iordanis Kerenidis, Natansh Mathur, Jonas Landman, Martin Strahm, Yun Yvonna Li:
Quantum Vision Transformers. Quantum 8: 1265 (2024) - [i38]Brian Coyle, El Amine Cherrat, Nishant Jain, Natansh Mathur, Snehal Raj, Skander Kazdaghli, Iordanis Kerenidis:
Training-efficient density quantum machine learning. CoRR abs/2405.20237 (2024) - 2023
- [j25]El Amine Cherrat, Iordanis Kerenidis, Anupam Prakash:
Quantum reinforcement learning via policy iteration. Quantum Mach. Intell. 5(2): 1-18 (2023) - [j24]El Amine Cherrat, Snehal Raj, Iordanis Kerenidis, Abhishek Shekhar, Ben Wood, Jon Dee, Shouvanik Chakrabarti, Chun-Fu Richard Chen, Dylan Herman, Shaohan Hu, Pierre Minssen, Ruslan Shaydulin, Yue Sun, Romina Yalovetzky, Marco Pistoia:
Quantum Deep Hedging. Quantum 7: 1191 (2023) - [i37]El Amine Cherrat, Snehal Raj, Iordanis Kerenidis, Abhishek Shekhar, Ben Wood, Jon Dee, Shouvanik Chakrabarti, Chun-Fu Richard Chen, Dylan Herman, Shaohan Hu, Pierre Minssen, Ruslan Shaydulin, Yue Sun, Romina Yalovetzky, Marco Pistoia:
Quantum Deep Hedging. CoRR abs/2303.16585 (2023) - [i36]Sohum Thakkar, Skander Kazdaghli, Natansh Mathur, Iordanis Kerenidis, André J. Ferreira-Martins, Samurai Brito:
Improved Financial Forecasting via Quantum Machine Learning. CoRR abs/2306.12965 (2023) - 2022
- [j23]Tudor Giurgica-Tiron, Iordanis Kerenidis, Farrokh Labib, Anupam Prakash, William J. Zeng:
Low depth algorithms for quantum amplitude estimation. Quantum 6: 745 (2022) - [j22]Jonas Landman, Natansh Mathur, Yun Yvonna Li, Martin Strahm, Skander Kazdaghli, Anupam Prakash, Iordanis Kerenidis:
Quantum Methods for Neural Networks and Application to Medical Image Classification. Quantum 6: 881 (2022) - [i35]Iordanis Kerenidis, Anupam Prakash:
Quantum machine learning with subspace states. CoRR abs/2202.00054 (2022) - [i34]El Amine Cherrat, Iordanis Kerenidis, Anupam Prakash:
Quantum Reinforcement Learning via Policy Iteration. CoRR abs/2203.01889 (2022) - [i33]El Amine Cherrat, Iordanis Kerenidis, Natansh Mathur, Jonas Landman, Martin Strahm, Yun Yvonna Li:
Quantum Vision Transformers. CoRR abs/2209.08167 (2022) - 2021
- [j21]Iordanis Kerenidis, Anupam Prakash, Dániel Szilágyi:
Quantum algorithms for Second-Order Cone Programming and Support Vector Machines. Quantum 5: 427 (2021) - 2020
- [c31]Iordanis Kerenidis, Jonas Landman, Anupam Prakash:
Quantum Algorithms for Deep Convolutional Neural Networks. ICLR 2020 - [c30]Iordanis Kerenidis, Alessandro Luongo, Anupam Prakash:
Quantum Expectation-Maximization for Gaussian mixture models. ICML 2020: 5187-5197 - [i32]Tudor Giurgica-Tiron, Iordanis Kerenidis, Farrokh Labib, Anupam Prakash, William J. Zeng:
Low depth algorithms for quantum amplitude estimation. CoRR abs/2012.03348 (2020)
2010 – 2019
- 2019
- [j20]Iordanis Kerenidis, Adi Rosén, Florent Urrutia:
Multi-Party Protocols, Information Complexity and Privacy. ACM Trans. Comput. Theory 11(2): 9:1-9:29 (2019) - [c29]Iordanis Kerenidis, Anupam Prakash, Dániel Szilágyi:
Quantum Algorithms for Portfolio Optimization. AFT 2019: 147-155 - [c28]Iordanis Kerenidis, Jonas Landman, Alessandro Luongo, Anupam Prakash:
q-means: A quantum algorithm for unsupervised machine learning. NeurIPS 2019: 4136-4146 - [i31]Iordanis Kerenidis, Alessandro Luongo, Anupam Prakash:
Quantum Expectation-Maximization for Gaussian Mixture Models. CoRR abs/1908.06657 (2019) - [i30]Iordanis Kerenidis, Anupam Prakash, Dániel Szilágyi:
Quantum algorithms for Second-Order Cone Programming and Support Vector Machines. CoRR abs/1908.06720 (2019) - [i29]Iordanis Kerenidis, Jonas Landman, Anupam Prakash:
Quantum Algorithms for Deep Convolutional Neural Networks. CoRR abs/1911.01117 (2019) - 2018
- [j19]Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez:
Streaming Communication Protocols. ACM Trans. Comput. Theory 10(4): 19:1-19:21 (2018) - [i28]Iordanis Kerenidis, Alessandro Luongo:
Quantum classification of the MNIST dataset via Slow Feature Analysis. CoRR abs/1805.08837 (2018) - [i27]Iordanis Kerenidis, Anupam Prakash:
A Quantum Interior Point Method for LPs and SDPs. CoRR abs/1808.09266 (2018) - [i26]Jonathan Allcock, Chang-Yu Hsieh, Iordanis Kerenidis, Shengyu Zhang:
Quantum algorithms for feedforward neural networks. CoRR abs/1812.03089 (2018) - [i25]Iordanis Kerenidis, Jonas Landman, Alessandro Luongo, Anupam Prakash:
q-means: A quantum algorithm for unsupervised machine learning. CoRR abs/1812.03584 (2018) - 2017
- [j18]André Chailloux, Iordanis Kerenidis:
Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment. SIAM J. Comput. 46(5): 1647-1677 (2017) - [c27]Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez:
Streaming Communication Protocols. ICALP 2017: 130:1-130:14 - [c26]Iordanis Kerenidis, Anupam Prakash:
Quantum Recommendation Systems. ITCS 2017: 49:1-49:21 - [i24]Alex Bredariol Grilo, Iordanis Kerenidis:
Learning with Errors is easy with quantum samples. CoRR abs/1702.08255 (2017) - 2016
- [j17]André Chailloux, Iordanis Kerenidis, Bill Rosgen:
Quantum commitments from complexity assumptions. Comput. Complex. 25(1): 103-151 (2016) - [j16]Alex B. Grilo, Iordanis Kerenidis, Jamie Sikora:
QMA with Subset State Witnesses. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j15]Iordanis Kerenidis, Mathieu Laurière, Francois Le Gall, Mathys Rennela:
Information cost of quantum communication protocols. Quantum Inf. Comput. 16(3&4): 181-196 (2016) - [j14]Dorit Aharonov, André Chailloux, Maor Ganz, Iordanis Kerenidis, Loïck Magnin:
A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias. SIAM J. Comput. 45(3): 633-679 (2016) - [j13]Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland:
Relative Discrepancy Does Not Separate Information and Communication Complexity. ACM Trans. Comput. Theory 9(1): 4:1-4:15 (2016) - [c25]Alex Bredariol Grilo, Iordanis Kerenidis, Attila Pereszlényi:
Pointer Quantum PCPs and Multi-Prover Games. MFCS 2016: 21:1-21:14 - [c24]Iordanis Kerenidis, Adi Rosén, Florent Urrutia:
Multi-Party Protocols, Information Complexity and Privacy. MFCS 2016: 57:1-57:16 - [i23]Alex Bredariol Grilo, Iordanis Kerenidis, Attila Pereszlényi:
Pointer Quantum PCPs and Multi-Prover Games. CoRR abs/1603.00903 (2016) - [i22]Iordanis Kerenidis, Anupam Prakash:
Quantum Recommendation Systems. CoRR abs/1603.08675 (2016) - [i21]Iordanis Kerenidis, Adi Rosén, Florent Urrutia:
Multi-Party Protocols, Information Complexity and Privacy. CoRR abs/1606.06872 (2016) - [i20]Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez:
Streaming Communication Protocols. CoRR abs/1609.07059 (2016) - [i19]Eddie Schoute, Laura Mancinska, Tanvirul Islam, Iordanis Kerenidis, Stephanie Wehner:
Shortcuts to quantum network routing. CoRR abs/1610.05238 (2016) - [i18]Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez:
Streaming Communication Protocols. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j12]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. SIAM J. Comput. 44(5): 1550-1572 (2015) - [c23]Romain Gay, Iordanis Kerenidis, Hoeteck Wee:
Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. CRYPTO (2) 2015: 485-502 - [c22]Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland:
Relative Discrepancy Does not Separate Information and Communication Complexity. ICALP (1) 2015: 506-516 - [c21]Alex Bredariol Grilo, Iordanis Kerenidis, Jamie Sikora:
QMA with Subset State Witnesses. MFCS (2) 2015: 163-174 - [c20]Marios Georgiou, Iordanis Kerenidis:
New Constructions for Quantum Money. TQC 2015: 92-110 - [i17]Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland:
Relative Discrepancy does not separate Information and Communication Complexity. Electron. Colloquium Comput. Complex. TR15 (2015) - [i16]Romain Gay, Iordanis Kerenidis, Hoeteck Wee:
Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. IACR Cryptol. ePrint Arch. 2015: 665 (2015) - 2014
- [c19]André Chailloux, Iordanis Kerenidis, Srijita Kundu, Jamie Sikora:
Optimal Bounds for Parity-Oblivious Random Access Codes with Applications. TQC 2014: 76-87 - [i15]Iordanis Kerenidis, Mathieu Laurière, François Le Gall, Mathys Rennela:
Privacy in Quantum Communication Complexity. CoRR abs/1409.8488 (2014) - [i14]Alex Bredariol Grilo, Iordanis Kerenidis, Jamie Sikora:
QMA with subset state witnesses. CoRR abs/1410.2882 (2014) - 2013
- [j11]André Chailloux, Iordanis Kerenidis, Jamie Sikora:
Lower bounds for quantum oblivious transfer. Quantum Inf. Comput. 13(1-2): 158-177 (2013) - [c18]Iordanis Kerenidis, Mathieu Laurière, David Xiao:
New Lower Bounds for Privacy in Communication Protocols. ICITS 2013: 69-89 - [i13]Iordanis Kerenidis, Mathieu Laurière, David Xiao:
New lower bounds for privacy in communication protocols. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j10]Iordanis Kerenidis, Stephanie Wehner:
Long distance quantum cryptography made simple. Quantum Inf. Comput. 12(5-6): 448-460 (2012) - [j9]Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang:
On the Power of a Unique Quantum Witness. Theory Comput. 8(1): 375-400 (2012) - [c17]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. FOCS 2012: 500-509 - [c16]Iordanis Kerenidis, Shengyu Zhang:
A Quantum Protocol for Sampling Correlated Equilibria Unconditionally and without a Mediator. TQC 2012: 13-28 - [i12]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower bounds on information complexity via zero-communication protocols and applications. CoRR abs/1204.1505 (2012) - [i11]Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao:
Lower bounds on information complexity via zero-communication protocols and applications. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j8]Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland:
Non-local box complexity and secure function evaluation. Quantum Inf. Comput. 11(1&2): 40-69 (2011) - [c15]André Chailloux, Iordanis Kerenidis:
Optimal Bounds for Quantum Bit Commitment. FOCS 2011: 354-362 - [c14]André Chailloux, Iordanis Kerenidis, Bill Rosgen:
Quantum Commitments from Complexity Assumptions. ICALP (1) 2011: 73-85 - [c13]Nati Aharon, André Chailloux, Iordanis Kerenidis, Serge Massar, Stefano Pironio, Jonathan Silman:
Weak Coin Flipping in a Device-Independent Setting. TQC 2011: 1-12 - [i10]Iordanis Kerenidis, Shengyu Zhang:
A quantum protocol for sampling correlated equilibria unconditionally and without a mediator. CoRR abs/1104.1770 (2011) - 2010
- [c12]André Chailloux, Iordanis Kerenidis, Jamie Sikora:
Lower bounds for Quantum Oblivious Transfer. FSTTCS 2010: 157-168 - [c11]Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang:
On the Power of a Unique Quantum Witness. ICS 2010: 470-481
2000 – 2009
- 2009
- [j7]Iordanis Kerenidis:
Quantum multiparty communication complexity and circuit lower bounds. Math. Struct. Comput. Sci. 19(1): 119-132 (2009) - [c10]André Chailloux, Iordanis Kerenidis:
Optimal Quantum Strong Coin Flipping. FOCS 2009: 527-533 - [c9]Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland:
Non-Local Box Complexity and Secure Function Evaluation. FSTTCS 2009: 239-250 - 2008
- [j6]Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis:
Exponential Separation of Quantum and Classical One-Way Communication Complexity. SIAM J. Comput. 38(1): 366-384 (2008) - [j5]Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf:
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. SIAM J. Comput. 38(5): 1695-1708 (2008) - [c8]André Chailloux, Iordanis Kerenidis:
Increasing the power of the verifier in Quantum Zero Knowledge. FSTTCS 2008: 95-106 - [c7]André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan:
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. TCC 2008: 501-534 - 2007
- [j4]Elham Kashefi, Iordanis Kerenidis:
Statistical Zero Knowledge and quantum one-way functions. Theor. Comput. Sci. 378(1): 101-116 (2007) - [c6]Iordanis Kerenidis:
Introduction to Quantum Information Theory. ICITS 2007: 146-147 - [c5]Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf:
Exponential separations for one-way quantum communication complexity, with applications to cryptography. STOC 2007: 516-525 - [c4]Iordanis Kerenidis:
Quantum Multiparty Communication Complexity and Circuit Lower Bounds. TAMC 2007: 306-317 - [i9]André Chailloux, Iordanis Kerenidis:
The role of help in Classical and Quantum Zero-Knowledge. IACR Cryptol. ePrint Arch. 2007: 421 (2007) - [i8]André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan:
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. IACR Cryptol. ePrint Arch. 2007: 467 (2007) - 2006
- [i7]Iordanis Kerenidis, Ran Raz:
The one-way communication complexity of the Boolean Hidden Matching Problem. CoRR abs/quant-ph/0607173 (2006) - [i6]Iordanis Kerenidis, Ran Raz:
The one-way communication complexity of the Boolean Hidden Matching Problem. Electron. Colloquium Comput. Complex. TR06 (2006) - 2004
- [j3]Iordanis Kerenidis, Ashwin Nayak:
Weak coin flipping with small bias. Inf. Process. Lett. 89(3): 131-135 (2004) - [j2]Iordanis Kerenidis, Ronald de Wolf:
Quantum symmetrically-private information retrieval. Inf. Process. Lett. 90(3): 109-114 (2004) - [j1]Iordanis Kerenidis, Ronald de Wolf:
Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. Syst. Sci. 69(3): 395-420 (2004) - [c3]Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis:
Exponential separation of quantum and classical one-way communication complexity. STOC 2004: 128-137 - [i5]Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis:
Exponential Separation of Quantum and Classical One-Way Communication Complexity. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c2]Iordanis Kerenidis, Ronald de Wolf:
Exponential lower bound for 2-query locally decodable codes via a quantum argument. STOC 2003: 106-115 - [i4]Iordanis Kerenidis, Ronald de Wolf:
Quantum Symmetrically-Private Information Retrieval. CoRR quant-ph/0307076 (2003) - 2002
- [c1]Petros Drineas, Iordanis Kerenidis, Prabhakar Raghavan:
Competitive recommendation systems. STOC 2002: 82-90 - [i3]Iordanis Kerenidis, Ronald de Wolf:
Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument. CoRR quant-ph/0208062 (2002) - [i2]Iordanis Kerenidis, Ronald de Wolf:
Exponential Lower Bound for 2-Query Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [i1]Chris Harrelson, Iordanis Kerenidis:
Quantum Clock Synchronization with one qubit. CoRR cs.CC/0103021 (2001)
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-20 22:50 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:
