Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Boris Aronov, Matthew J. Katz, and Elad Sulami. Dynamic Time Warping-Based Proximity Problems. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 9:1-9:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{aronov_et_al:LIPIcs.MFCS.2020.9, author = {Aronov, Boris and Katz, Matthew J. and Sulami, Elad}, title = {{Dynamic Time Warping-Based Proximity Problems}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {9:1--9:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-159-7}, ISSN = {1868-8969}, year = {2020}, volume = {170}, editor = {Esparza, Javier and Kr\'{a}l', Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.9}, URN = {urn:nbn:de:0030-drops-126794}, doi = {10.4230/LIPIcs.MFCS.2020.9}, annote = {Keywords: dynamic time warping, distance oracle, clustering, nearest-neighbor search} }
Published in: LIPIcs, Volume 141, 10th International Conference on Interactive Theorem Proving (ITP 2019)
Daniel E. Severín. Formalization of the Domination Chain with Weighted Parameters (Short Paper). In 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 141, pp. 36:1-36:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{severin:LIPIcs.ITP.2019.36, author = {Sever{\'\i}n, Daniel E.}, title = {{Formalization of the Domination Chain with Weighted Parameters}}, booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)}, pages = {36:1--36:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-122-1}, ISSN = {1868-8969}, year = {2019}, volume = {141}, editor = {Harrison, John and O'Leary, John and Tolmach, Andrew}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.36}, URN = {urn:nbn:de:0030-drops-110919}, doi = {10.4230/LIPIcs.ITP.2019.36}, annote = {Keywords: Domination Chain, Coq, Formalization of Mathematics} }
Published in: LIPIcs, Volume 142, 14th International Conference on Spatial Information Theory (COSIT 2019)
Christian Kray, Edzer Pebesma, Markus Konkol, and Daniel Nüst. Reproducible Research in Geoinformatics: Concepts, Challenges and Benefits (Vision Paper). In 14th International Conference on Spatial Information Theory (COSIT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 142, pp. 8:1-8:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kray_et_al:LIPIcs.COSIT.2019.8, author = {Kray, Christian and Pebesma, Edzer and Konkol, Markus and N\"{u}st, Daniel}, title = {{Reproducible Research in Geoinformatics: Concepts, Challenges and Benefits}}, booktitle = {14th International Conference on Spatial Information Theory (COSIT 2019)}, pages = {8:1--8:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-115-3}, ISSN = {1868-8969}, year = {2019}, volume = {142}, editor = {Timpf, Sabine and Schlieder, Christoph and Kattenbeck, Markus and Ludwig, Bernd and Stewart, Kathleen}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.COSIT.2019.8}, URN = {urn:nbn:de:0030-drops-111008}, doi = {10.4230/LIPIcs.COSIT.2019.8}, annote = {Keywords: vision paper, Geoinformatics, reproducibility, computational, spatial and temporal information, spatial data science, GI Science} }
Published in: LIPIcs, Volume 136, 3rd Summit on Advances in Programming Languages (SNAPL 2019)
Lindsey Kuper and Peter Alvaro. Toward Domain-Specific Solvers for Distributed Consistency. In 3rd Summit on Advances in Programming Languages (SNAPL 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 136, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kuper_et_al:LIPIcs.SNAPL.2019.10, author = {Kuper, Lindsey and Alvaro, Peter}, title = {{Toward Domain-Specific Solvers for Distributed Consistency}}, booktitle = {3rd Summit on Advances in Programming Languages (SNAPL 2019)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-113-9}, ISSN = {1868-8969}, year = {2019}, volume = {136}, editor = {Lerner, Benjamin S. and Bod{\'\i}k, Rastislav and Krishnamurthi, Shriram}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SNAPL.2019.10}, URN = {urn:nbn:de:0030-drops-105530}, doi = {10.4230/LIPIcs.SNAPL.2019.10}, annote = {Keywords: distributed consistency, SMT solving, theory solvers} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Daniel Binham, Pedro Machado Manhaes de Castro, and Antoine Vigneron. Reachability in a Planar Subdivision with Direction Constraints. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 17:1-17:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{binham_et_al:LIPIcs.SoCG.2017.17, author = {Binham, Daniel and Manhaes de Castro, Pedro Machado and Vigneron, Antoine}, title = {{Reachability in a Planar Subdivision with Direction Constraints}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {17:1--17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-038-5}, ISSN = {1868-8969}, year = {2017}, volume = {77}, editor = {Aronov, Boris and Katz, Matthew J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.17}, URN = {urn:nbn:de:0030-drops-72022}, doi = {10.4230/LIPIcs.SoCG.2017.17}, annote = {Keywords: Design and analysis of geometric algorithms, Path planning, Reachability} }
Published in: Dagstuhl Manifestos, Volume 6, Issue 1 (2017)
Alice Allen, Cecilia Aragon, Christoph Becker, Jeffrey Carver, Andrei Chis, Benoit Combemale, Mike Croucher, Kevin Crowston, Daniel Garijo, Ashish Gehani, Carole Goble, Robert Haines, Robert Hirschfeld, James Howison, Kathryn Huff, Caroline Jay, Daniel S. Katz, Claude Kirchner, Katie Kuksenok, Ralf Lämmel, Oscar Nierstrasz, Matt Turk, Rob van Nieuwpoort, Matthew Vaughn, and Jurgen J. Vinju. Engineering Academic Software (Dagstuhl Perspectives Workshop 16252). In Dagstuhl Manifestos, Volume 6, Issue 1, pp. 1-20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@Article{allen_et_al:DagMan.6.1.1, author = {Allen, Alice and Aragon, Cecilia and Becker, Christoph and Carver, Jeffrey and Chis, Andrei and Combemale, Benoit and Croucher, Mike and Crowston, Kevin and Garijo, Daniel and Gehani, Ashish and Goble, Carole and Haines, Robert and Hirschfeld, Robert and Howison, James and Huff, Kathryn and Jay, Caroline and Katz, Daniel S. and Kirchner, Claude and Kuksenok, Katie and L\"{a}mmel, Ralf and Nierstrasz, Oscar and Turk, Matt and van Nieuwpoort, Rob and Vaughn, Matthew and Vinju, Jurgen J.}, title = {{Engineering Academic Software (Dagstuhl Perspectives Workshop 16252)}}, pages = {1--20}, journal = {Dagstuhl Manifestos}, ISSN = {2193-2433}, year = {2017}, volume = {6}, number = {1}, editor = {Allen, Alice and Aragon, Cecilia and Becker, Christoph and Carver, Jeffrey and Chis, Andrei and Combemale, Benoit and Croucher, Mike and Crowston, Kevin and Garijo, Daniel and Gehani, Ashish and Goble, Carole and Haines, Robert and Hirschfeld, Robert and Howison, James and Huff, Kathryn and Jay, Caroline and Katz, Daniel S. and Kirchner, Claude and Kuksenok, Katie and L\"{a}mmel, Ralf and Nierstrasz, Oscar and Turk, Matt and van Nieuwpoort, Rob and Vaughn, Matthew and Vinju, Jurgen J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagMan.6.1.1}, URN = {urn:nbn:de:0030-drops-71468}, doi = {10.4230/DagMan.6.1.1}, annote = {Keywords: Academic software, Research software, Software citation, Software sustainability} }
Published in: LIPIcs, Volume 44, 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)
Edward Eaton and Fang Song. Making Existential-unforgeable Signatures Strongly Unforgeable in the Quantum Random-oracle Model. In 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 44, pp. 147-162, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{eaton_et_al:LIPIcs.TQC.2015.147, author = {Eaton, Edward and Song, Fang}, title = {{Making Existential-unforgeable Signatures Strongly Unforgeable in the Quantum Random-oracle Model}}, booktitle = {10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)}, pages = {147--162}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-96-5}, ISSN = {1868-8969}, year = {2015}, volume = {44}, editor = {Beigi, Salman and K\"{o}nig, Robert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2015.147}, URN = {urn:nbn:de:0030-drops-55540}, doi = {10.4230/LIPIcs.TQC.2015.147}, annote = {Keywords: digital signatures, strongly unforgeable, quantum random-oracle, lattices} }
Published in: LIPIcs, Volume 30, 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)
Norbert Bus, Shashwat Garg, Nabil H. Mustafa, and Saurabh Ray. Improved Local Search for Geometric Hitting Set. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 30, pp. 184-196, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{bus_et_al:LIPIcs.STACS.2015.184, author = {Bus, Norbert and Garg, Shashwat and Mustafa, Nabil H. and Ray, Saurabh}, title = {{Improved Local Search for Geometric Hitting Set}}, booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015)}, pages = {184--196}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-78-1}, ISSN = {1868-8969}, year = {2015}, volume = {30}, editor = {Mayr, Ernst W. and Ollinger, Nicolas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.184}, URN = {urn:nbn:de:0030-drops-49135}, doi = {10.4230/LIPIcs.STACS.2015.184}, annote = {Keywords: hitting sets, Delaunay triangulation, local search, disks, geometric algorithms} }
Feedback for Dagstuhl Publishing