nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A distributed leader election algorithm in crash-recovery and omissive systems
|
Fernández-Campusano, Christian |
|
2017 |
118 |
C |
p. 100-104 5 p. |
artikel |
2 |
A note on Thue games
|
Mercaş, Robert |
|
2017 |
118 |
C |
p. 75-77 3 p. |
artikel |
3 |
A polynomial-time algorithm for computing low CP-rank decompositions
|
Elbassioni, Khaled |
|
2017 |
118 |
C |
p. 10-14 5 p. |
artikel |
4 |
Area-universal drawings of biconnected outerplane graphs
|
Chang, Yi-Jun |
|
2017 |
118 |
C |
p. 1-5 5 p. |
artikel |
5 |
A short note on Merlin–Arthur protocols for subset sum
|
Nederlof, Jesper |
|
2017 |
118 |
C |
p. 15-16 2 p. |
artikel |
6 |
Checking strict positivity of Kraus maps is NP-hard
|
Gaubert, Stéphane |
|
2017 |
118 |
C |
p. 35-43 9 p. |
artikel |
7 |
Ciphertext-only attack on d × d Hill in O(d13 d )
|
Khazaei, Shahram |
|
2017 |
118 |
C |
p. 25-29 5 p. |
artikel |
8 |
Diagnosable evaluation of enhanced optical transpose interconnection system networks
|
Tsai, Chang-Hsiung |
|
2017 |
118 |
C |
p. 105-109 5 p. |
artikel |
9 |
Editorial Board
|
|
|
2017 |
118 |
C |
p. IFC- 1 p. |
artikel |
10 |
Equivariant algorithms for constraint satisfaction problems over coset templates
|
Lasota, Sławomir |
|
2017 |
118 |
C |
p. 44-52 9 p. |
artikel |
11 |
Fully polynomial-time computation of maximum likelihood trajectories in Markov chains
|
Grinberg, Yuri |
|
2017 |
118 |
C |
p. 53-57 5 p. |
artikel |
12 |
Good self-dual generalized quasi-cyclic codes exist
|
Shi, Minjia |
|
2017 |
118 |
C |
p. 21-24 4 p. |
artikel |
13 |
Group-based collective keyword querying in road networks
|
Su, Sen |
|
2017 |
118 |
C |
p. 83-90 8 p. |
artikel |
14 |
Inexact feasibility pump for mixed integer nonlinear programming
|
Li, M. |
|
2017 |
118 |
C |
p. 110-116 7 p. |
artikel |
15 |
Merging almost sorted sequences yields a 24-sorter
|
Ehlers, Thorsten |
|
2017 |
118 |
C |
p. 17-20 4 p. |
artikel |
16 |
On pattern matching with k mismatches and few don't cares
|
Nicolae, Marius |
|
2017 |
118 |
C |
p. 78-82 5 p. |
artikel |
17 |
Optimal suffix sorting and LCP array construction for constant alphabets
|
Louza, Felipe A. |
|
2017 |
118 |
C |
p. 30-34 5 p. |
artikel |
18 |
Periodicity in rectangular arrays
|
Gamard, Guilhem |
|
2017 |
118 |
C |
p. 58-63 6 p. |
artikel |
19 |
Refined algorithms for hitting many intervals
|
Damaschke, Peter |
|
2017 |
118 |
C |
p. 117-122 6 p. |
artikel |
20 |
Residuation for bipolar preferences in soft constraints
|
Gadducci, Fabio |
|
2017 |
118 |
C |
p. 69-74 6 p. |
artikel |
21 |
The clique-transversal set problem in {claw,K 4}-free planar graphs
|
Liang, Zuosong |
|
2017 |
118 |
C |
p. 64-68 5 p. |
artikel |
22 |
The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
|
Héam, P.-C. |
|
2017 |
118 |
C |
p. 6-9 4 p. |
artikel |
23 |
The fixed initial credit problem for partial-observation energy games is Ack-complete
|
Pérez, Guillermo A. |
|
2017 |
118 |
C |
p. 91-99 9 p. |
artikel |