


default search action
Theoretical Computer Science, Volume 900
Volume 900, January 2022
- André Nies, Frank Stephan

:
Randomness and initial segment complexity for measures. 1-19 - Marina Moscarini:

Computing a metric basis of a bipartite distance-hereditary graph. 20-24 - Isabel Oitavem

:
The polynomial hierarchy of functions and its levels. 25-34 - Maumita Chakraborty, Ranjan Mehera, Rajat Kumar Pal:

Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph. 35-52 - Yuichi Asahiro, Jesper Jansson

, Eiji Miyano
, Hirotaka Ono
:
Upper and lower degree-constrained graph orientation with minimum penalty. 53-78 - Thomas Bläsius

, Tobias Friedrich, Martin Schirneck
:
The complexity of dependency detection and discovery in relational databases. 79-96 - Keita Emura, Shuichi Katsumata, Yohei Watanabe:

Identity-based encryption with security against the KGC: A formal model and its instantiations. 97-119

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














