io-port.net

io-port 06113713 Alistarh, Dan; Gilbert, Seth; Guerraoui, Rachid; Travers, Corentin

Generating fast indulgent algorithms. (English)

Theory Comput. Syst. 51, No. 4, 404-424 (2012).

1

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113712 Attiya, Hagit; Hillel, Eshcar

A single-version STM that is multi-versioned permissive. (English)

Theory Comput. Syst. 51, No. 4, 425-446 (2012).

2

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113711 Kalyanasundaram, Bala; Velauthapillai, Mahe

A near optimal periodic transmission schedule in bounded degree wireless sensor network. (English)

Theory Comput. Syst. 51, No. 4, 474-491 (2012).

3

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113710 Chakaravarthy, Venkatesan T.; Choudhury, Anamitra R.; Garg, Vijay K.; Sabharwal, Yogish

Efficient decentralized algorithms for the distributed trigger counting problem. (English)

Theory Comput. Syst. 51, No. 4, 447-473 (2012).

4

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113709 Allender, Eric; Spakowski, Holger

Avoiding simplicity is complex. (English)

Theory Comput. Syst. 51, No. 3, 282-296 (2012).

5

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113708 Bienvenu, Laurent; Stephan, Frank; Teutsch, Jason

How powerful are integer-valued martingales? (English)

Theory Comput. Syst. 51, No. 3, 330-351 (2012).

6

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113707 Santhanam, Rahul

The complexity of explicit constructions. (English)

Theory Comput. Syst. 51, No. 3, 297-312 (2012).

7

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113706 Lutz, Jack H.; Shutters, Brad

Approximate self-assembly of the Sierpinski triangle. (English)

Theory Comput. Syst. 51, No. 3, 372-400 (2012).

8

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113705 Cenzer, Douglas; Dashti, Ali; Toska, Ferit; Wyman, Sebastian

Computability of countable subshifts in one dimension. (English)

Theory Comput. Syst. 51, No. 3, 352-371 (2012).

9

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113704 Blin, Guillaume; Rizzi, Romeo; Vialette, Stéphane

A faster algorithm for finding minimum Tucker submatrices. (English)

Theory Comput. Syst. 51, No. 3, 270-281 (2012).

10

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113703 Berger, Ulrich; Seisenberger, Monika

Proofs, programs, processes. (English)

Theory Comput. Syst. 51, No. 3, 313-329 (2012).

11

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113702 Fortnow, Lance; Lutz, Jack H.; Mayordomo, Elvira

Inseparability and strong hypotheses for disjoint NP pairs. (English)

Theory Comput. Syst. 51, No. 2, 229-247 (2012).

12

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113701 Egri, László; Krokhin, Andrei; Larose, Benoit; Tesson, Pascal

The complexity of the list homomorphism problem for graphs. (English)

Theory Comput. Syst. 51, No. 2, 143-178 (2012).

13

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113699 Dumitrescu, Adrian; Jiang, Minghui

Dispersion in disks. (English)

Theory Comput. Syst. 51, No. 2, 125-142 (2012).

14

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113698 Jeż, Artur; Okhotin, Alexander

Representing hyper-arithmetical sets by equations over sets of integers. (English)

Theory Comput. Syst. 51, No. 2, 196-228 (2012).

15

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113697 Gu, Xiaoyang; Hitchcock, John M.; Pavan, A.

Collapsing and separating completeness notions under average-case and worst-case hypotheses. (English)

Theory Comput. Syst. 51, No. 2, 248-265 (2012).

16

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113696 Gärtner, Tobias; Hotz, Günter

Representation theorems for analytic machines and computability of analytic functions. (English)

Theory Comput. Syst. 51, No. 1, 65-84 (2012).

17

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113695 Kristiansen, Lars; Mender, Bedeho Mesghina Wolde

Non-determinism in Gödel’s system $T$. (English)

Theory Comput. Syst. 51, No. 1, 85-105 (2012).

18

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113694 Ambos-Spies, Klaus; Bakibayev, Timur

Comparing nontriviality for E and EXP. (English)

Theory Comput. Syst. 51, No. 1, 106-122 (2012).

19

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06113691 Cardinal, Jean; Fiorini, Samuel; Joret, Gwenaël

Minimum entropy combinatorial optimization problems. (English)

Theory Comput. Syst. 51, No. 1, 4-21 (2012).

20

PDF XML AMS-TeX TEXT BIBTeX DOI