Published in: LIPIcs, Volume 200, 36th Computational Complexity Conference (CCC 2021)
Pranjal Dutta, Gorav Jindal, Anurag Pandey, and Amit Sinhababu. Arithmetic Circuit Complexity of Division and Truncation. In 36th Computational Complexity Conference (CCC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 200, pp. 25:1-25:36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dutta_et_al:LIPIcs.CCC.2021.25, author = {Dutta, Pranjal and Jindal, Gorav and Pandey, Anurag and Sinhababu, Amit}, title = {{Arithmetic Circuit Complexity of Division and Truncation}}, booktitle = {36th Computational Complexity Conference (CCC 2021)}, pages = {25:1--25:36}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-193-1}, ISSN = {1868-8969}, year = {2021}, volume = {200}, editor = {Kabanets, Valentine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.25}, URN = {urn:nbn:de:0030-drops-142990}, doi = {10.4230/LIPIcs.CCC.2021.25}, annote = {Keywords: Arithmetic Circuits, Division, Truncation, Division elimination, Rational function, Algebraic power series, Transcendental power series, Integer factorization} }
Published in: LIPIcs, Volume 157, 10th International Conference on Fun with Algorithms (FUN 2021) (2020)
Thomas Brocken, G. Wessel van der Heijden, Irina Kostitsyna, Lloyd E. Lo-Wong, and Remco J. A. Surtel. Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard. In 10th International Conference on Fun with Algorithms (FUN 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 157, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{brocken_et_al:LIPIcs.FUN.2021.15, author = {Brocken, Thomas and van der Heijden, G. Wessel and Kostitsyna, Irina and Lo-Wong, Lloyd E. and Surtel, Remco J. A.}, title = {{Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard}}, booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-145-0}, ISSN = {1868-8969}, year = {2020}, volume = {157}, editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.15}, URN = {urn:nbn:de:0030-drops-127769}, doi = {10.4230/LIPIcs.FUN.2021.15}, annote = {Keywords: Disc-robot motion planning, algorithmic complexity, PSPACE-hard} }
Published in: OASIcs, Volume 81, First International Computer Programming Education Conference (ICPEC 2020)
Tiago Gasiba, Ulrike Lechner, Filip Rezabek, and Maria Pinto-Albuquerque. Cybersecurity Games for Secure Programming Education in the Industry: Gameplay Analysis. In First International Computer Programming Education Conference (ICPEC 2020). Open Access Series in Informatics (OASIcs), Volume 81, pp. 10:1-10:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gasiba_et_al:OASIcs.ICPEC.2020.10, author = {Gasiba, Tiago and Lechner, Ulrike and Rezabek, Filip and Pinto-Albuquerque, Maria}, title = {{Cybersecurity Games for Secure Programming Education in the Industry: Gameplay Analysis}}, booktitle = {First International Computer Programming Education Conference (ICPEC 2020)}, pages = {10:1--10:11}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-153-5}, ISSN = {2190-6807}, year = {2020}, volume = {81}, editor = {Queir\'{o}s, Ricardo and Portela, Filipe and Pinto, M\'{a}rio and Sim\~{o}es, Alberto}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2020.10}, URN = {urn:nbn:de:0030-drops-122977}, doi = {10.4230/OASIcs.ICPEC.2020.10}, annote = {Keywords: education, training, secure coding, industry, cybersecurity, capture-the-flag, game analysis, cybersecurity challenge} }
Published in: OASIcs, Volume 81, First International Computer Programming Education Conference (ICPEC 2020)
Tiago Gasiba, Ulrike Lechner, Jorge Cuellar, and Alae Zouitni. Ranking Secure Coding Guidelines for Software Developer Awareness Training in the Industry. In First International Computer Programming Education Conference (ICPEC 2020). Open Access Series in Informatics (OASIcs), Volume 81, pp. 11:1-11:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{gasiba_et_al:OASIcs.ICPEC.2020.11, author = {Gasiba, Tiago and Lechner, Ulrike and Cuellar, Jorge and Zouitni, Alae}, title = {{Ranking Secure Coding Guidelines for Software Developer Awareness Training in the Industry}}, booktitle = {First International Computer Programming Education Conference (ICPEC 2020)}, pages = {11:1--11:11}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-153-5}, ISSN = {2190-6807}, year = {2020}, volume = {81}, editor = {Queir\'{o}s, Ricardo and Portela, Filipe and Pinto, M\'{a}rio and Sim\~{o}es, Alberto}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2020.11}, URN = {urn:nbn:de:0030-drops-122988}, doi = {10.4230/OASIcs.ICPEC.2020.11}, annote = {Keywords: education, teaching, training, secure coding, industry, cybersecurity, capture-the-flag, game analysis, game design, cybersecurity challenge} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Md Lutfar Rahman and Thomas Watson. Complexity of Unordered CNF Games. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 9:1-9:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{rahman_et_al:LIPIcs.ISAAC.2018.9, author = {Rahman, Md Lutfar and Watson, Thomas}, title = {{Complexity of Unordered CNF Games}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {9:1--9:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.9}, URN = {urn:nbn:de:0030-drops-99574}, doi = {10.4230/LIPIcs.ISAAC.2018.9}, annote = {Keywords: CNF, Games, PSPACE-complete, SAT, Linear Time} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Annette M. C. Ficker, Thomas Erlebach, Matús Mihalák, and Frits C. R. Spieksma. Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 45:1-45:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ficker_et_al:LIPIcs.ISAAC.2018.45, author = {Ficker, Annette M. C. and Erlebach, Thomas and Mihal\'{a}k, Mat\'{u}s and Spieksma, Frits C. R.}, title = {{Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {45:1--45:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.45}, URN = {urn:nbn:de:0030-drops-99933}, doi = {10.4230/LIPIcs.ISAAC.2018.45}, annote = {Keywords: approximation algorithm, matching, clustering problem} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar, Joachim Spoerhase, and Alexander Wolff. Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 61:1-61:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chan_et_al:LIPIcs.ISAAC.2018.61, author = {Chan, Timothy M. and van Dijk, Thomas C. and Fleszar, Krzysztof and Spoerhase, Joachim and Wolff, Alexander}, title = {{Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {61:1--61:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.61}, URN = {urn:nbn:de:0030-drops-100094}, doi = {10.4230/LIPIcs.ISAAC.2018.61}, annote = {Keywords: Geometric optimization, NP-hard, approximation, shallow-cell complexity, line stabbing} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Kelin Luo, Thomas Erlebach, and Yinfeng Xu. Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 64:1-64:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{luo_et_al:LIPIcs.ISAAC.2018.64, author = {Luo, Kelin and Erlebach, Thomas and Xu, Yinfeng}, title = {{Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {64:1--64:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.64}, URN = {urn:nbn:de:0030-drops-100122}, doi = {10.4230/LIPIcs.ISAAC.2018.64}, annote = {Keywords: Car-sharing system, Competitive analysis, On-line scheduling} }
Published in: LIPIcs, Volume 36, 26th International Conference on Rewriting Techniques and Applications (RTA 2015)
Florian Frohn, Jürgen Giesl, Jera Hensel, Cornelius Aschermann, and Thomas Ströder. Inferring Lower Bounds for Runtime Complexity. In 26th International Conference on Rewriting Techniques and Applications (RTA 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 36, pp. 334-349, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{frohn_et_al:LIPIcs.RTA.2015.334, author = {Frohn, Florian and Giesl, J\"{u}rgen and Hensel, Jera and Aschermann, Cornelius and Str\"{o}der, Thomas}, title = {{Inferring Lower Bounds for Runtime Complexity}}, booktitle = {26th International Conference on Rewriting Techniques and Applications (RTA 2015)}, pages = {334--349}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-85-9}, ISSN = {1868-8969}, year = {2015}, volume = {36}, editor = {Fern\'{a}ndez, Maribel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2015.334}, URN = {urn:nbn:de:0030-drops-52068}, doi = {10.4230/LIPIcs.RTA.2015.334}, annote = {Keywords: Term Rewriting, Runtime Complexity, Lower Bounds, Induction} }
Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Sungjin Im, Maxim Sviridenko, and Ruben van der Zwaan. Preemptive and Non-Preemptive Generalized Min Sum Set Cover. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 465-476, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{im_et_al:LIPIcs.STACS.2012.465, author = {Im, Sungjin and Sviridenko, Maxim and van der Zwaan, Ruben}, title = {{Preemptive and Non-Preemptive Generalized Min Sum Set Cover}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {465--476}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.465}, URN = {urn:nbn:de:0030-drops-33991}, doi = {10.4230/LIPIcs.STACS.2012.465}, annote = {Keywords: Set Cover, Approximation, Preemption, Latency, Average cover time} }
Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)
Lutz Schröder and Dirk Pattinson. Named Models in Coalgebraic Hybrid Logic. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 645-656, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{schroder_et_al:LIPIcs.STACS.2010.2492, author = {Schr\"{o}der, Lutz and Pattinson, Dirk}, title = {{Named Models in Coalgebraic Hybrid Logic}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {645--656}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-16-3}, ISSN = {1868-8969}, year = {2010}, volume = {5}, editor = {Marion, Jean-Yves and Schwentick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2492}, URN = {urn:nbn:de:0030-drops-24920}, doi = {10.4230/LIPIcs.STACS.2010.2492}, annote = {Keywords: Logic in computer science, semantics, deduction, modal logic, coalgebra} }
Published in: Dagstuhl Seminar Proceedings, Volume 9121, Normative Multi-Agent Systems (2009)
Thomas Agotnes, Wiebe van der Hoek, and Michael Wooldridge. Robust Normative Systems. In Normative Multi-Agent Systems. Dagstuhl Seminar Proceedings, Volume 9121, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{agotnes_et_al:DagSemProc.09121.27, author = {Agotnes, Thomas and van der Hoek, Wiebe and Wooldridge, Michael}, title = {{Robust Normative Systems}}, booktitle = {Normative Multi-Agent Systems}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9121}, editor = {Guido Boella and Pablo Noriega and Gabriella Pigozzi and Harko Verhagen}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09121.27}, URN = {urn:nbn:de:0030-drops-18971}, doi = {10.4230/DagSemProc.09121.27}, annote = {Keywords: Normative systems, robustness, fault tolerance, complexity} }
Published in: Dagstuhl Seminar Proceedings, Volume 7122, Normative Multi-agent Systems (2007)
Thomas Ågotnes, Wiebe van der Hoek, Juan A. Rodriguez-Aguilar, Carles Sierra, and Michael Wooldridge. On the Logic of Normative Systems. In Normative Multi-agent Systems. Dagstuhl Seminar Proceedings, Volume 7122, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{agotnes_et_al:DagSemProc.07122.24, author = {\r{A}gotnes, Thomas and van der Hoek, Wiebe and Rodriguez-Aguilar, Juan A. and Sierra, Carles and Wooldridge, Michael}, title = {{On the Logic of Normative Systems}}, booktitle = {Normative Multi-agent Systems}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7122}, editor = {Guido Boella and Leon van der Torre and Harko Verhagen}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07122.24}, URN = {urn:nbn:de:0030-drops-9210}, doi = {10.4230/DagSemProc.07122.24}, annote = {Keywords: Normative systems, normative temporal logic, deontic logic} }
Feedback for Dagstuhl Publishing