Search dblp for Publications

export results for "toc:db/journals/jcss/jcss84.bht:"

 download as .bib file

@article{DBLP:journals/jcss/BrazdilCFK17,
  author       = {Tom{\'{a}}s Br{\'{a}}zdil and
                  Krishnendu Chatterjee and
                  Vojtech Forejt and
                  Anton{\'{\i}}n Kucera},
  title        = {Trading performance for stability in Markov decision processes},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {144--170},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.09.009},
  doi          = {10.1016/J.JCSS.2016.09.009},
  timestamp    = {Tue, 04 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/BrazdilCFK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/BundalaCCSZ17,
  author       = {Daniel Bundala and
                  Michael Codish and
                  Lu{\'{\i}}s Cruz{-}Filipe and
                  Peter Schneider{-}Kamp and
                  Jakub Z{\'{a}}vodn{\'{y}}},
  title        = {Optimal-depth sorting networks},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {185--204},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.09.004},
  doi          = {10.1016/J.JCSS.2016.09.004},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/BundalaCCSZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/CassaigneOT17,
  author       = {Julien Cassaigne and
                  Nicolas Ollinger and
                  Rodrigo Torres{-}Avil{\'{e}}s},
  title        = {A small minimal aperiodic reversible Turing machine},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {288--301},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.10.004},
  doi          = {10.1016/J.JCSS.2016.10.004},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/CassaigneOT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/Chang17,
  author       = {Ching{-}Lueh Chang},
  title        = {A lower bound for metric 1-median selection},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {44--51},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.08.004},
  doi          = {10.1016/J.JCSS.2016.08.004},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/Chang17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/Civril17,
  author       = {Ali {\c{C}}ivril},
  title        = {Sparse approximation is provably hard under coherent dictionaries},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {32--43},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.07.001},
  doi          = {10.1016/J.JCSS.2016.07.001},
  timestamp    = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/Civril17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/DayRS17,
  author       = {Joel D. Day and
                  Daniel Reidenbach and
                  Markus L. Schmid},
  title        = {Closure properties of pattern languages},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {11--31},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.07.003},
  doi          = {10.1016/J.JCSS.2016.07.003},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/DayRS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/EpsteinL17,
  author       = {Leah Epstein and
                  Asaf Levin},
  title        = {An {AFPTAS} for variable sized bin packing with general activation
                  costs},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {79--96},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.07.007},
  doi          = {10.1016/J.JCSS.2016.07.007},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/EpsteinL17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/EtscheidKMR17,
  author       = {Michael Etscheid and
                  Stefan Kratsch and
                  Matthias Mnich and
                  Heiko R{\"{o}}glin},
  title        = {Polynomial kernels for weighted problems},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {1--10},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.06.004},
  doi          = {10.1016/J.JCSS.2016.06.004},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/EtscheidKMR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/FeigenblatPS17,
  author       = {Guy Feigenblat and
                  Ely Porat and
                  Ariel Shiftan},
  title        = {d-k-min-wise independent family of hash functions},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {171--184},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.09.005},
  doi          = {10.1016/J.JCSS.2016.09.005},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/FeigenblatPS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/GajarskyHOORRVS17,
  author       = {Jakub Gajarsk{\'{y}} and
                  Petr Hlinen{\'{y}} and
                  Jan Obdrz{\'{a}}lek and
                  Sebastian Ordyniak and
                  Felix Reidl and
                  Peter Rossmanith and
                  Fernando S{\'{a}}nchez Villaamil and
                  Somnath Sikdar},
  title        = {Kernelization using structural parameters on sparse graph classes},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {219--242},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.09.002},
  doi          = {10.1016/J.JCSS.2016.09.002},
  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/GajarskyHOORRVS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/GutinJS17,
  author       = {Gregory Z. Gutin and
                  Mark Jones and
                  Bin Sheng},
  title        = {Parameterized complexity of the k-arc Chinese Postman Problem},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {107--119},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.07.006},
  doi          = {10.1016/J.JCSS.2016.07.006},
  timestamp    = {Wed, 22 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/GutinJS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/JonssonLNZ17,
  author       = {Peter Jonsson and
                  Victor Lagerkvist and
                  Gustav Nordh and
                  Bruno Zanuttini},
  title        = {Strong partial clones and the time complexity of {SAT} problems},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {52--78},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.07.008},
  doi          = {10.1016/J.JCSS.2016.07.008},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/JonssonLNZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/KariK17,
  author       = {Lila Kari and
                  Steffen Kopecki},
  title        = {Deciding whether a regular language is generated by a splicing system},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {263--287},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.10.001},
  doi          = {10.1016/J.JCSS.2016.10.001},
  timestamp    = {Sat, 20 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/KariK17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/KociumakaRR17,
  author       = {Tomasz Kociumaka and
                  Jakub Radoszewski and
                  Wojciech Rytter},
  title        = {Fast algorithms for Abelian periods in words and greatest common divisor
                  queries},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {205--218},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.09.003},
  doi          = {10.1016/J.JCSS.2016.09.003},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/KociumakaRR17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/PanolanPS17,
  author       = {Fahad Panolan and
                  Geevarghese Philip and
                  Saket Saurabh},
  title        = {On the parameterized complexity of b-chromatic number},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {120--131},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.09.012},
  doi          = {10.1016/J.JCSS.2016.09.012},
  timestamp    = {Fri, 27 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/PanolanPS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/Schewe17,
  author       = {Sven Schewe},
  title        = {Solving parity games in big steps},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {243--262},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.10.002},
  doi          = {10.1016/J.JCSS.2016.10.002},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/Schewe17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/Xiao17,
  author       = {Mingyu Xiao},
  title        = {On a generalization of Nemhauser and Trotter's local optimization
                  theorem},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {97--106},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.08.003},
  doi          = {10.1016/J.JCSS.2016.08.003},
  timestamp    = {Mon, 08 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/Xiao17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/Zakablukov17,
  author       = {Dmitry V. Zakablukov},
  title        = {On asymptotic gate complexity and depth of reversible circuits without
                  additional memory},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {84},
  pages        = {132--143},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.jcss.2016.09.010},
  doi          = {10.1016/J.JCSS.2016.09.010},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/Zakablukov17.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.