2436 search results - page 265 / 488 » Comonadic Notions of Computation |
185
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
193
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
176
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
214
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
176
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...