Titlebook: Mathematical Foundations of Computer Science 2011; 36th International S Filip Murlak,Piotr Sankowski Conference proceedings 2011 Springer-V

忠誠

書目名稱Mathematical Foundations of Computer Science 2011影響因子(影響力)




書目名稱Mathematical Foundations of Computer Science 2011影響因子(影響力)學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 2011網(wǎng)絡(luò)公開度




書目名稱Mathematical Foundations of Computer Science 2011網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 2011被引頻次




書目名稱Mathematical Foundations of Computer Science 2011被引頻次學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 2011年度引用




書目名稱Mathematical Foundations of Computer Science 2011年度引用學(xué)科排名




書目名稱Mathematical Foundations of Computer Science 2011讀者反饋




書目名稱Mathematical Foundations of Computer Science 2011讀者反饋學(xué)科排名

modish

resilience

The Bounded Search Tree Algorithm for the , Problem Has Quadratic Smoothed Complexity log?/ loglog? and log?. Using smoothed analysis, we prove that such . instances can be solved efficiently by the .(.??+?. ·..)-time algorithm by Gramm . [13]. In particular, we show that for any given . instance ., the expected running time of this algorithm on a small perturbation of . is ..

鎮(zhèn)痛劑

1分開

Duality and Recognitionof the foundations of computer science, including in modal logic and in domain theory. In this talk I will give a general introduction to Stone duality and explain what this has to do with the connection between regular languages and monoids.

dapper

Faster Coupon Collecting via Replication with Applications in Gossipinge in advance without any knowledge of the random sequence..Our main results are lower and asymptotically matching constructive upper bounds for all three models. We also show that network gossiping (similar in spirit to all-in-all CC) is asymptotically no harder than collecting coupons.

podiatrist

Laconic

Nearest Neighbor Search in High-Dimensional SpacesFor instance, it forms the basis of a widely used classification method in machine learning: to label a new object, just find a similar but already-labeled object. Nearest neighbor search also serves as a primitive for other computational problems such as closest pair, minimum spanning tree, or variants of clustering.

供過于求

The Least-Core of Threshold Network Flow Gamesains among its members. However, some games have empty cores, so every distribution is inherently unstable. When the core is empty, one must use a more relaxed notion of stability, such as the least-core. We examine several problems regarding the least-core in general and restricted TNFGs.

Ancestor

Adhesivity Is Not Enough: Local Church-Rosser Revisited be proven in the presence of rules that are merely left-linear, i.e., rules which can merge different parts of a rewritten object. Such rules naturally emerge, e.g., when using graphical encodings for modelling the operational semantics of process calculi.