default search action
Theoretical Computer Science, Volume 855
Volume 855, February 2021
- Christos Kaklamanis, Panagiotis Kanellopoulos, Konstantinos Papaioannou, Dimitris Patouchas:
On the price of stability of some simple graph-based hedonic games. 1-15 - Shujiao Cao, Rui Xue:
Being a permutation is also orthogonal to one-wayness in quantum world: Impossibilities of quantum one-way permutations from one-wayness primitives. 16-42 - Svenja Huntemann, Richard J. Nowakowski, Carlos Pereira dos Santos:
Bounding game temperature using confusion intervals. 43-60 - Yan Li, Xin Zhang:
Equitable list tree-coloring of bounded treewidth graphs. 61-67 - Jianxin Wei:
Proof of a conjecture on 2-isometric words. 68-73 - Rong-Xia Hao, Zeng-Xian Tian:
The vertex-pancyclicity of data center networks. 74-89 - Vipin Ravindran Vijayalakshmi, Marc Schröder, Tami Tamir:
Scheduling games with machine-dependent priority lists. 90-103 - Chaya Ganesh, Bernardo Magri, Daniele Venturi:
Cryptographic reverse firewalls for interactive proof systems. 104-132 - Kengo Matsumoto:
Coded equivalence of one-sided topological Markov shifts. 133-140 - Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski:
Specification and space complexity of collaborative text editing. 141-160 - Frank Gurski, Dominique Komander, Carolin Rehs:
How to compute digraph width measures on directed co-graphs. 161-185
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.