John Hershberger Finding the Upper Envelope of n Line Segments in O(n log n) Time. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:33, n:4, pp:169-174 [Journal]

Richard Zippel An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Time. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:33, n:4, pp:207-212 [Journal]

Janez Zerovnik A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:33, n:4, pp:213-219 [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