nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A matched approximation bound for the sum of a greedy coloring
|
Bar-Noy, Amotz |
|
1999 |
71 |
3-4 |
p. 135-140 6 p. |
artikel |
2 |
An interesting way to partition a number
|
Bhatt, P.C.P. |
|
1999 |
71 |
3-4 |
p. 141-148 8 p. |
artikel |
3 |
A one-to-one correspondence between a class of leftist trees and binary trees
|
Kemp, Rainer |
|
1999 |
71 |
3-4 |
p. 97-105 9 p. |
artikel |
4 |
A simple bivalency proof that t-resilient consensus requires t+1 rounds
|
Aguilera, Marcos Kawazoe |
|
1999 |
71 |
3-4 |
p. 155-158 4 p. |
artikel |
5 |
Fast practical multi-pattern matching
|
Crochemore, Maxime |
|
1999 |
71 |
3-4 |
p. 107-113 7 p. |
artikel |
6 |
Hamming weights of correlation immune Boolean functions
|
Maitra, Subhamoy |
|
1999 |
71 |
3-4 |
p. 149-153 5 p. |
artikel |
7 |
How to prevent interaction of functional and inclusion dependencies
|
Levene, Mark |
|
1999 |
71 |
3-4 |
p. 115-125 11 p. |
artikel |
8 |
The complexity of some complementation problems
|
Plaisted, David A. |
|
1999 |
71 |
3-4 |
p. 159-165 7 p. |
artikel |
9 |
The cost of graceful degradation for omission failures
|
Jayanti, Prasad |
|
1999 |
71 |
3-4 |
p. 167-172 6 p. |
artikel |
10 |
Tree precedence in scheduling: The strong–weak distinction
|
Dror, M. |
|
1999 |
71 |
3-4 |
p. 127-134 8 p. |
artikel |