UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Modelling silicosis: The structure of equilibria

European journal of applied mathematics, 2020-12, Vol.31 (6), p.950-967

2020

Volltextzugriff (PDF)

Limit laws of planar maps with prescribed vertex degrees

Combinatorics, probability & computing, 2019-07, Vol.28 (4), p.519-541

2019

Volltextzugriff (PDF)

Asymmetric Rényi Problem

Combinatorics, probability & computing, 2019-07, Vol.28 (4), p.542-573

2019

Volltextzugriff (PDF)

Precise minimax redundancy and regret

IEEE transactions on information theory, 2004-11, Vol.50 (11), p.2686-2707

2004

Volltextzugriff (PDF)

The maximum degree of random planar graphs

Proceedings of the London Mathematical Society, 2014-10, Vol.109 (4), p.892-920

2014

Volltextzugriff (PDF)

Newman's phenomenon for generalized Thue–Morse sequences

Discrete mathematics, 2008-04, Vol.308 (7), p.1191-1208

2008

Volltextzugriff (PDF)

On the Construction of (Explicit) Khodak's Code and Its Analysis

IEEE transactions on information theory, 2008-11, Vol.54 (11), p.5073-5086

2008

Volltextzugriff (PDF)

An analytic approach to the height of binary search trees

Algorithmica, 2001-01, Vol.29 (1-2), p.89-119

Drmota, M.

2001

Volltextzugriff (PDF)

The Asymptotic Number of Leftist Trees

Algorithmica, 2001-11, Vol.31 (3), p.304-317

Drmota, M.

2001

Volltextzugriff (PDF)

Almost Every Tree With m Edges Decomposes K 2 m ,2 m

Combinatorics, probability & computing, 2014-01, Vol.23 (1), p.50-65

2014

Volltextzugriff (PDF)

Almost Every Tree With m Edges Decomposes K 2m,2m

Combinatorics, probability & computing, 2014-01, Vol.23 (1), p.50

2014

Volltextzugriff (PDF)

Almost Every Tree With m Edges Decomposes K sub(2)m2m

Combinatorics, probability & computing, 2014-01, Vol.23 (1), p.50-65

2014

Volltextzugriff (PDF)

An analytic approach to the height of binary search trees II

Journal of the ACM, 2003-05, Vol.50 (3), p.333-374

Drmota, Michael

2003

Volltextzugriff (PDF)

Tunstall Code, Khodak Variations, and Random Walks

IEEE transactions on information theory, 2010-06, Vol.56 (6), p.2928-2937

2010

Volltextzugriff (PDF)

Almost Every Tree With m Edges Decomposes K2m,2m

Combinatorics, probability & computing, 2014-01, Vol.23 (1), p.50-65

2014

Volltextzugriff (PDF)

On Robson's convergence and boundedness conjectures concerning the height of binary search trees

Theoretical computer science, 2004-12, Vol.329 (1-3), p.47-70

Drmota, Michael

2004

Volltextzugriff (PDF)

Systems of functional equations

Random structures & algorithms, 1997-01, Vol.10 (1-2), p.103-124

Drmota, Michael

1997

Volltextzugriff (PDF)

On the Construction of (Explicit) KhodakE14s Code and Its Analysis

IEEE transactions on information theory, 2008-01, Vol.54 (11)

2008

Volltextzugriff (PDF)

A unified presentation of some urn models

Algorithmica, 2001-01, Vol.29 (1-2), p.120-147

2001

Volltextzugriff (PDF)

Stochastic analysis of tree–like data structures

Proceedings of the Royal Society. A, Mathematical, physical, and engineering sciences, 2004-01, Vol.460 (2041), p.271-307

Drmota, Michael

2004

Volltextzugriff (PDF)

The Variance of the height of binary search trees

Theoretical computer science, 2002-01, Vol.270 (1), p.913-919

Drmota, Michael

2002

Volltextzugriff (PDF)

Probabilistic Methods in Discrete Mathematics: Proceedings of the Fourth International Petrozavodsk Conference, Petrozavodsk, Russia, June 3-7, 1996

2020

Volltextzugriff (PDF)

Probability Theory and Mathematical Statistics: Proceedings of the Seventh Vilnius Conference, Vilnius, Lithuania, 12-18 August, 1998

2020

Volltextzugriff (PDF)

Probability Theory and Mathematical Statistics: Proceedings of the Seventh Vilnius Conference (1998), Vilnius, Lithuania, 12-18 August, 1998

2020

Volltextzugriff (PDF)

the sum-of-digits function of squares

Journal of the London Mathematical Society, 2005-10, Vol.72 (2), p.273-292

2005

Volltextzugriff (PDF)

1 – 25 von 118

Menü

Weitere Dienste

Einstellungen

Modelling silicosis: The structure of equilibria

Limit laws of planar maps with prescribed vertex degrees

Asymmetric Rényi Problem

Precise minimax redundancy and regret

The maximum degree of random planar graphs

Newman's phenomenon for generalized Thue–Morse sequences

On the Construction of (Explicit) Khodak's Code and Its Analysis

An analytic approach to the height of binary search trees

The Asymptotic Number of Leftist Trees

Almost Every Tree With m Edges Decomposes K 2 m ,2 m

Almost Every Tree With m Edges Decomposes K 2m,2m

Almost Every Tree With m Edges Decomposes K sub(2)m2m

An analytic approach to the height of binary search trees II

Tunstall Code, Khodak Variations, and Random Walks

Almost Every Tree With m Edges Decomposes K2m,2m

On Robson's convergence and boundedness conjectures concerning the height of binary search trees

Systems of functional equations

On the Construction of (Explicit) KhodakE14s Code and Its Analysis

A unified presentation of some urn models

Stochastic analysis of tree–like data structures

The Variance of the height of binary search trees

Probabilistic Methods in Discrete Mathematics: Proceedings of the Fourth International Petrozavodsk Conference, Petrozavodsk, Russia, June 3-7, 1996

Probability Theory and Mathematical Statistics: Proceedings of the Seventh Vilnius Conference, Vilnius, Lithuania, 12-18 August, 1998

Probability Theory and Mathematical Statistics: Proceedings of the Seventh Vilnius Conference (1998), Vilnius, Lithuania, 12-18 August, 1998

the sum-of-digits function of squares

Suchergebnisse filtern