%0 Conference Paper %1 conf/fsttcs/Parys17 %A Parys, Pawel %B FSTTCS %D 2017 %E Lokam, Satya V. %E Ramanujam, R. %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 45:1-45:14 %T The Complexity of the Diagonal Problem for Recursion Schemes. %U http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2017.html#Parys17 %V 93 %@ 978-3-95977-055-2

@inproceedings{conf/fsttcs/Parys17, added-at = {2021-04-09T00:00:00.000+0200}, author = {Parys, Pawel}, biburl = {https://www.bibsonomy.org/bibtex/21d2e1d3ae3a6473a9265d8039b6da083/dblp}, booktitle = {FSTTCS}, crossref = {conf/fsttcs/2017}, editor = {Lokam, Satya V. and Ramanujam, R.}, ee = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.45}, interhash = {d35e864f5a4346be98e71956f8fc7034}, intrahash = {1d2e1d3ae3a6473a9265d8039b6da083}, isbn = {978-3-95977-055-2}, keywords = {dblp}, pages = {45:1-45:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-10T01:21:25.000+0200}, title = {The Complexity of the Diagonal Problem for Recursion Schemes.}, url = {http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2017.html#Parys17}, volume = 93, year = 2017 }