Martin Middendorf Manhattan Channel Routing is NP-complete Under Truly Restricted Settings. [Citation Graph (0, 0)][DBLP] Chicago J. Theor. Comput. Sci., 1996, v:1996, n:, pp:- [Journal]
Mitsunori Ogihara Sparse Hard Sets for P Yield Space-Efficient Algorithms. [Citation Graph (0, 0)][DBLP] Chicago J. Theor. Comput. Sci., 1996, v:1996, n:, pp:- [Journal]
Moshe Y. Vardi Rank Predicates vs. Progress Measures in Concurrent-Program Verification. [Citation Graph (0, 0)][DBLP] Chicago J. Theor. Comput. Sci., 1996, v:1996, n:, pp:- [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