8 citations · 10 across the 10 of their papers we have counts for
4 papers · 1 filter
The Horton-Strahler number of butterfly trees
John Peca-Medlin
The Horton-Strahler (HS) number, a classical measure of branching complexity arising in hydrology and register allocation, is studied for butterfly trees, a recursive family of bin…
Heights of butterfly trees
John Peca-Medlin, Chenyang Zhong
Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding inter…
Pivot probabilities and norm effects in Gaussian elimination for -ensembles
Kenji Gunawan, John Peca-Medlin
We analyze pivot probabilities in Gaussian elimination with partial pivoting (GEPP) for random matrix ensembles. For GUE matrices, we resolve a previously reported dis…
On the longest increasing subsequence and number of cycles of butterfly permutations
John Peca-Medlin, Chenyang Zhong
One method to generate random permutations involves using Gaussian elimination with partial pivoting (GEPP) on a random matrix and storing the permutation matrix factor fro…