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
Citation: P. Duris et Jdp. Rolim, LOWER BOUNDS ON THE MULTIPARTY COMMUNICATION COMPLEXITY, Journal of computer and system sciences, 56(1), 1998, pp. 90-95
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
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
Citation: P. Duris et Jdp. Rolim, A NOTE ON THE DENSITY OF ORACLE DECREASING TIME-SPACE COMPLEXITY, Theoretical computer science, 132(1-2), 1994, pp. 435-444