Alon Efrat The Complexity of the Union of (alpha, beta)-Covered Objects. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:4, pp:775-787 [Journal]
Anna Gál, Adi Rosén Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private Computation. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:4, pp:946-959 [Journal]
Michael Kaminski A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:4, pp:960-992 [Journal]
Grzegorz Malewicz A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:4, pp:993-1024 [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