Sciweavers

753 search results - page 26 / 151
» Completing a (k - 1)-Assignment
Sort
View
FOCS
2010
IEEE
14 years 7 months ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai
FOCS
2007
IEEE
15 years 4 months ago
Intrusion-Resilient Secret Sharing
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
Stefan Dziembowski, Krzysztof Pietrzak
DATE
1999
IEEE
76views Hardware» more  DATE 1999»
15 years 2 months ago
Testing the Configurable Interconnect/Logic Interface of SRAM-Based FPGA's
The objective of this paper is to define a minimum number of configurations for testing the configurable modules that interface the global interconnect and the logic cells of SRAM...
Michel Renovell, Jean Michel Portal, Joan Figueras...
DM
2008
73views more  DM 2008»
14 years 10 months ago
A note on edge-graceful spectra of the square of paths
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
Tao-Ming Wang, Cheng-Chih Hsiao, Sin-Min Lee
JAPLL
2010
98views more  JAPLL 2010»
14 years 8 months ago
On database query languages for K-relations
The relational model has recently been extended to so-called K-relations in which tuples are assigned a unique value in a semiring K. A query language, denoted by RAC K , similar ...
Floris Geerts, Antonella Poggi