Search dblp for Publications

export results for "toc:db/journals/jda/jda51.bht:"

 download as .bib file

@article{DBLP:journals/jda/BanksGHP18,
  author       = {Jacqueline Banks and
                  Scott Garrabrant and
                  Mark L. Huber and
                  Anne Perizzolo},
  title        = {Using {TPA} to count linear extensions},
  journal      = {J. Discrete Algorithms},
  volume       = {51},
  pages        = {1--11},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.jda.2018.04.001},
  doi          = {10.1016/J.JDA.2018.04.001},
  timestamp    = {Fri, 18 Jan 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/BanksGHP18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/CatalanoRF18,
  author       = {Dario Catalano and
                  Mario Di Raimondo and
                  Simone Faro},
  title        = {Verifiable pattern matching on outsourced texts},
  journal      = {J. Discrete Algorithms},
  volume       = {51},
  pages        = {39--50},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.jda.2018.08.002},
  doi          = {10.1016/J.JDA.2018.08.002},
  timestamp    = {Fri, 18 Jan 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/CatalanoRF18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HassineBRT18,
  author       = {Ghada Ben Hassine and
                  Pierre Berg{\'{e}} and
                  Arpad Rimmel and
                  Joanna Tomasik},
  title        = {A lower bound for weak Schur numbers with a deterministic algorithm},
  journal      = {J. Discrete Algorithms},
  volume       = {51},
  pages        = {12--25},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.jda.2018.10.002},
  doi          = {10.1016/J.JDA.2018.10.002},
  timestamp    = {Fri, 18 Jan 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/HassineBRT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/MhaskarS18,
  author       = {Neerja Mhaskar and
                  William F. Smyth},
  title        = {String covering with optimal covers},
  journal      = {J. Discrete Algorithms},
  volume       = {51},
  pages        = {26--38},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.jda.2018.09.003},
  doi          = {10.1016/J.JDA.2018.09.003},
  timestamp    = {Thu, 10 Jan 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/MhaskarS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics