Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs892.bht:"
@article{DBLP:journals/tcs/BensmailFI21, author = {Julien Bensmail and Foivos Fioravantes and Fionn Mc Inerney}, title = {On the role of 3s for the 1-2-3 Conjecture}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {238--257}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.023}, doi = {10.1016/J.TCS.2021.09.023}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BensmailFI21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CacicHI21, author = {Vedran Cacic and Marko Horvat and Zvonko Iljazovic}, title = {Computable subcontinua of semicomputable chainable Hausdorff continua}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {155--169}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.018}, doi = {10.1016/J.TCS.2021.09.018}, timestamp = {Wed, 03 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CacicHI21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FujiiSY21, author = {Kaito Fujii and Tasuku Soma and Yuichi Yoshida}, title = {Polynomial-time algorithms for submodular Laplacian systems}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {170--186}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.019}, doi = {10.1016/J.TCS.2021.09.019}, timestamp = {Wed, 15 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FujiiSY21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GoldbergLR21, author = {Leslie Ann Goldberg and John Lapinskas and David Richerby}, title = {Faster exponential-time algorithms for approximately counting independent sets}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {48--84}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.009}, doi = {10.1016/J.TCS.2021.09.009}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GoldbergLR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HaraT21, author = {Keisuke Hara and Keisuke Tanaka}, title = {Tightly secure ring signatures in the standard model}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {208--237}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.022}, doi = {10.1016/J.TCS.2021.09.022}, timestamp = {Wed, 03 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/HaraT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HongN21, author = {Seok{-}Hee Hong and Hiroshi Nagamochi}, title = {Re-embedding a 1-plane graph for a straight-line drawing in linear time}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {132--154}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.015}, doi = {10.1016/J.TCS.2021.09.015}, timestamp = {Thu, 27 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/HongN21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/JonssonLSU21, author = {Peter Jonsson and Victor Lagerkvist and Johannes Schmidt and Hannes Uppman}, title = {The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {1--24}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.006}, doi = {10.1016/J.TCS.2021.09.006}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/JonssonLSU21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/JurgensenS21, author = {Helmut J{\"{u}}rgensen and Ludwig Staiger}, title = {Automata for solid codes}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {25--47}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.007}, doi = {10.1016/J.TCS.2021.09.007}, timestamp = {Wed, 03 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/JurgensenS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LiB21, author = {Qinyi Li and Xavier Boyen}, title = {Efficient public-key encryption with equality test from lattices}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {85--107}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.010}, doi = {10.1016/J.TCS.2021.09.010}, timestamp = {Sat, 21 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/LiB21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/SantolayaCGRT21, author = {Fernando Santolaya and M{\'{o}}nica Caniup{\'{a}}n and Luis Gajardo and Miguel Romero and Rodrigo Torres{-}Avil{\'{e}}s}, title = {Efficient computation of spatial queries over points stored in \emph{k}\({}^{\mbox{2}}\)-tree compact data structures}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {108--131}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.012}, doi = {10.1016/J.TCS.2021.09.012}, timestamp = {Wed, 15 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/SantolayaCGRT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/XieZY21, author = {Sun Xie and Haixing Zhao and Jun Yin}, title = {Nonexistence of uniformly most reliable two-terminal graphs}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {279--288}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.025}, doi = {10.1016/J.TCS.2021.09.025}, timestamp = {Wed, 03 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/XieZY21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/YangLJLWZ21, author = {Yu Yang and Xiao{-}xiao Li and Meng{-}yuan Jin and Long Li and Hua Wang and Xiao{-}Dong Zhang}, title = {Enumeration of subtrees and BC-subtrees with maximum degree no more than \emph{k} in trees}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {258--278}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.024}, doi = {10.1016/J.TCS.2021.09.024}, timestamp = {Fri, 10 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/YangLJLWZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/YasumiOIT21, author = {Hiroto Yasumi and Fukuhito Ooshita and Michiko Inoue and S{\'{e}}bastien Tixeuil}, title = {Uniform bipartition in the population protocol model with arbitrary graphs}, journal = {Theor. Comput. Sci.}, volume = {892}, pages = {187--207}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2021.09.020}, doi = {10.1016/J.TCS.2021.09.020}, timestamp = {Tue, 12 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/YasumiOIT21.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.