Published in: LIPIcs, Volume 195, 6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021)
Jakob Grue Simonsen. The Expressive Power of One Variable Used Once: The Chomsky Hierarchy and First-Order Monadic Constructor Rewriting. In 6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 195, pp. 5:1-5:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{simonsen:LIPIcs.FSCD.2021.5, author = {Simonsen, Jakob Grue}, title = {{The Expressive Power of One Variable Used Once: The Chomsky Hierarchy and First-Order Monadic Constructor Rewriting}}, booktitle = {6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021)}, pages = {5:1--5:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-191-7}, ISSN = {1868-8969}, year = {2021}, volume = {195}, editor = {Kobayashi, Naoki}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2021.5}, URN = {urn:nbn:de:0030-drops-142439}, doi = {10.4230/LIPIcs.FSCD.2021.5}, annote = {Keywords: Constructor term rewriting, Chomsky Hierarchy, Implicit Complexity} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, and Christian Wulff-Nilsen. Near Optimal Adjacency Labeling Schemes for Power-Law Graphs. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 133:1-133:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{petersen_et_al:LIPIcs.ICALP.2016.133, author = {Petersen, Casper and Rotbart, Noy and Simonsen, Jakob Grue and Wulff-Nilsen, Christian}, title = {{Near Optimal Adjacency Labeling Schemes for Power-Law Graphs}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {133:1--133:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.133}, URN = {urn:nbn:de:0030-drops-62684}, doi = {10.4230/LIPIcs.ICALP.2016.133}, annote = {Keywords: Labeling schemes, Power-law graphs} }
Published in: LIPIcs, Volume 52, 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)
Cynthia Kop and Jakob Grue Simonsen. Complexity Hierarchies and Higher-Order Cons-Free Rewriting. In 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 52, pp. 23:1-23:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{kop_et_al:LIPIcs.FSCD.2016.23, author = {Kop, Cynthia and Grue Simonsen, Jakob}, title = {{Complexity Hierarchies and Higher-Order Cons-Free Rewriting}}, booktitle = {1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-010-1}, ISSN = {1868-8969}, year = {2016}, volume = {52}, editor = {Kesner, Delia and Pientka, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.23}, URN = {urn:nbn:de:0030-drops-59972}, doi = {10.4230/LIPIcs.FSCD.2016.23}, annote = {Keywords: higher-order term rewriting, implicit complexity, cons-freeness, ETIME hierarchy} }
Published in: LIPIcs, Volume 15, 23rd International Conference on Rewriting Techniques and Applications (RTA'12) (2012)
Soren Bjerg Andersen and Jakob Grue Simonsen. Term Rewriting Systems as Topological Dynamical Systems. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 53-68, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{andersen_et_al:LIPIcs.RTA.2012.53, author = {Andersen, Soren Bjerg and Simonsen, Jakob Grue}, title = {{Term Rewriting Systems as Topological Dynamical Systems}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {53--68}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.53}, URN = {urn:nbn:de:0030-drops-34841}, doi = {10.4230/LIPIcs.RTA.2012.53}, annote = {Keywords: Term rewriting, dynamical systems, topology, symbolic dynamics} }
Published in: LIPIcs, Volume 12, Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL (2011)
Andreas Schnabl and Jakob Grue Simonsen. The Exact Hardness of Deciding Derivational and Runtime Complexity. In Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 12, pp. 481-495, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{schnabl_et_al:LIPIcs.CSL.2011.481, author = {Schnabl, Andreas and Simonsen, Jakob Grue}, title = {{The Exact Hardness of Deciding Derivational and Runtime Complexity}}, booktitle = {Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL}, pages = {481--495}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-32-3}, ISSN = {1868-8969}, year = {2011}, volume = {12}, editor = {Bezem, Marc}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2011.481}, URN = {urn:nbn:de:0030-drops-32516}, doi = {10.4230/LIPIcs.CSL.2011.481}, annote = {Keywords: term rewriting, derivational complexity, arithmetical hierarchy} }
Published in: LIPIcs, Volume 10, 22nd International Conference on Rewriting Techniques and Applications (RTA'11) (2011)
Niels Bjørn Bugge Grathwohl, Jeroen Ketema, Jens Duelund Pallesen, and Jakob Grue Simonsen. Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus. In 22nd International Conference on Rewriting Techniques and Applications (RTA'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 10, pp. 61-70, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{grathwohl_et_al:LIPIcs.RTA.2011.61, author = {Grathwohl, Niels Bj{\o}rn Bugge and Ketema, Jeroen and Pallesen, Jens Duelund and Simonsen, Jakob Grue}, title = {{Anagopos: A Reduction Graph Visualizer for Term Rewriting and Lambda Calculus}}, booktitle = {22nd International Conference on Rewriting Techniques and Applications (RTA'11)}, pages = {61--70}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-30-9}, ISSN = {1868-8969}, year = {2011}, volume = {10}, editor = {Schmidt-Schauss, Manfred}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.61}, URN = {urn:nbn:de:0030-drops-31286}, doi = {10.4230/LIPIcs.RTA.2011.61}, annote = {Keywords: term rewriting, lambda calculus, reduction graphs, visualization} }
Published in: LIPIcs, Volume 6, Proceedings of the 21st International Conference on Rewriting Techniques and Applications (2010)
Claus Appel, Vincent van Oostrom, and Jakob Grue Simonsen. Higher-Order (Non-)Modularity. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Leibniz International Proceedings in Informatics (LIPIcs), Volume 6, pp. 17-32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{appel_et_al:LIPIcs.RTA.2010.17, author = {Appel, Claus and van Oostrom, Vincent and Simonsen, Jakob Grue}, title = {{Higher-Order (Non-)Modularity}}, booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications}, pages = {17--32}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-18-7}, ISSN = {1868-8969}, year = {2010}, volume = {6}, editor = {Lynch, Christopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.17}, URN = {urn:nbn:de:0030-drops-26427}, doi = {10.4230/LIPIcs.RTA.2010.17}, annote = {Keywords: Higher-order rewriting, modularity, termination, normalization} }
Published in: LIPIcs, Volume 6, Proceedings of the 21st International Conference on Rewriting Techniques and Applications (2010)
Jakob Grue Simonsen. Weak Convergence and Uniform Normalization in Infinitary Rewriting. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Leibniz International Proceedings in Informatics (LIPIcs), Volume 6, pp. 311-324, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{simonsen:LIPIcs.RTA.2010.311, author = {Simonsen, Jakob Grue}, title = {{Weak Convergence and Uniform Normalization in Infinitary Rewriting}}, booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications}, pages = {311--324}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-18-7}, ISSN = {1868-8969}, year = {2010}, volume = {6}, editor = {Lynch, Christopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.311}, URN = {urn:nbn:de:0030-drops-26609}, doi = {10.4230/LIPIcs.RTA.2010.311}, annote = {Keywords: Infinitary rewriting, weak convergence, uniform normalization} }