default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 580
Volume 580, May 2015
- Clémentine Gritti
, Willy Susilo, Thomas Plantard, Khin Than Win:
Privacy-preserving encryption scheme using DNA parentage test. 1-13 - Johannes Müller, Hengrui Jiang:
Graphical limit sets for general cellular automata. 14-27 - Fang Xie, Zhe Xu, Yuzhong Zhang, Qingguo Bai:
Scheduling games on uniform machines with activation cost. 28-35 - Min Ji, Qinyun Yang, Danli Yao, T. C. E. Cheng:
Single-machine batch scheduling of linear deteriorating jobs. 36-49 - Yuehua Bu, Xu Dong Bao:
Backbone coloring of planar graphs for C8-free or C9-free. 50-58 - Yu Yang, Hongbo Liu, Hua Wang, Scott Makeig:
Enumeration of BC-subtrees of trees. 59-74 - Peter Damaschke:
Finding and enumerating large intersections. 75-82 - Gabriel Istrate:
Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs. 83-93 - Gilad Braunschvig, Shiri Chechik, David Peleg, Adam Sealfon:
Fault tolerant additive and (μ, α)-spanners. 94-100 - Omid Amini, David Coudert, Nicolas Nisse:
Non-deterministic graph searching in trees. 101-121
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-10-18 19:30 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:
