Sharing Intellectual Property (IP) blocks in today's competitive market poses significant high security risks. In this paper, we present a tutorial for a watermarking approach...
The steadily increasing complexity of embedded systems requires comprehensive methodoloat support the design process from the highest possible abstraction level. In most of the cu...
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
In this paper, we present a GSA-based technique that performs more e cient and more precise symbolic analysis of predicated assignments, recurrences and index arrays. The e ciency...
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...