default search action
Search dblp for Publications
export results for "toc:db/journals/jcss/jcss106.bht:"
@article{DBLP:journals/jcss/FarrugiaGKP19, author = {Ashley Farrugia and Leszek Gasieniec and Lukasz Kuszner and Eduardo Pacheco}, title = {Deterministic rendezvous with different maps}, journal = {J. Comput. Syst. Sci.}, volume = {106}, pages = {49--59}, year = {2019}, url = {https://doi.org/10.1016/j.jcss.2019.06.001}, doi = {10.1016/J.JCSS.2019.06.001}, timestamp = {Tue, 20 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/FarrugiaGKP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FiliotMR19, author = {Emmanuel Filiot and Nicolas Mazzocchi and Jean{-}Fran{\c{c}}ois Raskin}, title = {Decidable weighted expressions with Presburger combinators}, journal = {J. Comput. Syst. Sci.}, volume = {106}, pages = {1--22}, year = {2019}, url = {https://doi.org/10.1016/j.jcss.2019.05.005}, doi = {10.1016/J.JCSS.2019.05.005}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/FiliotMR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/FluschnikKNS19, author = {Till Fluschnik and Stefan Kratsch and Rolf Niedermeier and Manuel Sorge}, title = {The parameterized complexity of the minimum shared edges problem}, journal = {J. Comput. Syst. Sci.}, volume = {106}, pages = {23--48}, year = {2019}, url = {https://doi.org/10.1016/j.jcss.2018.12.002}, doi = {10.1016/J.JCSS.2018.12.002}, timestamp = {Tue, 20 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/FluschnikKNS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/GaspersHP19, author = {Serge Gaspers and Shenwei Huang and Dani{\"{e}}l Paulusma}, title = {Colouring square-free graphs without long induced paths}, journal = {J. Comput. Syst. Sci.}, volume = {106}, pages = {60--79}, year = {2019}, url = {https://doi.org/10.1016/j.jcss.2019.06.002}, doi = {10.1016/J.JCSS.2019.06.002}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/GaspersHP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/KosowskiP19, author = {Adrian Kosowski and Dominik Pajak}, title = {Does adding more agents make a difference? {A} case study of cover time for the rotor-router}, journal = {J. Comput. Syst. Sci.}, volume = {106}, pages = {80--93}, year = {2019}, url = {https://doi.org/10.1016/j.jcss.2019.07.001}, doi = {10.1016/J.JCSS.2019.07.001}, timestamp = {Tue, 20 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/KosowskiP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/KoyanoHA19, author = {Hitoshi Koyano and Morihiro Hayashida and Tatsuya Akutsu}, title = {Optimal string clustering based on a Laplace-like mixture and {EM} algorithm on a set of strings}, journal = {J. Comput. Syst. Sci.}, volume = {106}, pages = {94--128}, year = {2019}, url = {https://doi.org/10.1016/j.jcss.2019.07.003}, doi = {10.1016/J.JCSS.2019.07.003}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/KoyanoHA19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcss/LiskiewiczLR19, author = {Maciej Liskiewicz and Matthias Lutter and R{\"{u}}diger Reischuk}, title = {Proper learning of \emph{k}-term {DNF} formulas from satisfying assignments}, journal = {J. Comput. Syst. Sci.}, volume = {106}, pages = {129--144}, year = {2019}, url = {https://doi.org/10.1016/j.jcss.2019.07.004}, doi = {10.1016/J.JCSS.2019.07.004}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcss/LiskiewiczLR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.