The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
The Digital Systems and Media Computing Laboratory (DSMC Lab) was established in the end of 2002 and is located in Patras, Greece. DSMC operates under the School of Sciences and Te...
Current business conditions have given rise to distributed teams that are mostly collocated except for one remote member. These “hub-and-satellite” teams face the challenge of...
Gina Venolia, John C. Tang, Ruy Cervantes, Sara Bl...