2252 search results - page 305 / 451 » Lower Bounds for Dynamic Algorithms |
104
Voted
SRDS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this work we consider a distributed system formed by a master processor and a collection of n processors (workers) that can execute tasks; worker processors are untrusted and m...
154
Voted
STOC
2010
ACM
16 years 26 days ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
140
Voted
MOBIHOC
2004
ACM
16 years 3 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
123
Voted
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
We consider the problem of dynamically indexing temporal observations about a collection of objects, each observation consisting of a key identifying the object, a list of attribu...
118
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...