1331 search results - page 170 / 267 » Complexity bounds for zero-test algorithms |
129
click to vote
ICALP
1992
Springer
15 years 7 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
129
click to vote
SIGGRAPH
2000
ACM
15 years 6 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
140
click to vote
SPAA
2009
ACM
16 years 9 days ago
2009
ACM
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
125
click to vote
STOC
2004
ACM
16 years 3 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
147
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...