標(biāo)題: Titlebook: Automata, Languages, and Programming; 42nd International C Magnús M. Halldórsson,Kazuo Iwama,Bettina Speckman Conference proceedings 2015 S [打印本頁(yè)] 作者: 嬉戲 時(shí)間: 2025-3-21 19:34
書目名稱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é)科排名
作者: 蕁麻 時(shí)間: 2025-3-21 23:53
https://doi.org/10.1007/978-3-322-81705-1 about .. Randomized encodings of functions have found many applications in different areas of cryptography, including secure multiparty computation, efficient parallel cryptography, and verifiable computation..We initiate a complexity-theoretic study of the class . of languages (or boolean function作者: 串通 時(shí)間: 2025-3-22 02:45
Zielgestaltung und Voraussetzungen,FFT) from 1964 is a method for computing this transformation in time .. Achieving a matching lower bound in a reasonable computational model is one of the most important open problems in theoretical computer science. In 2014, improving on his previous work, Ailon showed that if an algorithm speeds u作者: 允許 時(shí)間: 2025-3-22 07:31
Grundlegende Zuordnungskriterien, of faults. Standard competitive analysis gives overly pessimistic results as it ignores the fact that real-world input sequences exhibit locality of reference. In this paper we study the paging problem using an intuitive and simple locality model that records inter-request distances in the input. A作者: 公豬 時(shí)間: 2025-3-22 09:36 作者: AMPLE 時(shí)間: 2025-3-22 15:29 作者: commune 時(shí)間: 2025-3-22 18:27
https://doi.org/10.1007/978-3-663-02502-3is heard at a specific location, in a setting consisting of .?simultaneous transmitters and background noise. The SINR model gives rise to a natural geometric object, the ., which partitions the space into . regions where each of the transmitters can be heard and the remaining space where no transmi作者: BIBLE 時(shí)間: 2025-3-22 21:56
Die Bewertung von Ausgleichsforderungen reordering/sequencing problems. In this problem, colored items arrive over time, and are placed in a buffer of size .. When the buffer becomes full, an item must be removed from the buffer. A penalty cost is incurred each time the sequence of removed items switches colors. In the non-uniform cost m作者: Aprope 時(shí)間: 2025-3-23 05:15
,Grundzüge der Gewinnbeteiligung,n events. In an arrival event a ball is stored in an empty bin chosen by the adversary and discarded if no bin is empty. In an extraction event, an algorithm selects a bin, clears it, and gains its content. We are interested in analyzing the gain of an algorithm which serves in the dark without any 作者: lanugo 時(shí)間: 2025-3-23 09:01 作者: 簡(jiǎn)潔 時(shí)間: 2025-3-23 10:49 作者: 名次后綴 時(shí)間: 2025-3-23 17:20
,Einkauf — Effizienzquelle der Zukunft,onstraints is not necessary; the algorithm works as long as there exists an oracle that, on a proposed candidate solution, returns a violation in the form of a separating hyperplane. Can linear programming still be efficiently solved if the returned violation is in other formats?.Motivated by some r作者: 男學(xué)院 時(shí)間: 2025-3-23 19:52
A. Hessel,M. Geyer,G. Pl?ttner,E. Br?hlerontrolled by an adversary. Santha and Vazirani show that deterministic randomness extraction from these sources is impossible. In this paper, we study the generalization of SV sources for non-binary sequences. We show that unlike the binary case, deterministic randomness extraction in the generalize作者: 轉(zhuǎn)向 時(shí)間: 2025-3-23 22:28 作者: 和音 時(shí)間: 2025-3-24 03:46 作者: CROW 時(shí)間: 2025-3-24 09:32 作者: PATRI 時(shí)間: 2025-3-24 12:10
Gewinne und Verluste sozialen Wandelsction? We consider such . constraint satisfaction problems, and design the first nontrivial approximation algorithms in this context..Our main result is that for every CSP ., for ., there is a polynomial time constant factor . approximation algorithm for . simultaneous .-.-CSP instances. Our methods作者: 紡織品 時(shí)間: 2025-3-24 16:10 作者: 離開就切除 時(shí)間: 2025-3-24 21:34 作者: evanescent 時(shí)間: 2025-3-24 23:17
Gewinnen Strategien für mathematische Spielear, when given any non-empty set system, we prove that randomly restricting elements of its ground set makes the size of the restricted set system an odd number with significant probability. When compared to previously known reductions of this type, ours excel in their simplicity: For graph problems作者: 賠償 時(shí)間: 2025-3-25 05:51
What Percentage of Programs Halt?,programs. Does this quantity have a limit value? In this paper, we show that it is not the case, and further characterise the reals which can be the limsup of such a sequence .. We also study, for a given optimal machine?., how hard it is to approximate the domain of?. from the point of view of coarse and generic computability.作者: Cholesterol 時(shí)間: 2025-3-25 09:40
https://doi.org/10.1007/978-3-662-47672-7Algorithms; Automata; Categorical semantics; Computational complexity; Constraint satisfaction; Convex op作者: 褻瀆 時(shí)間: 2025-3-25 14:34
978-3-662-47671-0Springer-Verlag Berlin Heidelberg 2015作者: Sputum 時(shí)間: 2025-3-25 16:45 作者: 提煉 時(shí)間: 2025-3-25 22:37
Gewinnen Strategien für mathematische Spieleprograms. Does this quantity have a limit value? In this paper, we show that it is not the case, and further characterise the reals which can be the limsup of such a sequence .. We also study, for a given optimal machine?., how hard it is to approximate the domain of?. from the point of view of coarse and generic computability.作者: Coronary-Spasm 時(shí)間: 2025-3-26 00:16 作者: 提升 時(shí)間: 2025-3-26 04:32
Grundlegende Zuordnungskriterien,r of page faults incurred by an optimal offline algorithm .. The bound is tight up to a small additive constant. Based on these expressions for .’s cost, we obtain nearly tight upper and lower bounds on .’s competitiveness, given any characteristic vector .. The resulting ratios range between?1 and 作者: AVOW 時(shí)間: 2025-3-26 10:22 作者: 逗它小傻瓜 時(shí)間: 2025-3-26 13:01 作者: Buttress 時(shí)間: 2025-3-26 17:20
https://doi.org/10.1007/978-3-663-02502-3s strongly not only on the number?. of transmitters and on the approximation parameter ., but also on some geometric parameters that cannot be bounded . as a function of?. or?...In this paper, we address the question of . point location queries, i.e., answering many queries simultaneously. Specifica作者: 摸索 時(shí)間: 2025-3-26 21:23 作者: 尾隨 時(shí)間: 2025-3-27 03:16 作者: 揭穿真相 時(shí)間: 2025-3-27 07:19 作者: overreach 時(shí)間: 2025-3-27 13:18
,Einkauf — Effizienzquelle der Zukunft,defined by the constraints. In this case, the LP can be efficiently solved (under a mild condition of non-degeneracy). (2) The oracle returns the index of an arbitrary (i.e., worst-case) violated constraint. In this case, we give an algorithm with running time exponential in the number of variables.作者: 迅速飛過(guò) 時(shí)間: 2025-3-27 16:16 作者: Adrenaline 時(shí)間: 2025-3-27 19:28 作者: 配置 時(shí)間: 2025-3-27 23:37 作者: 不能約 時(shí)間: 2025-3-28 04:34
Quantifying Competitiveness in Paging with Locality of Reference,r of page faults incurred by an optimal offline algorithm .. The bound is tight up to a small additive constant. Based on these expressions for .’s cost, we obtain nearly tight upper and lower bounds on .’s competitiveness, given any characteristic vector .. The resulting ratios range between?1 and 作者: 符合規(guī)定 時(shí)間: 2025-3-28 10:16
Approximation Algorithms for Computing Maximin Share Allocations,ents, for which it is already known that exact maximin share allocations do not always exist. We provide a .-approximation algorithm for this case, improving on the currently known ratio of .. Finally, we undertake a probabilistic analysis. We prove that in randomly generated instances, with high pr作者: 漸變 時(shí)間: 2025-3-28 10:36 作者: 不來(lái) 時(shí)間: 2025-3-28 16:25 作者: Harbor 時(shí)間: 2025-3-28 21:33
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs,hat version of the problem (Adamaszek et al. , STOC 2011). In this paper, we give an .-competitive algorithm for the non-uniform case, where . is the ratio of the maximum to minimum color weight. Our work demonstrates that randomness can achieve exponential improvement in the competitive ratio even 作者: 準(zhǔn)則 時(shí)間: 2025-3-29 00:42
Serving in the Dark should be done Non-Uniformly,how that although no information is ever provided to the algorithm, using non-uniform probability distribution reduces the competitive ratio. Specifically, we design a 1.55-competitive algorithm and establish a lower bound of 1.5. We also prove a lower bound of 2 against any deterministic algorithm.作者: 慢跑鞋 時(shí)間: 2025-3-29 04:04
Approximation Algorithms for Min-Sum ,-Clustering and Balanced ,-Median,dian in metrics with constant doubling dimension..As in the work of Bartal et al., our approximation for general metrics uses embeddings into tree metrics. The main technical contribution in this paper is an .(1)-approximation for Balanced .-Median in hierarchically separated trees (HSTs). Our impro作者: decode 時(shí)間: 2025-3-29 08:16
Solving Linear Programming with Constraints Unknown,defined by the constraints. In this case, the LP can be efficiently solved (under a mild condition of non-degeneracy). (2) The oracle returns the index of an arbitrary (i.e., worst-case) violated constraint. In this case, we give an algorithm with running time exponential in the number of variables.作者: 編輯才信任 時(shí)間: 2025-3-29 13:13
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources,to extract common randomness without communication. Using the notion of ., we prove a necessary condition and a sufficient condition for the possibility of common randomness extraction from these sources. Based on these two conditions, the problem of common randomness extraction essentially reduces 作者: CHIDE 時(shí)間: 2025-3-29 15:57
Limitations of Algebraic Approaches to Graph Isomorphism Testing, related to the combinatorial Weisfeiler-Lehman algorithm. We exactly characterise the power of the Weisfeiler-Lehman algorithm in terms of an algebraic proof system that lies between degree-. Nullstellensatz and degree-. polynomial calculus.作者: Fibroid 時(shí)間: 2025-3-29 23:47 作者: Offensive 時(shí)間: 2025-3-30 02:56 作者: 同謀 時(shí)間: 2025-3-30 04:47 作者: PLUMP 時(shí)間: 2025-3-30 10:51
Quantifying Competitiveness in Paging with Locality of Reference, of faults. Standard competitive analysis gives overly pessimistic results as it ignores the fact that real-world input sequences exhibit locality of reference. In this paper we study the paging problem using an intuitive and simple locality model that records inter-request distances in the input. A作者: escalate 時(shí)間: 2025-3-30 14:22 作者: Control-Group 時(shí)間: 2025-3-30 19:24 作者: 幾何學(xué)家 時(shí)間: 2025-3-30 23:28
Batched Point Location in SINR Diagrams via Algebraic Tools,is heard at a specific location, in a setting consisting of .?simultaneous transmitters and background noise. The SINR model gives rise to a natural geometric object, the ., which partitions the space into . regions where each of the transmitters can be heard and the remaining space where no transmi作者: 小步走路 時(shí)間: 2025-3-31 04:15 作者: GROSS 時(shí)間: 2025-3-31 06:55 作者: 油膏 時(shí)間: 2025-3-31 09:46
Finding the Median (Obliviously) with Bounded Space,problem of determining whether the median is odd or even. It is nearly optimal since Chan, following Munro and Raman, has shown that there is a (randomized) selection algorithm using only . registers, each of which can store an input value or .-bit counter, that makes only . passes over the input. T作者: AGGER 時(shí)間: 2025-3-31 13:42 作者: BARGE 時(shí)間: 2025-3-31 21:29
Solving Linear Programming with Constraints Unknown,onstraints is not necessary; the algorithm works as long as there exists an oracle that, on a proposed candidate solution, returns a violation in the form of a separating hyperplane. Can linear programming still be efficiently solved if the returned violation is in other formats?.Motivated by some r作者: 確保 時(shí)間: 2025-4-1 00:40 作者: 不愛防注射 時(shí)間: 2025-4-1 04:32 作者: Ataxia 時(shí)間: 2025-4-1 09:11
