The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
XML has emerged as the standard for representing and exchanging data on the World Wide Web. It is critical to have efficient mechanisms to store and query XML data to exploit the...
Mustafa Atay, Yezhou Sun, Dapeng Liu, Shiyong Lu, ...
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to...
Ali Nazari, S. Sandeep Pradhan, Achilleas Anastaso...
Vehicular Ad hoc Networks (VANET) are expected to have great potential to improve both traffic safety and comfort in the future. When many vehicles want to access data through roa...
We consider the problem of constructing optimal authentication codes with splitting. New infinite families of such codes are obtained. In particular, we establish the first known...
— We demonstrate a decoding scheme for nested lattice codes which is able to decode a list of a particular size which contains the transmitted codeword with high probability. Thi...
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings ar...