標(biāo)題: Titlebook: Automata, Languages and Programming; 22nd International C Zoltán Fül?p,Ferenc Gécseg Conference proceedings 1995 Springer-Verlag Berlin Hei [打印本頁] 作者: sesamoiditis 時間: 2025-3-21 19:06
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學(xué)科排名
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學(xué)科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學(xué)科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學(xué)科排名
作者: antiquated 時間: 2025-3-21 23:25
https://doi.org/10.1007/978-3-531-91958-4arate devices and distinguishing between the space used for processing information and the space used merely to read the input word from. Likewise, we distinguish between the time used for processing information and the time used merely to read the input word.作者: 只有 時間: 2025-3-22 00:24 作者: DRAFT 時間: 2025-3-22 06:50
Fast gossiping by short messages,ymptotically matching upper and lower bounds. We also study the case of arbitrary . and we exactly determine the optimal number of communication rounds to perform gossiping under this hypothesis for complete graphs, hypercubes, rings, and paths.作者: 俗艷 時間: 2025-3-22 10:14 作者: BUST 時間: 2025-3-22 15:52
The complexity of searching succinctly represented graphs,sion procedures. It is based on previously studied concepts of “succinct representation” techniques, and allows us to prove PSPACE-completeness or EXPTIME-completeness of specific, natural problems on implicit graphs, such as those solved by A., AO.; and other best-first search strategies.作者: 類型 時間: 2025-3-22 20:19 作者: ARCHE 時間: 2025-3-22 21:53
Conference proceedings 1995sions. ICALP traditionally covers the whole area of theoretical computer science; among the topics addressed in the volume are concurrency, automata, formal languages, algorithms, communication protocols, computational complexity, computability, foundations of programming, learning and coding, and semantics.作者: Nibble 時間: 2025-3-23 03:44
https://doi.org/10.1007/978-3-663-10171-0thematical results proving thereby the soundness of our approach. Our theory is a proper generalization of the theory of finite and infinite words (with explicit termination) and of the theory of finite and infinite (real and complex) traces. We make use of trace theory, domain theory, and topology.作者: falsehood 時間: 2025-3-23 08:12 作者: 縱火 時間: 2025-3-23 09:44
https://doi.org/10.1007/978-3-662-59152-9ings. The problem turns out to be easily solved. Hence, we can break FAPKC by constructing decryption automata from the encryption automaton (public key). We describe a modification of FAPKC which can resist above attack.作者: 愉快嗎 時間: 2025-3-23 17:21 作者: 妨礙議事 時間: 2025-3-23 18:55
A domain for concurrent termination a generalization of Mazurkiewicz traces,thematical results proving thereby the soundness of our approach. Our theory is a proper generalization of the theory of finite and infinite words (with explicit termination) and of the theory of finite and infinite (real and complex) traces. We make use of trace theory, domain theory, and topology.作者: chastise 時間: 2025-3-24 01:28 作者: EVADE 時間: 2025-3-24 05:42 作者: ALLAY 時間: 2025-3-24 07:00 作者: 持續(xù) 時間: 2025-3-24 14:42
0302-9743 d in the volume are concurrency, automata, formal languages, algorithms, communication protocols, computational complexity, computability, foundations of programming, learning and coding, and semantics.978-3-540-60084-8978-3-540-49425-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 和平主義 時間: 2025-3-24 18:02 作者: RODE 時間: 2025-3-24 22:40 作者: 多嘴多舌 時間: 2025-3-25 00:43 作者: PAEAN 時間: 2025-3-25 05:25 作者: FER 時間: 2025-3-25 11:34 作者: Amorous 時間: 2025-3-25 13:54
Intervalizing ,-colored graphs,hm for . = 3 is based on an extensive analysis of the precise structure of graphs of pathwidth two, dynamic programming on certain parts of the input graph, and a careful combination of the results for the different parts.作者: 極力證明 時間: 2025-3-25 17:22 作者: subacute 時間: 2025-3-25 22:52 作者: nascent 時間: 2025-3-26 03:40 作者: TAP 時間: 2025-3-26 05:57 作者: 食物 時間: 2025-3-26 09:44
Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time, an algorithm for graph connectivity which admits an . cost of ... time per update. In contrast, the best known deterministic worst-case algorithms for fully dynamic connectivity require .. time per update.作者: 對手 時間: 2025-3-26 16:03
On the number of random bits in totally private computation,ayers have access to a source of uniformly distributed bits, at least .?1)(.?2)/2 random bits are needed to compute the sum modulo 2. of .-bit integers. This result is tight as there are protocols for this problem that use . this number of random bits.作者: sundowning 時間: 2025-3-26 19:06
Optimal shooting: Characterizations and applications,c parameter seems to be interesting in its own right. This suggests searching for tighter (constructive or not) upper and lower bounds on the stage number of an arbitrary graph, as well as determining the complexity of the recognition problem . ε .., both for fixed as well as variable ..作者: 多余 時間: 2025-3-26 22:05
Automata, Languages and Programming978-3-540-49425-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: gratify 時間: 2025-3-27 02:47
https://doi.org/10.1007/978-3-663-10171-0concatenation, shuffle product and union, respectively, and where the constant 0 is the empty set and the constant 1 is the singleton set containing the empty word. We show that the variety . generated by the structures .. has no finite axiomatization.作者: integral 時間: 2025-3-27 05:20
Gewalt durch Gewalt im Fernsehen?,y the two-dimensional analog of the suffix tree of a string [15], allowing on-line searches and statistics to be performed on .. We provide . simple algorithm that efficiently builds any chosen index in those classes in O(n. log .) . time using ..) space. The algorithm can be modified to require optimal ..) . for bounded ..作者: outer-ear 時間: 2025-3-27 10:53
https://doi.org/10.1007/978-3-662-62205-6lds polynomial-time algorithms to determine the minimum fill-in and the treewidth in several graph classes. We apply the approach to d-trapezoid graphs for which we give the first polynomialtime algorithms that determine the minimum fill-in resp. the treewidth.作者: insurrection 時間: 2025-3-27 16:18 作者: 引起痛苦 時間: 2025-3-27 18:50
https://doi.org/10.1007/978-3-663-10171-0concatenation, shuffle product and union, respectively, and where the constant 0 is the empty set and the constant 1 is the singleton set containing the empty word. We show that the variety . generated by the structures .. has no finite axiomatization.作者: 斜坡 時間: 2025-3-28 00:53 作者: 來自于 時間: 2025-3-28 04:21 作者: antedate 時間: 2025-3-28 09:07 作者: GROVE 時間: 2025-3-28 13:59
https://doi.org/10.1007/978-3-322-85124-6hree parallel approximation algorithms for the shortest superstring problem. The first is an . algorithm achieving a compression ratio of 1/3+ε for any ε > 0. The second is an . algorithm achieving a compression ratio of 38/63 ≈ 0.603. The third is an . algorithm achieving an approximation ratio of 作者: 矛盾 時間: 2025-3-28 15:19
Gewalt durch Gewalt im Fernsehen?,y the two-dimensional analog of the suffix tree of a string [15], allowing on-line searches and statistics to be performed on .. We provide . simple algorithm that efficiently builds any chosen index in those classes in O(n. log .) . time using ..) space. The algorithm can be modified to require opt作者: languid 時間: 2025-3-28 21:31 作者: Relinquish 時間: 2025-3-29 02:17
https://doi.org/10.1007/978-3-662-62205-6etwork. We consider the problem of gossiping in communication networks under the restriction that communicating nodes can exchange up to a fixed number . of packets at each round. In the first part of the paper we study the extremal case . = 1 and we exactly determine the optimal number of communica作者: 流動性 時間: 2025-3-29 04:24 作者: SLAY 時間: 2025-3-29 08:08 作者: Myelin 時間: 2025-3-29 14:28 作者: 諷刺滑稽戲劇 時間: 2025-3-29 17:07 作者: 十字架 時間: 2025-3-29 20:19
https://doi.org/10.1007/978-3-658-36285-0r collapse of the polynomial-time hierarchy PH to ZPP(NP) under the assumption that NP has polynomial-size circuits. This improves on the well-known result of Karp, Lipton, and Sipser (1980) stating a collapse of PH to its second level σ. under the same assumption. As a further consequence, we deriv作者: altruism 時間: 2025-3-30 03:48
https://doi.org/10.1007/978-3-658-36285-0lgorithms. The reason is that, in their standard definition, complexity classes are specifically tailored to explicit, instead of implicit, graphs of state or problem reduction spaces. But the usual practice works to a large extent, in some areas of Computer Science, over implicit graphs. To allow f作者: 配置 時間: 2025-3-30 04:44 作者: 不能逃避 時間: 2025-3-30 12:01 作者: 地名詞典 時間: 2025-3-30 12:46
On the construction of classes of suffix trees for square matrices: Algorithms and applications,y the two-dimensional analog of the suffix tree of a string [15], allowing on-line searches and statistics to be performed on .. We provide . simple algorithm that efficiently builds any chosen index in those classes in O(n. log .) . time using ..) space. The algorithm can be modified to require optimal ..) . for bounded ..作者: AMPLE 時間: 2025-3-30 20:06 作者: 經(jīng)典 時間: 2025-3-30 22:38
Wolfgang Melzer,Wilfried SchubarthWe generalize the characterization of abstract families of languages (AFLs) by abstract families of acceptors to Ω-continuous semirings.作者: neurologist 時間: 2025-3-31 02:38 作者: 胰臟 時間: 2025-3-31 06:34
The algebraic equivalent of AFL theory,We generalize the characterization of abstract families of languages (AFLs) by abstract families of acceptors to Ω-continuous semirings.作者: Commentary 時間: 2025-3-31 11:18
Post correspondence problem: Words possible as primitive solutions,Three types of “primitive” or “prime” solutions for PCP have earlier been investigated. The sets of words belonging to one of the three types (for some instance of PCP) form an increasing hierarchy. In our main result we show that the hierarchy is proper, except the binary case. We also give a sharpened characterization of the finite type.作者: 刺激 時間: 2025-3-31 15:18
https://doi.org/10.1007/3-540-60084-1Automat; algorithm; algorithms; automata; communication; complexity; formal language; programming; semantics作者: Overthrow 時間: 2025-3-31 18:58 作者: burnish 時間: 2025-3-31 23:34 作者: 織布機 時間: 2025-4-1 05:49
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166216.jpg作者: 大范圍流行 時間: 2025-4-1 07:59
A domain for concurrent termination a generalization of Mazurkiewicz traces,t component and a second alphabetic component yields some information about future actions. This allows to define a good semantic domain where the concatenation is continuous with respect to the Scott- and to the Lawson topology. For this we define the notion of .- and of .-trace. We show various ma作者: ENNUI 時間: 2025-4-1 11:00
Nonfinite axiomatizability of the equational theory of shuffle,concatenation, shuffle product and union, respectively, and where the constant 0 is the empty set and the constant 1 is the singleton set containing the empty word. We show that the variety . generated by the structures .. has no finite axiomatization.
