Workshop on Analytic Algorithmics and Combinatorics最新文献_第4页

A bijection for plane graphs and its applications 平面图形的投影及其应用

Workshop on Analytic Algorithmics and Combinatorics Pub Date : 2014-01-06 DOI: 10.1137/1.9781611973204.5

O. Bernardi, Gwendal Collet, Éric Fusy

引用次数: 3

On the asymptotic number of BCK(2)-terms 关于BCK(2)-项的渐近数

Workshop on Analytic Algorithmics and Combinatorics Pub Date : 2014-01-06 DOI: 10.1137/1.9781611973204.3

O. Bodini, Bernhard Gittenberger

引用次数: 5

Clump Combinatorics, Automata, and Word Asymptotics 聚类组合、自动机和词渐近

Workshop on Analytic Algorithmics and Combinatorics Pub Date : 2014-01-06 DOI: 10.1137/1.9781611973204.6

M. Régnier, Billy Fang, Daria Iakovishina

引用次数: 3

Expected External Profile of PATRICIA Tries PATRICIA Tries的预期外部形象

Workshop on Analytic Algorithmics and Combinatorics Pub Date : 2014-01-06 DOI: 10.1137/1.9781611973204.2

A. Magner, C. Knessl, W. Szpankowski

引用次数: 10

Tight Analysis of Randomized Rumor Spreading in Complete Graphs 完全图中随机谣言传播的严密分析

Workshop on Analytic Algorithmics and Combinatorics Pub Date : 2014-01-06 DOI: 10.1137/1.9781611973204.8

Benjamin Doerr, Marvin Künnemann

引用次数: 17

Permuted Random Walk Exits Typically in Linear Time 排列随机漫步通常在线性时间内退出

Workshop on Analytic Algorithmics and Combinatorics Pub Date : 2014-01-06 DOI: 10.1137/1.9781611973204.7

S. Ganguly, Y. Peres

引用次数: 3

On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem 河内问题瓶颈塔的平均情形复杂度研究

Workshop on Analytic Algorithmics and Combinatorics Pub Date : 2014-01-06 DOI: 10.1137/1.9781611973204.10

Noam Solomon, Shay Solomon

{"title":"On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem","authors":"Noam Solomon, Shay Solomon","doi":"10.1137/1.9781611973204.10","DOIUrl":"https://doi.org/10.1137/1.9781611973204.10","url":null,"abstract":"The Bottleneck Tower of Hanoi (BTH) problem, posed in 1981 by Wood, is a natural generalization of the classic Tower of Hanoi (TH) problem. There, a generalized placement rule allows a larger disk to be placed higher than a smaller one if their size difference is less than a given parameter k ≥ 1; when k = 1 we arrive at the classic TH problem. The objective is to compute a shortest move-sequence transferring a legal (under the above rule) configuration of n disks on three pegs to another legal configuration. In SOFSEM'07, Dinitz and the second author established tight asymptotic bounds for the worst-case complexity of the BTH problem, for all n and k. Moreover, they proved that the average-case complexity is asymptotically the same as the worst-case complexity, for all n > 3k and n ≤ k, and conjectured that the same phenomenon also occurs in the complementary range k < n ≤ 3k. In this paper we settle the conjecture of Dinitz and Solomon from SOFSEM'07 in the affirmative, and show that the average-case complexity of the BTH problem is asymptotically the same as the worst-case complexity, for all n and k. To this end we provide a new proof that applies to all values of n > k. That is, our proof is not a patch over the previous proof of Dinitz and Solomon that is tailored only for the regime k < n ≤ 3k, but is rather a stronger proof that is based on different principles and deeper ideas. We also show that there are natural connections between the BTH problem, the problem of sorting with complete networks of stacks using a forklift [Albert and Atkinson 2002, Konig and Lubbecke 2008] and the well-studied pancake problem [Gates and Papadimitriou 1979].","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114367784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Typical Depth of a Digital Search Tree built on a general source 建立在通用源上的数字搜索树的典型深度

Workshop on Analytic Algorithmics and Combinatorics Pub Date : 2014-01-06 DOI: 10.1137/1.9781611973204.1

Kanal Hun, B. Vallée

{"title":"Typical Depth of a Digital Search Tree built on a general source","authors":"Kanal Hun, B. Vallée","doi":"10.1137/1.9781611973204.1","DOIUrl":"https://doi.org/10.1137/1.9781611973204.1","url":null,"abstract":"The digital search tree (dst) plays a central role in compression algorithms, of Lempel-Ziv type. This important structure can be viewed as a mixing of a digital structure (the trie) with a binary search tree. Its probabilistic analysis is thus involved, even in the case when the text is produced by a simple source (a memoryless source, or a Markov chain). After the seminal paper of Flajolet and Sedgewick (1986) [11] which deals with the memoryless unbiased case, many papers, due to Drmota, Jacquet, Louchard, Prodinger, Szpankowski, Tang, published between 1990 and 2005, dealt with general memoryless sources or Markov chains, and performed the analysis of the main parameters of dst's--namely, internal path length, profile, typical depth-- (see for instance [7, 15, 14]). Here, we are interested in a more realistic analysis, when the words are emitted by a general source, where the emission of symbols may depend on the whole previous history. There exist previous analyses of text algorithms or digital structures that have been performed for general sources, for instance for tries ([3, 2]), or for basic sorting and searching algorithms ([22, 4]). However, the case of digital search trees has not yet been considered, and this is the main subject of the paper. The idea of this study is due to Philippe Flajolet and the first steps of the work were performed with him, during the end of 2010. This paper is dedicated to Philippe's memory.","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128906712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Survivors in Leader Election Algorithms 领袖选举算法中的幸存者

Workshop on Analytic Algorithmics and Combinatorics Pub Date : 2013-12-01 DOI: 10.1137/1.9781611973204.11

Ravi Kalpathy, H. Mahmoud, W. Rosenkrantz

引用次数: 8

On the Average Number of Edges in Theta Graphs 关于Theta图的平均边数

Workshop on Analytic Algorithmics and Combinatorics Pub Date : 2013-04-11 DOI: 10.1137/1.9781611973204.12

Pat Morin, S. Verdonschot

引用次数: 7