172 results on '"Svante Janson"'
Search Results
2. Bit-Array-Based Alternatives to HyperLogLog.
3. Fringe Trees for Random Trees with Given Vertex Degrees.
4. The number of descendants in a random directed acyclic graph.
5. Phragmén's voting methods and justified representation.
6. Periodic minimum in the count of binomial coefficients not divisible by a prime.
7. On Semi-Restricted Rock, Paper, Scissors.
8. Fluctuations of subgraph counts in graphon based random graphs.
9. Identities and periodic oscillations of divide-and-conquer recurrences splitting at half.
10. Depth-First Search Performance in a Random Digraph with Geometric Degree Distribution.
11. Successive minimum spanning trees.
12. The distance profile of rooted and unrooted simply generated trees.
13. On Knuth's conjecture for back and forward arcs in Depth First Search in a random digraph with geometric outdegree distribution.
14. The number of descendants in a random directed acyclic graph.
15. The Number of Occurrences of Patterns in a Random Tree or Forest Permutation.
16. Estimating Global Subgraph Counts by Sampling.
17. Hidden Words Statistics for Large Patterns.
18. Tree limits and limits of random trees.
19. Successive Minimum Spanning Trees.
20. Asymptotic normality in random graphs with given vertex degrees.
21. Random graphs with given vertex degrees and switchings.
22. Strong convergence of infinite color balanced urns under uniform ergodicity.
23. Rate of convergence for traditional Pólya urns.
24. Patterns in Random Permutations Avoiding Some Sets of Multiple Patterns.
25. Depth-First Search performance in a random digraph with geometric outdegree distribution.
26. Identities and periodic oscillations of divide-and-conquer recurrences splitting at half.
27. Inversions in Split Trees and Conditional Galton-Watson Trees.
28. Patterns in Random Permutations Avoiding Some Other Patterns (Keynote Speakers).
29. Component structure of the configuration model: Barely supercritical case.
30. Competing first passage percolation on random graphs with finite variance degrees.
31. Competition in growth and urns.
32. Patterns in random permutations avoiding the pattern 321.
33. A modified bootstrap percolation on a random graph coupled with a lattice.
34. Inversions in Split Trees and Conditional Galton-Watson Trees.
35. Random Recursive Trees and Preferential Attachment Trees are Random Split Trees.
36. Phragmén's Voting Methods and Justified Representation.
37. Phragmén's Voting Methods and Justified Representation.
38. Hidden Words Statistics for Large Patterns.
39. Central limit theorems for additive functionals and fringe trees in tries.
40. On convergence for graphexes.
41. Graph properties, graph limits, and entropy.
42. On String Graph Limits and the Structure of a Typical String Graph.
43. The Greedy Independent Set in a Random Graph with Given Degrees.
44. Packing random graphs and hypergraphs.
45. Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications.
46. Patterns in Random Permutations Avoiding the Pattern 132.
47. Preferential attachment without vertex growth: emergence of the giant component.
48. Hidden Words Statistics for Large Patterns.
49. The lower tail: Poisson approximation revisited.
50. Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.