2924 search results - page 135 / 585 » Lower Bounds in Distributed Computing |
94
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
For an n-variate degree
84
Voted
VRCAI
2006
ACM
15 years 6 months ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
86
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
66
Voted
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
94
Voted
ICDCSW
2003
IEEE
15 years 6 months ago
2003
IEEE
Nodes in ad hoc networks generally transmit data at regular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power and have v...