On the Expected Depth of Random Circuits
From MaRDI portal
Publication:4256686
DOI10.1017/S096354839900382XzbMath0941.68001OpenAlexW2001346451MaRDI QIDQ4256686
Kurt Mehlhorn, Sunil Arya, Mordecai J. Golin
Publication date: 7 March 2000
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s096354839900382x
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Mathematical problems of computer architecture (68M07)
Related Items (9)
Longest Path Distance in Random Circuits ⋮ Depth Properties of scaled attachment random recursive trees ⋮ A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits ⋮ The number of descendants in a random directed acyclic graph ⋮ Shape Measures of Random Increasing k-trees ⋮ Analysis of a generalized Friedman's urn with multiple drawings ⋮ Profiles of random trees: correlation and width of random recursive trees and binary search trees ⋮ The degree profile in some classes of random graphs that generalize recursive trees ⋮ On parallel time in population protocols
This page was built for publication: On the Expected Depth of Random Circuits