default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 460
Volume 460, November 2012
- Rod Downey, Keng Meng Ng
:
Lowness for bounded randomness. 1-9 - Zhenbo Wang, Zhenhua Cui:
Combination of parallel machine scheduling and vertex cover. 10-15 - Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Reversible iterative graph processes. 16-25 - Vadim V. Lozin, Raffaele Mosca:
Maximum regular induced subgraphs in 2 P3-free graphs. 26-33 - Shiying Wang, Guozhen Zhang, Kai Feng:
Fault tolerance in k-ary n-cube networks. 34-41 - Hadas Shachnai, Gal Tamir, Tami Tamir:
Minimal cost reconfiguration of data placement in a storage area network. 42-53 - Yongcheng Wu:
Computability on random events and variables in a computable probability space. 54-69 - Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters:
On the complexity of the highway problem. 70-77 - Jia Lee, Rui-Long Yang, Kenichi Morita:
Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements. 78-88
- Zhivko Nedev:
Lower bound for balanced sets. 89-93 - Simona E. Rombo:
Extracting string motif bases for quorum higher than two. 94-103
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 2025-12-09 23:25 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:
