Theoretical Computer Science, Volume 936 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Theoretical Computer Science

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 936, November 2022

• 
  • 
  • 
  • 
  • 
    Rajendra Kumar Sharma, Prasanna Raghaw Mishra, Yogesh Kumar, Nupur Gupta:
    Differential _δ_-uniformity and non-linearity of permutations over Zn. 1-12
• 
  • 
  • 
  • 
  • 
    Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
    Colored cut games. 13-32
• 
  • 
  • 
  • 
  • 
    Felicia Lucke, Daniël Paulusma, Bernard Ries:
    On the complexity of matching cut for graphs of bounded radius and _H_-free graphs. 33-42
• 
  • 
  • 
  • 
  • 
    Zhao Jin, Bowen Zhang, Tianyue Cao, Yongzhi Cao, Hanpin Wang:
    Reasoning about block-based cloud storage systems via separation logic. 43-76
• 
  • 
  • 
  • 
  • 
    Matthew Connor, Othon Michail, Igor Potapov:
    Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach. 77-91
• 
  • 
  • 
  • 
  • 
    Justin Cai, Rafael M. Frongillo:
    Computational complexity of problems for deterministic presentations of sofic shifts. 92-115
• 
  • 
  • 
  • 
  • 
    Robert Scheffler:
    On the recognition of search trees generated by BFS and DFS. 116-128
• 
  • 
  • 
  • 
  • 
    Patrizio Angelini, Michael A. Bekos, Philipp Kindermann, Tamara Mchedlidze:
    On mixed linear layouts of series-parallel graphs. 129-138
• 
  • 
  • 
  • 
  • 
    Shaojie Tang:
    Beyond pointwise submodularity: Non-monotone adaptive submodular maximization subject to knapsack and _k_-system constraints. 139-147
• 
  • 
  • 
  • 
  • 
    Ran Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu:
    Smallest number of vertices in a 2-arc-strong digraph without good pairs. 148-171
• 
  • 
  • 
  • 
  • 
    Xiao-Tao Lü, Jin Chen, Zhi-Xiong Wen:
    On the 2-abelian complexity of generalized Cantor sequences. 172-183

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.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: