default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSvante Janson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j133]Hsien-Kuei Hwang
, Svante Janson, Tsung-Hsi Tsai:
Identities and periodic oscillations of divide-and-conquer recurrences splitting at half. Adv. Appl. Math. 155: 102653 (2024)- [j132]Svante Janson:
On Semi-Restricted Rock, Paper, Scissors. Electron. J. Comb. 31(2) (2024) - [j131]Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner:
Phragmén's voting methods and justified representation. Math. Program. 203(1): 47-76 (2024) - [j130]Svante Janson:
The number of descendants in a random directed acyclic graph. Random Struct. Algorithms 64(3): 768-803 (2024) - [c16]Gabriel Berzunza Ojeda, Cecilia Holmgren, Svante Janson:
Fringe Trees for Random Trees with Given Vertex Degrees. AofA 2024: 1:1-1:13 - [c15]Svante Janson, Jérémie O. Lumbroso, Robert Sedgewick:
Bit-Array-Based Alternatives to HyperLogLog. AofA 2024: 5:1-5:19 - [c14]Philippe Jacquet, Svante Janson:
Depth-First Search Performance in Random Digraphs. AofA 2024: 30:1-30:15 - [i23]Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai:
Periodic minimum in the count of binomial coefficients not divisible by a prime. CoRR abs/2408.06817 (2024) - 2023
- [j129]Svante Janson:
The Number of Occurrences of Patterns in a Random Tree or Forest Permutation. Electron. J. Comb. 30(2) (2023) - [j128]Svante Janson, Valentas Kurauskas:
Estimating Global Subgraph Counts by Sampling. Electron. J. Comb. 30(2) (2023) - [j127]Bhaswar B. Bhattacharya, Anirban Chatterjee, Svante Janson:
Fluctuations of subgraph counts in graphon based random graphs. Comb. Probab. Comput. 32(3): 428-464 (2023) - [i22]Svante Janson:
On Knuth's conjecture for back and forward arcs in Depth First Search in a random digraph with geometric outdegree distribution. CoRR abs/2301.04131 (2023) - [i21]Svante Janson:
The number of descendants in a random directed acyclic graph. CoRR abs/2302.12467 (2023) - 2022
- [j126]Gabriel Berzunza Ojeda, Svante Janson:
The distance profile of rooted and unrooted simply generated trees. Comb. Probab. Comput. 31(3): 368-410 (2022) - [j125]Svante Janson:
On convergence for graphexes. Eur. J. Comb. 104: 103549 (2022) - [j124]Svante Janson, Gregory B. Sorkin:
Successive minimum spanning trees. Random Struct. Algorithms 61(1): 126-172 (2022) - [c13]Philippe Jacquet, Svante Janson:
Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution. AofA 2022: 11:1-11:15 - [i20]Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai:
Identities and periodic oscillations of divide-and-conquer recurrences splitting at half. CoRR abs/2210.10968 (2022) - [i19]Philippe Jacquet, Svante Janson:
Depth-First Search performance in a random digraph with geometric outdegree distribution. CoRR abs/2212.14865 (2022) - 2021
- [j123]Svante Janson, Wojciech Szpankowski:
Hidden Words Statistics for Large Patterns. Electron. J. Comb. 28(2): 2 (2021) - [j122]Svante Janson:
Tree limits and limits of random trees. Comb. Probab. Comput. 30(6): 849-893 (2021) - [i18]Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner:
Phragmén's Voting Methods and Justified Representation. CoRR abs/2102.12305 (2021) - 2020
- [j121]Svante Janson:
Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns. Algorithmica 82(3): 616-641 (2020) - [j120]Svante Janson:
A graphon counter example. Discret. Math. 343(6): 111836 (2020) - [j119]Antar Bandyopadhyay, Svante Janson, Debleena Thacker:
Strong convergence of infinite color balanced urns under uniform ergodicity. J. Appl. Probab. 57(3): 853-865 (2020) - [j118]Svante Janson:
Rate of convergence for traditional Pólya urns. J. Appl. Probab. 57(4): 1029-1044 (2020) - [j117]Svante Janson:
Asymptotic normality in random graphs with given vertex degrees. Random Struct. Algorithms 56(4): 1070-1116 (2020) - [j116]Svante Janson:
Random graphs with given vertex degrees and switchings. Random Struct. Algorithms 57(1): 3-31 (2020) - [c12]Svante Janson, Wojciech Szpankowski:
Hidden Words Statistics for Large Patterns. AofA 2020: 17:1-17:15 - [i17]Svante Janson:
Central limit theorems for additive functionals and fringe trees in tries. CoRR abs/2003.02725 (2020) - [i16]Svante Janson, Wojciech Szpankowski:
Hidden Words Statistics for Large Patterns. CoRR abs/2003.09584 (2020)
2010 – 2019
- 2019
- [j115]Svante Janson:
Random Recursive Trees and Preferential Attachment Trees are Random Split Trees. Comb. Probab. Comput. 28(1): 81-99 (2019) - [j114]Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman:
Inversions in Split Trees and Conditional Galton-Watson Trees. Comb. Probab. Comput. 28(3): 335-364 (2019) - [j113]Svante Janson, Robert Kozma, Miklós Ruszinkó, Yury Sokolov:
A modified bootstrap percolation on a random graph coupled with a lattice. Discret. Appl. Math. 258: 152-165 (2019) - [j112]Daniel Ahlberg, Simon Griffiths, Svante Janson, Robert Morris:
Competition in growth and urns. Random Struct. Algorithms 54(2): 211-227 (2019) - [j111]Remco van der Hofstad, Svante Janson, Malwina J. Luczak:
Component structure of the configuration model: Barely supercritical case. Random Struct. Algorithms 55(1): 3-55 (2019) - [j110]Svante Janson:
Patterns in random permutations avoiding the pattern 321. Random Struct. Algorithms 55(2): 249-270 (2019) - [j109]Daniel Ahlberg, Maria Deijfen, Svante Janson:
Competing first passage percolation on random graphs with finite variance degrees. Random Struct. Algorithms 55(3): 545-559 (2019) - [c11]Svante Janson, Gregory B. Sorkin:
Successive Minimum Spanning Trees. APPROX-RANDOM 2019: 60:1-60:16 - [i15]Svante Janson, Lutz Warnke:
Preferential attachment without vertex growth: emergence of the giant component. CoRR abs/1904.11861 (2019) - 2018
- [j108]Xing Shi Cai, Svante Janson:
Non-Fringe Subtrees in Conditioned Galton - Watson Trees. Electron. J. Comb. 25(3): 3 (2018) - [j107]Hamed Hatami, Svante Janson, Balázs Szegedy:
Graph properties, graph limits, and entropy. J. Graph Theory 87(2): 208-229 (2018) - [c10]Svante Janson:
Patterns in Random Permutations Avoiding Some Other Patterns (Keynote Speakers). AofA 2018: 6:1-6:12 - [c9]Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson, Fiona Skerman:
Inversions in Split Trees and Conditional Galton-Watson Trees. AofA 2018: 15:1-15:12 - [i14]Svante Janson, Subhabrata Sen, Joel Spencer:
Preferential Attachment When Stable. CoRR abs/1805.10653 (2018) - [i13]Svante Janson:
Thresholds quantifying proportionality criteria for election methods. CoRR abs/1810.06377 (2018) - 2017
- [j106]Cecilia Holmgren, Svante Janson, Matas Sileikis:
Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in m-ary Search Trees and Preferential Attachment Trees. Electron. J. Comb. 24(2): 2 (2017) - [j105]Svante Janson:
Patterns in Random Permutations Avoiding the Pattern 132. Comb. Probab. Comput. 26(1): 24-51 (2017) - [j104]Svante Janson, Andrew J. Uzzell:
On String Graph Limits and the Structure of a Typical String Graph. J. Graph Theory 84(4): 386-407 (2017) - [j103]Béla Bollobás, Svante Janson, Alex Scott:
Packing random graphs and hypergraphs. Random Struct. Algorithms 51(1): 3-13 (2017) - [j102]Graham R. Brightwell, Svante Janson, Malwina J. Luczak:
The Greedy Independent Set in a Random Graph with Given Degrees. Random Struct. Algorithms 51(4): 565-586 (2017) - [j101]Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai:
Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications. ACM Trans. Algorithms 13(4): 47:1-47:43 (2017) - [c8]Markus Brill, Rupert Freeman, Svante Janson, Martin Lackner:
Phragmén's Voting Methods and Justified Representation. AAAI 2017: 406-413 - 2016
- [j100]Svante Janson, Alfredo Viola:
A Unified Approach to Linear Probing Hashing with Buckets. Algorithmica 75(4): 724-781 (2016) - [j99]Colin Cooper, Alan M. Frieze, Nate Ince, Svante Janson, Joel Spencer:
On the Length of a Random Minimum Spanning Tree. Comb. Probab. Comput. 25(1): 89-107 (2016) - [j98]Svante Janson:
Graph limits and hereditary properties. Eur. J. Comb. 52: 321-337 (2016) - [j97]Svante Janson:
Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees. Random Struct. Algorithms 48(1): 57-101 (2016) - [j96]Svante Janson, Lutz Warnke:
The lower tail: Poisson approximation revisited. Random Struct. Algorithms 48(2): 219-246 (2016) - [i12]Svante Janson:
Phragmén's and Thiele's election methods. CoRR abs/1611.08826 (2016) - 2015
- [j95]Svante Janson:
Maximal Clades in Random Binary Search Trees. Electron. J. Comb. 22(1): 1 (2015) - [j94]Svante Janson, Vera T. Sós:
More on quasi-random graphs, subgraph counts and graph limits. Eur. J. Comb. 46: 134-160 (2015) - [j93]Svante Janson:
On degenerate sums of m-dependent variables. J. Appl. Probab. 52(4): 1146-1155 (2015) - [i11]Svante Janson:
On the tails of the limiting Quicksort distribution. CoRR abs/1508.07230 (2015) - 2014
- [j92]Svante Janson:
Asymptotic bias of some election methods. Ann. Oper. Res. 215(1): 89-136 (2014) - [j91]Svante Janson, Andrew J. Uzzell:
On the Typical Structure of Graphs in a Monotone Property. Electron. J. Comb. 21(3): 3 (2014) - [j90]Abram Magner, Svante Janson, Giorgios Kollias, Wojciech Szpankowski:
On Symmetry of Uniform and Preferential Attachment Graphs. Electron. J. Comb. 21(3): 3 (2014) - [j89]Louigi Addario-Berry, Svante Janson, Colin McDiarmid:
On the Spread of Random Graphs. Comb. Probab. Comput. 23(4): 477-504 (2014) - [j88]Pawel Hitczenko, Svante Janson:
Weighted Random Staircase Tableaux. Comb. Probab. Comput. 23(6): 1114-1147 (2014) - [j87]Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Maarit Ranto:
Graphs where every k-subset of vertices is an identifying set. Discret. Math. Theor. Comput. Sci. 16(1): 73-88 (2014) - [j86]Svante Janson:
The probability that a random multigraph is simple. II. J. Appl. Probab. 51(A): 123-137 (2014) - [j85]Svante Janson, Malwina J. Luczak, Peter Windridge:
Law of large numbers for the SIR epidemic on a random graph with given degrees. Random Struct. Algorithms 45(4): 726-763 (2014) - [c7]Pawel Hitczenko, Svante Janson:
Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences. LATIN 2014: 490-501 - [i10]Svante Janson, Alfredo Viola:
A unified approach to linear probing hashing with buckets. CoRR abs/1410.5967 (2014) - 2013
- [j84]Marcel Wild, Svante Janson, Stephan G. Wagner, Dirk Laurie:
Coupon collecting and transversals of hypergraphs. Discret. Math. Theor. Comput. Sci. 15(2): 259-270 (2013) - [i9]Svante Janson, Gregory B. Sorkin:
VCG Auction Mechanism Cost Expectations and Variances. CoRR abs/1310.1777 (2013) - 2012
- [j83]E. Rodney Canfield, Svante Janson, Doron Zeilberger:
Corrigendum to "The Mahonian probability distribution on words is asymptotically normal" [Adv. in Appl. Math. 46 (1-4) (2011) 109-124]. Adv. Appl. Math. 49(1): 77 (2012) - [j82]Svante Janson, Oliver Riordan:
Susceptibility in Inhomogeneous Random Graphs. Electron. J. Comb. 19(1): 31 (2012) - [j81]James Allen Fill, Svante Janson, Mark Daniel Ward:
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf. Electron. J. Comb. 19(2): 18 (2012) - [j80]Svante Janson:
Generalized Galois Numbers, Inversions, Lattice Paths, Ferrers Diagrams and Limit Theorems. Electron. J. Comb. 19(3): 34 (2012) - [j79]Béla Bollobás, Svante Janson, Oliver Riordan:
Monotone Graph Limits and Quasimonotone Graphs. Internet Math. 8(3): 187-231 (2012) - [j78]Svante Janson, Svante Linusson:
The Probability of the Alabama Paradox. J. Appl. Probab. 49(3): 773-794 (2012) - [j77]Svante Janson, Yuval Peres:
Hitting Times for Random Walks with Restarts. SIAM J. Discret. Math. 26(2): 537-547 (2012) - [j76]Svante Janson:
Renewal theory in the analysis of tries and strings. Theor. Comput. Sci. 416: 33-54 (2012) - [i8]James Allen Fill, Svante Janson:
The number of bit comparisons used by Quicksort: an average-case analysis. CoRR abs/1202.2595 (2012) - [i7]James Allen Fill, Svante Janson, Mark Daniel Ward:
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf. CoRR abs/1203.2670 (2012) - 2011
- [j75]E. Rodney Canfield, Svante Janson, Doron Zeilberger:
The Mahonian probability distribution on words is asymptotically normal. Adv. Appl. Math. 46(1-4): 109-124 (2011) - [j74]Svante Janson:
Poset limits and exchangeable random posets. Comb. 31(5): 529-563 (2011) - [j73]Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman:
On Vertex, Edge, and Vertex-Edge Random Graphs. Electron. J. Comb. 18(1) (2011) - [j72]Svante Janson:
Quasi-random graphs and graph limits. Eur. J. Comb. 32(7): 1054-1083 (2011) - [j71]Svante Janson, Markus Kuba, Alois Panholzer:
Generalized Stirling permutations, families of increasing trees and urn models. J. Comb. Theory A 118(1): 94-114 (2011) - [j70]Béla Bollobás, Svante Janson, Oliver Riordan:
On covering by translates of a set. Random Struct. Algorithms 38(1-2): 33-67 (2011) - [j69]Béla Bollobás, Svante Janson, Oliver Riordan:
Sparse random graphs with clustering. Random Struct. Algorithms 38(3): 269-323 (2011) - [j68]Luc Devroye, Svante Janson:
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees. Random Struct. Algorithms 38(4): 381-395 (2011) - [j67]Svante Janson, Oliver Riordan:
Duality in inhomogeneous random graphs, and the cut metric. Random Struct. Algorithms 39(3): 399-411 (2011) - [j66]Sven Erick Alm, Svante Janson, Svante Linusson:
Correlations for paths in random orientations of G(n, p) and G(n, m). Random Struct. Algorithms 39(4): 486-506 (2011) - [c6]Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman:
On Vertex, Edge, and Vertex-edge Random Graphs. ANALCO 2011: 16-22 - 2010
- [j65]Catherine S. Greenhill, Svante Janson, Andrzej Rucinski:
On the Number of Perfect Matchings in Random Lifts. Comb. Probab. Comput. 19(5-6): 791-817 (2010) - [j64]Svante Janson:
A divertent generating function that can be summed and analysed analytically. Discret. Math. Theor. Comput. Sci. 12(2): 1-22 (2010) - [j63]Svante Janson:
Asymptotic equivalence and contiguity of some random graphs. Random Struct. Algorithms 36(1): 26-45 (2010) - [j62]Geoffrey R. Grimmett, Svante Janson:
Random graphs with forbidden vertex degrees. Random Struct. Algorithms 37(2): 137-175 (2010)
2000 – 2009
- 2009
- [j61]Geoffrey R. Grimmett, Svante Janson:
Random Even Graphs. Electron. J. Comb. 16(1) (2009) - [j60]Béla Bollobás, Svante Janson, Oliver Riordan:
Line-of-Sight Percolation. Comb. Probab. Comput. 18(1-2): 83-106 (2009) - [j59]Svante Janson:
The Probability That a Random Multigraph is Simple. Comb. Probab. Comput. 18(1-2): 205-225 (2009) - [j58]Svante Janson, Tero Laihonen:
On the size of identifying codes in binary hypercubes. J. Comb. Theory A 116(5): 1087-1096 (2009) - [j57]Svante Janson, Malwina J. Luczak:
A new approach to the giant component problem. Random Struct. Algorithms 34(2): 197-216 (2009) - [c5]Svante Janson, Tero Laihonen:
An optimal result for codes identifying sets of words. ISIT 2009: 2547-2551 - [i6]Svante Janson:
Renewal theory in analysis of tries and strings. CoRR abs/0912.2174 (2009) - 2008
- [j56]Svante Janson, Andrew Thomason:
Dismantling Sparse Random Graphs. Comb. Probab. Comput. 17(2): 259-264 (2008) - [j55]Svante Janson:
Individual Displacements in Hashing with Coalesced Chains. Comb. Probab. Comput. 17(6): 799-814 (2008) - [j54]Svante Janson, Christian Lavault, Guy Louchard:
Convergence of Some Leader Election Algorithms. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j53]Persi Diaconis, Susan P. Holmes, Svante Janson:
Threshold Graph Limits and Random Threshold Graphs. Internet Math. 5(3): 267-320 (2008) - [i5]Svante Janson, Christian Lavault, Guy Louchard:
Convergence of some leader election algorithms. CoRR abs/0802.1389 (2008) - 2007
- [j52]Svante Janson, Joel Spencer:
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution. Comb. Probab. Comput. 16(4): 631-658 (2007) - [j51]Svante Janson:
On a Random Graph Related to Quantum Theory. Comb. Probab. Comput. 16(5): 757-766 (2007) - [j50]Svante Janson, Nicholas C. Wormald:
Rainbow Hamilton cycles in random regular graphs. Random Struct. Algorithms 30(1-2): 35-49 (2007) - [j49]Svante Janson, Malwina J. Luczak:
A simple solution to the k-core problem. Random Struct. Algorithms 30(1-2): 50-62 (2007) - [j48]Béla Bollobás, Svante Janson, Oliver Riordan:
The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1): 3-122 (2007) - [j47]Béla Bollobás, Svante Janson, Oliver Riordan:
Spread-out percolation in Rd. Random Struct. Algorithms 31(2): 239-246 (2007) - [j46]Svante Janson, Wojciech Szpankowski:
Partial fillup and search time in LC tries. ACM Trans. Algorithms 3(4): 44 (2007) - 2006
- [j45]Svante Janson:
Left and Right Pathlengths in Random Binary Trees. Algorithmica 46(3-4): 419-429 (2006) - [j44]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) - [j43]Svante Janson:
Random cutting and records in deterministic and random trees. Random Struct. Algorithms 29(2): 139-179 (2006) - [c4]Svante Janson, Wojciech Szpankowski:
Partial Fillup and Search Time in LC Tries. ANALCO 2006: 223-229 - 2005
- [j42]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) - [j41]Svante Janson:
Asymptotic degree distribution in random recursive trees. Random Struct. Algorithms 26(1-2): 69-83 (2005) - [j40]Svante Janson:
Individual displacements for linear probing hashing with different insertion policies. ACM Trans. Algorithms 1(2): 177-213 (2005) - [i4]Svante Janson, Wojciech Szpankowski:
Partial fillup and search time in LC tries. CoRR abs/cs/0510017 (2005) - [i3]Svante Janson:
Individual displacements in hashing with coalesced chains. CoRR abs/math/0502232 (2005) - 2004
- [j39]Svante Janson, Andrzej Rucinski:
The Deletion Method For Upper Tail Estimates. Comb. 24(4): 615-640 (2004) - [j38]Hans Garmo, Svante Janson, Michal Karonski:
On Generalized Random Railways. Comb. Probab. Comput. 13(1): 31-35 (2004) - [j37]Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott:
Quicksort with Unreliable Comparisons: A Probabilistic Analysis. Comb. Probab. Comput. 13(4-5): 419-449 (2004) - [j36]Svante Janson:
Large deviations for sums of partly dependent random variables. Random Struct. Algorithms 24(3): 234-248 (2004) - [j35]Svante Janson, Stefano Lonardi, Wojciech Szpankowski:
On average sequence complexity. Theor. Comput. Sci. 326(1-3): 213-227 (2004) - [c3]Svante Janson, Stefano Lonardi, Wojciech Szpankowski:
On the Average Sequence Complexity. CPM 2004: 74-88 - [c2]Svante Janson, Stefano Lonardi, Wojciech Szpankowski:
On the Average Sequence Complexity. Data Compression Conference 2004: 542 - [c1]James Allen Fill, Svante Janson:
The number of bit comparisons used by Quicksort: an average-case analysis. SODA 2004: 300-307 - 2003
- [j34]Svante Janson:
Cycles And Unicyclic Components In Random Graphs. Comb. Probab. Comput. 12(1): 27-52 (2003) - [j33]Svante Janson:
The Wiener Index of simply generated random trees. Random Struct. Algorithms 22(4): 337-358 (2003) - [j32]Geoffrey R. Grimmett, Svante Janson:
On smallest triangles. Random Struct. Algorithms 23(2): 206-223 (2003) - 2002
- [j31]Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald:
Permutation Pseudographs And Contiguity. Comb. Probab. Comput. 11(3): 273-298 (2002) - [j30]James Allen Fill, Svante Janson:
Quicksort asymptotics. J. Algorithms 44(1): 4-28 (2002) - [j29]Svante Janson, Andrzej Rucinski:
The infamous upper tail. Random Struct. Algorithms 20(3): 317-342 (2002) - [j28]Svante Janson, Dana Randall, Joel Spencer:
Random dyadic tilings of the unit square. Random Struct. Algorithms 21(3-4): 225-251 (2002) - 2001
- [j27]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) - [j26]James Allen Fill, Svante Janson:
Approximating the limiting Quicksort distribution. Random Struct. Algorithms 19(3-4): 376-406 (2001) - [j25]Svante Janson:
Asymptotic distribution for the cost of linear probing hashing. Random Struct. Algorithms 19(3-4): 438-471 (2001) - 2000
- [b1]Svante Janson, Tomasz Luczak, Andrzej Rucinski:
Random graphs. Wiley-Interscience series in discrete mathematics and optimization, Wiley 2000, ISBN 978-0-471-17541-4, pp. I-XI, 1-333 - [j24]Svante Janson, Yannis C. Stamatiou, Malvina Vamvakari:
Bounding the unsatisfiability threshold of random 3-SAT. Random Struct. Algorithms 17(2): 103-116 (2000) - [j23]Svante Janson:
Growth of components in random graphs. Random Struct. Algorithms 17(3-4): 343-356 (2000) - [i2]James Allen Fill, Svante Janson:
Smoothness and decay properties of the limiting Quicksort density function. CoRR math.PR/0005235 (2000) - [i1]James Allen Fill, Svante Janson:
A characterization of the set of fixed points of the Quicksort transformation. CoRR math.PR/0005236 (2000)
1990 – 1999
- 1999
- [j22]Svante Janson:
One, Two And Three Times Log N/N For Paths In A Complete Graph With Random Weights. Comb. Probab. Comput. 8(4): 347-361 (1999) - [j21]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
- [j20]Svante Janson:
New versions of Suen's correlation inequality. Random Struct. Algorithms 13(3-4): 467-483 (1998) - 1997
- [j19]Svante Janson:
Hook Lengths in a Skew Young Diagram. Electron. J. Comb. 4(1) (1997) - [j18]Svante Janson, Wojciech Szpankowski:
Analysis of an Asymmetric Leader Election Algorithm. Electron. J. Comb. 4(1) (1997) - [j17]Svante Janson, Donald E. Knuth:
Shellsort with three increments. Random Struct. Algorithms 10(1-2): 125-142 (1997) - 1996
- [j16]Anant P. Godbole, Svante Janson:
Random Covering Designs. J. Comb. Theory A 75(1): 85-98 (1996) - 1995
- [j15]Svante Janson:
Random Regular Graphs: Asymptotic Distributions and Contiguity. Comb. Probab. Comput. 4: 369-405 (1995) - [j14]Svante Janson:
Hamilton Cycles in a Random Tournament. Random Struct. Algorithms 6(2/3): 213-220 (1995) - [j13]Svante Janson:
A Graph Fourier Transform and Proportional Graphs. Random Struct. Algorithms 6(2/3): 341-352 (1995) - [j12]Alan M. Frieze, Svante Janson:
Perfect Matchings in Random s-Uniform Hypergraphs. Random Struct. Algorithms 7(1): 41-58 (1995) - [j11]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
- [j10]Svante Janson:
The Numbers of Spanning Trees, Hamilton cycles and Perfect Matchings in a Random Graph. Comb. Probab. Comput. 3: 97-126 (1994) - [j9]Alan M. Frieze, Svante Janson, Tomasz Luczak:
Introduction. Random Struct. Algorithms 5(1): 1-3 (1994) - 1993
- [j8]Svante Janson:
Multicyclic Components in a Random Graph Process. Random Struct. Algorithms 4(1): 71-84 (1993) - [j7]Svante Janson, Donald E. Knuth, Tomasz Luczak, Boris G. Pittel:
The Birth of the Giant Component. Random Struct. Algorithms 4(3): 233-359 (1993) - 1992
- [j6]Svante Janson, Jan Kratochvíl:
Thresholds for classes of intersection graphs. Discret. Math. 108(1-3): 307-326 (1992) - [j5]Svante Janson, Joel Spencer:
Probabilistic Construction of Proportional Graphs. Random Struct. Algorithms 3(2): 127-138 (1992) - 1991
- [j4]Svante Janson, Jan Kratochvíl:
Proportional Graphs. Random Struct. Algorithms 2(2): 209-224 (1991) - 1990
- [j3]Svante Janson:
A Functional Limit Theorem for Random Graphs with Applications to Subgraph Count Statistics. Random Struct. Algorithms 1(1): 15-38 (1990) - [j2]Svante Janson:
Poisson Approximation for Large Deviations. Random Struct. Algorithms 1(2): 221-230 (1990) - [j1]Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski:
Small Cliques in Random Graphs. Random Struct. Algorithms 1(4): 403-434 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
