2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Society For Industrial And Applied Mathematics

9781611975505

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract)

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611975505.9 ◽

2019 ◽

pp. 87-93

Author(s):

James Allen Fill ◽

Wei-Chun Hung

Keyword(s):

Large Deviations ◽

Limiting Distribution ◽

Tail Asymptotics

Download Full-text

Combinatorics of nondeterministic walks of the Dyck and Motzkin type

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611975505.1 ◽

2019 ◽

pp. 1-12

Author(s):

Élie de Panafieu ◽

Mohamed Lamine Lamali ◽

Michael Wallner

Download Full-text

Ranked Schröder Trees

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611975505.2 ◽

2019 ◽

pp. 13-26 ◽

Cited By ~ 1

Author(s):

Olivier Bodini ◽

Antoine Genitrini ◽

Mehdi Naima

Download Full-text

Sesquickselect: One and a half pivots for cache-efficient selection

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611975505.6 ◽

2019 ◽

pp. 54-66

Author(s):

Conrado Martínez† ◽

Markus Nebel ◽

Sebastian Wild

Keyword(s):

Cache Efficient ◽

Efficient Selection

Download Full-text

When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611975505.10 ◽

2019 ◽

pp. 94-102 ◽

Cited By ~ 1

Author(s):

Johannes Lengler ◽

Anders Martinsson ◽

Angelika Steger

Keyword(s):

Monotone Functions ◽

Entropy Compression

Download Full-text

Protection Number of Recursive Trees

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611975505.5 ◽

2019 ◽

pp. 45-53

Author(s):

Zbigniew Gołębiewski ◽

Mateusz Klimczak

Keyword(s):

Recursive Trees

Download Full-text

Random walks on graphs: new bounds on hitting, meeting, coalescing and returning

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611975505.13 ◽

2019 ◽

pp. 119-126

Author(s):

Roberto I. Oliveira ◽

Yuval Peres

Keyword(s):

Random Walks ◽

Random Walks On Graphs

Download Full-text

Arithmetic Progression Hypergraphs: Examining the Second Moment Method

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611975505.14 ◽

2019 ◽

pp. 127-134

Author(s):

Michael Mitzenmacher

Keyword(s):

Arithmetic Progression ◽

Moment Method ◽

Second Moment ◽

Second Moment Method ◽

The Second Moment Method

Download Full-text

Subcritical random hypergraphs, high-order components, and hypertrees

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611975505.12 ◽

2019 ◽

pp. 111-118 ◽

Cited By ~ 1

Author(s):

Oliver Cooley ◽

Wenjie Fang ◽

Nicola Del Giudice ◽

Mihyun Kang

Keyword(s):

High Order ◽

Order Components ◽

Random Hypergraphs

Download Full-text

Reducing Simply Generated Trees by Iterative Leaf Cutting

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) ◽

10.1137/1.9781611975505.4 ◽

2019 ◽

pp. 36-44

Author(s):

Benjamin Hackl ◽

Clemens Heuberger ◽

Stephan Wagner

Keyword(s):

Leaf Cutting ◽

Simply Generated Trees

Download Full-text

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Society For Industrial And Applied Mathematics

QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract)

Combinatorics of nondeterministic walks of the Dyck and Motzkin type

Ranked Schröder Trees

Sesquickselect: One and a half pivots for cache-efficient selection

When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument

Protection Number of Recursive Trees

Random walks on graphs: new bounds on hitting, meeting, coalescing and returning

Arithmetic Progression Hypergraphs: Examining the Second Moment Method

Subcritical random hypergraphs, high-order components, and hypertrees

Reducing Simply Generated Trees by Iterative Leaf Cutting

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
Latest Publications