Sciweavers

WDAG
2010
Springer
199views Algorithms» more  WDAG 2010»
13 years 10 months ago
The 2010 Edsger W. Dijkstra Prize in Distributed Computing
Marcos Kawazoe Aguilera, Michel Raynal
WDAG
2010
Springer
204views Algorithms» more  WDAG 2010»
13 years 10 months ago
The Cost of Privatization
Software transactional memory (STM) guarantees that a transaction, consisting of a sequence of operations on the memory, appears to be executed atomically. In practice, it is impor...
Hagit Attiya, Eshcar Hillel
WDAG
2010
Springer
206views Algorithms» more  WDAG 2010»
13 years 10 months ago
Scalable Quantum Consensus for Crash Failures
We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qu...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
WASA
2010
Springer
236views Algorithms» more  WASA 2010»
13 years 10 months ago
A Game Theoretic Approach to Multi-radio Multi-channel Assignment in Wireless Networks
Abstract. It has been long recognized that the interference among concurrent wireless transmissions plays a crucial role in limiting the performance of wireless networks. Recently,...
Devu Manikantan Shila, Yu Cheng, Tricha Anjali
WASA
2010
Springer
288views Algorithms» more  WASA 2010»
13 years 10 months ago
Approaching the Optimal Schedule for Data Aggregation in Wireless Sensor Networks
Abstract. Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper foc...
Pei Wang, Yuan He, Liusheng Huang
WASA
2010
Springer
212views Algorithms» more  WASA 2010»
13 years 10 months ago
Interference-Aware Gossiping Scheduling in Uncoordinated Duty-Cycled Multi-hop Wireless Networks
Xianlong Jiao, Wei Lou, Xiaodong Wang, Junchao Ma,...
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
13 years 10 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
WALCOM
2010
IEEE
217views Algorithms» more  WALCOM 2010»
13 years 10 months ago
Reconstruction Algorithm for Permutation Graphs
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
WALCOM
2010
IEEE
260views Algorithms» more  WALCOM 2010»
13 years 10 months ago
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
Tetsuo Asano, Wolfgang Mulzer, Yajun Wang
WALCOM
2010
IEEE
351views Algorithms» more  WALCOM 2010»
13 years 10 months ago
Pathwidth and Searching in Parameterized Threshold Graphs
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shas...