default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 936
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.
last updated on 2026-05-18 00:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
