Published in: LIPIcs, Volume 252, 31st EACSL Annual Conference on Computer Science Logic (CSL 2023)
Chris Barrett, Willem Heijltjes, and Guy McCusker. The Functional Machine Calculus II: Semantics. In 31st EACSL Annual Conference on Computer Science Logic (CSL 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 252, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{barrett_et_al:LIPIcs.CSL.2023.10, author = {Barrett, Chris and Heijltjes, Willem and McCusker, Guy}, title = {{The Functional Machine Calculus II: Semantics}}, booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)}, pages = {10:1--10:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-264-8}, ISSN = {1868-8969}, year = {2023}, volume = {252}, editor = {Klin, Bartek and Pimentel, Elaine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.10}, URN = {urn:nbn:de:0030-drops-174716}, doi = {10.4230/LIPIcs.CSL.2023.10}, annote = {Keywords: lambda-calculus, computational effects, denotational semantics, strong normalization} }
Published in: LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)
John Augustine, Anisur Rahaman Molla, Gopal Pandurangan, and Yadu Vasudev. Byzantine Connectivity Testing in the Congested Clique. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 7:1-7:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{augustine_et_al:LIPIcs.DISC.2022.7, author = {Augustine, John and Molla, Anisur Rahaman and Pandurangan, Gopal and Vasudev, Yadu}, title = {{Byzantine Connectivity Testing in the Congested Clique}}, booktitle = {36th International Symposium on Distributed Computing (DISC 2022)}, pages = {7:1--7:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-255-6}, ISSN = {1868-8969}, year = {2022}, volume = {246}, editor = {Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.7}, URN = {urn:nbn:de:0030-drops-171987}, doi = {10.4230/LIPIcs.DISC.2022.7}, annote = {Keywords: Byzantine protocols, distributed graph algorithms, congested clique, graph connectivity, fault-tolerant computation, randomized algorithms} }
Published in: LIPIcs, Volume 245, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)
Marcos Kiwi, Markus Schepers, and John Sylvester. Cover and Hitting Times of Hyperbolic Random Graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 245, pp. 30:1-30:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{kiwi_et_al:LIPIcs.APPROX/RANDOM.2022.30, author = {Kiwi, Marcos and Schepers, Markus and Sylvester, John}, title = {{Cover and Hitting Times of Hyperbolic Random Graphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)}, pages = {30:1--30:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-249-5}, ISSN = {1868-8969}, year = {2022}, volume = {245}, editor = {Chakrabarti, Amit and Swamy, Chaitanya}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.30}, URN = {urn:nbn:de:0030-drops-171523}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.30}, annote = {Keywords: Random walk, hyperbolic random graph, cover time, hitting time, average hitting time, target time, effective resistance, Kirchhoff index} }
Published in: DARTS, Volume 8, Issue 2, Special Issue of the 36th European Conference on Object-Oriented Programming (ECOOP 2022)
Shuyang Liu, John Bender, and Jens Palsberg. Compiling Volatile Correctly in Java (Artifact). In Special Issue of the 36th European Conference on Object-Oriented Programming (ECOOP 2022). Dagstuhl Artifacts Series (DARTS), Volume 8, Issue 2, pp. 3:1-3:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Article{liu_et_al:DARTS.8.2.3, author = {Liu, Shuyang and Bender, John and Palsberg, Jens}, title = {{Compiling Volatile Correctly in Java (Artifact)}}, pages = {3:1--3:2}, journal = {Dagstuhl Artifacts Series}, ISSN = {2509-8195}, year = {2022}, volume = {8}, number = {2}, editor = {Liu, Shuyang and Bender, John and Palsberg, Jens}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DARTS.8.2.3}, URN = {urn:nbn:de:0030-drops-162018}, doi = {10.4230/DARTS.8.2.3}, annote = {Keywords: formal semantics, concurrency, compilation} }
Published in: LIPIcs, Volume 222, 36th European Conference on Object-Oriented Programming (ECOOP 2022)
Shuyang Liu, John Bender, and Jens Palsberg. Compiling Volatile Correctly in Java. In 36th European Conference on Object-Oriented Programming (ECOOP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 222, pp. 6:1-6:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{liu_et_al:LIPIcs.ECOOP.2022.6, author = {Liu, Shuyang and Bender, John and Palsberg, Jens}, title = {{Compiling Volatile Correctly in Java}}, booktitle = {36th European Conference on Object-Oriented Programming (ECOOP 2022)}, pages = {6:1--6:26}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-225-9}, ISSN = {1868-8969}, year = {2022}, volume = {222}, editor = {Ali, Karim and Vitek, Jan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2022.6}, URN = {urn:nbn:de:0030-drops-162346}, doi = {10.4230/LIPIcs.ECOOP.2022.6}, annote = {Keywords: formal semantics, concurrency, compilation} }
Published in: LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021)
Ioannis Anagnostides and Themis Gouleakis. Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 5:1-5:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{anagnostides_et_al:LIPIcs.DISC.2021.5, author = {Anagnostides, Ioannis and Gouleakis, Themis}, title = {{Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model}}, booktitle = {35th International Symposium on Distributed Computing (DISC 2021)}, pages = {5:1--5:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-210-5}, ISSN = {1868-8969}, year = {2021}, volume = {209}, editor = {Gilbert, Seth}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.5}, URN = {urn:nbn:de:0030-drops-148077}, doi = {10.4230/LIPIcs.DISC.2021.5}, annote = {Keywords: Distributed Computing, Hybrid Model, Sparse Graphs, Deterministic Algorithms, All-Pairs Shortest Paths, Minimum Cut, Radius} }
Published in: Dagstuhl Reports, Volume 11, Issue 1 (2021)
Gerth Stølting Brodal, John Iacono, Markus E. Nebel, and Vijaya Ramachandran. Scalable Data Structures (Dagstuhl Seminar 21071). In Dagstuhl Reports, Volume 11, Issue 1, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Article{brodal_et_al:DagRep.11.1.1, author = {Brodal, Gerth St{\o}lting and Iacono, John and Nebel, Markus E. and Ramachandran, Vijaya}, title = {{Scalable Data Structures (Dagstuhl Seminar 21071)}}, pages = {1--23}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2021}, volume = {11}, number = {1}, editor = {Brodal, Gerth St{\o}lting and Iacono, John and Nebel, Markus E. and Ramachandran, Vijaya}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.11.1.1}, URN = {urn:nbn:de:0030-drops-143481}, doi = {10.4230/DagRep.11.1.1}, annote = {Keywords: algorithms, big data, data structures, GPU computing, large data sets, models of computation, parallel algorithms} }
Published in: LIPIcs, Volume 169, 35th Computational Complexity Conference (CCC 2020)
Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, and Srikanth Srinivasan. Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't. In 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 169, pp. 14:1-14:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chaugule_et_al:LIPIcs.CCC.2020.14, author = {Chaugule, Prasad and Kumar, Mrinal and Limaye, Nutan and Mohapatra, Chandra Kanta and She, Adrian and Srinivasan, Srikanth}, title = {{Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't}}, booktitle = {35th Computational Complexity Conference (CCC 2020)}, pages = {14:1--14:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-156-6}, ISSN = {1868-8969}, year = {2020}, volume = {169}, editor = {Saraf, Shubhangi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.14}, URN = {urn:nbn:de:0030-drops-125660}, doi = {10.4230/LIPIcs.CCC.2020.14}, annote = {Keywords: Schur polynomial, Jacobian, Algebraic independence, Generalized Vandermonde determinant, Taylor expansion, Formula complexity, Lower bound} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, and John Sylvester. Choice and Bias in Random Walks. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 76:1-76:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{georgakopoulos_et_al:LIPIcs.ITCS.2020.76, author = {Georgakopoulos, Agelos and Haslegrave, John and Sauerwald, Thomas and Sylvester, John}, title = {{Choice and Bias in Random Walks}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {76:1--76:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.76}, URN = {urn:nbn:de:0030-drops-117612}, doi = {10.4230/LIPIcs.ITCS.2020.76}, annote = {Keywords: Power of Two Choices, Markov Chains, Random Walks, Cover Time, Markov Decision Processes} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Josep Díaz, Lefteris Kirousis, Sofia Kokonezi, and John Livieratos. Algorithmically Efficient Syntactic Characterization of Possibility Domains. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 50:1-50:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{diaz_et_al:LIPIcs.ICALP.2019.50, author = {D{\'\i}az, Josep and Kirousis, Lefteris and Kokonezi, Sofia and Livieratos, John}, title = {{Algorithmically Efficient Syntactic Characterization of Possibility Domains}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {50:1--50: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.50}, URN = {urn:nbn:de:0030-drops-106269}, doi = {10.4230/LIPIcs.ICALP.2019.50}, annote = {Keywords: collective decision making, computational social choice, judgment aggregation, logical relations, algorithm complexity} }
Published in: LIPIcs, Volume 135, 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019)
Shalev Ben-David and Robin Kothari. Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge. In 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 135, pp. 2:1-2:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bendavid_et_al:LIPIcs.TQC.2019.2, author = {Ben-David, Shalev and Kothari, Robin}, title = {{Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge}}, booktitle = {14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019)}, pages = {2:1--2:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-112-2}, ISSN = {1868-8969}, year = {2019}, volume = {135}, editor = {van Dam, Wim and Man\v{c}inska, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2019.2}, URN = {urn:nbn:de:0030-drops-103944}, doi = {10.4230/LIPIcs.TQC.2019.2}, annote = {Keywords: Quantum query complexity, quantum algorithms} }
Published in: OASIcs, Volume 70, 2nd Conference on Language, Data and Knowledge (LDK 2019)
Oana Inel and Lora Aroyo. Validation Methodology for Expert-Annotated Datasets: Event Annotation Case Study. In 2nd Conference on Language, Data and Knowledge (LDK 2019). Open Access Series in Informatics (OASIcs), Volume 70, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{inel_et_al:OASIcs.LDK.2019.12, author = {Inel, Oana and Aroyo, Lora}, title = {{Validation Methodology for Expert-Annotated Datasets: Event Annotation Case Study}}, booktitle = {2nd Conference on Language, Data and Knowledge (LDK 2019)}, pages = {12:1--12:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-105-4}, ISSN = {2190-6807}, year = {2019}, volume = {70}, editor = {Eskevich, Maria and de Melo, Gerard and F\"{a}th, Christian and McCrae, John P. and Buitelaar, Paul and Chiarcos, Christian and Klimek, Bettina and Dojchinovski, Milan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.LDK.2019.12}, URN = {urn:nbn:de:0030-drops-103762}, doi = {10.4230/OASIcs.LDK.2019.12}, annote = {Keywords: Crowdsourcing, Human-in-the-Loop, Event Extraction, Time Extraction} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, and Ahmad A. Rushdi. Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 1:1-1:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{abdelkader_et_al:LIPIcs.SoCG.2018.1, author = {Abdelkader, Ahmed and Bajaj, Chandrajit L. and Ebeida, Mohamed S. and Mahmoud, Ahmed H. and Mitchell, Scott A. and Owens, John D. and Rushdi, Ahmad A.}, title = {{Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {1:1--1:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.1}, URN = {urn:nbn:de:0030-drops-87147}, doi = {10.4230/LIPIcs.SoCG.2018.1}, annote = {Keywords: sampling conditions, surface reconstruction, polyhedral meshing, Voronoi} }
Published in: LIPIcs, Volume 96, 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
John M. Hitchcock and Hadi Shafei. Nonuniform Reductions and NP-Completeness. In 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 96, pp. 40:1-40:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hitchcock_et_al:LIPIcs.STACS.2018.40, author = {Hitchcock, John M. and Shafei, Hadi}, title = {{Nonuniform Reductions and NP-Completeness}}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)}, pages = {40:1--40:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-062-0}, ISSN = {1868-8969}, year = {2018}, volume = {96}, editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.40}, URN = {urn:nbn:de:0030-drops-85217}, doi = {10.4230/LIPIcs.STACS.2018.40}, annote = {Keywords: computational complexity, NP-completeness, reducibility, nonuniform complexity} }
Published in: LIPIcs, Volume 70, 20th International Conference on Principles of Distributed Systems (OPODIS 2016)
Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari. Design Patterns in Beeping Algorithms. In 20th International Conference on Principles of Distributed Systems (OPODIS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 70, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{casteigts_et_al:LIPIcs.OPODIS.2016.15, author = {Casteigts, Arnaud and M\'{e}tivier, Yves and Robson, John Michael and Zemmari, Akka}, title = {{Design Patterns in Beeping Algorithms}}, booktitle = {20th International Conference on Principles of Distributed Systems (OPODIS 2016)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-031-6}, ISSN = {1868-8969}, year = {2017}, volume = {70}, editor = {Fatourou, Panagiota and Jim\'{e}nez, Ernesto and Pedone, Fernando}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2016.15}, URN = {urn:nbn:de:0030-drops-70840}, doi = {10.4230/LIPIcs.OPODIS.2016.15}, annote = {Keywords: Beeping models, Design patterns, Collision detection, Colouring, 2-hop colouring, Degree computation, Emulation} }
Feedback for Dagstuhl Publishing