| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Svante Janson |
Renewal theory in the analysis of tries and strings.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | James Allen Fill, Svante Janson, Mark Daniel Ward |
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | James Allen Fill, Svante Janson |
The number of bit comparisons used by Quicksort: an average-case analysis |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Svante Janson, Markus Kuba, Alois Panholzer |
Generalized Stirling permutations, families of increasing trees and urn models. |
J. Comb. Theory, Ser. A |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Quasi-random graphs and graph limits. |
Eur. J. Comb. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman |
On Vertex, Edge, and Vertex-Edge Random Graphs. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Béla Bollobás, Svante Janson, Oliver Riordan |
On covering by translates of a set. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Oliver Riordan |
Duality in inhomogeneous random graphs, and the cut metric. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Erick Alm, Svante Janson, Svante Linusson |
Correlations for paths in random orientations of G(n, p) and G(n, m). |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Svante Janson, Oliver Riordan |
Sparse random graphs with clustering. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Devroye, Svante Janson |
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees. |
Random Struct. Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Poset limits and exchangeable random posets. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
A divertent generating function that can be summed and analysed analytically. |
Discrete Mathematics & Theoretical Computer Science |
2010 |
DBLP BibTeX RDF |
|
| 1 | Geoffrey R. Grimmett, Svante Janson |
Random graphs with forbidden vertex degrees. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Asymptotic equivalence and contiguity of some random graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Catherine S. Greenhill, Svante Janson, Andrzej Rucinski |
On the Number of Perfect Matchings in Random Lifts. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Tero Laihonen |
On the size of identifying codes in binary hypercubes. |
J. Comb. Theory, Ser. A |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Geoffrey R. Grimmett, Svante Janson |
Random Even Graphs. |
Electr. J. Comb. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Svante Janson, Malwina J. Luczak |
A new approach to the giant component problem. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Svante Janson, Oliver Riordan |
Line-of-Sight Percolation. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
The Probability That a Random Multigraph is Simple. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Renewal theory in analysis of tries and strings |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Svante Janson, Tero Laihonen |
An optimal result for codes identifying sets of words. |
ISIT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Christian Lavault, Guy Louchard |
Convergence of Some Leader Election Algorithms. |
Discrete Mathematics & Theoretical Computer Science |
2008 |
DBLP BibTeX RDF |
|
| 1 | Svante Janson |
Individual Displacements in Hashing with Coalesced Chains. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Andrew Thomason |
Dismantling Sparse Random Graphs. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Persi Diaconis, Susan Holmes, Svante Janson |
Threshold Graph Limits and Random Threshold Graphs. |
Internet Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Christian Lavault, Guy Louchard |
Convergence of some leader election algorithms |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Svante Janson, Nicholas C. Wormald |
Rainbow Hamilton cycles in random regular graphs. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Svante Janson, Oliver Riordan |
The phase transition in inhomogeneous random graphs. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Svante Janson, Oliver Riordan |
Spread-out percolation in Rd. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Malwina J. Luczak |
A simple solution to the k-core problem. |
Random Struct. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
On a Random Graph Related to Quantum Theory. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Joel Spencer |
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Wojciech Szpankowski |
Partial fillup and search time in LC tries. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Digital trees, level-compressed tries, partial fillup, trees, probabilistic analysis, strings, Poissonization |
| 1 | Svante Janson |
Left and Right Pathlengths in Random Binary Trees. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Random cutting and records in deterministic and random trees. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Asymptotic degree distribution in random recursive trees. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Svante Janson, Oliver Riordan |
The phase transition in the uniformly grown random graph has infinite order. |
Random Struct. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Individual displacements for linear probing hashing with different insertion policies. |
ACM Transactions on Algorithms |
2005 |
DBLP DOI BibTeX RDF |
Robin Hood hashing, Hashing, linear probing |
| 1 | Svante Janson, Wojciech Szpankowski |
Partial fillup and search time in LC tries |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Svante Janson |
Individual displacements in hashing with coalesced chains |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Svante Janson, Stefano Lonardi, Wojciech Szpankowski |
On average sequence complexity. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Large deviations for sums of partly dependent random variables. |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Garmo, Svante Janson, Michal Karonski |
On Generalized Random Railways. |
Combinatorics, Probability & Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott |
Quicksort with Unreliable Comparisons: A Probabilistic Analysis. |
Combinatorics, Probability & Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Andrzej Rucinski |
The Deletion Method For Upper Tail Estimates. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 60F05 |
| 1 | James Allen Fill, Svante Janson |
The number of bit comparisons used by Quicksort: an average-case analysis. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Stefano Lonardi, Wojciech Szpankowski |
On the Average Sequence Complexity. |
CPM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Stefano Lonardi, Wojciech Szpankowski |
On the Average Sequence Complexity. (PDF / PS) |
Data Compression Conference |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
The Wiener Index of simply generated random trees. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Geoffrey R. Grimmett, Svante Janson |
On smallest triangles. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Cycles And Unicyclic Components In Random Graphs. |
Combinatorics, Probability & Computing |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Dana Randall, Joel Spencer |
Random dyadic tilings of the unit square. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Andrzej Rucinski |
The infamous upper tail. |
Random Struct. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald |
Permutation Pseudographs And Contiguity. |
Combinatorics, Probability & Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | James Allen Fill, Svante Janson |
Quicksort asymptotics. |
J. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | James Allen Fill, Svante Janson |
Approximating the limiting Quicksort distribution. |
Random Struct. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Asymptotic distribution for the cost of linear probing hashing. |
Random Struct. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Yannis C. Stamatiou, Malvina Vamvakari |
Erratum to Bounding the Unsatisfiability Threshold of Random 3-SAT. |
Random Struct. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Yannis C. Stamatiou, Malvina Vamvakari |
Bounding the unsatisfiability threshold of random 3-SAT. |
Random Struct. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Growth of components in random graphs. |
Random Struct. Algorithms |
2000 |
DBLP BibTeX RDF |
|
| 1 | James Allen Fill, Svante Janson |
A characterization of the set of fixed points of the Quicksort transformation |
CoRR |
2000 |
DBLP BibTeX RDF |
|
| 1 | James Allen Fill, Svante Janson |
Smoothness and decay properties of the limiting Quicksort density function |
CoRR |
2000 |
DBLP BibTeX RDF |
|
| 1 | Pawel Hitczenko, Svante Janson, Joseph E. Yukich |
On the variance of the random sphere of influence graph. |
Random Struct. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
One, Two And Three Times Log N/N For Paths In A Complete Graph With Random Weights. |
Combinatorics, Probability & Computing |
1999 |
DBLP BibTeX RDF |
|
| 1 | Svante Janson |
New versions of Suen's correlation inequality. |
Random Struct. Algorithms |
1998 |
DBLP BibTeX RDF |
|
| 1 | Svante Janson, Wojciech Szpankowski |
Analysis of an Asymmetric Leader Election Algorithm. |
Electr. J. Comb. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Svante Janson |
Hook Lengths in a Skew Young Diagram. |
Electr. J. Comb. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Svante Janson, Donald E. Knuth |
Shellsort with three increments. |
Random Struct. Algorithms |
1997 |
DBLP BibTeX RDF |
|
| 1 | Anant P. Godbole, Svante Janson |
Random Covering Designs. |
J. Comb. Theory, Ser. A |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
The Minimal Spanning Tree in a Complete Graph and a Functional Limit Theorem for Trees in a Random Graph. |
Random Struct. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
A Graph Fourier Transform and Proportional Graphs. |
Random Struct. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Hamilton Cycles in a Random Tournament. |
Random Struct. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Svante Janson |
Perfect Matchings in Random s-Uniform Hypergraphs. |
Random Struct. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Random Regular Graphs: Asymptotic Distributions and Contiguity. |
Combinatorics, Probability & Computing |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Svante Janson, Tomasz Luczak |
Introduction. |
Random Struct. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
The Numbers of Spanning Trees, Hamilton cycles and Perfect Matchings in a Random Graph. |
Combinatorics, Probability & Computing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Multicyclic Components in a Random Graph Process. |
Random Struct. Algorithms |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Donald E. Knuth, Tomasz Luczak, Boris Pittel |
The Birth of the Giant Component. |
Random Struct. Algorithms |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Jan Kratochvíl |
Thresholds for classes of intersection graphs. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Joel Spencer |
Probabilistic Construction of Proportional Graphs. |
Random Struct. Algorithms |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Jan Kratochvíl |
Proportional Graphs. |
Random Struct. Algorithms |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
Poisson Approximation for Large Deviations. |
Random Struct. Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski |
Small Cliques in Random Graphs. |
Random Struct. Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson |
A Functional Limit Theorem for Random Graphs with Applications to Subgraph Count Statistics. |
Random Struct. Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")