io-port.net

io-port 06110704 Rombo, Simona E.

Extracting string motif bases for quorum higher than two. (English)

Theor. Comput. Sci. 460, 94-103 (2012).

1

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110702 Lee, Jia; Yang, Rui-Long; Morita, Kenichi

Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements. (English)

Theor. Comput. Sci. 460, 78-88 (2012).

2

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110701 Elbassioni, Khaled; Raman, Rajiv; Ray, Saurabh; Sitters, René

On the complexity of the highway problem. (English)

Theor. Comput. Sci. 460, 70-77 (2012).

3

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110699 Shachnai, Hadas; Tamir, Gal; Tamir, Tami

Minimal cost reconfiguration of data placement in a storage area network. (English)

Theor. Comput. Sci. 460, 42-53 (2012).

4

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110698 Wang, Shiying; Zhang, Guozhen; Feng, Kai

Fault tolerance in $k$-ary $n$-cube networks. (English)

Theor. Comput. Sci. 460, 34-41 (2012).

5

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110697 Lozin, Vadim V.; Mosca, Raffaele

Maximum regular induced subgraphs in $2P_3$-free graphs. (English)

Theor. Comput. Sci. 460, 26-33 (2012).

6

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110696 Dourado, Mitre C.; Penso, Lucia Draque; Rautenbach, Dieter; Szwarcfiter, Jayme L.

Reversible iterative graph processes. (English)

Theor. Comput. Sci. 460, 16-25 (2012).

7

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110695 Wang, Zhenbo; Cui, Zhenhua

Combination of parallel machine scheduling and vertex cover. (English)

Theor. Comput. Sci. 460, 10-15 (2012).

8

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110694 Downey, Rod; Ng, Keng Meng

Lowness for bounded randomness. (English)

Theor. Comput. Sci. 460, 1-9 (2012).

9

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110693 Zeng, Shengke; Jiang, Shaoquan; Qin, Zhiguang

An efficient conditionally anonymous ring signature in the random oracle model. (English)

Theor. Comput. Sci. 461, 106-114 (2012).

10

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110692 Yamakami, Tomoyuki

Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems. (English)

Theor. Comput. Sci. 461, 86-105 (2012).

11

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110691 Tian, Cong; Duan, Zhenhua; Zhang, Nan

An efficient approach for abstraction-refinement in model checking. (English)

Theor. Comput. Sci. 461, 76-85 (2012).

12

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110690 Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket

On parameterized independent feedback vertex set. (English)

Theor. Comput. Sci. 461, 65-75 (2012).

13

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110689 Messner, Jochen; Thierauf, Thomas

A Kolmogorov complexity proof of the Lovász local lemma for satisfiability. (English)

Theor. Comput. Sci. 461, 55-64 (2012).

14

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110688 Liu, Yunlong; Wang, Jianxin; Guo, Jiong; Chen, Jianer

Complexity and parameterized algorithms for cograph editing. (English)

Theor. Comput. Sci. 461, 45-54 (2012).

15

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110687 Jiang, Minghui; Zhang, Yong

Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy. (English)

Theor. Comput. Sci. 461, 27-44 (2012).

16

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110686 De Marco, Gianluca; Kranakis, Evangelos; Wiener, Gábor

Computing majority with triple queries. (English)

Theor. Comput. Sci. 461, 17-26 (2012).

17

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110685 Cai, Jin-Yi; Kowalczyk, Michael

Spin systems on $k$-regular graphs with complex edge functions. (English)

Theor. Comput. Sci. 461, 2-16 (2012).

18

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110684 Michael, Loizos

Evolvability via the Fourier transform. (English)

Theor. Comput. Sci. 462, 88-98 (2012).

19

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06110683 Miao, Cuixia; Zhang, Yuzhong; Wu, Cuilian

Scheduling of deteriorating jobs with release dates to minimize the maximum lateness. (English)

Theor. Comput. Sci. 462, 80-87 (2012).

20

PDF XML AMS-TeX TEXT BIBTeX DOI