Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/BerthomieuZ24,
  author       = {Bernard Berthomieu and
                  Dmitry A. Zaitsev},
  title        = {Sleptsov nets are Turing-complete},
  journal      = {Theor. Comput. Sci.},
  volume       = {986},
  pages        = {114346},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114346},
  doi          = {10.1016/J.TCS.2023.114346},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BerthomieuZ24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChanTX24,
  author       = {T.{-}H. Hubert Chan and
                  Zhihao Gavin Tang and
                  Quan Xue},
  title        = {Max-min greedy matching problem: Hardness for the adversary and fractional
                  variant},
  journal      = {Theor. Comput. Sci.},
  volume       = {986},
  pages        = {114329},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114329},
  doi          = {10.1016/J.TCS.2023.114329},
  timestamp    = {Sat, 10 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChanTX24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DvorakG24,
  author       = {Tom{\'{a}}s Dvor{\'{a}}k and
                  Mei{-}Mei Gu},
  title        = {Paired 2-disjoint path covers of burnt pancake graphs with faulty
                  elements},
  journal      = {Theor. Comput. Sci.},
  volume       = {986},
  pages        = {114327},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114327},
  doi          = {10.1016/J.TCS.2023.114327},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DvorakG24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Dvorakova24,
  author       = {L'ubom{\'{\i}}ra Dvor{\'{a}}kov{\'{a}}},
  title        = {String attractors of episturmian sequences},
  journal      = {Theor. Comput. Sci.},
  volume       = {986},
  pages        = {114341},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114341},
  doi          = {10.1016/J.TCS.2023.114341},
  timestamp    = {Sat, 10 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Dvorakova24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GerontitisMSK24,
  author       = {Dimitrios Gerontitis and
                  Changxin Mo and
                  Predrag S. Stanimirovic and
                  Vasilios N. Katsikis},
  title        = {Improved zeroing neural models based on two novel activation functions
                  with exponential behavior},
  journal      = {Theor. Comput. Sci.},
  volume       = {986},
  pages        = {114328},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114328},
  doi          = {10.1016/J.TCS.2023.114328},
  timestamp    = {Sat, 10 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GerontitisMSK24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Li24,
  author       = {Shuo Li},
  title        = {A note on the Lie complexity and beyond},
  journal      = {Theor. Comput. Sci.},
  volume       = {986},
  pages        = {114343},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114343},
  doi          = {10.1016/J.TCS.2023.114343},
  timestamp    = {Thu, 25 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Li24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LiuCWYF24,
  author       = {Xiaoqing Liu and
                  Baolei Cheng and
                  Yan Wang and
                  Jia Yu and
                  Jianxi Fan},
  title        = {Enhancing fault tolerance of balanced hypercube networks by the edge
                  partition method},
  journal      = {Theor. Comput. Sci.},
  volume       = {986},
  pages        = {114340},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114340},
  doi          = {10.1016/J.TCS.2023.114340},
  timestamp    = {Thu, 25 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LiuCWYF24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LuCWW24,
  author       = {Xiao{-}Tao L{\"{u}} and
                  Jin Chen and
                  Zhi{-}Xiong Wen and
                  Wen Wu},
  title        = {On the 2-binomial complexity of the generalized Thue-Morse words},
  journal      = {Theor. Comput. Sci.},
  volume       = {986},
  pages        = {114342},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114342},
  doi          = {10.1016/J.TCS.2023.114342},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LuCWW24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/TuCCW24,
  author       = {Binbin Tu and
                  Yu Chen and
                  Hongrui Cui and
                  Xianfang Wang},
  title        = {Fast two-party signature for upgrading {ECDSA} to two-party scenario
                  easily},
  journal      = {Theor. Comput. Sci.},
  volume       = {986},
  pages        = {114325},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114325},
  doi          = {10.1016/J.TCS.2023.114325},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/TuCCW24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Wang24,
  author       = {Yong Wang},
  title        = {Finding the edges in optimal Hamiltonian cycles based on frequency
                  quadrilaterals},
  journal      = {Theor. Comput. Sci.},
  volume       = {986},
  pages        = {114323},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114323},
  doi          = {10.1016/J.TCS.2023.114323},
  timestamp    = {Sat, 10 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Wang24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/YinLXL24,
  author       = {Wen Yin and
                  Jiarong Liang and
                  Yuhao Xie and
                  Changzhen Li},
  title        = {The \emph{t}/\emph{k}-diagnosability of \emph{m}-ary \emph{n}-cube
                  networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {986},
  pages        = {114345},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114345},
  doi          = {10.1016/J.TCS.2023.114345},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/YinLXL24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Zhang24a,
  author       = {Xiaojin Zhang},
  title        = {Improved algorithm for permutation testing},
  journal      = {Theor. Comput. Sci.},
  volume       = {986},
  pages        = {114316},
  year         = {2024},
  url          = {https://doi.org/10.1016/j.tcs.2023.114316},
  doi          = {10.1016/J.TCS.2023.114316},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Zhang24a.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.