default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs962.bht:"
@article{DBLP:journals/tcs/ChengZGZC23, author = {Yunlong Cheng and Hao Zhou and Xiaofeng Gao and Jiaqi Zheng and Guihai Chen}, title = {Optimizing incremental {SDN} upgrades for load balancing in {ISP} networks}, journal = {Theor. Comput. Sci.}, volume = {962}, pages = {113927}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113927}, doi = {10.1016/J.TCS.2023.113927}, timestamp = {Wed, 22 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/ChengZGZC23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GargM23, author = {Jugal Garg and Aniket Murhekar}, title = {Computing fair and efficient allocations with few utility values}, journal = {Theor. Comput. Sci.}, volume = {962}, pages = {113932}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113932}, doi = {10.1016/J.TCS.2023.113932}, timestamp = {Thu, 15 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GargM23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GoldbergK23, author = {Paul W. Goldberg and Matthew J. Katzman}, title = {Lower bounds for the query complexity of equilibria in Lipschitz games}, journal = {Theor. Comput. Sci.}, volume = {962}, pages = {113931}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113931}, doi = {10.1016/J.TCS.2023.113931}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GoldbergK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/LangLZ23, author = {Rongling Lang and Hui Lei and Junxue Zhang}, title = {On the saturation spectrum of families of cycle subdivisions}, journal = {Theor. Comput. Sci.}, volume = {962}, pages = {113941}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113941}, doi = {10.1016/J.TCS.2023.113941}, timestamp = {Wed, 14 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/LangLZ23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/MonicaMS23, author = {Dario Della Monica and Angelo Montanari and Pietro Sala}, title = {An interval temporal logic characterization of extended \emph{{\(\omega\)}}-regular languages}, journal = {Theor. Comput. Sci.}, volume = {962}, pages = {113929}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113929}, doi = {10.1016/J.TCS.2023.113929}, timestamp = {Mon, 12 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/MonicaMS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ZhangYZZWX23, author = {Pingyuan Zhang and Haining Yang and Liang Zhu and Yanhua Zhang and Hao Wang and Qiuliang Xu}, title = {A new lattice-based online/offline signatures framework for low-power devices}, journal = {Theor. Comput. Sci.}, volume = {962}, pages = {113942}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113942}, doi = {10.1016/J.TCS.2023.113942}, timestamp = {Thu, 15 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ZhangYZZWX23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/ZhangZ23, author = {Meng Zhang and Yi Zhang}, title = {Arbitrary-size permutation networks using arbitrary-radix switches}, journal = {Theor. Comput. Sci.}, volume = {962}, pages = {113939}, year = {2023}, url = {https://doi.org/10.1016/j.tcs.2023.113939}, doi = {10.1016/J.TCS.2023.113939}, timestamp = {Wed, 07 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ZhangZ23.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.