Claus-Peter Schnorr How Many Polynomials can be Approximated Faster Than They can be Evaluated? [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1981, v:12, n:2, pp:76-78 [Journal]

Mark H. Overmars General Methods for `All Elements' and `All Pairs' Problems. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1981, v:12, n:2, pp:99-102 [Journal]

Silvio Micali Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1981, v:12, n:2, pp:103-105 [Journal]

Martin Tompa An Extension of Savitch's Theorem to Small Space Bounds. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1981, v:12, n:2, pp:106-108 [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