nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A recursive ascent Earley parser
|
Leermakers, René |
|
1992 |
41 |
2 |
p. 87-91 5 p. |
artikel |
2 |
A self-stabilizing algorithm for constructing breadth-first trees
|
Huang, Shing-Tsaan |
|
1992 |
41 |
2 |
p. 109-117 9 p. |
artikel |
3 |
Finding a maximum set of independent chords in a circle
|
Chang, R.C. |
|
1992 |
41 |
2 |
p. 99-102 4 p. |
artikel |
4 |
Finding approximate solutions to NP-hard problems by neural networks is hard
|
Yao, Xin |
|
1992 |
41 |
2 |
p. 93-98 6 p. |
artikel |
5 |
On efficient implementation of LR-attributed grammars
|
Pavlů, Petr |
|
1992 |
41 |
2 |
p. 67-75 9 p. |
artikel |
6 |
On immunity against Biham and Shamir's “differential cryptanalysis”
|
Adams, Carlisle M. |
|
1992 |
41 |
2 |
p. 77-80 4 p. |
artikel |
7 |
Order of state functions and logic functions
|
Kobuchi, Youichi |
|
1992 |
41 |
2 |
p. 61-66 6 p. |
artikel |
8 |
Processor-efficient exponentiation in finite fields
|
Von Zur Gathen, Joachim |
|
1992 |
41 |
2 |
p. 81-86 6 p. |
artikel |
9 |
Searching for segments with largest relative overlap
|
Aurenhammer, Franz |
|
1992 |
41 |
2 |
p. 103-108 6 p. |
artikel |