Sciweavers

2252 search results - page 167 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
114
Voted
FM
2008
Springer
148views Formal Methods» more  FM 2008»
15 years 5 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl
123
Voted
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
15 years 3 months ago
Computing the Greedy Spanner in Near-Quadratic Time
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...
141
Voted
FTCS
1997
115views more  FTCS 1997»
15 years 4 months ago
Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts
This paper presents robust emulation of multi-writer/multi-reader registers in message-passing systems using dynamic quorum con gurations. In addition to processor and link failur...
Nancy A. Lynch, Alexander A. Shvartsman
WWW
2005
ACM
16 years 4 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
154
Voted
AI
1999
Springer
15 years 3 months ago
Coalition Structure Generation with Worst Case Guarantees
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coal...
Tuomas Sandholm, Kate Larson, Martin Andersson, On...