2252 search results - page 81 / 451 » Lower Bounds for Dynamic Algorithms |
SODA
2004
ACM
15 years 2 months ago
2004
ACM
In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of ( log N log log N ) on the tile ...
124
click to vote
SPAA
1993
ACM
15 years 5 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
116
click to vote
ALT
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
102
click to vote
IPL
2010
14 years 12 months ago
2010
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...
109
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...