Program checking, program self-correcting and program selftesting were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in the mid eighties as a new way to gain conï¬...
Shafi Goldwasser, Dan Gutfreund, Alexander Healy, ...
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
In this article, we describe our experiences in implementing an experimental wide-area GMPLS network called CHEETAH (Circuit-Switched End-to-End Transport Architecture). The key c...
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Stochastic context-free grammar (SCFG) based models for non-coding RNA (ncRNA) gene searches are much more powerful than regular grammar based models due to the ability to model in...