Zur Kurzanzeige

Mini-Workshop: Random Trees, Information and Algorithms

dc.date.accessioned2019-10-24T14:17:29Z
dc.date.available2019-10-24T14:17:29Z
dc.date.issued2011
dc.identifier.urihttp://publications.mfo.de/handle/mfo/3238
dc.description.abstractThe subject of this Mini-Workshop is the probabilistic analysis of random tree models that originate from applications in Computer Science. Emphasis is put on their connections to algorithms and information theory. Trees with a stochastic growth dynamic appear in Computer Science as data structures, in the context of coding schemes as well as connected to fundamental algorithms such as sorting, searching and selecting. The focus of this Mini-Workshop is on probabilistic and analytic techniques that have been developed recently in the asymptotic analysis of random trees such as martingale methods, connections to branching random walks, the contraction method, the method of moments as well as various techniques based on generating functions.
dc.titleMini-Workshop: Random Trees, Information and Algorithms
dc.rights.licenseDieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden.de
dc.rights.licenseThis document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties.en
dc.identifier.doi10.14760/OWR-2011-23
local.series.idOWR-2011-23
local.subject.msc68
local.subject.msc60
local.sortindex678
local.date-range24 Apr - 30 Apr 2011
local.workshopcode1117c
local.workshoptitleMini-Workshop: Random Trees, Information and Algorithms
local.organizersRalph Neininger, Frankfurt; Wojciech Szpanowski, West Lafayette
local.report-nameWorkshop Report 2011,23
local.opc-photo-id1117c
local.publishers-doi10.4171/OWR/2011/23
local.ems-referenceNeininger Ralph, Szpanowski Wojciech: Mini-Workshop: Random Trees, Information and Algorithms. Oberwolfach Rep. 8 (2011), 1241-1286. doi: 10.4171/OWR/2011/23


Dateien zu dieser Ressource

Thumbnail
Report

Das Dokument erscheint in:

Zur Kurzanzeige