Sciweavers

61 search results - page 8 / 13
» ipl 2007
Sort
View
IPL
2007
50views more  IPL 2007»
14 years 9 months ago
Wait-free regular storage from Byzantine components
We present a simple, efficient, and self-contained construction of a wait-free regular register from Byzantine storage components. Our construction utilizes a novel building block...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
IPL
2007
96views more  IPL 2007»
14 years 9 months ago
Fault diameter of product graphs
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fa...
Jun-Ming Xu, Chao Yang
IPL
2007
105views more  IPL 2007»
14 years 9 months ago
Improving the arithmetic of elliptic curves in the Jacobi model
The use of elliptic curve cryptosystems on embedded systems has been becoming widespread for some years. Therefore the resistance of such cryptosystems to side-channel attacks is ...
Sylvain Duquesne
IPL
2007
121views more  IPL 2007»
14 years 9 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
Venkatesh Raman, Somnath Sikdar
IPL
2007
71views more  IPL 2007»
14 years 9 months ago
Relaxations of semiring constraint satisfaction problems
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...
Louise Leenen, Thomas Andreas Meyer, Aditya Ghose