| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A characterization of 2-threshold functions via pairs of prime segments
|
Zamaraeva, Elena
|
|
|
919 |
C |
p. 1-17
|
article
|
| 2 |
A visit to mutual exclusion in seven dates
|
Raynal, Michel
|
|
|
919 |
C |
p. 47-65
|
article
|
| 3 |
Constructions of 2-resilient rotation symmetric Boolean functions through symbol transformations of cyclic Hadamard matrix
|
Du, Jiao
|
|
|
919 |
C |
p. 80-91
|
article
|
| 4 |
Editorial Board
|
|
|
|
919 |
C |
p. ii
|
article
|
| 5 |
Finding binary words with a given number of subsequences
|
Żak, Radosław
|
|
|
919 |
C |
p. 75-79
|
article
|
| 6 |
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
|
Droste, Manfred
|
|
|
919 |
C |
p. 118-143
|
article
|
| 7 |
Fragile complexity of adaptive algorithms
|
Bose, Prosenjit
|
|
|
919 |
C |
p. 92-102
|
article
|
| 8 |
Generalized framework for Group Testing: Queries, feedbacks and adversaries
|
Klonowski, Marek
|
|
|
919 |
C |
p. 18-35
|
article
|
| 9 |
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
|
Chaplick, Steven
|
|
|
919 |
C |
p. 66-74
|
article
|
| 10 |
The complexity of the unit stop number problem and its implications to other related problems
|
Baïou, Mourad
|
|
|
919 |
C |
p. 36-46
|
article
|
| 11 |
Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography
|
Galesi, Nicola
|
|
|
919 |
C |
p. 103-117
|
article
|
Journal description