Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/Bard19,
  author       = {Gregory V. Bard},
  title        = {Determining whether a given cryptographic function is a permutation
                  of another given cryptographic function - {A} problem in intellectual
                  property},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {3--14},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.010},
  doi          = {10.1016/J.TCS.2019.10.010},
  timestamp    = {Wed, 20 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Bard19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CaronLP19,
  author       = {Pascal Caron and
                  Jean{-}Gabriel Luque and
                  Bruno Patrou},
  title        = {State complexity of combined operations involving catenation and binary
                  Boolean operations: Beyond the Brzozowski conjectures},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {15--30},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.013},
  doi          = {10.1016/J.TCS.2019.10.013},
  timestamp    = {Sat, 21 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/CaronLP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ColbournDH19,
  author       = {Charles J. Colbourn and
                  Ryan E. Dougherty and
                  Daniel Horsley},
  title        = {Distributing hash families with few rows},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {31--41},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.014},
  doi          = {10.1016/J.TCS.2019.10.014},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ColbournDH19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DoukasMB19,
  author       = {Nikolaos Doukas and
                  Oleksandr P. Markovskyi and
                  Nikolaos G. Bardis},
  title        = {Hash function design for cloud storage data auditing},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {42--51},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.015},
  doi          = {10.1016/J.TCS.2019.10.015},
  timestamp    = {Wed, 20 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DoukasMB19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DrosteKR19,
  author       = {Manfred Droste and
                  Ilias S. Kotsireas and
                  Robert Rolland},
  title        = {Preface},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {1--2},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.009},
  doi          = {10.1016/J.TCS.2019.10.009},
  timestamp    = {Tue, 12 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/DrosteKR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DuchampMN19,
  author       = {G{\'{e}}rard H. E. Duchamp and
                  Vincel Hoang Ngoc Minh and
                  Quoc Hoan Ng{\^{o}}},
  title        = {Kleene stars of the plane, polylogarithms and symmetries},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {52--72},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.016},
  doi          = {10.1016/J.TCS.2019.10.016},
  timestamp    = {Wed, 20 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DuchampMN19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FotiadisK19,
  author       = {Georgios Fotiadis and
                  Elisavet Konstantinou},
  title        = {{TNFS} resistant families of pairing-friendly elliptic curves},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {73--89},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.017},
  doi          = {10.1016/J.TCS.2019.10.017},
  timestamp    = {Fri, 31 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FotiadisK19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KampelLGS19,
  author       = {Ludwig Kampel and
                  Manuel Leithner and
                  Bernhard Garn and
                  Dimitris E. Simos},
  title        = {Problems and algorithms for covering arrays via set covers},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {90--106},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.018},
  doi          = {10.1016/J.TCS.2019.10.018},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/KampelLGS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KampelS19,
  author       = {Ludwig Kampel and
                  Dimitris E. Simos},
  title        = {A survey on the state of the art of complexity problems for covering
                  arrays},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {107--124},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.019},
  doi          = {10.1016/J.TCS.2019.10.019},
  timestamp    = {Wed, 20 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KampelS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KlimaP19,
  author       = {Ondrej Kl{\'{\i}}ma and
                  Libor Pol{\'{a}}k},
  title        = {Syntactic structures of regular languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {125--141},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.020},
  doi          = {10.1016/J.TCS.2019.10.020},
  timestamp    = {Wed, 20 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KlimaP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Lisonek19,
  author       = {Petr Lisonek},
  title        = {Kochen-Specker sets and Hadamard matrices},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {142--145},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.021},
  doi          = {10.1016/J.TCS.2019.10.021},
  timestamp    = {Wed, 20 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Lisonek19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MouraRS19,
  author       = {Lucia Moura and
                  Sebastian Raaphorst and
                  Brett Stevens},
  title        = {Upper bounds on the sizes of variable strength covering arrays using
                  the Lov{\'{a}}sz local lemma},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {146--154},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.022},
  doi          = {10.1016/J.TCS.2019.10.022},
  timestamp    = {Wed, 20 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MouraRS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/PinS19,
  author       = {Jean{-}{\'{E}}ric Pin and
                  Xaro Soler{-}Escriv{\`{a}}},
  title        = {Languages and formations generated by \emph{D}\({}_{\mbox{4}}\) and
                  \emph{Q}\({}_{\mbox{8}}\)},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {155--172},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.023},
  doi          = {10.1016/J.TCS.2019.10.023},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/PinS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/SakkalisKS19,
  author       = {Takis Sakkalis and
                  Kwanghee Ko and
                  Galam Song},
  title        = {Roots of quaternion polynomials: Theory and computation},
  journal      = {Theor. Comput. Sci.},
  volume       = {800},
  pages        = {173--178},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.10.024},
  doi          = {10.1016/J.TCS.2019.10.024},
  timestamp    = {Wed, 20 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/SakkalisKS19.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.