Sciweavers

300 search results - page 30 / 60
» Compiling Erlang to Scheme
Sort
View
EUROCRYPT
2005
Springer
15 years 9 months ago
Reducing Complexity Assumptions for Statistically-Hiding Commitment
We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes bas...
Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-...
ISCA
2000
IEEE
134views Hardware» more  ISCA 2000»
15 years 8 months ago
Architectural support for scalable speculative parallelization in shared-memory multiprocessors
Speculative parallelization aggressively executes in parallel codes that cannot be fully parallelized by the compiler. Past proposals of hardware schemes have mostly focused on si...
Marcelo H. Cintra, José F. Martínez,...
ICFP
2002
ACM
16 years 3 months ago
A demand-driven adaptive type analysis
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
Danny Dubé, Marc Feeley
IPPS
2006
IEEE
15 years 9 months ago
A compiler-based communication analysis approach for multiprocessor systems
In this paper we describe a compiler framework which can identify communication patterns for MPIbased parallel applications. This has the potential of providing significant perfo...
Shuyi Shao, Alex K. Jones, Rami G. Melhem
139
Voted
CRYPTO
2003
Springer
96views Cryptology» more  CRYPTO 2003»
15 years 9 months ago
Scalable Protocols for Authenticated Group Key Exchange
We consider the fundamental problem of authenticated group key exchange among n parties within a larger and insecure public network. A number of solutions to this problem have bee...
Jonathan Katz, Moti Yung