Search dblp for Publications

export results for "toc:db/journals/tcs/tcs664.bht:"

 download as .bib file

@article{DBLP:journals/tcs/AdamoGLL17,
  author       = {Alessandro Adamo and
                  Giuliano Grossi and
                  Raffaella Lanzarotti and
                  Jianyi Lin},
  title        = {Sparse decomposition by iterating Lipschitzian-type mappings},
  journal      = {Theor. Comput. Sci.},
  volume       = {664},
  pages        = {12--28},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2016.04.025},
  doi          = {10.1016/J.TCS.2016.04.025},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/AdamoGLL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BarcucciBBP17a,
  author       = {Elena Barcucci and
                  Antonio Bernini and
                  Stefano Bilotta and
                  Renzo Pinzani},
  title        = {Cross-bifix-free sets in two dimensions},
  journal      = {Theor. Comput. Sci.},
  volume       = {664},
  pages        = {29--38},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2015.08.032},
  doi          = {10.1016/J.TCS.2015.08.032},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BarcucciBBP17a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BianchiMP17,
  author       = {Maria Paola Bianchi and
                  Carlo Mereghetti and
                  Beatrice Palano},
  title        = {Quantum finite automata: Advances on Bertoni's ideas},
  journal      = {Theor. Comput. Sci.},
  volume       = {664},
  pages        = {39--53},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2016.01.045},
  doi          = {10.1016/J.TCS.2016.01.045},
  timestamp    = {Mon, 06 Nov 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BianchiMP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BrocchiCM17,
  author       = {Stefano Brocchi and
                  Giusi Castiglione and
                  Paolo Massazza},
  title        = {On the exhaustive generation of k-convex polyominoes},
  journal      = {Theor. Comput. Sci.},
  volume       = {664},
  pages        = {54--66},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2016.02.006},
  doi          = {10.1016/J.TCS.2016.02.006},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BrocchiCM17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CampadelliGP17,
  author       = {Paola Campadelli and
                  Massimiliano Goldwurm and
                  Giovanni Pighizzini},
  title        = {Alberto Bertoni: {A} scientist and a friend},
  journal      = {Theor. Comput. Sci.},
  volume       = {664},
  pages        = {2--11},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2017.01.002},
  doi          = {10.1016/J.TCS.2017.01.002},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/CampadelliGP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CampadelliPG17,
  author       = {Paola Campadelli and
                  Giovanni Pighizzini and
                  Massimiliano Goldwurm},
  title        = {Preface},
  journal      = {Theor. Comput. Sci.},
  volume       = {664},
  pages        = {1},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2017.01.001},
  doi          = {10.1016/J.TCS.2017.01.001},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/CampadelliPG17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CarpiD17,
  author       = {Arturo Carpi and
                  Flavio D'Alessandro},
  title        = {On incomplete and synchronizing finite sets},
  journal      = {Theor. Comput. Sci.},
  volume       = {664},
  pages        = {67--77},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2015.08.042},
  doi          = {10.1016/J.TCS.2015.08.042},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/CarpiD17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Choffrut17a,
  author       = {Christian Choffrut},
  title        = {An Hadamard operation on rational relations},
  journal      = {Theor. Comput. Sci.},
  volume       = {664},
  pages        = {78--90},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2015.10.042},
  doi          = {10.1016/J.TCS.2015.10.042},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Choffrut17a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Crespi-Reghizzi17a,
  author       = {Stefano Crespi{-}Reghizzi and
                  Pierluigi {San Pietro}},
  title        = {Counter machines, Petri Nets, and consensual computation},
  journal      = {Theor. Comput. Sci.},
  volume       = {664},
  pages        = {91--116},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2015.12.004},
  doi          = {10.1016/J.TCS.2015.12.004},
  timestamp    = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Crespi-Reghizzi17a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DennunzioFMMP17,
  author       = {Alberto Dennunzio and
                  Enrico Formenti and
                  Luca Manzoni and
                  Giancarlo Mauri and
                  Antonio E. Porreca},
  title        = {Computational complexity of finite asynchronous cellular automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {664},
  pages        = {131--143},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2015.12.003},
  doi          = {10.1016/J.TCS.2015.12.003},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/DennunzioFMMP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FeliceMR17,
  author       = {Clelia De Felice and
                  Sabrina Mantaci and
                  Antonio Restivo},
  title        = {On the decomposition of prefix codes},
  journal      = {Theor. Comput. Sci.},
  volume       = {664},
  pages        = {117--130},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2015.12.002},
  doi          = {10.1016/J.TCS.2015.12.002},
  timestamp    = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/FeliceMR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/SabadiniSW17,
  author       = {Nicoletta Sabadini and
                  Filippo Schiavio and
                  Robert F. C. Walters},
  title        = {On the geometry and algebra of networks with state},
  journal      = {Theor. Comput. Sci.},
  volume       = {664},
  pages        = {144--163},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.tcs.2016.01.028},
  doi          = {10.1016/J.TCS.2016.01.028},
  timestamp    = {Sat, 02 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/SabadiniSW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.