1628 search results - page 282 / 326 » Compiler Construction Using Scheme |
121
Voted
ICFP
2005
ACM
16 years 2 months ago
2005
ACM
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
126
Voted
ASIACRYPT
2009
Springer
15 years 8 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
142
Voted
WAOA
2005
Springer
15 years 7 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
129
click to vote
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
107
click to vote
CRYPTO
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...