Probability, trees and algorithms. Abstracts from the workshop held November 2--8, 2014.
DOI10.4171/OWR/2014/50zbMATH Open1349.00142OpenAlexW2401360348MaRDI QIDQ347231FDOQ347231
Authors:
Publication date: 30 November 2016
Published in: Oberwolfach Reports (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4171/owr/2014/50
Recommendations
- Mini-workshop: Random trees, information and algorithms. Abstracts from the mini-workshop held April 24--30, 2011
- Random trees. Abstracts from the workshop held January 18th -- January 24th, 2009.
- A probabilistic analysis of some tree algorithms
- scientific article
- Algorithms, random tree models and combinatorial objects
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Central limit and other weak theorems (60F05) Analysis of algorithms (68W40) Searching and sorting (68P10) Combinatorial probability (60C05) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to probability theory (60-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Collections of abstracts of lectures (00B05)
Cites Work
- Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
- Fires on trees
- The cut-tree of large recursive trees
- The cut-tree of large Galton-Watson trees and the Brownian CRT
- The vertex-cut-tree of Galton-Watson trees converging to a stable tree
- Reversing the cut tree of the Brownian continuum random tree
Cited In (2)
This page was built for publication: Probability, trees and algorithms. Abstracts from the workshop held November 2--8, 2014.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347231)
