Sciweavers

1679 search results - page 31 / 336
» Strong order equivalence
Sort
View
APCSAC
2003
IEEE
14 years 3 months ago
Implementation of Fast Address-Space Switching and TLB Sharing on the StrongARM Processor
The StrongARM processor features virtually-addressed caches and a TLB without address-space tags. A naive implementation therefore requires flushing of all CPU caches and the TLB ...
Adam Wiggins, Harvey Tuch, Volkmar Uhlig, Gernot H...
FOCS
2009
IEEE
14 years 1 months ago
Optimal Quantum Strong Coin Flipping
Coin flipping is a fundamental cryptographic primitive that enables two distrustful and far apart parties to create a uniformly random bit [Blu81]. Quantum information allows for ...
André Chailloux, Iordanis Kerenidis
IEEEARES
2010
IEEE
14 years 4 months ago
Program Obfuscation by Strong Cryptography
—Program obfuscation is often employed by malware in order to avoid detection by anti-virus software, but it has many other legitimate uses, such as copy protection, software lic...
Zeljko Vrba, Pål Halvorsen, Carsten Griwodz
FOCS
2007
IEEE
14 years 4 months ago
Strongly History-Independent Hashing with Applications
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
Guy E. Blelloch, Daniel Golovin
LICS
2012
IEEE
12 years 8 days ago
A Higher-Order Distributed Calculus with Name Creation
—This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus. Passivation [Schmitt and Ste...
Adrien Piérard, Eijiro Sumii