Sciweavers

328 search results - page 57 / 66
» Simple Termination Revisited
Sort
View
GLOBECOM
2009
IEEE
13 years 11 months ago
Multi-Frame Distributed Protocol for Analog Network Coding in Slow-Fading Channels
The wireless network scenario here is based on N users that communicate one with the others through a central relay node by adopting the Analog Network Coding (ANC) paradigm. In th...
Jonathan Gambini, Umberto Spagnolini
CHES
2006
Springer
133views Cryptology» more  CHES 2006»
13 years 11 months ago
Fast Generation of Prime Numbers on Portable Devices: An Update
The generation of prime numbers underlies the use of most public-key cryptosystems, essentially as a primitive needed for the creation of RSA key pairs. Surprisingly enough, despit...
Marc Joye, Pascal Paillier
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
ICLP
1991
Springer
13 years 11 months ago
{log}: A Logic Programming Language with Finite Sets
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
Agostino Dovier, Eugenio G. Omodeo, Enrico Pontell...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 9 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos