On the Expected Depth of Random Circuits

DOI10.1017/S096354839900382XMaRDI QIDQ4256686zbMATH OpenOpenAlexFDO

Authors Sunil Arya, K. Mehlhorn, 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

zbMATH Keywords

random circuits

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Mathematical problems of computer architecture (68M07)

Recommendations

• On the depth of randomly generated circuits
• scientific article; zbMATH DE number 1372652
• On the internal structure of random recursive circuits
• Longest path distance in random circuits
• scientific article; zbMATH DE number 1129497

Cited in

(14)

• A generalized Pólya urn and limit laws for the number of outputs in a family of random circuits
• On parallel time in population protocols
• Analysis of a generalized Friedman's urn with multiple drawings
• Outputs in random f-ary recursive circuits
• Depth properties of scaled attachment random recursive trees
• Longest path distance in random circuits
• scientific article; zbMATH DE number 1129497 (Why is no real title available?)
• On the depth of randomly generated circuits
• scientific article; zbMATH DE number 1372652 (Why is no real title available?)
• The degree profile in some classes of random graphs that generalize recursive trees
• Shape measures of random increasing k-trees
• Profiles of random trees: correlation and width of random recursive trees and binary search trees
• The number of descendants in a random directed acyclic graph
• Approximation of subgraph counts in the uniform attachment model

This page was built for publication: On the Expected Depth of Random Circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256686)