128
click to vote
CIAC
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
68
Voted
STOC
1987
ACM
15 years 4 months ago
1987
ACM
68
Voted
STOC
1987
ACM
15 years 4 months ago
1987
ACM
64
Voted
STOC
1987
ACM
15 years 4 months ago
1987
ACM
54
Voted
STOC
1987
ACM
15 years 4 months ago
1987
ACM
78
Voted
STOC
1987
ACM
15 years 4 months ago
1987
ACM
75
Voted
STOC
1987
ACM
15 years 4 months ago
1987
ACM
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
74
Voted
STOC
1987
ACM
15 years 4 months ago
1987
ACM
87
Voted
STOC
1987
ACM
15 years 4 months ago
1987
ACM
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
69
Voted
FODO
1989
Springer
15 years 4 months ago
1989
Springer