default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 652
Volume 652, November 2016
- Qian Cao, Zhaohui Liu
:
Semi-online scheduling with bounded job sizes on two uniform machines. 1-17 - Kai He, Jian Weng, Robert H. Deng, Joseph K. Liu:
On the security of two identity-based conditional proxy re-encryption schemes. 18-27 - Kung-Jui Pai, Jou-Ming Chang:
Constructing two completely independent spanning trees in hypercube-variant networks. 28-37 - T. Karthick:
Structure of squares and efficient domination in graph classes. 38-46 - Paul C. Bell, Shang Chen, Lisa M. Jackson:
On the decidability and complexity of problems for restricted hierarchical hybrid systems. 47-63 - Harry J. Altman:
Integer complexity: Representing numbers of bounded defect. 64-85 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Exact and approximate algorithms for movement problems on (special classes of) graphs. 86-101 - Daniel Berend, Aryeh Kontorovich:
The state complexity of random DFAs. 102-108
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-07-01 01:20 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:
