9888 search results - page 273 / 1978 » compute 2009 |
216
Voted
RTA
2009
Springer
16 years 2 months ago
2009
Springer
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
197
click to vote
BICOB
2009
Springer
16 years 2 days ago
2009
Springer
Cytoplasmic post-transcriptional modification of mRNA transcripts in the form of polyadenylated (poly(A)) tails plays a key role in their translational control. The timing and degr...
160
Voted
LICS
2009
IEEE
16 years 2 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
208
click to vote
PKC
2009
Springer
16 years 8 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
186
Voted
SIGCSE
2009
ACM
16 years 8 months ago
2009
ACM
Deaf and hard of hearing students are an underrepresented group in computing and face extra challenges in university-level computing courses. This paper describes a 9-week Summer ...