We show that the reachability problem for recursive state machines (or equivalently, pushdown systems), believed for long to have cubic worst-case complexity, can be solved in sli...
We present an overview of a tutorial on model management--an approach to solving data integration problems, such as data warehousing, e-commerce, object-to-relational mapping, sch...
ng the abstract view of computing resources from the implementation of these resources of indirection between abstract view and implementation of resources - Hides implementation d...
We propose a new approach to library-based technology mapping, based on the method of logical effort. Our algorithm is close to optimal for fanout-free circuits, and is extended t...
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...