1211 search results - page 54 / 243 » Topics in 0--1 data |
127
click to vote
PODC
2006
ACM
15 years 8 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
113
click to vote
CRYPTO
2000
Springer
15 years 6 months ago
2000
Springer
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
143
click to vote
DAGSTUHL
2007
15 years 3 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
130
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
125
click to vote
INTEGRATION
2007
15 years 1 months ago
2007
Since their publication in 1998 and 2001 respectively, Power and Electromagnetic Analysis (SPA, DPA, EMA) have been successfully used to retrieve secret information stored in cryp...