nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: Combinatorial and algorithmic applications
|
Gurvits, Leonid |
|
2015 |
240 |
C |
p. 42-55 14 p. |
artikel |
2 |
Detecting regularities on grammar-compressed strings
|
I, Tomohiro |
|
2015 |
240 |
C |
p. 74-89 16 p. |
artikel |
3 |
Editorial Board
|
|
|
2015 |
240 |
C |
p. i- 1 p. |
artikel |
4 |
Editorial Board
|
|
|
2015 |
240 |
C |
p. IFC- 1 p. |
artikel |
5 |
Improved bounds for reduction to depth 4 and depth 3
|
Tavenas, Sébastien |
|
2015 |
240 |
C |
p. 2-11 10 p. |
artikel |
6 |
Minimal indices for predecessor search
|
Cohen, Sarel |
|
2015 |
240 |
C |
p. 12-30 19 p. |
artikel |
7 |
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
|
Fournier, Hervé |
|
2015 |
240 |
C |
p. 31-41 11 p. |
artikel |
8 |
On the quantifier-free dynamic complexity of Reachability
|
Zeume, Thomas |
|
2015 |
240 |
C |
p. 108-129 22 p. |
artikel |
9 |
Polynomial threshold functions and Boolean threshold circuits
|
Hansen, Kristoffer Arnsfelt |
|
2015 |
240 |
C |
p. 56-73 18 p. |
artikel |
10 |
Prime languages
|
Kupferman, Orna |
|
2015 |
240 |
C |
p. 90-107 18 p. |
artikel |
11 |
Special Issue for the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, Klosterneuburg, Austria
|
Chatterjee, Krishnendu |
|
2015 |
240 |
C |
p. 1- 1 p. |
artikel |