Svante Janson Cycles And Unicyclic Components In Random Graphs. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2003, v:12, n:1, pp:- [Journal]
Svante Janson The Numbers of Spanning Trees, Hamilton cycles and Perfect Matchings in a Random Graph. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1994, v:3, n:, pp:97-126 [Journal]
Svante Janson Random Regular Graphs: Asymptotic Distributions and Contiguity. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1995, v:4, n:, pp:369-405 [Journal]
Svante Janson One, Two And Three Times Log N/N For Paths In A Complete Graph With Random Weights. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1999, v:8, n:4, pp:- [Journal]
Svante Janson Asymptotic distribution for the cost of linear probing hashing. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2001, v:19, n:3-4, pp:438-471 [Journal]
Svante Janson The Wiener Index of simply generated random trees. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2003, v:22, n:4, pp:337-358 [Journal]
Svante Janson Large deviations for sums of partly dependent random variables. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2004, v:24, n:3, pp:234-248 [Journal]
Svante Janson Asymptotic degree distribution in random recursive trees. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2005, v:26, n:1-2, pp:69-83 [Journal]
Svante Janson Random cutting and records in deterministic and random trees. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2006, v:29, n:2, pp:139-179 [Journal]
Svante Janson A Functional Limit Theorem for Random Graphs with Applications to Subgraph Count Statistics. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1990, v:1, n:1, pp:15-38 [Journal]
Svante Janson Multicyclic Components in a Random Graph Process. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1993, v:4, n:1, pp:71-84 [Journal]
Svante Janson The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1995, v:7, n:4, pp:337-356 [Journal]
Svante Janson, Johan Wästlund Addendum to "The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph". [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2006, v:28, n:4, pp:511-512 [Journal]
Svante Janson Individual displacements for linear probing hashing with different insertion policies. [Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2005, v:1, n:2, pp:177-213 [Journal]