nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs
|
Šparl, Petra |
|
2012 |
112 |
14-15 |
p. 567-571 5 p. |
artikel |
2 |
A lower bound on the size of resolution proofs of the Ramsey theorem
|
Pudlák, Pavel |
|
2012 |
112 |
14-15 |
p. 610-611 2 p. |
artikel |
3 |
An alternate proof of Statmanʼs finite completeness theorem
|
Srivathsan, B. |
|
2012 |
112 |
14-15 |
p. 612-616 5 p. |
artikel |
4 |
Editorial Board
|
|
|
2012 |
112 |
14-15 |
p. IFC- 1 p. |
artikel |
5 |
Efficient inclusion testing for simple classes of unambiguous ω-automata
|
Isaak, Dimitri |
|
2012 |
112 |
14-15 |
p. 578-582 5 p. |
artikel |
6 |
Embedding a mesh of trees in the crossed cube
|
Dong, Qiang |
|
2012 |
112 |
14-15 |
p. 599-603 5 p. |
artikel |
7 |
Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
|
Du, Xiaoni |
|
2012 |
112 |
14-15 |
p. 604-609 6 p. |
artikel |
8 |
Minimum wirelength of hypercubes into n-dimensional grid networks
|
Rajasingh, Indra |
|
2012 |
112 |
14-15 |
p. 583-586 4 p. |
artikel |
9 |
One-round identity-based key exchange with Perfect Forward Security
|
Xie, Min |
|
2012 |
112 |
14-15 |
p. 587-591 5 p. |
artikel |
10 |
On multi-head automata with restricted nondeterminism
|
Reidenbach, Daniel |
|
2012 |
112 |
14-15 |
p. 572-577 6 p. |
artikel |
11 |
Regular set of representatives for time-constrained MSC graphs
|
Akshay, S. |
|
2012 |
112 |
14-15 |
p. 592-598 7 p. |
artikel |