Svante Janson - RankMe

178 papers A* 2B 4C 7Journal 161Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Approximation of subgraph counts in the uniform attachment model. Comb. Probab. Comput. Johan Björklund, Cecilia Holmgren, Svante Janson, Tiffany Y. Y. Lo
2025	J	`jnl`	Bit-array-based alternatives to HyperLogLog. Theor. Comput. Sci. Svante Janson, Jérémie O. Lumbroso, Robert Sedgewick
2025	J	`jnl`	Fringe Trees for Random Trees With Given Vertex Degrees. Random Struct. Algorithms Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson
2025	J	`jnl`	Maximal Counts in the Stopped Occupancy Problem. CoRR Alexander Gnedin, Svante Janson, Yaakov Malinovsky
2024	C	`conf`	Bit-Array-Based Alternatives to HyperLogLog. AofA Svante Janson, Jérémie O. Lumbroso, Robert Sedgewick
2024	J	`jnl`	Central limit theorem for components in meandric systems through high moments. Comb. Probab. Comput. Svante Janson, Paul Thévenin
2024	C	`conf`	Depth-First Search Performance in Random Digraphs. AofA Philippe Jacquet, Svante Janson
2024	C	`conf`	Fringe Trees for Random Trees with Given Vertex Degrees. AofA Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson
2024	J	`jnl`	Identities and periodic oscillations of divide-and-conquer recurrences splitting at half. Adv. Appl. Math. Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai
2024	J	`jnl`	On Semi-Restricted Rock, Paper, Scissors. Electron. J. Comb. Svante Janson
2024	J	`jnl`	Periodic minimum in the count of binomial coefficients not divisible by a prime. CoRR Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai
2024	J	`jnl`	Phragmén's voting methods and justified representation. Math. Program. Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner
2024	J	`jnl`	The number of descendants in a random directed acyclic graph. Random Struct. Algorithms Svante Janson
2023	J	`jnl`	Estimating Global Subgraph Counts by Sampling. Electron. J. Comb. Svante Janson, Valentas Kurauskas
2023	J	`jnl`	Fluctuations of subgraph counts in graphon based random graphs. Comb. Probab. Comput. Bhaswar B. Bhattacharya, Anirban Chatterjee, Svante Janson
2023	J	`jnl`	On Knuth's conjecture for back and forward arcs in Depth First Search in a random digraph with geometric outdegree distribution. CoRR Svante Janson
2023	J	`jnl`	The Number of Occurrences of Patterns in a Random Tree or Forest Permutation. Electron. J. Comb. Svante Janson
2023	J	`jnl`	The number of descendants in a random directed acyclic graph. CoRR Svante Janson
2022	C	`conf`	Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution. AofA Philippe Jacquet, Svante Janson
2022	J	`jnl`	Depth-First Search performance in a random digraph with geometric outdegree distribution. CoRR Philippe Jacquet, Svante Janson
2022	J	`jnl`	Identities and periodic oscillations of divide-and-conquer recurrences splitting at half. CoRR Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai
2022	J	`jnl`	On convergence for graphexes. Eur. J. Comb. Svante Janson
2022	J	`jnl`	Successive minimum spanning trees. Random Struct. Algorithms Svante Janson, Gregory B. Sorkin
2022	J	`jnl`	The distance profile of rooted and unrooted simply generated trees. Comb. Probab. Comput. Gabriel Berzunza Ojeda, Svante Janson
2021	J	`jnl`	Hidden Words Statistics for Large Patterns. Electron. J. Comb. Svante Janson, Wojciech Szpankowski
2021	J	`jnl`	Phragmén's Voting Methods and Justified Representation. CoRR Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner
2021	J	`jnl`	Tree limits and limits of random trees. Comb. Probab. Comput. Svante Janson
2020	J	`jnl`	A graphon counter example. Discret. Math. Svante Janson
2020	J	`jnl`	Asymptotic normality in random graphs with given vertex degrees. Random Struct. Algorithms Svante Janson
2020	J	`jnl`	Central limit theorems for additive functionals and fringe trees in tries. CoRR Svante Janson
2020	C	`conf`	Hidden Words Statistics for Large Patterns. AofA Svante Janson, Wojciech Szpankowski
2020	J	`jnl`	Hidden Words Statistics for Large Patterns. CoRR Svante Janson, Wojciech Szpankowski
2020	J	`jnl`	Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns. Algorithmica Svante Janson
2020	J	`jnl`	Random graphs with given vertex degrees and switchings. Random Struct. Algorithms Svante Janson
2020	J	`jnl`	Rate of convergence for traditional Pólya urns. J. Appl. Probab. Svante Janson
2020	J	`jnl`	Strong convergence of infinite color balanced urns under uniform ergodicity. J. Appl. Probab. Antar Bandyopadhyay, Svante Janson, Debleena Thacker
2019	J	`jnl`	A modified bootstrap percolation on a random graph coupled with a lattice. Discret. Appl. Math. Svante Janson, Robert Kozma, Miklós Ruszinkó, Yury Sokolov
2019	J	`jnl`	Competing first passage percolation on random graphs with finite variance degrees. Random Struct. Algorithms Daniel Ahlberg, Maria Deijfen, Svante Janson
2019	J	`jnl`	Competition in growth and urns. Random Struct. Algorithms Daniel Ahlberg, Simon Griffiths, Svante Janson, Robert Morris
2019	J	`jnl`	Component structure of the configuration model: Barely supercritical case. Random Struct. Algorithms Remco van der Hofstad, Svante Janson, Malwina J. Luczak
2019	J	`jnl`	Inversions in Split Trees and Conditional Galton-Watson Trees. Comb. Probab. Comput. Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman
2019	J	`jnl`	Patterns in random permutations avoiding the pattern 321. Random Struct. Algorithms Svante Janson
2019	J	`jnl`	Preferential attachment without vertex growth: emergence of the giant component. CoRR Svante Janson, Lutz Warnke
2019	J	`jnl`	Random Recursive Trees and Preferential Attachment Trees are Random Split Trees. Comb. Probab. Comput. Svante Janson
2019	—	`conf`	Successive Minimum Spanning Trees. APPROX-RANDOM Svante Janson, Gregory B. Sorkin
2018	J	`jnl`	Graph properties, graph limits, and entropy. J. Graph Theory Hamed Hatami, Svante Janson, Balázs Szegedy
2018	C	`conf`	Inversions in Split Trees and Conditional Galton-Watson Trees. AofA Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman
2018	J	`jnl`	Non-Fringe Subtrees in Conditioned Galton - Watson Trees. Electron. J. Comb. Xing Shi Cai, Svante Janson
2018	C	`conf`	Patterns in Random Permutations Avoiding Some Other Patterns (Keynote Speakers). AofA Svante Janson
2018	J	`jnl`	Preferential Attachment When Stable. CoRR Svante Janson, Subhabrata Sen, Joel Spencer
2018	J	`jnl`	Thresholds quantifying proportionality criteria for election methods. CoRR Svante Janson
2017	J	`jnl`	Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications. ACM Trans. Algorithms Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai
2017	J	`jnl`	Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in m-ary Search Trees and Preferential Attachment Trees. Electron. J. Comb. Cecilia Holmgren, Svante Janson, Matas Sileikis
2017	J	`jnl`	On String Graph Limits and the Structure of a Typical String Graph. J. Graph Theory Svante Janson, Andrew J. Uzzell
2017	J	`jnl`	Packing random graphs and hypergraphs. Random Struct. Algorithms Béla Bollobás, Svante Janson, Alex Scott
2017	J	`jnl`	Patterns in Random Permutations Avoiding the Pattern 132. Comb. Probab. Comput. Svante Janson
2017	A*	`conf`	Phragmén's Voting Methods and Justified Representation. AAAI Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner
2017	J	`jnl`	The Greedy Independent Set in a Random Graph with Given Degrees. Random Struct. Algorithms Graham R. Brightwell, Svante Janson, Malwina J. Luczak
2016	J	`jnl`	A Unified Approach to Linear Probing Hashing with Buckets. Algorithmica Svante Janson, Alfredo Viola
2016	J	`jnl`	Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees. Random Struct. Algorithms Svante Janson
2016	J	`jnl`	Graph limits and hereditary properties. Eur. J. Comb. Svante Janson
2016	J	`jnl`	On the Length of a Random Minimum Spanning Tree. Comb. Probab. Comput. Colin Cooper, Alan M. Frieze, Nate Ince, Svante Janson, Joel Spencer
2016	J	`jnl`	Phragmén's and Thiele's election methods. CoRR Svante Janson
2016	J	`jnl`	The lower tail: Poisson approximation revisited. Random Struct. Algorithms Svante Janson, Lutz Warnke
2015	J	`jnl`	Maximal Clades in Random Binary Search Trees. Electron. J. Comb. Svante Janson
2015	J	`jnl`	More on quasi-random graphs, subgraph counts and graph limits. Eur. J. Comb. Svante Janson, Vera T. Sós
2015	J	`jnl`	On degenerate sums of J. Appl. Probab. Svante Janson
2015	J	`jnl`	On the tails of the limiting Quicksort distribution. CoRR Svante Janson
2014	J	`jnl`	A unified approach to linear probing hashing with buckets. CoRR Svante Janson, Alfredo Viola
2014	J	`jnl`	Asymptotic bias of some election methods. Ann. Oper. Res. Svante Janson
2014	J	`jnl`	Graphs where every k-subset of vertices is an identifying set. Discret. Math. Theor. Comput. Sci. Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Maarit Ranto
2014	J	`jnl`	Law of large numbers for the SIR epidemic on a random graph with given degrees. Random Struct. Algorithms Svante Janson, Malwina J. Luczak, Peter Windridge
2014	J	`jnl`	On Symmetry of Uniform and Preferential Attachment Graphs. Electron. J. Comb. Abram Magner, Svante Janson, Giorgios Kollias, Wojciech Szpankowski
2014	J	`jnl`	On the Spread of Random Graphs. Comb. Probab. Comput. Louigi Addario-Berry, Svante Janson, Colin McDiarmid
2014	J	`jnl`	On the Typical Structure of Graphs in a Monotone Property. Electron. J. Comb. Svante Janson, Andrew J. Uzzell
2014	J	`jnl`	The probability that a random multigraph is simple. II. J. Appl. Probab. Svante Janson
2014	J	`jnl`	Weighted Random Staircase Tableaux. Comb. Probab. Comput. Pawel Hitczenko, Svante Janson
2014	B	`conf`	Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences. LATIN Pawel Hitczenko, Svante Janson
2013	J	`jnl`	Coupon collecting and transversals of hypergraphs. Discret. Math. Theor. Comput. Sci. Marcel Wild, Svante Janson, Stephan G. Wagner, Dirk Laurie
2013	J	`jnl`	VCG Auction Mechanism Cost Expectations and Variances. CoRR Svante Janson, Gregory B. Sorkin
2012	J	`jnl`	Corrigendum to "The Mahonian probability distribution on words is asymptotically normal" [Adv. in Appl. Math. 46 (1-4) (2011) 109-124]. Adv. Appl. Math. E. Rodney Canfield, Svante Janson, Doron Zeilberger
2012	J	`jnl`	Generalized Galois Numbers, Inversions, Lattice Paths, Ferrers Diagrams and Limit Theorems. Electron. J. Comb. Svante Janson
2012	J	`jnl`	Hitting Times for Random Walks with Restarts. SIAM J. Discret. Math. Svante Janson, Yuval Peres
2012	J	`jnl`	Monotone Graph Limits and Quasimonotone Graphs. Internet Math. Béla Bollobás, Svante Janson, Oliver Riordan
2012	J	`jnl`	Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf CoRR James Allen Fill, Svante Janson, Mark Daniel Ward
2012	J	`jnl`	Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf. Electron. J. Comb. James Allen Fill, Svante Janson, Mark Daniel Ward
2012	J	`jnl`	Renewal theory in the analysis of tries and strings. Theor. Comput. Sci. Svante Janson
2012	J	`jnl`	Susceptibility in Inhomogeneous Random Graphs. Electron. J. Comb. Svante Janson, Oliver Riordan
2012	J	`jnl`	The Probability of the Alabama Paradox. J. Appl. Probab. Svante Janson, Svante Linusson
2012	J	`jnl`	The number of bit comparisons used by Quicksort: an average-case analysis CoRR James Allen Fill, Svante Janson
2011	J	`jnl`	Correlations for paths in random orientations of G(n, p) and G(n, m). Random Struct. Algorithms Sven Erick Alm, Svante Janson, Svante Linusson
2011	J	`jnl`	Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees. Random Struct. Algorithms Luc Devroye, Svante Janson
2011	J	`jnl`	Duality in inhomogeneous random graphs, and the cut metric. Random Struct. Algorithms Svante Janson, Oliver Riordan
2011	J	`jnl`	Generalized Stirling permutations, families of increasing trees and urn models. J. Comb. Theory A Svante Janson, Markus Kuba, Alois Panholzer
2011	J	`jnl`	On Vertex, Edge, and Vertex-Edge Random Graphs. Electron. J. Comb. Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman
2011	—	`conf`	On Vertex, Edge, and Vertex-edge Random Graphs. ANALCO Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman
2011	J	`jnl`	On covering by translates of a set. Random Struct. Algorithms Béla Bollobás, Svante Janson, Oliver Riordan
2011	J	`jnl`	Poset limits and exchangeable random posets. Comb. Svante Janson
2011	J	`jnl`	Quasi-random graphs and graph limits. Eur. J. Comb. Svante Janson
2011	J	`jnl`	Sparse random graphs with clustering. Random Struct. Algorithms Béla Bollobás, Svante Janson, Oliver Riordan
2011	J	`jnl`	The Mahonian probability distribution on words is asymptotically normal. Adv. Appl. Math. E. Rodney Canfield, Svante Janson, Doron Zeilberger
2010	J	`jnl`	A divertent generating function that can be summed and analysed analytically. Discret. Math. Theor. Comput. Sci. Svante Janson
2010	J	`jnl`	Asymptotic equivalence and contiguity of some random graphs. Random Struct. Algorithms Svante Janson
2010	J	`jnl`	On the Number of Perfect Matchings in Random Lifts. Comb. Probab. Comput. Catherine S. Greenhill, Svante Janson, Andrzej Rucinski
2010	J	`jnl`	Random graphs with forbidden vertex degrees. Random Struct. Algorithms Geoffrey R. Grimmett, Svante Janson
2009	J	`jnl`	A new approach to the giant component problem. Random Struct. Algorithms Svante Janson, Malwina J. Luczak
2009	B	`conf`	An optimal result for codes identifying sets of words. ISIT Svante Janson, Tero Laihonen
2009	J	`jnl`	Line-of-Sight Percolation. Comb. Probab. Comput. Béla Bollobás, Svante Janson, Oliver Riordan
2009	J	`jnl`	On the size of identifying codes in binary hypercubes. J. Comb. Theory A Svante Janson, Tero Laihonen
2009	J	`jnl`	Random Even Graphs. Electron. J. Comb. Geoffrey R. Grimmett, Svante Janson
2009	J	`jnl`	Renewal theory in analysis of tries and strings CoRR Svante Janson
2009	J	`jnl`	The Probability That a Random Multigraph is Simple. Comb. Probab. Comput. Svante Janson
2008	J	`jnl`	Convergence of Some Leader Election Algorithms. Discret. Math. Theor. Comput. Sci. Svante Janson, Christian Lavault, Guy Louchard
2008	J	`jnl`	Convergence of some leader election algorithms CoRR Svante Janson, Christian Lavault, Guy Louchard
2008	J	`jnl`	Dismantling Sparse Random Graphs. Comb. Probab. Comput. Svante Janson, Andrew Thomason
2008	J	`jnl`	Individual Displacements in Hashing with Coalesced Chains. Comb. Probab. Comput. Svante Janson
2008	J	`jnl`	Threshold Graph Limits and Random Threshold Graphs. Internet Math. Persi Diaconis, Susan P. Holmes, Svante Janson
2007	J	`jnl`	A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution. Comb. Probab. Comput. Svante Janson, Joel Spencer
2007	J	`jnl`	A simple solution to the Random Struct. Algorithms Svante Janson, Malwina J. Luczak
2007	J	`jnl`	On a Random Graph Related to Quantum Theory. Comb. Probab. Comput. Svante Janson
2007	J	`jnl`	Partial fillup and search time in LC tries. ACM Trans. Algorithms Svante Janson, Wojciech Szpankowski
2007	J	`jnl`	Rainbow Hamilton cycles in random regular graphs. Random Struct. Algorithms Svante Janson, Nicholas C. Wormald
2007	J	`jnl`	Spread-out percolation in R Random Struct. Algorithms Béla Bollobás, Svante Janson, Oliver Riordan
2007	J	`jnl`	The phase transition in inhomogeneous random graphs. Random Struct. Algorithms Béla Bollobás, Svante Janson, Oliver Riordan
2006	J	`jnl`	Addendum to "The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph". Random Struct. Algorithms Svante Janson, Johan Wästlund
2006	J	`jnl`	Left and Right Pathlengths in Random Binary Trees. Algorithmica Svante Janson
2006	—	`conf`	Partial Fillup and Search Time in LC Tries. ANALCO Svante Janson, Wojciech Szpankowski
2006	J	`jnl`	Random cutting and records in deterministic and random trees. Random Struct. Algorithms Svante Janson
2005	J	`jnl`	Asymptotic degree distribution in random recursive trees. Random Struct. Algorithms Svante Janson
2005	J	`jnl`	Individual displacements for linear probing hashing with different insertion policies. ACM Trans. Algorithms Svante Janson
2005	J	`jnl`	Individual displacements in hashing with coalesced chains CoRR Svante Janson
2005	J	`jnl`	Partial fillup and search time in LC tries CoRR Svante Janson, Wojciech Szpankowski
2005	J	`jnl`	The phase transition in the uniformly grown random graph has infinite order. Random Struct. Algorithms Béla Bollobás, Svante Janson, Oliver Riordan
2004	J	`jnl`	Large deviations for sums of partly dependent random variables. Random Struct. Algorithms Svante Janson
2004	J	`jnl`	On Generalized Random Railways. Comb. Probab. Comput. Hans Garmo, Svante Janson, Michal Karonski
2004	J	`jnl`	On average sequence complexity. Theor. Comput. Sci. Svante Janson, Stefano Lonardi, Wojciech Szpankowski
2004	B	`conf`	On the Average Sequence Complexity. CPM Svante Janson, Stefano Lonardi, Wojciech Szpankowski
2004	B	`conf`	On the Average Sequence Complexity. Data Compression Conference Svante Janson, Stefano Lonardi, Wojciech Szpankowski
2004	J	`jnl`	Quicksort with Unreliable Comparisons: A Probabilistic Analysis. Comb. Probab. Comput. Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott
2004	J	`jnl`	The Deletion Method For Upper Tail Estimates. Comb. Svante Janson, Andrzej Rucinski
2004	A*	`conf`	The number of bit comparisons used by Quicksort: an average-case analysis. SODA James Allen Fill, Svante Janson
2003	J	`jnl`	Cycles And Unicyclic Components In Random Graphs. Comb. Probab. Comput. Svante Janson
2003	J	`jnl`	On smallest triangles. Random Struct. Algorithms Geoffrey R. Grimmett, Svante Janson
2003	J	`jnl`	The Wiener Index of simply generated random trees. Random Struct. Algorithms Svante Janson
2002	J	`jnl`	Permutation Pseudographs And Contiguity. Comb. Probab. Comput. Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald
2002	J	`jnl`	Quicksort asymptotics. J. Algorithms James Allen Fill, Svante Janson
2002	J	`jnl`	Random dyadic tilings of the unit square. Random Struct. Algorithms Svante Janson, Dana Randall, Joel Spencer
2002	J	`jnl`	The infamous upper tail. Random Struct. Algorithms Svante Janson, Andrzej Rucinski
2001	J	`jnl`	Approximating the limiting Quicksort distribution. Random Struct. Algorithms James Allen Fill, Svante Janson
2001	J	`jnl`	Asymptotic distribution for the cost of linear probing hashing. Random Struct. Algorithms Svante Janson
2001	J	`jnl`	Erratum to Bounding the Unsatisfiability Threshold of Random 3-SAT. Random Struct. Algorithms Svante Janson, Yannis C. Stamatiou, Malvina Vamvakari
2000	J	`jnl`	A characterization of the set of fixed points of the Quicksort transformation CoRR James Allen Fill, Svante Janson
2000	J	`jnl`	Bounding the unsatisfiability threshold of random 3-SAT. Random Struct. Algorithms Svante Janson, Yannis C. Stamatiou, Malvina Vamvakari
2000	J	`jnl`	Growth of components in random graphs. Random Struct. Algorithms Svante Janson
2000	—	`book`	Random graphs. Svante Janson, Tomasz Luczak, Andrzej Rucinski
2000	J	`jnl`	Smoothness and decay properties of the limiting Quicksort density function CoRR James Allen Fill, Svante Janson
1999	J	`jnl`	On the variance of the random sphere of influence graph. Random Struct. Algorithms Pawel Hitczenko, Svante Janson, Joseph E. Yukich
1999	J	`jnl`	One, Two And Three Times Log N/N For Paths In A Complete Graph With Random Weights. Comb. Probab. Comput. Svante Janson
1998	J	`jnl`	New versions of Suen's correlation inequality. Random Struct. Algorithms Svante Janson
1997	J	`jnl`	Analysis of an Asymmetric Leader Election Algorithm. Electron. J. Comb. Svante Janson, Wojciech Szpankowski
1997	J	`jnl`	Hook Lengths in a Skew Young Diagram. Electron. J. Comb. Svante Janson
1997	J	`jnl`	Shellsort with three increments. Random Struct. Algorithms Svante Janson, Donald E. Knuth
1996	J	`jnl`	Random Covering Designs. J. Comb. Theory A Anant P. Godbole, Svante Janson
1995	J	`jnl`	A Graph Fourier Transform and Proportional Graphs. Random Struct. Algorithms Svante Janson
1995	J	`jnl`	Hamilton Cycles in a Random Tournament. Random Struct. Algorithms Svante Janson
1995	J	`jnl`	Perfect Matchings in Random s-Uniform Hypergraphs. Random Struct. Algorithms Alan M. Frieze, Svante Janson
1995	J	`jnl`	Random Regular Graphs: Asymptotic Distributions and Contiguity. Comb. Probab. Comput. Svante Janson
1995	J	`jnl`	The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph. Random Struct. Algorithms Svante Janson
1994	J	`jnl`	Introduction. Random Struct. Algorithms Alan M. Frieze, Svante Janson, Tomasz Luczak
1994	J	`jnl`	The Numbers of Spanning Trees, Hamilton cycles and Perfect Matchings in a Random Graph. Comb. Probab. Comput. Svante Janson
1993	J	`jnl`	Multicyclic Components in a Random Graph Process. Random Struct. Algorithms Svante Janson
1993	J	`jnl`	The Birth of the Giant Component. Random Struct. Algorithms Svante Janson, Donald E. Knuth, Tomasz Luczak, Boris G. Pittel
1992	J	`jnl`	Probabilistic Construction of Proportional Graphs. Random Struct. Algorithms Svante Janson, Joel Spencer
1992	J	`jnl`	Thresholds for classes of intersection graphs. Discret. Math. Svante Janson, Jan Kratochvíl
1991	J	`jnl`	Proportional Graphs. Random Struct. Algorithms Svante Janson, Jan Kratochvíl
1990	J	`jnl`	A Functional Limit Theorem for Random Graphs with Applications to Subgraph Count Statistics. Random Struct. Algorithms Svante Janson
1990	J	`jnl`	Poisson Approximation for Large Deviations. Random Struct. Algorithms Svante Janson
1990	J	`jnl`	Small Cliques in Random Graphs. Random Struct. Algorithms Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski