Lech Banachowski A Complement to Tarjan's Result about the Lower Bound on the Complexity of the Set Union Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1980, v:11, n:2, pp:59-65 [Journal]
Friedrich J. Urbanek An O(log n) Algorithm for Computing the nth Element of the Solution of a Difference Equation. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1980, v:11, n:2, pp:66-67 [Journal]
David Gries, Gary Levin Computing Fibonacci Numbers (and Similarly Defined Functions) in Log Time. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1980, v:11, n:2, pp:68-69 [Journal]
Jürgen Ebert A Note on Odd and Even Factors of Undirected Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1980, v:11, n:2, pp:70-72 [Journal]
Paris C. Kanellakis On the Computational Complexity of Cardinality Constraints in Relational Databases. [Citation Graph (2, 0)][DBLP] Inf. Process. Lett., 1980, v:11, n:2, pp:98-101 [Journal]
Ernst L. Leiss A Note on a Signature System Based on Probabilistic Logic. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1980, v:11, n:2, pp:110-113 [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
