48 search results - page 10 / 10 » Probabilistically Checkable Proofs and Applications |
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
JAL
2002
13 years 5 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...