Published in: LIPIcs, Volume 270, 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023)
Harald König, Uwe Wolter, and Tim Kräuter. Structural Operational Semantics for Heterogeneously Typed Coalgebras. In 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 270, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{konig_et_al:LIPIcs.CALCO.2023.7, author = {K\"{o}nig, Harald and Wolter, Uwe and Kr\"{a}uter, Tim}, title = {{Structural Operational Semantics for Heterogeneously Typed Coalgebras}}, booktitle = {10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023)}, pages = {7:1--7:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-287-7}, ISSN = {1868-8969}, year = {2023}, volume = {270}, editor = {Baldan, Paolo and de Paiva, Valeria}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2023.7}, URN = {urn:nbn:de:0030-drops-188048}, doi = {10.4230/LIPIcs.CALCO.2023.7}, annote = {Keywords: Coalgebra, Bialgebra, Structural operational semantics, Compositionality} }
Published in: LIPIcs, Volume 267, 4th Conference on Information-Theoretic Cryptography (ITC 2023)
Cody Freitag and Ilan Komargodski. The Cost of Statistical Security in Proofs for Repeated Squaring. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 4:1-4:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{freitag_et_al:LIPIcs.ITC.2023.4, author = {Freitag, Cody and Komargodski, Ilan}, title = {{The Cost of Statistical Security in Proofs for Repeated Squaring}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {4:1--4:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.4}, URN = {urn:nbn:de:0030-drops-183326}, doi = {10.4230/LIPIcs.ITC.2023.4}, annote = {Keywords: Cryptographic Proofs, Repeated Squaring, Lower Bounds} }
Published in: LIPIcs, Volume 267, 4th Conference on Information-Theoretic Cryptography (ITC 2023)
Samuel Bouaziz-Ermann, Alex B. Grilo, and Damien Vergnaud. Quantum Security of Subset Cover Problems. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 9:1-9:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{bouazizermann_et_al:LIPIcs.ITC.2023.9, author = {Bouaziz-Ermann, Samuel and Grilo, Alex B. and Vergnaud, Damien}, title = {{Quantum Security of Subset Cover Problems}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {9:1--9:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.9}, URN = {urn:nbn:de:0030-drops-183378}, doi = {10.4230/LIPIcs.ITC.2023.9}, annote = {Keywords: Cryptography, Random oracle model, Quantum information} }
Published in: LIPIcs, Volume 267, 4th Conference on Information-Theoretic Cryptography (ITC 2023)
Kasper Green Larsen, Maciej Obremski, and Mark Simkin. Distributed Shuffling in Adversarial Environments. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{larsen_et_al:LIPIcs.ITC.2023.10, author = {Larsen, Kasper Green and Obremski, Maciej and Simkin, Mark}, title = {{Distributed Shuffling in Adversarial Environments}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {10:1--10:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.10}, URN = {urn:nbn:de:0030-drops-183385}, doi = {10.4230/LIPIcs.ITC.2023.10}, annote = {Keywords: Distributed Computing, Shuffling} }
Published in: LIPIcs, Volume 267, 4th Conference on Information-Theoretic Cryptography (ITC 2023)
Hannah Keller, Claudio Orlandi, Anat Paskin-Cherniavsky, and Divya Ravi. MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 11:1-11:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{keller_et_al:LIPIcs.ITC.2023.11, author = {Keller, Hannah and Orlandi, Claudio and Paskin-Cherniavsky, Anat and Ravi, Divya}, title = {{MPC with Low Bottleneck-Complexity: Information-Theoretic Security and More}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {11:1--11:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.11}, URN = {urn:nbn:de:0030-drops-183391}, doi = {10.4230/LIPIcs.ITC.2023.11}, annote = {Keywords: Secure Multiparty Computation, Bottleneck Complexity, Information-theoretic} }
Published in: LIPIcs, Volume 267, 4th Conference on Information-Theoretic Cryptography (ITC 2023)
Ivan Damgård, Divya Ravi, Daniel Tschudi, and Sophia Yakoubov. Secure Communication in Dynamic Incomplete Networks. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 13:1-13:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{damgard_et_al:LIPIcs.ITC.2023.13, author = {Damg\r{a}rd, Ivan and Ravi, Divya and Tschudi, Daniel and Yakoubov, Sophia}, title = {{Secure Communication in Dynamic Incomplete Networks}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {13:1--13:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.13}, URN = {urn:nbn:de:0030-drops-183419}, doi = {10.4230/LIPIcs.ITC.2023.13}, annote = {Keywords: Secure Communication, Dynamic Incomplete Network, Information-theoretic} }
Published in: LIPIcs, Volume 267, 4th Conference on Information-Theoretic Cryptography (ITC 2023)
Justin Holmgren and Ruta Jawale. Locally Covert Learning. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 14:1-14:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{holmgren_et_al:LIPIcs.ITC.2023.14, author = {Holmgren, Justin and Jawale, Ruta}, title = {{Locally Covert Learning}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {14:1--14:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.14}, URN = {urn:nbn:de:0030-drops-183421}, doi = {10.4230/LIPIcs.ITC.2023.14}, annote = {Keywords: learning theory, adversarial machine learning, zero knowledge, Fourier analysis of boolean functions, Goldreich-Levin algorithm, Kushilevitz-Mansour algorithm} }
Published in: LIPIcs, Volume 267, 4th Conference on Information-Theoretic Cryptography (ITC 2023)
Amos Beimel. Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 16:1-16:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{beimel:LIPIcs.ITC.2023.16, author = {Beimel, Amos}, title = {{Lower Bounds for Secret-Sharing Schemes for k-Hypergraphs}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {16:1--16:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.16}, URN = {urn:nbn:de:0030-drops-183440}, doi = {10.4230/LIPIcs.ITC.2023.16}, annote = {Keywords: Secret Sharing, Share Size, Lower Bounds, Monotone Circuits} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Siu-Wing Cheng, Man-Kwun Chiu, Kai Jin, and Man Ting Wong. A Generalization of Self-Improving Algorithms. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 29:1-29:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cheng_et_al:LIPIcs.SoCG.2020.29, author = {Cheng, Siu-Wing and Chiu, Man-Kwun and Jin, Kai and Wong, Man Ting}, title = {{A Generalization of Self-Improving Algorithms}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {29:1--29:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.29}, URN = {urn:nbn:de:0030-drops-121873}, doi = {10.4230/LIPIcs.SoCG.2020.29}, annote = {Keywords: expected running time, entropy, sorting, Delaunay triangulation} }
Published in: LIPIcs, Volume 72, 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)
Harald König and Uwe Wolter. Being Van Kampen in Presheaf Topoi is a Uniqueness Property. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 16:1-16:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{konig_et_al:LIPIcs.CALCO.2017.16, author = {K\"{o}nig, Harald and Wolter, Uwe}, title = {{Being Van Kampen in Presheaf Topoi is a Uniqueness Property}}, booktitle = {7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)}, pages = {16:1--16:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-033-0}, ISSN = {1868-8969}, year = {2017}, volume = {72}, editor = {Bonchi, Filippo and K\"{o}nig, Barbara}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.16}, URN = {urn:nbn:de:0030-drops-80320}, doi = {10.4230/LIPIcs.CALCO.2017.16}, annote = {Keywords: Van Kampen Cocone, Presheaf Topos, Fibred Semantics, Mapping Path} }
Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)
Uli Schlachter and Harro Wimmel. k-Bounded Petri Net Synthesis from Modal Transition Systems. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 6:1-6:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{schlachter_et_al:LIPIcs.CONCUR.2017.6, author = {Schlachter, Uli and Wimmel, Harro}, title = {{k-Bounded Petri Net Synthesis from Modal Transition Systems}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {6:1--6:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-048-4}, ISSN = {1868-8969}, year = {2017}, volume = {85}, editor = {Meyer, Roland and Nestmann, Uwe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.6}, URN = {urn:nbn:de:0030-drops-77802}, doi = {10.4230/LIPIcs.CONCUR.2017.6}, annote = {Keywords: Modal transition system, bounded Petri net, synthesis} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Arnab Ganguly, Wing-Kai Hon, Rahul Shah, and Sharma V. Thankachan. Space-Time Trade-Offs for the Shortest Unique Substring Problem. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 34:1-34:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{ganguly_et_al:LIPIcs.ISAAC.2016.34, author = {Ganguly, Arnab and Hon, Wing-Kai and Shah, Rahul and Thankachan, Sharma V.}, title = {{Space-Time Trade-Offs for the Shortest Unique Substring Problem}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {34:1--34:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-026-2}, ISSN = {1868-8969}, year = {2016}, volume = {64}, editor = {Hong, Seok-Hee}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.34}, URN = {urn:nbn:de:0030-drops-68041}, doi = {10.4230/LIPIcs.ISAAC.2016.34}, annote = {Keywords: Suffix Tree, Sparsification, Rabin-Karp Fingerprint, Probabilistic z-Fast Trie, Succinct Data-Structures} }
Published in: LIPIcs, Volume 33, 30th Conference on Computational Complexity (CCC 2015)
Kai-Min Chung, Xiaodi Wu, and Henry Yuen. Parallel Repetition for Entangled k-player Games via Fast Quantum Search. In 30th Conference on Computational Complexity (CCC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 33, pp. 512-536, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{chung_et_al:LIPIcs.CCC.2015.512, author = {Chung, Kai-Min and Wu, Xiaodi and Yuen, Henry}, title = {{Parallel Repetition for Entangled k-player Games via Fast Quantum Search}}, booktitle = {30th Conference on Computational Complexity (CCC 2015)}, pages = {512--536}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-81-1}, ISSN = {1868-8969}, year = {2015}, volume = {33}, editor = {Zuckerman, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.512}, URN = {urn:nbn:de:0030-drops-50727}, doi = {10.4230/LIPIcs.CCC.2015.512}, annote = {Keywords: Parallel repetition, quantum entanglement, communication complexity} }
Published in: Dagstuhl Reports, Volume 2, Issue 5 (2012)
Dedre Gentner, Frank van Harmelen, Pascal Hitzler, Krzysztof Janowicz, and Kai-Uwe Kühnberger. Cognitive Approaches for the Semantic Web (Dagstuhl Seminar 12221). In Dagstuhl Reports, Volume 2, Issue 5, pp. 93-116, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@Article{gentner_et_al:DagRep.2.5.93, author = {Gentner, Dedre and van Harmelen, Frank and Hitzler, Pascal and Janowicz, Krzysztof and K\"{u}hnberger, Kai-Uwe}, title = {{Cognitive Approaches for the Semantic Web (Dagstuhl Seminar 12221)}}, pages = {93--116}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2012}, volume = {2}, number = {5}, editor = {Gentner, Dedre and van Harmelen, Frank and Hitzler, Pascal and Janowicz, Krzysztof and K\"{u}hnberger, Kai-Uwe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.5.93}, URN = {urn:nbn:de:0030-drops-37115}, doi = {10.4230/DagRep.2.5.93}, annote = {Keywords: Cognitive methods, Semantic Web, Analogy and similarity-based reasoning, Semantic heterogeneity and context, Symbol grounding, Emerging semantics, Comonsense reasoning} }
Published in: Dagstuhl Seminar Proceedings, Volume 10381, Robust Query Processing (2011)
Götz Graefe, Arnd Christian König, Harumi Anne Kuno, Volker Markl, and Kai-Uwe Sattler. 10381 Summary and Abstracts Collection – Robust Query Processing. In Robust Query Processing. Dagstuhl Seminar Proceedings, Volume 10381, pp. 1-64, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{graefe_et_al:DagSemProc.10381.1, author = {Graefe, G\"{o}tz and K\"{o}nig, Arnd Christian and Kuno, Harumi Anne and Markl, Volker and Sattler, Kai-Uwe}, title = {{10381 Summary and Abstracts Collection – Robust Query Processing}}, booktitle = {Robust Query Processing}, pages = {1--64}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2011}, volume = {10381}, editor = {Goetz Graefe and Arnd Christian K\"{o}nig and Harumi Anne Kuno and Volker Markl and Kai-Uwe Sattler}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10381.1}, URN = {urn:nbn:de:0030-drops-29846}, doi = {10.4230/DagSemProc.10381.1}, annote = {Keywords: Robust query processing, adaptive query optimization, query execution, indexing, workload management, reliability, application availability} }
Feedback for Dagstuhl Publishing