Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Fred Anderson, Anirban Ghosh, Matthew Graham, Lucas Mougeot, and David Wisnosky. An Interactive Tool for Experimenting with Bounded-Degree Plane Geometric Spanners (Media Exposition). In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 61:1-61:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{anderson_et_al:LIPIcs.SoCG.2021.61, author = {Anderson, Fred and Ghosh, Anirban and Graham, Matthew and Mougeot, Lucas and Wisnosky, David}, title = {{An Interactive Tool for Experimenting with Bounded-Degree Plane Geometric Spanners}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {61:1--61:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.61}, URN = {urn:nbn:de:0030-drops-138607}, doi = {10.4230/LIPIcs.SoCG.2021.61}, annote = {Keywords: graph approximation, Delaunay triangulations, geometric spanners, plane spanners, bounded-degree spanners} }
Published in: LIPIcs, Volume 143, 19th International Workshop on Algorithms in Bioinformatics (WABI 2019)
Alexey Markin and Oliver Eulenstein. Consensus Clusters in Robinson-Foulds Reticulation Networks. In 19th International Workshop on Algorithms in Bioinformatics (WABI 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 143, pp. 12:1-12:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{markin_et_al:LIPIcs.WABI.2019.12, author = {Markin, Alexey and Eulenstein, Oliver}, title = {{Consensus Clusters in Robinson-Foulds Reticulation Networks}}, booktitle = {19th International Workshop on Algorithms in Bioinformatics (WABI 2019)}, pages = {12:1--12:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-123-8}, ISSN = {1868-8969}, year = {2019}, volume = {143}, editor = {Huber, Katharina T. and Gusfield, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2019.12}, URN = {urn:nbn:de:0030-drops-110420}, doi = {10.4230/LIPIcs.WABI.2019.12}, annote = {Keywords: Phylogenetics, phylogenetic tree, phylogenetic network, reticulation network, Robinson-Foulds, Pareto, RF-Net} }
Published in: LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019)
Tobias Kappé, Paul Brunet, Jurriaan Rot, Alexandra Silva, Jana Wagemaker, and Fabio Zanasi. Kleene Algebra with Observations. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 41:1-41:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kappe_et_al:LIPIcs.CONCUR.2019.41, author = {Kapp\'{e}, Tobias and Brunet, Paul and Rot, Jurriaan and Silva, Alexandra and Wagemaker, Jana and Zanasi, Fabio}, title = {{Kleene Algebra with Observations}}, booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, pages = {41:1--41: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.41}, URN = {urn:nbn:de:0030-drops-109431}, doi = {10.4230/LIPIcs.CONCUR.2019.41}, annote = {Keywords: Concurrent Kleene algebra, Kleene algebra with tests, free model, axiomatisation, decision procedure} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
C. Ramya and B. V. Raghavendra Rao. Lower Bounds for Multilinear Order-Restricted ABPs. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 52:1-52:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{ramya_et_al:LIPIcs.MFCS.2019.52, author = {Ramya, C. and Rao, B. V. Raghavendra}, title = {{Lower Bounds for Multilinear Order-Restricted ABPs}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {52:1--52:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.52}, URN = {urn:nbn:de:0030-drops-109963}, doi = {10.4230/LIPIcs.MFCS.2019.52}, annote = {Keywords: Computational complexity, Algebraic complexity theory, Polynomials} }
Published in: LIPIcs, Volume 50, 31st Conference on Computational Complexity (CCC 2016)
Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, and Ben Lee Volk. Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. In 31st Conference on Computational Complexity (CCC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 50, pp. 30:1-30:25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{anderson_et_al:LIPIcs.CCC.2016.30, author = {Anderson, Matthew and Forbes, Michael A. and Saptharishi, Ramprasad and Shpilka, Amir and Volk, Ben Lee}, title = {{Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs}}, booktitle = {31st Conference on Computational Complexity (CCC 2016)}, pages = {30:1--30:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-008-8}, ISSN = {1868-8969}, year = {2016}, volume = {50}, editor = {Raz, Ran}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.30}, URN = {urn:nbn:de:0030-drops-58255}, doi = {10.4230/LIPIcs.CCC.2016.30}, annote = {Keywords: Algebraic Complexity, Lower Bounds, Derandomization, Polynomial Identity Testing} }
Published in: LIPIcs, Volume 42, 26th International Conference on Concurrency Theory (CONCUR 2015)
Alexandra Silva. Applications of Automata and Concurrency Theory in Networks (Invited Paper). In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 42-43, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{silva:LIPIcs.CONCUR.2015.42, author = {Silva, Alexandra}, title = {{Applications of Automata and Concurrency Theory in Networks}}, booktitle = {26th International Conference on Concurrency Theory (CONCUR 2015)}, pages = {42--43}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-91-0}, ISSN = {1868-8969}, year = {2015}, volume = {42}, editor = {Aceto, Luca and de Frutos Escrig, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2015.42}, URN = {urn:nbn:de:0030-drops-53993}, doi = {10.4230/LIPIcs.CONCUR.2015.42}, annote = {Keywords: Automata, network programming, coalgebra} }
Published in: LIPIcs, Volume 32, 1st Summit on Advances in Programming Languages (SNAPL 2015)
Benjamin Livshits and Todd Mytkowicz. InterPoll: Crowd-Sourced Internet Polls. In 1st Summit on Advances in Programming Languages (SNAPL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 32, pp. 156-176, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{livshits_et_al:LIPIcs.SNAPL.2015.156, author = {Livshits, Benjamin and Mytkowicz, Todd}, title = {{InterPoll: Crowd-Sourced Internet Polls}}, booktitle = {1st Summit on Advances in Programming Languages (SNAPL 2015)}, pages = {156--176}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-80-4}, ISSN = {1868-8969}, year = {2015}, volume = {32}, editor = {Ball, Thomas and Bodík, Rastislav and Krishnamurthi, Shriram and Lerner, Benjamin S. and Morriset, Greg}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SNAPL.2015.156}, URN = {urn:nbn:de:0030-drops-50242}, doi = {10.4230/LIPIcs.SNAPL.2015.156}, annote = {Keywords: CrowdSourcing, Polling, LINQ} }
Published in: LIPIcs, Volume 32, 1st Summit on Advances in Programming Languages (SNAPL 2015)
Santosh Nagarakatte, Milo M. K. Martin, and Steve Zdancewic. Everything You Want to Know About Pointer-Based Checking. In 1st Summit on Advances in Programming Languages (SNAPL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 32, pp. 190-208, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{nagarakatte_et_al:LIPIcs.SNAPL.2015.190, author = {Nagarakatte, Santosh and Martin, Milo M. K. and Zdancewic, Steve}, title = {{Everything You Want to Know About Pointer-Based Checking}}, booktitle = {1st Summit on Advances in Programming Languages (SNAPL 2015)}, pages = {190--208}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-80-4}, ISSN = {1868-8969}, year = {2015}, volume = {32}, editor = {Ball, Thomas and Bodík, Rastislav and Krishnamurthi, Shriram and Lerner, Benjamin S. and Morriset, Greg}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SNAPL.2015.190}, URN = {urn:nbn:de:0030-drops-50268}, doi = {10.4230/LIPIcs.SNAPL.2015.190}, annote = {Keywords: Memory safety, Buffer overflows, Dangling pointers, Pointer-based checking, SoftBoundCETS} }
Published in: LIPIcs, Volume 32, 1st Summit on Advances in Programming Languages (SNAPL 2015)
Umut A. Acar, Guy Blelloch, Matthew Fluet, Stefan K. Muller, and Ram Raghunathan. Coupling Memory and Computation for Locality Management. In 1st Summit on Advances in Programming Languages (SNAPL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 32, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{acar_et_al:LIPIcs.SNAPL.2015.1, author = {Acar, Umut A. and Blelloch, Guy and Fluet, Matthew and Muller, Stefan K. and Raghunathan, Ram}, title = {{Coupling Memory and Computation for Locality Management}}, booktitle = {1st Summit on Advances in Programming Languages (SNAPL 2015)}, pages = {1--14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-80-4}, ISSN = {1868-8969}, year = {2015}, volume = {32}, editor = {Ball, Thomas and Bodík, Rastislav and Krishnamurthi, Shriram and Lerner, Benjamin S. and Morriset, Greg}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SNAPL.2015.1}, URN = {urn:nbn:de:0030-drops-50121}, doi = {10.4230/LIPIcs.SNAPL.2015.1}, annote = {Keywords: Parallel computing, locality, memory management, parallel garbage collection, functional programming, nested parallelism, thread scheduling} }
Published in: LIPIcs, Volume 32, 1st Summit on Advances in Programming Languages (SNAPL 2015)
Aurojit Panda, Katerina Argyraki, Mooly Sagiv, Michael Schapira, and Scott Shenker. New Directions for Network Verification. In 1st Summit on Advances in Programming Languages (SNAPL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 32, pp. 209-220, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{panda_et_al:LIPIcs.SNAPL.2015.209, author = {Panda, Aurojit and Argyraki, Katerina and Sagiv, Mooly and Schapira, Michael and Shenker, Scott}, title = {{New Directions for Network Verification}}, booktitle = {1st Summit on Advances in Programming Languages (SNAPL 2015)}, pages = {209--220}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-80-4}, ISSN = {1868-8969}, year = {2015}, volume = {32}, editor = {Ball, Thomas and Bodík, Rastislav and Krishnamurthi, Shriram and Lerner, Benjamin S. and Morriset, Greg}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SNAPL.2015.209}, URN = {urn:nbn:de:0030-drops-50278}, doi = {10.4230/LIPIcs.SNAPL.2015.209}, annote = {Keywords: Middleboxes, Network Verification, Mutable Dataplane} }
Published in: LIPIcs, Volume 32, 1st Summit on Advances in Programming Languages (SNAPL 2015)
Jeremy G. Siek, Michael M. Vitousek, Matteo Cimini, and John Tang Boyland. Refined Criteria for Gradual Typing. In 1st Summit on Advances in Programming Languages (SNAPL 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 32, pp. 274-293, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{siek_et_al:LIPIcs.SNAPL.2015.274, author = {Siek, Jeremy G. and Vitousek, Michael M. and Cimini, Matteo and Boyland, John Tang}, title = {{Refined Criteria for Gradual Typing}}, booktitle = {1st Summit on Advances in Programming Languages (SNAPL 2015)}, pages = {274--293}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-80-4}, ISSN = {1868-8969}, year = {2015}, volume = {32}, editor = {Ball, Thomas and Bodík, Rastislav and Krishnamurthi, Shriram and Lerner, Benjamin S. and Morriset, Greg}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SNAPL.2015.274}, URN = {urn:nbn:de:0030-drops-50312}, doi = {10.4230/LIPIcs.SNAPL.2015.274}, annote = {Keywords: gradual typing, type systems, semantics, dynamic languages} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Matthew Anderson and Anuj Dawar. On Symmetric Circuits and Fixed-Point Logics. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 41-52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{anderson_et_al:LIPIcs.STACS.2014.41, author = {Anderson, Matthew and Dawar, Anuj}, title = {{On Symmetric Circuits and Fixed-Point Logics}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {41--52}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.41}, URN = {urn:nbn:de:0030-drops-44455}, doi = {10.4230/LIPIcs.STACS.2014.41}, annote = {Keywords: symmetric circuit, fixed-point logic, majority, counting, uniformity} }
Feedback for Dagstuhl Publishing