Sciweavers

241 search results - page 26 / 49
» On Generating Independent Random Strings
Sort
View
SSS
2009
Springer
195views Control Systems» more  SSS 2009»
14 years 1 months ago
Anonymous Transactions in Computer Networks
Abstract. We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as...
Shlomi Dolev, Marina Kopeetsky
ICALP
2001
Springer
13 years 12 months ago
Hidden Pattern Statistics
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
Philippe Flajolet, Yves Guivarc'h, Wojciech Szpank...
ICWN
2008
13 years 8 months ago
A Framework of Authentic Post-Issuance Program Modification for Multi-Application Smart Cards
Authentic program modification is very important for a multi-application smart card system since applications in the system are realized after the issuance of the smart card. In t...
Mohammad Mesbah Uddin, Salahuddin Muhammad Salim Z...
COMBINATORICS
2000
84views more  COMBINATORICS 2000»
13 years 7 months ago
A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large
We study the limiting distribution of the height in a generalized trie in which external nodes are capable to store up to b items (the so called b-tries). We assume that such a tr...
Charles Knessl, Wojciech Szpankowski
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
14 years 4 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra