| 2009 |
|---|
| 65 | EE | Svante Janson:
The Probability That a Random Multigraph is Simple.
Combinatorics, Probability & Computing 18(1-2): 205-225 (2009) |
| 64 | EE | Béla Bollobás,
Svante Janson,
Oliver Riordan:
Line-of-Sight Percolation.
Combinatorics, Probability & Computing 18(1-2): 83-106 (2009) |
| 63 | EE | Svante Janson,
Malwina J. Luczak:
A new approach to the giant component problem.
Random Struct. Algorithms 34(2): 197-216 (2009) |
| 2008 |
|---|
| 62 | EE | Svante Janson,
Christian Lavault,
Guy Louchard:
Convergence of some leader election algorithms
CoRR abs/0802.1389: (2008) |
| 61 | EE | Svante Janson,
Andrew Thomason:
Dismantling Sparse Random Graphs.
Combinatorics, Probability & Computing 17(2): 259-264 (2008) |
| 60 | EE | Svante Janson:
Individual Displacements in Hashing with Coalesced Chains.
Combinatorics, Probability & Computing 17(6): 799-814 (2008) |
| 2007 |
|---|
| 59 | EE | Svante Janson,
Wojciech Szpankowski:
Partial fillup and search time in LC tries.
ACM Transactions on Algorithms 3(4): (2007) |
| 58 | EE | Svante Janson,
Joel Spencer:
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution.
Combinatorics, Probability & Computing 16(4): 631-658 (2007) |
| 57 | EE | Svante Janson:
On a Random Graph Related to Quantum Theory.
Combinatorics, Probability & Computing 16(5): 757-766 (2007) |
| 56 | EE | Svante Janson,
Nicholas C. Wormald:
Rainbow Hamilton cycles in random regular graphs.
Random Struct. Algorithms 30(1-2): 35-49 (2007) |
| 55 | EE | Svante Janson,
Malwina J. Luczak:
A simple solution to the k-core problem.
Random Struct. Algorithms 30(1-2): 50-62 (2007) |
| 54 | EE | Béla Bollobás,
Svante Janson,
Oliver Riordan:
The phase transition in inhomogeneous random graphs.
Random Struct. Algorithms 31(1): 3-122 (2007) |
| 53 | EE | Béla Bollobás,
Svante Janson,
Oliver Riordan:
Spread-out percolation in Rd.
Random Struct. Algorithms 31(2): 239-246 (2007) |
| 2006 |
|---|
| 52 | EE | Svante Janson:
Left and Right Pathlengths in Random Binary Trees.
Algorithmica 46(3-4): 419-429 (2006) |
| 51 | EE | 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".
Random Struct. Algorithms 28(4): 511-512 (2006) |
| 50 | EE | Svante Janson:
Random cutting and records in deterministic and random trees.
Random Struct. Algorithms 29(2): 139-179 (2006) |
| 2005 |
|---|
| 49 | EE | Svante Janson:
Individual displacements for linear probing hashing with different insertion policies.
ACM Transactions on Algorithms 1(2): 177-213 (2005) |
| 48 | EE | Svante Janson,
Wojciech Szpankowski:
Partial fillup and search time in LC tries
CoRR abs/cs/0510017: (2005) |
| 47 | EE | Svante Janson:
Individual displacements in hashing with coalesced chains
CoRR abs/math/0502232: (2005) |
| 46 | EE | Béla Bollobás,
Svante Janson,
Oliver Riordan:
The phase transition in the uniformly grown random graph has infinite order.
Random Struct. Algorithms 26(1-2): 1-36 (2005) |
| 45 | EE | Svante Janson:
Asymptotic degree distribution in random recursive trees.
Random Struct. Algorithms 26(1-2): 69-83 (2005) |
| 2004 |
|---|
| 44 | EE | Svante Janson,
Stefano Lonardi,
Wojciech Szpankowski:
On the Average Sequence Complexity.
CPM 2004: 74-88 |
| 43 | EE | Svante Janson,
Stefano Lonardi,
Wojciech Szpankowski:
On the Average Sequence Complexity.
Data Compression Conference 2004: 542 |
| 42 | EE | James Allen Fill,
Svante Janson:
The number of bit comparisons used by Quicksort: an average-case analysis.
SODA 2004: 300-307 |
| 41 | EE | Svante Janson,
Andrzej Rucinski:
The Deletion Method For Upper Tail Estimates.
Combinatorica 24(4): 615-640 (2004) |
| 40 | | Hans Garmo,
Svante Janson,
Michal Karonski:
On Generalized Random Railways.
Combinatorics, Probability & Computing 13(1): 31-35 (2004) |
| 39 | EE | Laurent Alonso,
Philippe Chassaing,
Florent Gillet,
Svante Janson,
Edward M. Reingold,
René Schott:
Quicksort with Unreliable Comparisons: A Probabilistic Analysis.
Combinatorics, Probability & Computing 13(4-5): 419-449 (2004) |
| 38 | EE | Svante Janson:
Large deviations for sums of partly dependent random variables.
Random Struct. Algorithms 24(3): 234-248 (2004) |
| 37 | EE | Svante Janson,
Stefano Lonardi,
Wojciech Szpankowski:
On average sequence complexity.
Theor. Comput. Sci. 326(1-3): 213-227 (2004) |
| 2003 |
|---|
| 36 | | Svante Janson:
Cycles And Unicyclic Components In Random Graphs.
Combinatorics, Probability & Computing 12(1): (2003) |
| 35 | EE | Svante Janson:
The Wiener Index of simply generated random trees.
Random Struct. Algorithms 22(4): 337-358 (2003) |
| 34 | EE | Geoffrey R. Grimmett,
Svante Janson:
On smallest triangles.
Random Struct. Algorithms 23(2): 206-223 (2003) |
| 2002 |
|---|
| 33 | | Catherine S. Greenhill,
Svante Janson,
Jeong Han Kim,
Nicholas C. Wormald:
Permutation Pseudographs And Contiguity.
Combinatorics, Probability & Computing 11(3): (2002) |
| 32 | EE | James Allen Fill,
Svante Janson:
Quicksort asymptotics.
J. Algorithms 44(1): 4-28 (2002) |
| 31 | EE | Svante Janson,
Andrzej Rucinski:
The infamous upper tail.
Random Struct. Algorithms 20(3): 317-342 (2002) |
| 30 | EE | Svante Janson,
Dana Randall,
Joel Spencer:
Random dyadic tilings of the unit square.
Random Struct. Algorithms 21(3-4): 225-251 (2002) |
| 2001 |
|---|
| 29 | | Svante Janson,
Yannis C. Stamatiou,
Malvina Vamvakari:
Erratum to Bounding the Unsatisfiability Threshold of Random 3-SAT.
Random Struct. Algorithms 18(1): 99-100 (2001) |
| 28 | | James Allen Fill,
Svante Janson:
Approximating the limiting Quicksort distribution.
Random Struct. Algorithms 19(3-4): 376-406 (2001) |
| 27 | | Svante Janson:
Asymptotic distribution for the cost of linear probing hashing.
Random Struct. Algorithms 19(3-4): 438-471 (2001) |
| 2000 |
|---|
| 26 | EE | James Allen Fill,
Svante Janson:
Smoothness and decay properties of the limiting Quicksort density function
CoRR math.PR/0005235: (2000) |
| 25 | EE | James Allen Fill,
Svante Janson:
A characterization of the set of fixed points of the Quicksort transformation
CoRR math.PR/0005236: (2000) |
| 24 | | Svante Janson,
Yannis C. Stamatiou,
Malvina Vamvakari:
Bounding the unsatisfiability threshold of random 3-SAT.
Random Struct. Algorithms 17(2): 103-116 (2000) |
| 23 | | Svante Janson:
Growth of components in random graphs.
Random Struct. Algorithms 17(3-4): 343-356 (2000) |
| 1999 |
|---|
| 22 | | Svante Janson:
One, Two And Three Times Log N/N For Paths In A Complete Graph With Random Weights.
Combinatorics, Probability & Computing 8(4): (1999) |
| 21 | | Pawel Hitczenko,
Svante Janson,
Joseph E. Yukich:
On the variance of the random sphere of influence graph.
Random Struct. Algorithms 14(2): 139-152 (1999) |
| 1998 |
|---|
| 20 | | Svante Janson:
New versions of Suen's correlation inequality.
Random Struct. Algorithms 13(3-4): 467-483 (1998) |
| 1997 |
|---|
| 19 | EE | Svante Janson,
Wojciech Szpankowski:
Analysis of an Asymmetric Leader Election Algorithm.
Electr. J. Comb. 4(1): (1997) |
| 18 | EE | Svante Janson:
Hook Lengths in a Skew Young Diagram.
Electr. J. Comb. 4(1): (1997) |
| 17 | | Svante Janson,
Donald E. Knuth:
Shellsort with three increments.
Random Struct. Algorithms 10(1-2): 125-142 (1997) |
| 1996 |
|---|
| 16 | EE | Anant P. Godbole,
Svante Janson:
Random Covering Designs.
J. Comb. Theory, Ser. A 75(1): 85-98 (1996) |
| 1995 |
|---|
| 15 | | Svante Janson:
Random Regular Graphs: Asymptotic Distributions and Contiguity.
Combinatorics, Probability & Computing 4: 369-405 (1995) |
| 14 | | Svante Janson:
Hamilton Cycles in a Random Tournament.
Random Struct. Algorithms 6(2/3): 213-220 (1995) |
| 13 | | Svante Janson:
A Graph Fourier Transform and Proportional Graphs.
Random Struct. Algorithms 6(2/3): 341-352 (1995) |
| 12 | | Alan M. Frieze,
Svante Janson:
Perfect Matchings in Random s-Uniform Hypergraphs.
Random Struct. Algorithms 7(1): 41-58 (1995) |
| 11 | | Svante Janson:
The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph.
Random Struct. Algorithms 7(4): 337-356 (1995) |
| 1994 |
|---|
| 10 | | Svante Janson:
The Numbers of Spanning Trees, Hamilton cycles and Perfect Matchings in a Random Graph.
Combinatorics, Probability & Computing 3: 97-126 (1994) |
| 9 | | Alan M. Frieze,
Svante Janson,
Tomasz Luczak:
Introduction.
Random Struct. Algorithms 5(1): 1-3 (1994) |
| 1993 |
|---|
| 8 | | Svante Janson:
Multicyclic Components in a Random Graph Process.
Random Struct. Algorithms 4(1): 71-84 (1993) |
| 7 | | Svante Janson,
Donald E. Knuth,
Tomasz Luczak,
Boris Pittel:
The Birth of the Giant Component.
Random Struct. Algorithms 4(3): 233-359 (1993) |
| 1992 |
|---|
| 6 | EE | Svante Janson,
Jan Kratochvíl:
Thresholds for classes of intersection graphs.
Discrete Mathematics 108(1-3): 307-326 (1992) |
| 5 | | Svante Janson,
Joel Spencer:
Probabilistic Construction of Proportional Graphs.
Random Struct. Algorithms 3(2): 127-138 (1992) |
| 1991 |
|---|
| 4 | | Svante Janson,
Jan Kratochvíl:
Proportional Graphs.
Random Struct. Algorithms 2(2): 209-224 (1991) |
| 1990 |
|---|
| 3 | | Svante Janson:
A Functional Limit Theorem for Random Graphs with Applications to Subgraph Count Statistics.
Random Struct. Algorithms 1(1): 15-38 (1990) |
| 2 | | Svante Janson:
Poisson Approximation for Large Deviations.
Random Struct. Algorithms 1(2): 221-230 (1990) |
| 1 | | Andrew D. Barbour,
Svante Janson,
Michal Karonski,
Andrzej Rucinski:
Small Cliques in Random Graphs.
Random Struct. Algorithms 1(4): 403-434 (1990) |
