Sciweavers

15033 search results - page 29 / 3007
» Complexity Theory and Algorithms
Sort
View
PODC
2003
ACM
15 years 3 months ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
PODS
2007
ACM
196views Database» more  PODS 2007»
15 years 9 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
89
Voted
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
15 years 10 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
14 years 8 months ago
The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, T...
SPAA
2010
ACM
14 years 10 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis