Published in: LIPIcs, Volume 202, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Michael Kaminski and Igor E. Shparlinski. Sets of Linear Forms Which Are Hard to Compute. In 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 202, pp. 66:1-66:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{kaminski_et_al:LIPIcs.MFCS.2021.66, author = {Kaminski, Michael and Shparlinski, Igor E.}, title = {{Sets of Linear Forms Which Are Hard to Compute}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {66:1--66:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-201-3}, ISSN = {1868-8969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.66}, URN = {urn:nbn:de:0030-drops-145065}, doi = {10.4230/LIPIcs.MFCS.2021.66}, annote = {Keywords: Linear algorithms, additive complexity, effective Perron theorem, effective Lindemann-Weierstrass theorem} }
Published in: LIPIcs, Volume 186, 24th International Conference on Database Theory (ICDT 2021)
Liat Peterfreund. Grammars for Document Spanners. In 24th International Conference on Database Theory (ICDT 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 186, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{peterfreund:LIPIcs.ICDT.2021.7, author = {Peterfreund, Liat}, title = {{Grammars for Document Spanners}}, booktitle = {24th International Conference on Database Theory (ICDT 2021)}, pages = {7:1--7:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-179-5}, ISSN = {1868-8969}, year = {2021}, volume = {186}, editor = {Yi, Ke and Wei, Zhewei}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2021.7}, URN = {urn:nbn:de:0030-drops-137154}, doi = {10.4230/LIPIcs.ICDT.2021.7}, annote = {Keywords: Information Extraction, Document Spanners, Context-Free Grammars, Constant-Delay Enumeration, Regular Expressions, Pushdown Automata} }
Published in: LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
Orna Kupferman and Ofer Leshkowitz. On Repetition Languages. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 170, pp. 59:1-59:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kupferman_et_al:LIPIcs.MFCS.2020.59, author = {Kupferman, Orna and Leshkowitz, Ofer}, title = {{On Repetition Languages}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {59:1--59:14}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.59}, URN = {urn:nbn:de:0030-drops-127268}, doi = {10.4230/LIPIcs.MFCS.2020.59}, annote = {Keywords: B\"{u}chi automata, Expressive power, Succinctness} }
Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)
Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub. Multi-Criteria Optimization in Answer Set Programming. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{gebser_et_al:LIPIcs.ICLP.2011.1, author = {Gebser, Martin and Kaminski, Roland and Kaufmann, Benjamin and Schaub, Torsten}, title = {{Multi-Criteria Optimization in Answer Set Programming}}, booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)}, pages = {1--10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-31-6}, ISSN = {1868-8969}, year = {2011}, volume = {11}, editor = {Gallagher, John P. and Gelfond, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.1}, URN = {urn:nbn:de:0030-drops-31617}, doi = {10.4230/LIPIcs.ICLP.2011.1}, annote = {Keywords: Answer Set Programming, Multi-Criteria Optimization, Linux Package Configuration} }
Feedback for Dagstuhl Publishing