BibTeX records: Lawrence M. Ioannou

download as .bib file

@article{DBLP:journals/tcs/IoannouM14,
  author       = {Lawrence M. Ioannou and
                  Michele Mosca},
  title        = {Public-key cryptography based on bounded quantum reference frames},
  journal      = {Theor. Comput. Sci.},
  volume       = {560},
  pages        = {33--45},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.tcs.2014.09.016},
  doi          = {10.1016/J.TCS.2014.09.016},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/IoannouM14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pqcrypto/IoannouM11,
  author       = {Lawrence M. Ioannou and
                  Michele Mosca},
  editor       = {Bo{-}Yin Yang},
  title        = {A New Spin on Quantum Cryptography: Avoiding Trapdoors and Embracing
                  Public Keys},
  booktitle    = {Post-Quantum Cryptography - 4th International Workshop, PQCrypto 2011,
                  Taipei, Taiwan, November 29 - December 2, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7071},
  pages        = {255--274},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-25405-5\_17},
  doi          = {10.1007/978-3-642-25405-5\_17},
  timestamp    = {Tue, 14 May 2019 10:00:42 +0200},
  biburl       = {https://dblp.org/rec/conf/pqcrypto/IoannouM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tqc/IoannouM11,
  author       = {Lawrence M. Ioannou and
                  Michele Mosca},
  editor       = {Dave Bacon and
                  Miguel{-}Angel Martin{-}Delgado and
                  Martin Roetteler},
  title        = {Unconditionally-Secure and Reusable Public-Key Authentication},
  booktitle    = {Theory of Quantum Computation, Communication, and Cryptography - 6th
                  Conference, {TQC} 2011, Madrid, Spain, May 24-26, 2011, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {6745},
  pages        = {121--142},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-54429-3\_8},
  doi          = {10.1007/978-3-642-54429-3\_8},
  timestamp    = {Thu, 14 Oct 2021 09:54:54 +0200},
  biburl       = {https://dblp.org/rec/conf/tqc/IoannouM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/IoannouM10,
  author       = {Lawrence M. Ioannou and
                  Michele Mosca},
  title        = {Universal quantum computation in a hidden basis},
  journal      = {Quantum Inf. Comput.},
  volume       = {10},
  number       = {7{\&}8},
  pages        = {541--561},
  year         = {2010},
  url          = {https://doi.org/10.26421/QIC10.7-8-1},
  doi          = {10.26421/QIC10.7-8-1},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/qic/IoannouM10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/qic/Ioannou07,
  author       = {Lawrence M. Ioannou},
  title        = {Computational complexity of the quantum separability problem},
  journal      = {Quantum Inf. Comput.},
  volume       = {7},
  number       = {4},
  pages        = {335--370},
  year         = {2007},
  url          = {https://doi.org/10.26421/QIC7.4-5},
  doi          = {10.26421/QIC7.4-5},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/qic/Ioannou07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0603089,
  author       = {Lawrence M. Ioannou and
                  Benjamin C. Travaglione and
                  Donny Cheung},
  title        = {Convex Separation from Optimization via Heuristics},
  journal      = {CoRR},
  volume       = {abs/cs/0603089},
  year         = {2006},
  url          = {http://arxiv.org/abs/cs/0603089},
  eprinttype    = {arXiv},
  eprint       = {cs/0603089},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0603089.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-quant-ph-0603199,
  author       = {Lawrence M. Ioannou},
  title        = {Computational complexity of the quantum separability problem},
  journal      = {CoRR},
  volume       = {abs/quant-ph/0603199},
  year         = {2006},
  url          = {http://arxiv.org/abs/quant-ph/0603199},
  eprinttype    = {arXiv},
  eprint       = {quant-ph/0603199},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-quant-ph-0603199.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0504110,
  author       = {Lawrence M. Ioannou},
  title        = {Computing finite-dimensional bipartite quantum separability},
  journal      = {CoRR},
  volume       = {abs/cs/0504110},
  year         = {2005},
  url          = {http://arxiv.org/abs/cs/0504110},
  eprinttype    = {arXiv},
  eprint       = {cs/0504110},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0504110.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics