Titlebook: Computing and Combinatorics; 27th International C Chi-Yeh Chen,Wing-Kai Hon,Chia-Wei Lee Conference proceedings 2021 Springer Nature Switze

平項(xiàng)山

Molecular Dynamics Simulations,tenations of two similar strings, and prove non-context-freeness of these languages. We consider the Hamming distance and the edit-distance for the error measure of the two similar strings in pseudo-copy languages. When the error has an upper bound or a fixed value, we show that the pseudo-copy lang

remission

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234765.jpg

全面

Limitations of the Impagliazzo–Nisan–Wigderson Pseudorandom Generator Against Permutation Branching dered branching programs of length ., width ., and alphabet size . to within error .. A series of works have shown that the analysis of the INW generator can be improved for the class of . branching programs or the more general . branching programs, improving the . dependence on the length . to . or

Offensive

All-to-All Broadcast in Dragonfly Networksach router to all routers. Two different all-to-all broadcast algorithms GFA2A and RFA2A using the previous group-first and router-first one-to-all broadcast schemes are presented. A new all-to-all broadcast algorithm named A2A is presented by collecting all messages from all routers in the same gro

deactivate

An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences(LIS) problem and the longest common subsequence (LCS) problem. In this paper, we propose an algorithm that finds every LCIS of two sequences .,?. of length . in . time and space, where . denotes the size of the alphabet set and . the total number of increasing subsequences contained in . (thus, the

Dawdle

hemoglobin

COWER

General Max-Min Fair Allocationr own utilities for the resources, and the goal is to find an assignment that maximizes the minimum total utility of resources assigned to a player. We introduce an over-estimation strategy to help overcome the challenges of each resource having different utilities for different players. When all re

蜈蚣

On the Approximation Hardness of Geodetic Set and Its Variantspath between two vertices of the subset. A strong geodetic set is a subset S of vertices and a choice of a shortest path for every pair of vertices of S such that every vertex is on one of these shortest paths. The geodetic number (resp. edge geodetic number) of a graph is the minimum size of a geod

ethnology