849 search results - page 113 / 170 » Completely Non-malleable Schemes |
SODA
1993
ACM
13 years 10 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
WLAN is one of the most successful applications of wireless communications in daily life because of low cost and ease of deployment. The enabling technique for this success is the ...
AUTOMATICA
2006
13 years 9 months ago
2006
The problem of absolute stability is one of the oldest open problems in the theory of control. Even for the particular case of second-order systems a complete solution was present...
IAJIT
2008
13 years 9 months ago
2008
: Traffic shaping function becomes imperative for the new broadband services that are being deployed in order to avoid information loss, to provide the end users multiple traffic o...
IJNSEC
2008
13 years 9 months ago
2008
Recently, M. Abdalla et al. proposed a slightly different variant of AuthA, based on the scheme proposed by E. Bresson et al., and provided the first complete proof of forward-sec...