| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An analysis of chain characteristics in the cryptanalytic TMTO method
|
Tomašević, Violeta
|
|
2013
|
501 |
C |
p. 52-61
10 p.
|
artikel
|
| 2 |
Conditional Kolmogorov complexity and universal probability
|
Vitányi, Paul M.B.
|
|
2013
|
501 |
C |
p. 93-100
8 p.
|
artikel
|
| 3 |
Editorial Board
|
|
|
2013
|
501 |
C |
p. iii-viii
nvt p.
|
artikel
|
| 4 |
Fault isolation and identification in general biswapped networks under the PMC diagnostic model
|
Tsai, Chang-Hsiung
|
|
2013
|
501 |
C |
p. 62-71
10 p.
|
artikel
|
| 5 |
Linear circuits, two-variable logic and weakly blocked monoids
|
Behle, Christoph
|
|
2013
|
501 |
C |
p. 20-33
14 p.
|
artikel
|
| 6 |
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
|
Vakhania, Nodari
|
|
2013
|
501 |
C |
p. 72-81
10 p.
|
artikel
|
| 7 |
One-round multi-party communication complexity of distinguishing sums
|
Apon, Daniel
|
|
2013
|
501 |
C |
p. 101-108
8 p.
|
artikel
|
| 8 |
On excessive index of certain networks
|
Rajasingh, Indra
|
|
2013
|
501 |
C |
p. 34-40
7 p.
|
artikel
|
| 9 |
On the open problem of Ginsburg concerning semilinear sets and related problems
|
Ibarra, Oscar H.
|
|
2013
|
501 |
C |
p. 11-19
9 p.
|
artikel
|
| 10 |
On the weak computability of a four dimensional orthogonal packing and time scheduling problem
|
Huang, Wenqi
|
|
2013
|
501 |
C |
p. 1-10
10 p.
|
artikel
|
| 11 |
On using probabilistic Turing machines to model participants in cryptographic protocols
|
Klingler, Lee
|
|
2013
|
501 |
C |
p. 49-51
3 p.
|
artikel
|
| 12 |
Partial algebras and complexity of satisfiability and universal theory for distributive lattices, boolean algebras and Heyting algebras
|
van Alten, C.J.
|
|
2013
|
501 |
C |
p. 82-92
11 p.
|
artikel
|
| 13 |
The total run length of a word
|
Glen, Amy
|
|
2013
|
501 |
C |
p. 41-48
8 p.
|
artikel
|
Tijdschrift beschrijving