Sciweavers

28 search results - page 3 / 6
» Fast Garbling of Circuits Under Standard Assumptions
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 10 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
GLVLSI
2006
IEEE
185views VLSI» more  GLVLSI 2006»
14 years 19 days ago
Application of fast SOCP based statistical sizing in the microprocessor design flow
In this paper we have applied statistical sizing in an industrial setting. Efficient implementation of the statistical sizing algorithm is achieved by utilizing a dedicated interi...
Murari Mani, Mahesh Sharma, Michael Orshansky
DC
2008
13 years 6 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
EUROCRYPT
2010
Springer
13 years 11 months ago
Bounded Key-Dependent Message Security
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...
Boaz Barak, Iftach Haitner, Dennis Hofheinz, Yuval...
BMCBI
2006
102views more  BMCBI 2006»
13 years 6 months ago
UVPAR: fast detection of functional shifts in duplicate genes
Background: The imprint of natural selection on gene sequences is often difficult to detect. A plethora of methods have been devised to detect genetic changes due to selective pro...
Vicente Arnau, Miguel Gallach, J. Ignasi Lucas, Ig...