| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Choosing the right algorithm with hints from complexity theory
|
Wang, Shouda
|
|
|
296 |
C |
p.
|
artikel
|
| 2 |
Clustering categorical data: Soft rounding k-modes
|
Gavva, Surya Teja
|
|
|
296 |
C |
p.
|
artikel
|
| 3 |
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas
|
Bredereck, Robert
|
|
|
296 |
C |
p.
|
artikel
|
| 4 |
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs
|
Martynova, Olga
|
|
|
296 |
C |
p.
|
artikel
|
| 5 |
Early detection of temporal constraint violations
|
Mackey, Isaac
|
|
|
296 |
C |
p.
|
artikel
|
| 6 |
Editorial Board
|
|
|
|
296 |
C |
p.
|
artikel
|
| 7 |
Fast synchronization of inhomogenous random automata
|
Gerencsér, Balázs
|
|
|
296 |
C |
p.
|
artikel
|
| 8 |
Functionality of compositions of top-down tree transducers is decidable
|
Maneth, Sebastian
|
|
|
296 |
C |
p.
|
artikel
|
| 9 |
On the codewords of generalized Reed-Muller codes reaching the fourth weight
|
Golalizadeh, Somayyeh
|
|
|
296 |
C |
p.
|
artikel
|
| 10 |
Realizability problem for constraint LTL
|
Bhaskar, Ashwin
|
|
|
296 |
C |
p.
|
artikel
|
| 11 |
Special Issue on 13th International Conference on Security and Cryptography for Networks (SCN 2022)
|
Galdi, Clemente
|
|
|
296 |
C |
p.
|
artikel
|
| 12 |
Succinct data structure for path graphs
|
Balakrishnan, Girish
|
|
|
296 |
C |
p.
|
artikel
|
| 13 |
The membership problem for subsemigroups of GL 2 ( Z ) is NP-complete
|
Bell, Paul C.
|
|
|
296 |
C |
p.
|
artikel
|
| 14 |
Towards non-iterative calculation of the zeros of the Riemann zeta function
|
Matiyasevich, Yu.
|
|
|
296 |
C |
p.
|
artikel
|
Tijdschrift beschrijving