The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Svante Janson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  52. Partial fillup and search time in LC tries [Citation Graph (, )][DBLP]


  53. Convergence of some leader election algorithms [Citation Graph (, )][DBLP]


  54. Renewal theory in analysis of tries and strings [Citation Graph (, )][DBLP]


  55. On a Random Graph Related to Quantum Theory. [Citation Graph (, )][DBLP]


  56. A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution. [Citation Graph (, )][DBLP]


  57. Dismantling Sparse Random Graphs. [Citation Graph (, )][DBLP]


  58. Individual Displacements in Hashing with Coalesced Chains. [Citation Graph (, )][DBLP]


  59. The Probability That a Random Multigraph is Simple. [Citation Graph (, )][DBLP]


  60. Line-of-Sight Percolation. [Citation Graph (, )][DBLP]


  61. Convergence of Some Leader Election Algorithms. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002