標(biāo)題: Titlebook: Computer Science -- Theory and Applications; 7th International Co Edward A. Hirsch,Juhani Karhum?ki,Michail Prilutsk Conference proceedings [打印本頁] 作者: BREED 時間: 2025-3-21 17:03
書目名稱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é)科排名
作者: 取消 時間: 2025-3-21 23:56
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 作者: 不易燃 時間: 2025-3-22 05:19
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 作者: BET 時間: 2025-3-22 13:51 作者: BET 時間: 2025-3-22 19:14 作者: saphenous-vein 時間: 2025-3-23 01:15 作者: Cholagogue 時間: 2025-3-23 02:29
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
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作者: 圓木可阻礙 時間: 2025-3-23 12:24 作者: Inveterate 時間: 2025-3-23 14:06 作者: HERE 時間: 2025-3-23 19:45
The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairsannakakis [14] showed that for any nontrivial node-hereditary graph property, the problem of given a graph, finding the size of the largest induced subgraph of the graph that has the property, is .-hard. In this paper, we completely characterize those minor-ancestral properties for which the problem作者: Arthritis 時間: 2025-3-24 01:22
Satisfiability Thresholds beyond ,??XORSATlity threshold of such systems occurs where the 2??core has density 1. We show a similar result for random uniquely extendible constraints over 4 elements. Our results extend previous results of Dubois/Mandler for equations mod 2 and .?=?3 and Connamacher/Molloy for uniquely extendible constraints o作者: 厭倦嗎你 時間: 2025-3-24 05:45
Finding Vertex-Surjective Graph Homomorphisms host graph. The bijective and injective homomorphism problems can be formulated in terms of spanning subgraphs and subgraphs, and as such their computational complexity has been extensively studied. What about the surjective variant? Because this problem is NP-complete in general, we restrict the g作者: Gleason-score 時間: 2025-3-24 09:34
Broadcast Domination on Block Graphs in Linear Timerom a vertex . with .(.)?>?0. The . problem seeks to compute a broadcast domination where the sum of the assigned values is minimized. We show that . can be solved in linear time on block graphs. For general graphs the best known algorithm runs in time .. For trees and interval graphs, linear-time a作者: Mangle 時間: 2025-3-24 13:45 作者: –scent 時間: 2025-3-24 18:44
Descriptional Complexity of Operations on Alternating and Boolean Automatate is 2.?+?1. This solves an open problem stated by Fellah . (Intern. J. Computer Math. 35, 1990, 117–132). Then we examine the complexity of basic operations on languages represented by boolean and alternating finite automata. We get tight bounds for intersection and union, and for concatenation an作者: 巨頭 時間: 2025-3-24 21:59
Gisela Henrici-Olivé,Salvador Olivé remained elusive..The latter question can clearly benefit from the powerful tools of modern complexity theory and algorithms. In this talk, we will provide an in-depth overview of the fascinating theory that has emerged around this question over the last decade.作者: NOCT 時間: 2025-3-25 02:09
The Chemistry of the Non-Metalsme. This improves the previous known result for ...Our deterministric sorting relies on the notion of an approximate .-th order statistic. For this auxiliary problem, we devise a deterministic algorithm that runs in . time and produces a key (either corrupted or not) whose order rank differs from . by at most .(.).作者: concentrate 時間: 2025-3-25 04:25 作者: Neutral-Spine 時間: 2025-3-25 07:30 作者: 窩轉(zhuǎn)脊椎動物 時間: 2025-3-25 15:08 作者: 有權(quán) 時間: 2025-3-25 17:07 作者: CEDE 時間: 2025-3-25 21:20
Can the Theory of Algorithms Ratify the “Invisible Hand of the Market”? remained elusive..The latter question can clearly benefit from the powerful tools of modern complexity theory and algorithms. In this talk, we will provide an in-depth overview of the fascinating theory that has emerged around this question over the last decade.作者: harrow 時間: 2025-3-26 02:19
Resilient Quicksort and Selectionme. This improves the previous known result for ...Our deterministric sorting relies on the notion of an approximate .-th order statistic. For this auxiliary problem, we devise a deterministic algorithm that runs in . time and produces a key (either corrupted or not) whose order rank differs from . by at most .(.).作者: 角斗士 時間: 2025-3-26 06:59
Approximating Minimum Power Edge-Multi-Coversain result improves this ratio to .(log.) for general costs, and to .(1) for uniform costs. This also implies ratios .(log.) for the ... and . for the ... problems; the latter is the currently best known ratio for the min-cost version of the problem. In addition, for small values of ., we improve the previously best ratio .?+?1 to .?+?1/2.作者: 無意 時間: 2025-3-26 09:04 作者: 新義 時間: 2025-3-26 16:13 作者: exclusice 時間: 2025-3-26 17:30 作者: Antigen 時間: 2025-3-26 22:40 作者: 大方一點 時間: 2025-3-27 01:34
https://doi.org/10.1007/978-1-4615-2952-1can be solved in linear time on block graphs. For general graphs the best known algorithm runs in time .. For trees and interval graphs, linear-time algorithms are known. As block graphs form a superclass of trees, our result extends the classes of graphs on which this problem is solvable in linear time.作者: N防腐劑 時間: 2025-3-27 07:44 作者: Mortal 時間: 2025-3-27 10:59
Broadcast Domination on Block Graphs in Linear Timecan be solved in linear time on block graphs. For general graphs the best known algorithm runs in time .. For trees and interval graphs, linear-time algorithms are known. As block graphs form a superclass of trees, our result extends the classes of graphs on which this problem is solvable in linear time.作者: 單片眼鏡 時間: 2025-3-27 14:45
Descriptional Complexity of Operations on Alternating and Boolean Automataerations on languages represented by boolean and alternating finite automata. We get tight bounds for intersection and union, and for concatenation and reversal of languages represented by boolean automata. In the case of star, and of concatenation and reversal of AFA languages, our upper and lower bounds differ by one.作者: 沒有準(zhǔn)備 時間: 2025-3-27 19:26
Checking Tests for Read-Once Functions over Arbitrary Basesriables of . and . is the largest arity of functions in .. For some functions, this bound cannot be improved by more than a constant factor. The employed technique involves reconstructing . from its .-variable projections and provides a stronger form of Kuznetsov’s classic theorem on read-once representations.作者: STENT 時間: 2025-3-28 00:47 作者: JEER 時間: 2025-3-28 03:06
Satisfiability Thresholds beyond ,??XORSATver a domain of 4 elements with .?=?3 arguments..The proof is based on variance calculations, using a technique introduced by Dubois/Mandler. However, several additional observations (of independent interest) are necessary.作者: inferno 時間: 2025-3-28 08:41 作者: Dictation 時間: 2025-3-28 13:15
https://doi.org/10.1007/978-3-662-13150-3ntennae)..2) We present novel upper bound techniques which, in combination with stronger lower bounds, allow us to improve the previous approximation results for the edge length needed to achieve strong connectivity for .?=?4 (from 2sin(./5) to optimal) and .?=?3 (from . to .).作者: 悲觀 時間: 2025-3-28 17:36
Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGsntennae)..2) We present novel upper bound techniques which, in combination with stronger lower bounds, allow us to improve the previous approximation results for the edge length needed to achieve strong connectivity for .?=?4 (from 2sin(./5) to optimal) and .?=?3 (from . to .).作者: Ophthalmologist 時間: 2025-3-28 18:52
0302-9743 ewed and selected from 66 submissions. CSR 2012 was one of the events of the Alan Turing Year 2012, the topics dealt with cover substantial parts of theoretical computer science and its applications.978-3-642-30641-9978-3-642-30642-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: ANTH 時間: 2025-3-29 00:40 作者: Spinal-Tap 時間: 2025-3-29 05:54 作者: 其他 時間: 2025-3-29 08:24 作者: 蓋他為秘密 時間: 2025-3-29 12:54 作者: deadlock 時間: 2025-3-29 19:26 作者: 傻 時間: 2025-3-29 20:56 作者: 偶然 時間: 2025-3-30 03:10
Sculpting the Body, or Embodied Timechain 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.作者: APRON 時間: 2025-3-30 06:59
Sculpting the Space, or the Retorts at Playtest for a read-once function . over . depending on all its variables is a set of input vectors distinguishing . from all other read-once functions of the same variables. We show that every read-once function . over . has a checking test containing .(..) vectors, where . is the number of relevant va作者: Carbon-Monoxide 時間: 2025-3-30 08:25
Sculpting the Space, or the Retorts at Play nodes. Motivated by applications in wireless networks, we consider the following fundamental problem in wireless network design. Given a graph .?=?(.,.) with edge costs and degree bounds {.(.):.?∈?.}, the . (.) problem is to find a minimum-power subgraph . of . such that the degree of every node . 作者: 豪華 時間: 2025-3-30 15:53 作者: arthroplasty 時間: 2025-3-30 20:26 作者: 狗舍 時間: 2025-3-30 23:06 作者: Endoscope 時間: 2025-3-31 03:46
https://doi.org/10.1007/978-94-011-2928-2left 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作者: 態(tài)學(xué) 時間: 2025-3-31 06:54
https://doi.org/10.1007/978-3-662-13150-3raph of out-degree at most . and whose longest edge length is the shortest possible. The motivation comes from the problem of replacing omnidirectional antennae in a sensor network with . directional antennae per sensor so that the resulting sensor network is strongly connected. The contribution of 作者: GNAT 時間: 2025-3-31 13:10
Gerard J. Graham,Robert J. Nibbsed model, if the first four operations are to be supported in constant time, the last two operations must take at least logarithmic time. Brodal showed that his worst-case efficient priority queues achieve these worst-case bounds. Unfortunately, this data structure is involved and the time bounds hi作者: Bernstein-test 時間: 2025-3-31 16:25 作者: Visual-Field 時間: 2025-3-31 18:06 作者: PACK 時間: 2025-3-31 23:15 作者: Hippocampus 時間: 2025-4-1 02:17 作者: 打火石 時間: 2025-4-1 08:27
I. J. D. Lindley,J. Westwick,S. Kunkelinterrelation between knowledge and topology. The comparison language arising naturally from the relevant semantics is well-known from the beginnings of topological model theory, and subset space bisimulations provide for the proper notion of invariance of formulas here.作者: Somber 時間: 2025-4-1 10:50 作者: 動物 時間: 2025-4-1 16:38 作者: FATAL 時間: 2025-4-1 21:31
