1477 search results - page 245 / 296 » Complexity of (iterated) dominance |
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
SMA
1999
ACM
14 years 1 months ago
1999
ACM
We present an efficient algorithm for preserving the total volume of a solids undergoing free-form deformation using discrete level-of-detail representations. Given the boundary r...
FSE
1999
Springer
14 years 1 months ago
1999
Springer
Recently a powerful cryptanalytic tool—the slide attack— was introduced [3]. Slide attacks are very successful in breaking iterative ciphers with a high degree of self-similari...
CSCW
1998
ACM
14 years 28 days ago
1998
ACM
Everyday, people in organizations must solve their problems to get their work accomplished. To do so, they often must find others with knowledge and information. Systems that assi...
LCTRTS
1998
Springer
14 years 28 days ago
1998
Springer
Abstract. Previously published methods for estimation of the worstcase execution time on contemporary processors with complex pipelines and multi-level memory hierarchies result in...