740 search results - page 94 / 148 » Lower bounds for Buchsbaum* complexes |
142
click to vote
SWAT
2000
Springer
15 years 9 months ago
2000
Springer
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
182
click to vote
CIAC
2010
Springer
15 years 9 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 ...
121
click to vote
IPL
2006
15 years 6 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
146
click to vote
ESA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (th...
175
click to vote
ICCAD
1995
IEEE
15 years 9 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...