We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
With steady improvement in the reliability and performance of communication devices, routing instabilities now contribute to many of the remaining service degradations and interru...
Haldane Peterson, Soumya Sen, Jaideep Chandrasheka...
In this chapter, we are concerned with the relationship between Description Logics and other formalisms, regardless of whether they were designed for knowledge representation issu...
The "Institut National de I'Audiovisuel" (1NA) is in charge of keeping records of national TV broadcasts. Its main function is to provide TV producers with authenti...
Marc Nanard, Jocelyne Nanard, David Genest, Michel...
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
Henry Tan, Tharam S. Dillon, Fedja Hadzic, Elizabe...