Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 8 of 16663 results
Sort by: relevance publication year
Showing results for ISSN matching 0304-3975

The complexity of rerouting shortest paths

JOURNAL ARTICLE published October 2013 in Theoretical Computer Science

Research funded by DFG (BO 3391/1-1)

Authors: Paul Bonsma

https://doi.org/10.1016/j.tcs.2013.09.012 Actions

Power, positive closure, and quotients on convex languages

JOURNAL ARTICLE published May 2021 in Theoretical Computer Science

Research funded by Vedecká Grantová Agentúra MŠVVaŠ SR a SAV (2/0132/19,APVV-15-0091)

Authors: Michal Hospodár

https://doi.org/10.1016/j.tcs.2021.02.002 Actions

Hybrid fault diagnosis capability analysis of regular graphs

JOURNAL ARTICLE published February 2019 in Theoretical Computer Science

Research funded by National Natural Science Foundation of China (11571044,61373021)

Authors: Yulong Wei | Min Xu

https://doi.org/10.1016/j.tcs.2018.08.007 Actions

One-visibility cops and robber on trees

JOURNAL ARTICLE published September 2021 in Theoretical Computer Science

Research funded by Natural Sciences and Engineering Research Council of Canada (RGPIN-2018-06800)

Authors: Boting Yang | Tanzina Akter

https://doi.org/10.1016/j.tcs.2021.07.038 Actions

Reliability analysis of data center networks based on precise and imprecise diagnosis strategies

JOURNAL ARTICLE published February 2020 in Theoretical Computer Science

Authors: Xiaoyan Li | Xiaohua Jia | Jianxi Fan | Cheng-Kuan Lin

https://doi.org/10.1016/j.tcs.2019.12.006 Actions

Finite-memory automata

JOURNAL ARTICLE published November 1994 in Theoretical Computer Science

Authors: Michael Kaminski | Nissim Francez

https://doi.org/10.1016/0304-3975(94)90242-9 Actions

Block sensitivity of minterm-transitive functions

JOURNAL ARTICLE published September 2011 in Theoretical Computer Science

Authors: Andrew Drucker

https://doi.org/10.1016/j.tcs.2011.06.025 Actions

Conditional diagnosability of arrangement graphs under the PMC model

JOURNAL ARTICLE published September 2014 in Theoretical Computer Science

Research funded by National Natural Science Foundation of China (61072080) | Natural Science Foundation of Fujian Province (2013J01221,2013J01222,JA12073)

Authors: Limei Lin | Shuming Zhou | Li Xu | Dajin Wang

https://doi.org/10.1016/j.tcs.2014.06.041 Actions

An iteration method for computing the total number of spanning trees and its applications in graph theory

JOURNAL ARTICLE published January 2018 in Theoretical Computer Science

Research funded by National Natural Science Foundation of China (61163054,61662066,61363060)

Authors: Fei Ma | Bing Yao

https://doi.org/10.1016/j.tcs.2017.10.030 Actions

Clustering with respect to the information distance

JOURNAL ARTICLE published September 2022 in Theoretical Computer Science

Authors: Andrei Romashchenko

https://doi.org/10.1016/j.tcs.2022.06.039 Actions

Interaction-aware influence maximization and iterated sandwich method

JOURNAL ARTICLE published June 2020 in Theoretical Computer Science

Research funded by Natural Science Foundation of China (61672321,61771289,61832012,61373027,11871081)

Authors: Chuangen Gao | Shuyang Gu | Ruiqi Yang | Jiguo Yu | Weili Wu | Dachuan Xu

https://doi.org/10.1016/j.tcs.2020.03.016 Actions

Taming randomness and complexity – Essays in honour of Professor Péter Gács

JOURNAL ARTICLE published March 2023 in Theoretical Computer Science

Authors: Ilir Capuni | Jarkko Kari | Alexander Shen

https://doi.org/10.1016/j.tcs.2023.113776 Actions

The partial diagnosability of interconnection networks under the Hybrid PMC model

JOURNAL ARTICLE published May 2023 in Theoretical Computer Science

Authors: Jun Yuan | Shuyuan Ge | Aixia Liu

https://doi.org/10.1016/j.tcs.2023.113859 Actions

PPAD-complete approximate pure Nash equilibria in Lipschitz games

JOURNAL ARTICLE published November 2023 in Theoretical Computer Science

Authors: Paul W. Goldberg | Matthew Katzman

https://doi.org/10.1016/j.tcs.2023.114218 Actions

Quantitative estimates for the size of an intersection of sparse automatic sets

JOURNAL ARTICLE published October 2023 in Theoretical Computer Science

Research funded by Natural Sciences and Engineering Research Council of Canada (RGPIN-2018-03770,RGPIN-2022-02951)

Authors: Seda Albayrak | Jason P. Bell

https://doi.org/10.1016/j.tcs.2023.114144 Actions

Cellular automata and bootstrap percolation

JOURNAL ARTICLE published July 2022 in Theoretical Computer Science

Authors: Ville Salo | Guillaume Theyssier | Ilkka Törmä

https://doi.org/10.1016/j.tcs.2022.04.015 Actions

On balanced and abelian properties of circular words over a ternary alphabet

JOURNAL ARTICLE published January 2023 in Theoretical Computer Science

Authors: D.V. Bulgakova | N. Buzhinsky | Y.O. Goncharov

https://doi.org/10.1016/j.tcs.2022.10.027 Actions

Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model

JOURNAL ARTICLE published February 2023 in Theoretical Computer Science

Authors: Ashwin Ganesan

https://doi.org/10.1016/j.tcs.2023.113718 Actions

Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude)

JOURNAL ARTICLE published March 2023 in Theoretical Computer Science

Authors: Alastair A. Abbott | Cezar Câmpeanu | Ludwig Staiger | Marius Zimand | Arto Salomaa

https://doi.org/10.1016/j.tcs.2023.113819 Actions

Rapid left expansivity, a commonality between Wolfram's Rule 30 and powers of p/q

JOURNAL ARTICLE published February 2023 in Theoretical Computer Science

Research funded by Suomen Kulttuurirahasto (00210566)

Authors: Johan Kopra

https://doi.org/10.1016/j.tcs.2022.12.018 Actions
Feedback: support@crossref.org