Algorithms, random tree models and combinatorial objects

zbMATH Open1250.05112MaRDI QIDQ3082005FDOQ3082005

Authors: Alois Panholzer 

Publication date: 9 March 2011

Recommendations

• Mini-workshop: Random trees, information and algorithms. Abstracts from the mini-workshop held April 24--30, 2011
• Random binary trees: from the average case analysis to the asymptotics of distributions
• The properties of random trees
• A probabilistic analysis of some tree algorithms
• Analysis of the total costs for variants of the union-find algorithm

zbMATH Keywords

pills problemcannibal urnOK Corral problemQuick Find Weighted (QFW)

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (8)

• Enumeration and randomized constructions of hypertrees
• Analysis of the total costs for variants of the union-find algorithm
• 2005 international conference on analysis of algorithms. Papers from the conference, Barcelona, Spain, June 6--10, 2005.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probability, trees and algorithms. Abstracts from the workshop held November 2--8, 2014.
• Searching Trees: An Essay
• The combinatorics of discrete time-trees: theory and open problems

This page was built for publication: Algorithms, random tree models and combinatorial objects

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