Authors: ANDREEV AE CLEMENTI AEF ROLIM JDP

Citation: Ae. Andreev et al., A NEW GENERAL DERANDOMIZATION METHOD, JOURNAL OF THE ACM, 45(1), 1998, pp. 179-213

Authors: ANDREEV AE CLEMENTI AEF ROLIM JDP

Citation: Ae. Andreev et al., OPTIMAL BOUNDS FOR THE APPROXIMATION OF BOOLEAN FUNCTIONS AND SOME APPLICATIONS, Theoretical computer science, 180(1-2), 1997, pp. 243-268

Authors: CLEMENTI AEF DIIANNI M

Citation: Aef. Clementi et M. Diianni, ON THE HARDNESS OF APPROXIMATING OPTIMUM SCHEDULE PROBLEMS IN STORE-AND-FORWARD NETWORKS, IEEE/ACM transactions on networking, 4(2), 1996, pp. 272-280

Authors: ANDREEV AE CLEMENTI AEF ROLIM JDP

Citation: Ae. Andreev et al., CONSTRUCTING THE HIGHEST DEGREE SUBGRAPH FOR DENSE GRAPHS IS IN NLAP, Theoretical computer science, 161(1-2), 1996, pp. 307-314