Andreas Goerdt, Tomasz Jurdzinski Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]

Alan Stacey Branching Random Walks On Quasi-Transitive Graphs. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]

The Oberwolfach Meeting On Combinatorics, Probability And Computing. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2003, v:12, n:3, 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