The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Johan Jonasson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Johan Jonasson
    On the Cover Time for Random Walks on Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:3, pp:265-279 [Journal]
  2. Johan Jonasson
    An upper bound on the cover time for powers of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:181-190 [Journal]
  3. Johan Jonasson
    Lollipop graphs are extremal for commute times. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:2, pp:131-142 [Journal]
  4. Johan Jonasson, Elchanan Mossel, Yuval Peres
    Percolation in a dependent random environment. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:4, pp:333-343 [Journal]

  5. Positive Influence and Negative Dependence. [Citation Graph (, )][DBLP]


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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002