10916 search results - page 288 / 2184 » On Constructive Connectives and Systems |
193
Voted
DIAU
2000
Springer
15 years 11 months ago
2000
Springer
This paper presents a security analysis of Onion Routing, an application independent infrastructure for tra c-analysis-resistant and anonymous Internet connections. It also includ...
159
click to vote
DAC
1996
ACM
15 years 11 months ago
1996
ACM
1 Two tutorials are presented introducing the basic syntax and semantics of Awk and Perl. The languages are taught by example, and the same example EDA applications are developed i...
149
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...
155
click to vote
SIAMDM
2010
15 years 5 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
187
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
We introduce a simple primitive called Augmented Broadcast Encryption (ABE) that is sufficient for constructing broadcast encryption, traitor-tracing, and trace-and-revoke systems...