Gregory F. Lawler A Discrete Analogue of a Theorem of Makarov. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1993, v:2, n:, pp:181-199 [Journal]
Gregory F. Lawler Recurrence and Transience for a Card Shuffling Model. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1995, v:4, n:, pp:133-142 [Journal]
Gregory F. Lawler Expected hitting times for a random walk on a connected graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1986, v:61, n:1, pp:85-92 [Journal]
Search in 0.001secs, Finished in 0.001secs
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