nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
All minimal prime extensions of hereditary classes of graphs
|
Giakoumakis, Vassilis |
|
2007 |
370 |
1-3 |
p. 74-93 20 p. |
artikel |
2 |
An automata-theoretic approach to the word problem for ω -terms over R
|
Almeida, Jorge |
|
2007 |
370 |
1-3 |
p. 131-169 39 p. |
artikel |
3 |
An efficient alignment algorithm for masked sequences
|
Kim, Jin Wook |
|
2007 |
370 |
1-3 |
p. 19-33 15 p. |
artikel |
4 |
A note on efficient aggregate queries in sensor networks
|
Patt-Shamir, Boaz |
|
2007 |
370 |
1-3 |
p. 254-264 11 p. |
artikel |
5 |
Binary matrices under the microscope: A tomographical problem
|
Frosini, Andrea |
|
2007 |
370 |
1-3 |
p. 201-217 17 p. |
artikel |
6 |
Canonical disjoint NP-pairs of propositional proof systems
|
Glaßer, Christian |
|
2007 |
370 |
1-3 |
p. 60-73 14 p. |
artikel |
7 |
Cramer–Damgård signatures revisited: Efficient flat-tree signatures based on factoring
|
Catalano, Dario |
|
2007 |
370 |
1-3 |
p. 186-200 15 p. |
artikel |
8 |
Editorial Board
|
|
|
2007 |
370 |
1-3 |
p. v-ix nvt p. |
artikel |
9 |
Feasibility and complexity of broadcasting with random transmission failures
|
Pelc, Andrzej |
|
2007 |
370 |
1-3 |
p. 279-292 14 p. |
artikel |
10 |
Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
|
Hsieh, Sun-Yuan |
|
2007 |
370 |
1-3 |
p. 299-308 10 p. |
artikel |
11 |
Improved hardness amplification in NP
|
Lu, Chi-Jen |
|
2007 |
370 |
1-3 |
p. 293-298 6 p. |
artikel |
12 |
Induced-path partition on graphs with special blocks
|
Pan, Jun-Jie |
|
2007 |
370 |
1-3 |
p. 121-130 10 p. |
artikel |
13 |
Languages generated by iterated idempotency
|
Leupold, Peter |
|
2007 |
370 |
1-3 |
p. 170-185 16 p. |
artikel |
14 |
Longest common subsequence problem for unoriented and cyclic strings
|
Nicolas, François |
|
2007 |
370 |
1-3 |
p. 1-18 18 p. |
artikel |
15 |
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
|
Brandstädt, Andreas |
|
2007 |
370 |
1-3 |
p. 229-239 11 p. |
artikel |
16 |
Obtaining shorter regular expressions from finite-state automata
|
Han, Yo-Sub |
|
2007 |
370 |
1-3 |
p. 110-120 11 p. |
artikel |
17 |
One Head Machines from a symbolic approach
|
Gajardo, A. |
|
2007 |
370 |
1-3 |
p. 34-47 14 p. |
artikel |
18 |
On searching a table consistent with division poset
|
Cheng, Yongxi |
|
2007 |
370 |
1-3 |
p. 240-253 14 p. |
artikel |
19 |
On the relationship between ATSP and the cycle cover problem
|
Sunil Chandran, L. |
|
2007 |
370 |
1-3 |
p. 218-228 11 p. |
artikel |
20 |
Quantifier elimination for the reals with a predicate for the powers of two
|
Avigad, Jeremy |
|
2007 |
370 |
1-3 |
p. 48-59 12 p. |
artikel |
21 |
Solving shortest paths efficiently on nearly acyclic directed graphs
|
Saunders, Shane |
|
2007 |
370 |
1-3 |
p. 94-109 16 p. |
artikel |
22 |
The left–right-imbalance of binary search trees
|
Kuba, Markus |
|
2007 |
370 |
1-3 |
p. 265-278 14 p. |
artikel |