Markus Bläser Lower bounds for the bilinear complexity of associative algebras. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2000, v:9, n:2, pp:73-112 [Journal]
Ran Raz The BNS-Chung criterion for multi-party communication complexity. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2000, v:9, n:2, pp:113-122 [Journal]
F. Blume On the relation between entropy and the average complexity of trajectories in dynamical systems. [Citation Graph (0, 0)][DBLP] Computational Complexity, 2000, v:9, n:2, pp:146-155 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
