Titlebook: Computer Science -- Theory and Applications; 7th International Co Edward A. Hirsch,Juhani Karhum?ki,Michail Prilutsk Conference proceedings

BREED

書目名稱Computer Science -- Theory and Applications影響因子(影響力)




書目名稱Computer Science -- Theory and Applications影響因子(影響力)學(xué)科排名




書目名稱Computer Science -- Theory and Applications網(wǎng)絡(luò)公開度




書目名稱Computer Science -- Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computer Science -- Theory and Applications被引頻次




書目名稱Computer Science -- Theory and Applications被引頻次學(xué)科排名




書目名稱Computer Science -- Theory and Applications年度引用




書目名稱Computer Science -- Theory and Applications年度引用學(xué)科排名




書目名稱Computer Science -- Theory and Applications讀者反饋




書目名稱Computer Science -- Theory and Applications讀者反饋學(xué)科排名

取消

Resilient Quicksort and Selection can tolerate up to . memory faults during its execution. A resilient sorting algorithm must produce a sequence where every pair of uncorrupted keys is ordered correctly. Finocchi, Grandoni, and Italiano devised a .-resilient deterministic mergesort algorithm that runs in .(. log.?+?..) time. We pre

可商量

不易燃

News about Semiantichains and Unichain Coveringschain covering in the product .×. are equal. As a positive result we state conditions on . and . that imply the min-max relation. However, we also have an example showing that in general the min-max relation is false. This disproves the Saks-West conjecture.

Ancestor

BET

BET

saphenous-vein

Cholagogue

Bounded Synchronization Delay in Omega-Rational Expressionsn as SF?=?AP. Perrin generalized SF?=?AP to infinite words in the mid 1980s. In 1973 Schützenberger presented another (and less known) characterization of aperiodic languages in terms of rational expressions where the use of the star operation is restricted to prefix codes with bounded synchronizati

synovium

Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphsleft degree . is fixed, .. We ask whether for the probability that . has a left-perfect matching it is advantageous not to fix .. for each left node . but rather choose it at random according to some (cleverly chosen) distribution. We show the following, provided that the degrees of the left nodes a