Published in: LIPIcs, Volume 216, 30th EACSL Annual Conference on Computer Science Logic (CSL 2022)
Carmen Constantin, Nuiok Dicaire, and Chris Heunen. Localisable Monads. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 15:1-15:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{constantin_et_al:LIPIcs.CSL.2022.15, author = {Constantin, Carmen and Dicaire, Nuiok and Heunen, Chris}, title = {{Localisable Monads}}, booktitle = {30th EACSL Annual Conference on Computer Science Logic (CSL 2022)}, pages = {15:1--15:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-218-1}, ISSN = {1868-8969}, year = {2022}, volume = {216}, editor = {Manea, Florin and Simpson, Alex}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.15}, URN = {urn:nbn:de:0030-drops-157353}, doi = {10.4230/LIPIcs.CSL.2022.15}, annote = {Keywords: Monad, Monoidal category, Presheaf, Central idempotent, Graded monad, Indexed monad, Formal monad, Strong monad, Commutative monad} }
Published in: LIPIcs, Volume 183, 29th EACSL Annual Conference on Computer Science Logic (CSL 2021)
Samson Abramsky and Rui Soares Barbosa. The Logic of Contextuality. In 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 183, pp. 5:1-5:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{abramsky_et_al:LIPIcs.CSL.2021.5, author = {Abramsky, Samson and Barbosa, Rui Soares}, title = {{The Logic of Contextuality}}, booktitle = {29th EACSL Annual Conference on Computer Science Logic (CSL 2021)}, pages = {5:1--5:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-175-7}, ISSN = {1868-8969}, year = {2021}, volume = {183}, editor = {Baier, Christel and Goubault-Larrecq, Jean}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2021.5}, URN = {urn:nbn:de:0030-drops-134394}, doi = {10.4230/LIPIcs.CSL.2021.5}, annote = {Keywords: partial Boolean algebras, contextuality, exclusivity principles, Kochen-Specker paradoxes, tensor product} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Huan Li, He Sun, and Luca Zanetti. Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 71:1-71:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{li_et_al:LIPIcs.ESA.2019.71, author = {Li, Huan and Sun, He and Zanetti, Luca}, title = {{Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {71:1--71:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.71}, URN = {urn:nbn:de:0030-drops-111926}, doi = {10.4230/LIPIcs.ESA.2019.71}, annote = {Keywords: Spectral methods, Hermitian Laplacians, the Max-2-Lin problem, Unique Games} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Scott Aaronson, Alexandru Cojocaru, Alexandru Gheorghiu, and Elham Kashefi. Complexity-Theoretic Limitations on Blind Delegated Quantum Computation. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 6:1-6:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{aaronson_et_al:LIPIcs.ICALP.2019.6, author = {Aaronson, Scott and Cojocaru, Alexandru and Gheorghiu, Alexandru and Kashefi, Elham}, title = {{Complexity-Theoretic Limitations on Blind Delegated Quantum Computation}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.6}, URN = {urn:nbn:de:0030-drops-105826}, doi = {10.4230/LIPIcs.ICALP.2019.6}, annote = {Keywords: Quantum cryptography, Complexity theory, Delegated quantum computation, Computing on encrypted data} }
Feedback for Dagstuhl Publishing