default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 968
Volume 968, August 2023
- Sophie MacDonald
:
The road problem and homomorphisms of directed graphs. 113981 - Oliver A. S. Lyon, Kai Salomaa:
The nondeterministic state complexity of the site-directed deletion language operation. 113999 - Dominique Komander, Carolin Rehs:
Twin-distance-hereditary digraphs. 114009 - Priyamvada, B. S. Panda:
Complexity and algorithms for injective edge coloring of graphs. 114010 - Michael Fuchs, Tsan-Cheng Yu:
Asymptotic normality for the size of graph tries built from M-ary tree labelings. 114011 - Vincenzo Botta, Ivan Visconti:
Doubly adaptive zero-knowledge proofs. 114014 - Hong Chang, Jing Jin, Zhicheng Liu, Ping Li, Xiaoyan Zhang:
Two-stage non-submodular maximization. 114017 - Kexin Xu, Benjamin Hong Meng Tan, Li-Ping Wang, Khin Mi Mi Aung, Huaxiong Wang:
Multi-key fully homomorphic encryption from NTRU and (R)LWE with faster bootstrapping. 114026
- Somnath Bera, Atulya K. Nagar, Sastha Sriram, K. G. Subramanian:
An array P system based on a new variant of pure 2D context-free grammars. 114027 - Yanyan Li, Bosheng Song, Xiangxiang Zeng:
Spiking neural P systems with weights and delays on synapses. 114028
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 2024-11-13 23:54 CET 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:
