BREED
发表于 2025-3-21 17:03:13
书目名称Computer Science -- Theory and Applications影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0233824<br><br> <br><br>书目名称Computer Science -- Theory and Applications影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0233824<br><br> <br><br>书目名称Computer Science -- Theory and Applications网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0233824<br><br> <br><br>书目名称Computer Science -- Theory and Applications网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0233824<br><br> <br><br>书目名称Computer Science -- Theory and Applications被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0233824<br><br> <br><br>书目名称Computer Science -- Theory and Applications被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0233824<br><br> <br><br>书目名称Computer Science -- Theory and Applications年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0233824<br><br> <br><br>书目名称Computer Science -- Theory and Applications年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0233824<br><br> <br><br>书目名称Computer Science -- Theory and Applications读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0233824<br><br> <br><br>书目名称Computer Science -- Theory and Applications读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0233824<br><br> <br><br>
取消
发表于 2025-3-21 23:56:43
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
可商量
发表于 2025-3-22 01:04:44
http://reply.papertrans.cn/24/2339/233824/233824_3.png
不易燃
发表于 2025-3-22 05:19:14
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
发表于 2025-3-22 12:32:44
http://reply.papertrans.cn/24/2339/233824/233824_5.png
BET
发表于 2025-3-22 13:51:54
http://reply.papertrans.cn/24/2339/233824/233824_6.png
BET
发表于 2025-3-22 19:14:41
http://reply.papertrans.cn/24/2339/233824/233824_7.png
saphenous-vein
发表于 2025-3-23 01:15:26
http://reply.papertrans.cn/24/2339/233824/233824_8.png
Cholagogue
发表于 2025-3-23 02:29:16
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
发表于 2025-3-23 06:47:13
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