Sciweavers

347 search results - page 19 / 70
» The Berlekamp-Massey Algorithm revisited
Sort
View
CIE
2008
Springer
15 years 26 days ago
Deterministic Graphical Games Revisited
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
Daniel Andersson, Kristoffer Arnsfelt Hansen, Pete...
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 4 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ALGORITHMICA
2010
155views more  ALGORITHMICA 2010»
14 years 11 months ago
Bin Packing with Rejection Revisited
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
Leah Epstein
RECOMB
2005
Springer
15 years 11 months ago
On Sorting by Translocations
The study of genome rearrangements is an important tool in comparative genomics. This paper revisits the problem of sorting a multichromosomal genome by translocations, i.e. exchan...
Anne Bergeron, Julia Mixtacki, Jens Stoye
109
Voted
FSE
2003
Springer
135views Cryptology» more  FSE 2003»
15 years 4 months ago
New Attacks against Standardized MACs
In this paper, we revisit the security of several message authentication code (MAC) algorithms based on block ciphers, when instantiated with 64-bit block ciphers such as DES. We e...
Antoine Joux, Guillaume Poupard, Jacques Stern