


default search action
Theoretical Computer Science, Volume 618
Volume 618, March 2016
- Yingjie Xia, Xuejiao Liu, Fubiao Xia, Guilin Wang:

A reduction of security notions in designated confirmer signatures. 1-20 - Limei Lin

, Li Xu, Shuming Zhou:
Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model. 21-29 - Haibin Zhu

, Dongning Liu
, Siqin Zhang, Yu Zhu, Luyao Teng, Shaohua Teng
:
Solving the Many to Many assignment problem by improving the Kuhn-Munkres algorithm with backtracking. 30-41 - Markus L. Schmid:

Computing equality-free and repetitive string factorisations. 42-51 - Alexander Okhotin

:
Input-driven languages are linear conjunctive. 52-71 - Simone Bova, Robert Ganian, Stefan Szeider

:
Quantified conjunctive queries on partially ordered sets. 72-84 - Nabila Abdessaied, Matthew Amy, Rolf Drechsler

, Mathias Soeken:
Complexity of reversible circuits and their quantum implementations. 85-106 - Lhouari Nourine, Jean-Marc Petit

:
Extended dualization: Application to maximal pattern mining. 107-121 - Hélio B. Macêdo Filho

, Raphael C. S. Machado, Celina M. H. de Figueiredo
:
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3. 122-134
- Patrick Chisan Hew:

Working in binary protects the repetends of 1/3h: Comment on Colussi's 'The convergence classes of Collatz function'. 135-141

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














