標題: Titlebook: Automata, Languages and Programming; 31st International C Josep Díaz,Juhani Karhum?ki,Donald Sannella Conference proceedings 2004 Springer- [打印本頁] 作者: exposulate 時間: 2025-3-21 19:00
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學科排名
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度
書目名稱Automata, Languages and Programming網(wǎng)絡(luò)公開度學科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學科排名
作者: 錫箔紙 時間: 2025-3-21 21:56
What Do Program Logics and Type Systems Have in Common?This talk tries to contribute to a discussion started by John Reynolds’ in his short presentation (“five minute madness talk”) at the SPACE workshop 2004 (http://www.diku.dk/topps/space2004/).作者: micturition 時間: 2025-3-22 03:10
Abschnitt X Schlussvorschriftens input a set of keys, and permits queries about the relative order of these keys according to some ordering relation. A ., or ., . is one that permits queries about the output to be interleaved with operations that incrementally modify the input. For example, a dynamic sorting algorithm is one that作者: Stagger 時間: 2025-3-22 04:57
Abschnitt X Schlussvorschriftenat people engage in on the the Internet. Even beyond becoming the number one source of information, a growing number of businesses are depending on web search engines for customer acquisition..The first generation of web search engines used text-only retrieval techniques. Google revolutionized the f作者: 頌揚本人 時間: 2025-3-22 11:21
Abschnitt II Bemessung der Gewerbesteuericted to this world of feasibility, proofs and computations become extremely tightly interrelated, sometimes even indistinguishable. Moreover, many of these rich relations, underlying concepts, techniques etc. look very different from their “classical” counterparts, or simply do not have any. This t作者: 揮舞 時間: 2025-3-22 16:53
,Merkmale, Pr?vention und Folgen,the relation between two implicit representations, the role of word compression in solvability of word equations and compressed language recognition problems. The grammar compression is more convenient than .-encoding, its size differs from that of .-encoding by at most logarithmic factor, the const作者: Inertia 時間: 2025-3-22 19:17
Wilfried Schubarth,Christoph Ackermannest sequences so that we can deduce desired information about the given system under test, such as whether it conforms to a given specification model, or whether it satisfies given requirement properties. Test generation can be approached from different points of view – as an optimization problem of作者: 意外 時間: 2025-3-23 00:48 作者: 職業(yè)拳擊手 時間: 2025-3-23 03:51
Methodische Anlage der Untersuchung,xist in any Martin-L?f category (extensive locally cartesian closed category with W-types) by exploiting our work on container types. This generalises a result by Dybjer (1997) who showed that non-nested strictly positive inductive types can be represented using W-types. We also provide a detailed a作者: Dappled 時間: 2025-3-23 08:55 作者: 不舒服 時間: 2025-3-23 13:03
Marek Fuchs,Siegfried Lamnek,Nina Baurons. The recursion trees of DPLL algorithm executions on unsatisfiable formulas are equivalent to tree-like resolution proofs. Therefore, lower bounds for tree-like resolution (known since 1960s) apply to them. However, these lower bounds say nothing about their behavior on . formulas. Proving expon作者: abolish 時間: 2025-3-23 17:42 作者: EVICT 時間: 2025-3-23 20:15 作者: 壕溝 時間: 2025-3-24 01:26
Verbreitung von Gewalt an Schulen, is to find the best-cost strategy of supplying the inputs so as to ensure reachability of a target set within a specified number of iterations. The only known complexity bound for this problem is a doubly-exponential upper bound. We establish a singly-exponential upper bound and show that there exi作者: dry-eye 時間: 2025-3-24 06:26
Marek Fuchs,Siegfried Lamnek,Nina Baur number of wavelengths available on a fiber is some parameter .. Our aim is to minimize the maximum ratio between the number of fibers deployed on a link . and the number of fibers required on the same link . when wavelength assignment is allowed to be fractional..Our main results are negative ones.作者: bypass 時間: 2025-3-24 08:38
https://doi.org/10.1007/978-3-531-91311-7hts and ./. = .(./ log .) our approaches are the first to achieve .(..) I/Os. We also show that for unweighted undirected graphs, APSP can be solved with just . I/Os. Both our weighted and unweighted approaches require .(..) space. For diameter computations we provide I/O-space tradeoffs. Finally, w作者: falsehood 時間: 2025-3-24 11:25 作者: 字的誤用 時間: 2025-3-24 17:33 作者: Aviary 時間: 2025-3-24 20:47 作者: 出來 時間: 2025-3-25 02:37
Josep Díaz,Juhani Karhum?ki,Donald SannellaIncludes supplementary material: 作者: Focus-Words 時間: 2025-3-25 03:40
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/166215.jpg作者: 急急忙忙 時間: 2025-3-25 09:35 作者: intricacy 時間: 2025-3-25 15:20 作者: placebo 時間: 2025-3-25 18:11
Automata, Languages and Programming978-3-540-27836-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 整體 時間: 2025-3-25 23:50
0302-9743 Overview: Includes supplementary material: 978-3-540-22849-3978-3-540-27836-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Watemelon 時間: 2025-3-26 03:10 作者: coltish 時間: 2025-3-26 06:17
Marek Fuchs,Siegfried Lamnek,Nina Baura graph..On the positive side, we present algorithms with approximation ratios .(log .+log.), .(log..?+?log.) and .(..) respectively. Here .. is the length of the longest path..We conclude by presenting two variants of the problem and discussing which of our results still apply.作者: 褲子 時間: 2025-3-26 09:42
The Power of Verification for One-Parameter Agents作者: faculty 時間: 2025-3-26 16:13 作者: 圍裙 時間: 2025-3-26 20:05
The Past, Present, and Future of Web Search Enginesat people engage in on the the Internet. Even beyond becoming the number one source of information, a growing number of businesses are depending on web search engines for customer acquisition..The first generation of web search engines used text-only retrieval techniques. Google revolutionized the f作者: 駭人 時間: 2025-3-26 22:48 作者: appall 時間: 2025-3-27 03:54
Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Inputthe relation between two implicit representations, the role of word compression in solvability of word equations and compressed language recognition problems. The grammar compression is more convenient than .-encoding, its size differs from that of .-encoding by at most logarithmic factor, the const作者: 地名表 時間: 2025-3-27 08:49 作者: 注入 時間: 2025-3-27 10:33
Deciding Knowledge in Security Protocols Under Equational Theoriesnowledge is often treated in terms of message deducibility and indistinguishability relations. In this paper we study the decidability of these two relations. The messages in question may employ functions (encryption, decryption, etc.) axiomatized in an equational theory. Our main positive results s作者: 胡言亂語 時間: 2025-3-27 14:17 作者: 裝勇敢地做 時間: 2025-3-27 18:06 作者: Assault 時間: 2025-3-28 00:38
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulasons. The recursion trees of DPLL algorithm executions on unsatisfiable formulas are equivalent to tree-like resolution proofs. Therefore, lower bounds for tree-like resolution (known since 1960s) apply to them. However, these lower bounds say nothing about their behavior on . formulas. Proving expon作者: 斗志 時間: 2025-3-28 03:22 作者: 跳脫衣舞的人 時間: 2025-3-28 08:55
Learning a Hidden Subgraphy whether a set of vertices induces an edge. Questions of this type are motivated by problems in molecular biology. In the deterministic nonadaptive setting, we prove nearly matching upper and lower bounds for the minimum possible number of queries required when the family is the family of all stars作者: Maximizer 時間: 2025-3-28 13:51 作者: 過剩 時間: 2025-3-28 15:00 作者: 擴大 時間: 2025-3-28 22:05
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphshts and ./. = .(./ log .) our approaches are the first to achieve .(..) I/Os. We also show that for unweighted undirected graphs, APSP can be solved with just . I/Os. Both our weighted and unweighted approaches require .(..) space. For diameter computations we provide I/O-space tradeoffs. Finally, w作者: Congeal 時間: 2025-3-29 01:41
A ,-Calculus for Resource Separationlti-place contexts augmented with constraints, allowing a concise presentation of the typing rules. It is an extension of the affine .-calculus. We give a semantics based on sets indexed by resources, and show how the calculus may be extended to handle non-symmetric relations with application to all作者: Definitive 時間: 2025-3-29 04:28 作者: 同步左右 時間: 2025-3-29 08:50
Further Improvements in Competitive Guarantees for QoS Bufferingr space is limited, and packet loss occurs when the buffer overflows. We describe a modification of the previously proposed “preemptive greedy” algorithm of for buffer management and give an analysis to show that this algorithm achieves a competitive ratio of at most 1.75. This improves upon recent 作者: Harness 時間: 2025-3-29 14:23 作者: 消息靈通 時間: 2025-3-29 16:44
Testing, Optimizaton, and Games minimizing cost and maximizing the effectiveness of the tests; as a game between tester and system under test; or as a learning problem. We touch on some of these aspects and related algorithmic questions.作者: 陳列 時間: 2025-3-29 22:52
Algorithms for Multi-product Pricingto set prices of multiple products from a single company, so as to maximize the overall revenue of the company. We present approximation algorithms as well as negative results for several variants of the multi-product pricing problem, modeling different purchasing patterns and market assumptions.作者: FICE 時間: 2025-3-30 02:29 作者: 變異 時間: 2025-3-30 06:58 作者: 漂亮才會豪華 時間: 2025-3-30 10:24 作者: EXALT 時間: 2025-3-30 15:19 作者: indoctrinate 時間: 2025-3-30 19:42 作者: ADAGE 時間: 2025-3-31 00:00
https://doi.org/10.1007/978-3-531-91311-7etting, we prove nearly matching upper and lower bounds for the minimum possible number of queries required when the family is the family of all stars of a given size or all cliques of a given size. We further describe some bounds that apply to general graphs.作者: Yag-Capsulotomy 時間: 2025-3-31 01:06 作者: SUGAR 時間: 2025-3-31 06:59 作者: 殖民地 時間: 2025-3-31 10:57 作者: Conquest 時間: 2025-3-31 14:18
Verbreitung von Gewalt an Schulen, an overlay network for . sequence of arrivals and departures of peers up to a certain rate, under a reasonable assumption that Byzantine peers are a sufficient minority. The random distribution allows to proactively protect the system from . adversarial attack within our model.作者: 省略 時間: 2025-3-31 20:02 作者: BOAST 時間: 2025-3-31 22:34 作者: 廢除 時間: 2025-4-1 02:38 作者: LINES 時間: 2025-4-1 07:27
Grammar Compression, LZ-Encodings, and String Algorithms with Implicit Inputroblems. The grammar compression is more convenient than .-encoding, its size differs from that of .-encoding by at most logarithmic factor, the constructive proof is based on the concept similar to balanced trees.作者: Abbreviate 時間: 2025-4-1 11:53
Deciding Knowledge in Security Protocols Under Equational Theorieslations. The messages in question may employ functions (encryption, decryption, etc.) axiomatized in an equational theory. Our main positive results say that, for a large and useful class of equational theories, deducibility and indistinguishability are both decidable in polynomial time.作者: 破譯密碼 時間: 2025-4-1 16:55
Representing Nested Inductive Types Using W-Types a result by Dybjer (1997) who showed that non-nested strictly positive inductive types can be represented using W-types. We also provide a detailed analysis of the categorical infrastructure needed to establish the result.作者: VOC 時間: 2025-4-1 18:40
Learning a Hidden Subgraphetting, we prove nearly matching upper and lower bounds for the minimum possible number of queries required when the family is the family of all stars of a given size or all cliques of a given size. We further describe some bounds that apply to general graphs.作者: PHIL 時間: 2025-4-2 00:57
Optimal Reachability for Weighted Timed Gamesnly known complexity bound for this problem is a doubly-exponential upper bound. We establish a singly-exponential upper bound and show that there exist automata with exponentially many states in a single region with pair-wise distinct optimal strategies.作者: CANON 時間: 2025-4-2 05:10
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphsith just . I/Os. Both our weighted and unweighted approaches require .(..) space. For diameter computations we provide I/O-space tradeoffs. Finally, we provide improved results for both diameter and APSP computation on directed planar graphs.
