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影响因子(影响力)学科排名




书目名称Mathematical Foundations of Computer Science 2011网络公开度




书目名称Mathematical Foundations of Computer Science 2011网络公开度学科排名




书目名称Mathematical Foundations of Computer Science 2011被引频次




书目名称Mathematical Foundations of Computer Science 2011被引频次学科排名




书目名称Mathematical Foundations of Computer Science 2011年度引用




书目名称Mathematical Foundations of Computer Science 2011年度引用学科排名




书目名称Mathematical Foundations of Computer Science 2011读者反馈




书目名称Mathematical Foundations of Computer Science 2011读者反馈学科排名

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 ..

镇痛剂

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.