Published in: LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
Pål Grønås Drange, Markus Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, and Somnath Sikdar. Kernelization and Sparseness: the Case of Dominating Set. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 31:1-31:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{drange_et_al:LIPIcs.STACS.2016.31, author = {Drange, P\r{a}l Gr{\o}n\r{a}s and Dregi, Markus and Fomin, Fedor V. and Kreutzer, Stephan and Lokshtanov, Daniel and Pilipczuk, Marcin and Pilipczuk, Michal and Reidl, Felix and S\'{a}nchez Villaamil, Fernando and Saurabh, Saket and Siebertz, Sebastian and Sikdar, Somnath}, title = {{Kernelization and Sparseness: the Case of Dominating Set}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {31:1--31:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.31}, URN = {urn:nbn:de:0030-drops-57327}, doi = {10.4230/LIPIcs.STACS.2016.31}, annote = {Keywords: kernelization, dominating set, bounded expansion, nowhere dense} }
Published in: Dagstuhl Seminar Proceedings, Volume 6081, Software Verification: Infinite-State Model Checking and Static Program Analysis (2006)
Jérôme Leroux and Grégoire Sutre. Flat counter automata almost everywhere!. In Software Verification: Infinite-State Model Checking and Static Program Analysis. Dagstuhl Seminar Proceedings, Volume 6081, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{leroux_et_al:DagSemProc.06081.4, author = {Leroux, J\'{e}r\^{o}me and Sutre, Gr\'{e}goire}, title = {{Flat counter automata almost everywhere!}}, booktitle = {Software Verification: Infinite-State Model Checking and Static Program Analysis}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6081}, editor = {Parosh Aziz Abdulla and Ahmed Bouajjani and Markus M\"{u}ller-Olm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06081.4}, URN = {urn:nbn:de:0030-drops-7297}, doi = {10.4230/DagSemProc.06081.4}, annote = {Keywords: Symbolic representation, Infinite state system, Acceleration, Meta-transition} }
Published in: Dagstuhl Seminar Proceedings, Volume 6081, Software Verification: Infinite-State Model Checking and Static Program Analysis (2006)
Dirk Beyer, Thomas A. Henzinger, and Grégory Théoduloz. Lazy Shape Analysis. In Software Verification: Infinite-State Model Checking and Static Program Analysis. Dagstuhl Seminar Proceedings, Volume 6081, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{beyer_et_al:DagSemProc.06081.5, author = {Beyer, Dirk and Henzinger, Thomas A. and Th\'{e}oduloz, Gr\'{e}gory}, title = {{Lazy Shape Analysis}}, booktitle = {Software Verification: Infinite-State Model Checking and Static Program Analysis}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6081}, editor = {Parosh Aziz Abdulla and Ahmed Bouajjani and Markus M\"{u}ller-Olm}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06081.5}, URN = {urn:nbn:de:0030-drops-7284}, doi = {10.4230/DagSemProc.06081.5}, annote = {Keywords: Software model checking, Shape analysis, Counterexample-guided abstraction refinement, Interpolation, Predicate abstraction} }
Published in: OASIcs, Volume 4, 6th International Workshop on Worst-Case Execution Time Analysis (WCET'06) (2006)
Raimund Kirner, Markus Grössing, and Peter Puschner. Comparing WCET and Resource Demands of Trigonometric Functions Implemented as Iterative Calculations vs. Table-Lookup. In 6th International Workshop on Worst-Case Execution Time Analysis (WCET'06). Open Access Series in Informatics (OASIcs), Volume 4, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{kirner_et_al:OASIcs.WCET.2006.669, author = {Kirner, Raimund and Gr\"{o}ssing, Markus and Puschner, Peter}, title = {{Comparing WCET and Resource Demands of Trigonometric Functions Implemented as Iterative Calculations vs. Table-Lookup}}, booktitle = {6th International Workshop on Worst-Case Execution Time Analysis (WCET'06)}, pages = {1--6}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-03-3}, ISSN = {2190-6807}, year = {2006}, volume = {4}, editor = {Mueller, Frank}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2006.669}, URN = {urn:nbn:de:0030-drops-6694}, doi = {10.4230/OASIcs.WCET.2006.669}, annote = {Keywords: Worst-case execution time, WCET analysis, table lookup, iterative computation, Taylor series, resource demands} }
Feedback for Dagstuhl Publishing