Published in: LIPIcs, Volume 232, 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)
Jop Briët and Francisco Escudero Gutiérrez. On Converses to the Polynomial Method. In 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 232, pp. 6:1-6:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{briet_et_al:LIPIcs.TQC.2022.6, author = {Bri\"{e}t, Jop and Escudero Guti\'{e}rrez, Francisco}, title = {{On Converses to the Polynomial Method}}, booktitle = {17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)}, pages = {6:1--6:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-237-2}, ISSN = {1868-8969}, year = {2022}, volume = {232}, editor = {Le Gall, Fran\c{c}ois and Morimae, Tomoyuki}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2022.6}, URN = {urn:nbn:de:0030-drops-165139}, doi = {10.4230/LIPIcs.TQC.2022.6}, annote = {Keywords: Quantum query complexity, polynomial method, completely bounded polynomials} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Krishnendu Chatterjee, Thomas A. Henzinger, and Jan Otop. Long-Run Average Behavior of Vector Addition Systems with States. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 27:1-27:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chatterjee_et_al:LIPIcs.CONCUR.2019.27, author = {Chatterjee, Krishnendu and Henzinger, Thomas A. and Otop, Jan}, title = {{Long-Run Average Behavior of Vector Addition Systems with States}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {27:1--27:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.27}, URN = {urn:nbn:de:0030-drops-109293}, doi = {10.4230/LIPIcs.CONCUR.2019.27}, annote = {Keywords: vector addition systems, mean-payoff, Diophantine inequalities} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Mario Bravetti, Marco Carbone, Julien Lange, Nobuko Yoshida, and Gianluigi Zavattaro. A Sound Algorithm for Asynchronous Session Subtyping. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 38:1-38:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bravetti_et_al:LIPIcs.CONCUR.2019.38, author = {Bravetti, Mario and Carbone, Marco and Lange, Julien and Yoshida, Nobuko and Zavattaro, Gianluigi}, title = {{A Sound Algorithm for Asynchronous Session Subtyping}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {38:1--38:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, year = {2019}, volume = {140}, editor = {Fokkink, Wan and van Glabbeek, Rob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.38}, URN = {urn:nbn:de:0030-drops-109408}, doi = {10.4230/LIPIcs.CONCUR.2019.38}, annote = {Keywords: Session types, Concurrency, Subtyping, Algorithm} }
Published in: LIPIcs, Volume 134, 33rd European Conference on Object-Oriented Programming (ECOOP 2019)
Rupak Majumdar, Marcus Pirron, Nobuko Yoshida, and Damien Zufferey. Motion Session Types for Robotic Interactions (Brave New Idea Paper). In 33rd European Conference on Object-Oriented Programming (ECOOP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 134, pp. 28:1-28:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{majumdar_et_al:LIPIcs.ECOOP.2019.28, author = {Majumdar, Rupak and Pirron, Marcus and Yoshida, Nobuko and Zufferey, Damien}, title = {{Motion Session Types for Robotic Interactions}}, booktitle = {33rd European Conference on Object-Oriented Programming (ECOOP 2019)}, pages = {28:1--28:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-111-5}, ISSN = {1868-8969}, year = {2019}, volume = {134}, editor = {Donaldson, Alastair F.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2019.28}, URN = {urn:nbn:de:0030-drops-108205}, doi = {10.4230/LIPIcs.ECOOP.2019.28}, annote = {Keywords: Session Types, Robotics, Concurrent Programming, Motions, Communications, Multiparty Session Types, Deadlock Freedom} }
Published in: LIPIcs, Volume 134, 33rd European Conference on Object-Oriented Programming (ECOOP 2019)
Alen Arslanagić, Jorge A. Pérez, and Erik Voogd. Minimal Session Types (Pearl). In 33rd European Conference on Object-Oriented Programming (ECOOP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 134, pp. 23:1-23:28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{arslanagic_et_al:LIPIcs.ECOOP.2019.23, author = {Arslanagi\'{c}, Alen and P\'{e}rez, Jorge A. and Voogd, Erik}, title = {{Minimal Session Types}}, booktitle = {33rd European Conference on Object-Oriented Programming (ECOOP 2019)}, pages = {23:1--23:28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-111-5}, ISSN = {1868-8969}, year = {2019}, volume = {134}, editor = {Donaldson, Alastair F.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2019.23}, URN = {urn:nbn:de:0030-drops-108151}, doi = {10.4230/LIPIcs.ECOOP.2019.23}, annote = {Keywords: Session types, process calculi, pi-calculus} }
Published in: Dagstuhl Seminar Proceedings, Volume 5081, Foundations of Global Computing (2006)
Francisco Martins, Liliana Salvador, Vasco T. Vasconcelos, and Luís Lopes. MiKO---Mikado Koncurrent Objects. In Foundations of Global Computing. Dagstuhl Seminar Proceedings, Volume 5081, pp. 1-43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2006)
@InProceedings{martins_et_al:DagSemProc.05081.6, author = {Martins, Francisco and Salvador, Liliana and Vasconcelos, Vasco T. and Lopes, Lu{\'\i}s}, title = {{MiKO---Mikado Koncurrent Objects}}, booktitle = {Foundations of Global Computing}, pages = {1--43}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5081}, editor = {Jos\'{e} Luiz Fiadeiro and Ugo Montanari and Martin Wirsing}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05081.6}, URN = {urn:nbn:de:0030-drops-3014}, doi = {10.4230/DagSemProc.05081.6}, annote = {Keywords: Global computing, code migration, administrative domains, process calculus} }
Feedback for Dagstuhl Publishing