標題: Titlebook: Automata, Languages and Programming; 37th International C Samson Abramsky,Cyril Gavoille,Paul G. Spirakis Conference proceedings 2010 Sprin [打印本頁] 作者: Inveigle 時間: 2025-3-21 20:06
書目名稱Automata, Languages and Programming影響因子(影響力)
書目名稱Automata, Languages and Programming影響因子(影響力)學科排名
書目名稱Automata, Languages and Programming網(wǎng)絡公開度
書目名稱Automata, Languages and Programming網(wǎng)絡公開度學科排名
書目名稱Automata, Languages and Programming被引頻次
書目名稱Automata, Languages and Programming被引頻次學科排名
書目名稱Automata, Languages and Programming年度引用
書目名稱Automata, Languages and Programming年度引用學科排名
書目名稱Automata, Languages and Programming讀者反饋
書目名稱Automata, Languages and Programming讀者反饋學科排名
作者: Cirrhosis 時間: 2025-3-21 22:02 作者: 確定的事 時間: 2025-3-22 04:03 作者: Daily-Value 時間: 2025-3-22 06:24 作者: 小鹿 時間: 2025-3-22 11:16
,Zur Gewaltf?rmigkeit von Kultur,n the whole graph ...In the second part of our paper, we describe another dynamic subgraph connectivity structure with amortized . update time, . query time and linear space, which improves the structure introduced by [Chan, P?tra?cu, Roditty, FOCS’08] that takes . space.作者: 歡樂東方 時間: 2025-3-22 13:12 作者: 蠟燭 時間: 2025-3-22 21:00
Mergeable Dictionarieslit and Merge operations in . amortized time was presented by Farach and Thorup [4]. In contrast, our data structure supports all operations, including Split and Merge, in . amortized time, thus showing that interleaved Merge operations can be supported at no additional cost vis-à-vis disjoint Merge operations.作者: 油膏 時間: 2025-3-23 01:14
New Data Structures for Subgraph Connectivityn the whole graph ...In the second part of our paper, we describe another dynamic subgraph connectivity structure with amortized . update time, . query time and linear space, which improves the structure introduced by [Chan, P?tra?cu, Roditty, FOCS’08] that takes . space.作者: adjacent 時間: 2025-3-23 04:37
Ruth Stanley (Wissenschaftliche Assistentin)estigation, we revisit the framework of . and mostly concentrate on the research on ., which sparked the interconnection between local search and game theory. We conclude by stating various open problems.作者: 從屬 時間: 2025-3-23 06:32 作者: 寬大 時間: 2025-3-23 10:03
https://doi.org/10.1007/978-3-322-83356-3pressible in the monadic second order logic can be computed in linear time for matroids given by a decomposition with bounded width. We also relate the decomposition width to matroid branch-width and discuss implications of our results with respect to other known algorithms.作者: 繞著哥哥問 時間: 2025-3-23 15:09 作者: 小爭吵 時間: 2025-3-23 18:23 作者: 全部 時間: 2025-3-24 01:08
https://doi.org/10.1007/978-3-322-92539-8 2003] and Harvey, Ladner, Lovász and Tamir [WADS 2003 and Journal of Algorithms 2006]. We also extend this algorithm to solve the . problem in . time, improving the previous .(.)-time algorithm by Harada, Ono, Sadakane and Yamashita [ISAAC 2008].作者: EXULT 時間: 2025-3-24 05:44 作者: Oversee 時間: 2025-3-24 07:01
Faster Algorithms for Semi-matching Problems (Extended Abstract) 2003] and Harvey, Ladner, Lovász and Tamir [WADS 2003 and Journal of Algorithms 2006]. We also extend this algorithm to solve the . problem in . time, improving the previous .(.)-time algorithm by Harada, Ono, Sadakane and Yamashita [ISAAC 2008].作者: NOTCH 時間: 2025-3-24 12:23
Local Search: Simple, Successful, But Sometimes Sluggishestigation, we revisit the framework of . and mostly concentrate on the research on ., which sparked the interconnection between local search and game theory. We conclude by stating various open problems.作者: daredevil 時間: 2025-3-24 16:28 作者: aviator 時間: 2025-3-24 21:01 作者: Functional 時間: 2025-3-25 02:23
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctionshful greedy algorithms for CA problems? The notion of greediness is associated with a broad class of algorithms, known as priority algorithms, which encapsulates many natural auction methods. We show that no truthful greedy priority algorithm can obtain an approximation to the CA problem that is sublinear in ., even for .-CAs with .?≥?2.作者: Glower 時間: 2025-3-25 03:21
Globalization and its consequencesy to check, it is by far not obvious how to compute a satisfying assignment efficiently in case the conditions are fulfilled; until recently, it was not known how to do so. It is also remarkable that while deciding satisfiability is trivial for formulas that satisfy the conditions, a slightest relax作者: Repatriate 時間: 2025-3-25 11:23
Hanne-Margret Birckenbach,Christian Wellmann the length of the data string, even for metrics whose calculation is ... For the Hamming metric we can reconstruct the corrupted data in near linear time even for unbounded alphabets. This result is achieved using the property of . in the self-convolution vector and Reed-Solomon codes. Finally, we 作者: Fibroid 時間: 2025-3-25 11:43 作者: 發(fā)炎 時間: 2025-3-25 19:35 作者: Explosive 時間: 2025-3-25 23:47 作者: UTTER 時間: 2025-3-26 00:48 作者: Frequency-Range 時間: 2025-3-26 05:43
MedR Schriftenreihe Medizinrecht computations which only make a black-box use of the underlying field or ring; (2) a non-interactive VC protocol for boolean circuits in the preprocessing model, conceptually simplifying and improving the online complexity of a recent protocol of Gennaro et al.?(Cryptology ePrint Archive: Report 200作者: affluent 時間: 2025-3-26 12:05 作者: Adulate 時間: 2025-3-26 14:30
When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiabilityy to check, it is by far not obvious how to compute a satisfying assignment efficiently in case the conditions are fulfilled; until recently, it was not known how to do so. It is also remarkable that while deciding satisfiability is trivial for formulas that satisfy the conditions, a slightest relax作者: 有罪 時間: 2025-3-26 19:13 作者: 慢慢啃 時間: 2025-3-26 23:31
The Cooperative Game Theory Foundations of Network Bargaining Gamesish a novel connection between well-studied cooperative game theory concepts and the solution concepts of . and . defined for the bargaining games. This immediately implies one can take advantage of the results and algorithms in cooperative game theory to reproduce results such as those of Azar et a作者: right-atrium 時間: 2025-3-27 01:08
On the Existence of Pure Nash Equilibria in Weighted Congestion Gameshile . must be equal for every .. This characterization is even valid for 3-player games, thus, closing the gap to 2-player games considered above. Finally, we derive various results regarding consistency and FIP-consistency for weighted network congestion games.作者: 含鐵 時間: 2025-3-27 07:21 作者: visual-cortex 時間: 2025-3-27 12:35 作者: AWE 時間: 2025-3-27 15:40 作者: 針葉樹 時間: 2025-3-27 20:24 作者: Migratory 時間: 2025-3-28 01:46
Ruth Stanley (Wissenschaftliche Assistentin)istics and present results on the complexity of the frequently used standard local search algorithm for various problems. Here, our focus in on worst case, average case, and smoothed complexity along with the existence of sequences of improving steps of exponential length. For a more theoretical inv作者: consolidate 時間: 2025-3-28 04:52
Globalization and its consequencesow serious these constraints are) is necessary so that all of them cannot be satisfied simultaneously?.For a concrete setting we consider boolean formulas in conjunctive normal form (CNF), where the clauses play the role of constraints. If all clauses are large, it needs many clauses to obtain an un作者: 植物群 時間: 2025-3-28 08:37 作者: deceive 時間: 2025-3-28 12:32
Ruth Stanley (Wissenschaftliche Assistentin)s paper we design a randomized polynomial-time approximation algorithm for SDP. achieving an approximation ratio of.We show that under the assumption of the unique games conjecture the achieved approximation ratio is optimal: There is no polynomial-time algorithm which approximates SDP. with a ratio作者: 儲備 時間: 2025-3-28 15:58
Hanne-Margret Birckenbach,Christian Wellmanny be caused by measurements errors, or natural features of the phenomenon. This paper studies the problem of recovering the correct cycle from data corrupted by various error models, formally defined as the .. Specifically, we define a metric property which we call . and study the period recovery pr作者: 面包屑 時間: 2025-3-28 20:17
https://doi.org/10.1007/978-3-322-83356-3in linear time for matroids with bounded branch-width that are represented over finite fields. To be able to extend these algorithmic results to matroids not representable over finite fields, we introduce a new matroid width parameter, the decomposition width, and show that every matroid property ex作者: Sigmoidoscopy 時間: 2025-3-29 02:15 作者: Mercurial 時間: 2025-3-29 05:16
https://doi.org/10.1007/978-3-663-14413-7d congestion game with cost functions in . possesses a pure Nash equilibrium. We say that . is . if every weighted congestion game with cost functions in . has the Finite Improvement Property. Our main results are structural characterizations of consistency for twice continuously differentiable cost作者: 思考而得 時間: 2025-3-29 09:23
Die Spur des Anderen im Selbst,lar interest is the special case in which agents are interested in sets of size at most . (.-CAs), where a simple greedy algorithm obtains an .?+?1 approximation but no truthful algorithm is known to perform better than .. As partial work towards resolving this gap, we ask: what is the power of trut作者: conifer 時間: 2025-3-29 11:47
,Die Unf?higkeit (nicht) zu lieben,s satisfiable, and if the value of the game is negative the formula has a polynomial-size refutation in Σ.-Frege (a.k.a.?DNF-resolution). This reduces the problem of solving mean-payoff games to the weak automatizability of Σ.-Frege, and to the interpolation problem for Σ.-Frege. Since the interpola作者: Sigmoidoscopy 時間: 2025-3-29 16:59 作者: 亞麻制品 時間: 2025-3-29 21:17
MedR Schriftenreihe Medizinrechtypting a plaintext .′ that is related to .. At ICALP’05, Fischlin suggested a stronger notion, called ., where non-malleability should be preserved against adversaries attempting to compute encryptions of related plaintexts under newly generated public keys. This new notion applies to systems where 作者: 乳汁 時間: 2025-3-30 02:58
https://doi.org/10.1007/978-3-662-68260-9perations, as long as their strategies cannot be used for communication between them. The study of multi-prover interactive proof systems with no-signaling provers has been motivated by the study of those with provers sharing quantum states. The relation between them is that no-signaling strategies 作者: Muffle 時間: 2025-3-30 05:12
MedR Schriftenreihe Medizinrechtnally strong but untrusted server. We present new general approaches for constructing VC protocols, as well as solving the related problems of program checking and self-correcting. The new approaches reduce the task of verifiable computation to suitable variants of secure multiparty computation (MPC作者: Disk199 時間: 2025-3-30 11:18
Hintergrund und Methodik der Arbeit collection of disjoint sets of totally ordered data. While in a typical mergeable dictionary (e.g. 2-4 Trees), the Merge operation can only be performed on sets that span disjoint intervals in keyspace, the structure here has no such limitation. A data structure which can handle arbitrary Merge ope作者: 任意 時間: 2025-3-30 12:25
https://doi.org/10.1007/978-3-322-92539-8aster algorithms for both weighted and unweighted case..For the weighted case, we give an .(.log.)-time algorithm, where . is the number of vertices and . is the number of edges, by exploiting the geometric structure of the problem. This improves the classical .(..) algorithms by Horn [Operations Re作者: 負擔 時間: 2025-3-30 19:09
https://doi.org/10.1007/978-3-322-92539-8 all of which have distinct colors. We give a 2-approximation to this problem for any ? when the objective is to minimize the maximum radius of any cluster. We show that the approximation ratio is optimal unless .., by providing a matching lower bound. Several extensions to our algorithm have also b作者: 助記 時間: 2025-3-31 00:00 作者: Costume 時間: 2025-3-31 01:41
,Ein Versteck für Schlangen und Spinnen,s each capable of holding a single key. Each key has .?≥?3 (distinct) associated buckets chosen uniformly at random and independently of the choices of other keys. A hash table can be constructed successfully if each key can be placed into one of its buckets. We seek thresholds .. such that, as . go作者: CRAFT 時間: 2025-3-31 07:14 作者: adj憂郁的 時間: 2025-3-31 12:55 作者: condone 時間: 2025-3-31 17:20
0302-9743 Overview: 978-3-642-14164-5978-3-642-14165-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: novelty 時間: 2025-3-31 20:03
Ruth Stanley (Wissenschaftliche Assistentin)egree is 14. We show that . always contains a plane spanner of maximum degree?6 and stretch factor?6. This spanner can be constructed efficiently in linear time given the Triangular Distance Delaunay triangulation introduced by Chew.作者: Brain-Waves 時間: 2025-4-1 01:17 作者: 流浪 時間: 2025-4-1 03:44
978-3-642-14164-5Springer-Verlag Berlin Heidelberg 2010作者: Panacea 時間: 2025-4-1 07:19
