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 A CRESCENZI P DAHLHAUS E DEAGOSTINO S ROLIM JDP

Citation: Ae. Andreev et al., THE PARALLEL COMPLEXITY OF APPROXIMATING THE HIGH-DEGREE SUBGRAPH PROBLEM, Theoretical computer science, 205(1-2), 1998, pp. 261-282

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: 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

Authors: ANDREEV AE

Citation: Ae. Andreev, ALMOST OPTIMAL HITTING SET, Doklady Akademii nauk. Rossijskaa akademia nauk, 340(4), 1995, pp. 453-455

Authors: ANDREEV AE GERASIMOV VA GERASIMOV VB ZAIKA VM ZOLOTOV IY KURAKOV AV UMNOV VO

Citation: Ae. Andreev et al., EFFICIENT QUANTRON WITH COAXIAL PUMP LAMP AND PHOSPHATE-GLASS ACTIVE ELEMENT, Kvantovaa elektronika, 20(4), 1993, pp. 349-352