| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A direct construction of polynomial-size OBDD proof of pigeon hole problem
|
Chén, Wěi
|
|
2009
|
109 |
10 |
p. 472-477
6 p.
|
artikel
|
| 2 |
An elementary proof of a generalization of double Greibach normal form
|
Yoshinaka, Ryo
|
|
2009
|
109 |
10 |
p. 490-492
3 p.
|
artikel
|
| 3 |
A new fast heuristic for labeling points
|
Roy, Sasanka
|
|
2009
|
109 |
10 |
p. 478-484
7 p.
|
artikel
|
| 4 |
A note on compressed sensing and the complexity of matrix multiplication
|
Iwen, M.A.
|
|
2009
|
109 |
10 |
p. 468-471
4 p.
|
artikel
|
| 5 |
A note on the expressibility problem for modal logics and star-free regular expressions
|
ten Cate, Balder
|
|
2009
|
109 |
10 |
p. 509-513
5 p.
|
artikel
|
| 6 |
A note on the Greedy algorithm for finding independent sets of C k -free graphs
|
Koura, Ippei
|
|
2009
|
109 |
10 |
p. 485-489
5 p.
|
artikel
|
| 7 |
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
|
Tzeng, Chi-Hung
|
|
2009
|
109 |
10 |
p. 518-522
5 p.
|
artikel
|
| 8 |
Clean the graph before you draw it!
|
Gaspers, Serge
|
|
2009
|
109 |
10 |
p. 463-467
5 p.
|
artikel
|
| 9 |
Editorial Board
|
|
|
2009
|
109 |
10 |
p. IFC-
1 p.
|
artikel
|
| 10 |
Efficient approximation algorithms for shortest cycles in undirected graphs
|
Lingas, Andrzej
|
|
2009
|
109 |
10 |
p. 493-498
6 p.
|
artikel
|
| 11 |
Improving on-line construction of two-dimensional suffix trees for square matrices
|
Na, Joong Chae
|
|
2009
|
109 |
10 |
p. 504-508
5 p.
|
artikel
|
| 12 |
On the size of (generalized) OBDDs for threshold functions
|
Bollig, Beate
|
|
2009
|
109 |
10 |
p. 499-503
5 p.
|
artikel
|
| 13 |
Universal hash functions for an infinite universe and hash trees
|
Brass, Peter
|
|
2009
|
109 |
10 |
p. 461-462
2 p.
|
artikel
|
| 14 |
Weak associativity and restricted rotation
|
Pallo, Jean Marcel
|
|
2009
|
109 |
10 |
p. 514-517
4 p.
|
artikel
|
Tijdschrift beschrijving