140 search results - page 13 / 28 » soda 2010 |
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
SODA
2010
ACM
13 years 8 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of non-negative, constant description...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...