849 search results - page 164 / 170 » Completely Non-malleable Schemes |
ICLP
1992
Springer
15 years 1 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
POPL
1992
ACM
15 years 1 months ago
1992
ACM
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
93
Voted
APLAS
2007
ACM
15 years 1 months ago
2007
ACM
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
104
click to vote
GLVLSI
2009
IEEE
15 years 1 months ago
2009
IEEE
Modern embedded devices (e.g., PDAs, mobile phones) are now incorporating Java as a very popular implementation language in their designs. These new embedded systems include multi...
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...