On the public citation graph
Transitional behaviors of the average cost of quicksort with median-of-(2t + 1)
0 signed · 39 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199808)13:1<17::aid-rsa2>3.0.co;2-vopenalex-snapshot
A Poisson * Negative Binomial Convolution Law for Random Polynomials over Finite Fields
inferredcites →https://doi.org/10.1002/rsa.3240070403openalex-snapshot
Optimal sampling strategies for quicksort
inferredcites →https://doi.org/10.1006/jnth.1997.2216openalex-snapshot
Sur la répartition des valeurs des fonctions arithmétiques. Le nombre de facteurs premiers d'un entier
inferredcites →https://doi.org/10.1007/978-94-011-6958-5_5openalex-snapshot
Ordinary differential equations
inferredcites →https://doi.org/10.1007/bf00289467openalex-snapshot
The analysis of Quicksort programs
inferredcites →https://doi.org/10.1007/bf00289612openalex-snapshot
A principle of independence for binary tree searching
inferredcites →https://doi.org/10.1007/bf01210596openalex-snapshot
On the expected height of fringe-balanced trees
inferredcites →https://doi.org/10.1007/bfb0016270openalex-snapshot
Optimal sorting of seven element sets
inferredcites →https://doi.org/10.1007/bfb0055064openalex-snapshot
Optimal sampling strategies in quicksort
inferredcites →https://doi.org/10.1016/0095-8956(87)90052-9openalex-snapshot
Bandwidths and profiles of trees
inferredcites →https://doi.org/10.1016/0196-6774(85)90003-3openalex-snapshot
The analysis of a fringe heuristic for binary search trees
inferredcites →https://doi.org/10.1016/0378-4754(90)90194-nopenalex-snapshot
Asymptotic approximations of integrals
inferredcites →https://doi.org/10.1016/b978-0-08-026482-0.50024-4openalex-snapshot
ASYMPTOTIC APPROXIMATIONS TO INTEGRALS
inferredcites →https://doi.org/10.1016/s0304-3975(98)00181-9openalex-snapshot
Presorting algorithms: An average-case point of view
inferredcites →https://doi.org/10.1017/9781108120241.010openalex-snapshot
Ordinary Differential Equations
inferredcites →https://doi.org/10.1017/cbo9780511754654.009openalex-snapshot
Asymptotic Expansions of Integrals
inferredcites →https://doi.org/10.1017/s0001867800050278openalex-snapshot
Saddle point approximation for the distribution of the sum of independent random variables
inferredcites →https://doi.org/10.1051/ita/1989230303171openalex-snapshot
Combinatorial analysis of quicksort algorithm
inferredcites →https://doi.org/10.1093/comjnl/19.4.322openalex-snapshot
Locally balanced binary trees
inferredcites →https://doi.org/10.1137/0403019openalex-snapshot
Singularity Analysis of Generating Functions
inferredcites →https://doi.org/10.37236/1358openalex-snapshot
On the Number of Descendants and Ascendants in Random Search Trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.10010openalex-snapshot
On a multivariate contraction method for random recursive structures with applications to Quicksort
inferred← citeshttps://doi.org/10.1007/s00453-006-0109-5openalex-snapshot
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
inferred← citeshttps://doi.org/10.1016/j.future.2017.01.034openalex-snapshot
Bidirectional Conditional Insertion Sort algorithm; An efficient progress on the classical insertion sort
inferred← citeshttps://doi.org/10.1016/s0196-6774(02)00208-0openalex-snapshot
An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms
inferred← citeshttps://doi.org/10.1017/s0963548302005321openalex-snapshot
The Wiener Index of Random Trees
inferred← citeshttps://doi.org/10.1017/s0963548316000018openalex-snapshot
Shape Measures of Random Increasing k-trees
inferred← citeshttps://doi.org/10.1137/s0895480104440134openalex-snapshot
Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees
inferred← citeshttps://doi.org/10.1142/9789812702715_0005openalex-snapshot
PHASE CHANGES IN RANDOM RECURSIVE STRUCTURES AND ALGORITHMS
inferred← citeshttps://doi.org/10.1145/2444016.2493373openalex-snapshot
Optimal selection and sorting via dynamic programming
inferred← citeshttps://doi.org/10.1145/2629340openalex-snapshot
Average Case and Distributional Analysis of Dual-Pivot Quicksort
inferred← citeshttps://doi.org/10.1214/07-aap457openalex-snapshot
A functional limit theorem for the profile of search trees
inferred← citeshttps://doi.org/10.1214/105051606000000187openalex-snapshot
Width and mode of the profile for some random trees of logarithmic height
inferred← citeshttps://doi.org/10.1214/ejp.v16-889openalex-snapshot
On the Asymptotic Internal Path Length and the Asymptotic Wiener Index of Random Split Trees
inferred← citeshttps://doi.org/10.46298/dmtcs.369openalex-snapshot
A survey of multivariate aspects of the contraction method
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.