The main difficulty in the formalization of a static analysis framework for CC programs is probably related to the correct approximation of the entailment relation between constrai...
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
—The recently proposed Pocket Switched Network paradigm takes advantage of human social contacts to opportunistically create data paths over time. We examine how effective such a...
—This paper investigates fundamental performance limits of medium access control (MAC) protocols for particular underwater multi-hop sensor networks under a fair-access criterion...
Yang Xiao, Miao Peng, John H. Gibson, Geoffrey G. ...