2252 search results - page 218 / 451 » Lower Bounds for Dynamic Algorithms |
266
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
129
click to vote
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
153
click to vote
CONCUR
2008
Springer
15 years 5 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
150
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
126
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...