4 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DS2014★ 4 cited
Analysis of Branch Misses in Quicksort
Conrado Martínez, Markus E. Nebel, Sebastian Wild
The analysis of algorithms mostly relies on counting classic elementary operations like additions, multiplications, comparisons, swaps etc. This approach is often sufficient to qua…
math.PR2010★ 1 cited
Psi-series method in random trees and moments of high orders
Hua-Huai Chern, Hsien-Kuei Hwang, Conrado Martínez
An unusual and surprising expansion of the form \[ p_n = ρ^{-n-1}(6n +\tfrac{18}5+ \tfrac{336}{3125} n^{-5}+\tfrac{1008}{3125} n^{-6} +\text{smaller order terms}), \] as $n\to\inft…