標(biāo)題: Titlebook: Algorithms and Data Structures; 17th International S Anna Lubiw,Mohammad Salavatipour,Meng He Conference proceedings 2021 Springer Nature S [打印本頁] 作者: 萬能 時(shí)間: 2025-3-21 16:20
書目名稱Algorithms and Data Structures影響因子(影響力)
書目名稱Algorithms and Data Structures影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開度
書目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Data Structures被引頻次
書目名稱Algorithms and Data Structures被引頻次學(xué)科排名
書目名稱Algorithms and Data Structures年度引用
書目名稱Algorithms and Data Structures年度引用學(xué)科排名
書目名稱Algorithms and Data Structures讀者反饋
書目名稱Algorithms and Data Structures讀者反饋學(xué)科排名
作者: PANEL 時(shí)間: 2025-3-21 22:10 作者: 改變 時(shí)間: 2025-3-22 04:19 作者: BRINK 時(shí)間: 2025-3-22 07:46 作者: 愉快么 時(shí)間: 2025-3-22 11:50 作者: 矛盾心理 時(shí)間: 2025-3-22 12:54 作者: 四目在模仿 時(shí)間: 2025-3-22 19:13 作者: 騷動(dòng) 時(shí)間: 2025-3-22 21:59
,Dynamic Dictionaries for Multisets and?Counting Filters with Constant Time Operations,, with high probability, supports operations in constant time and requires space that is . times the information-theoretic lower bound for filters plus .(.) bits..The main technical component of our solution is based on efficiently storing variable-length bounded binary counters and its analysis via作者: 受傷 時(shí)間: 2025-3-23 04:31
,Incomplete Directed Perfect Phylogeny in?Linear Time,properties of the dynamic connectivity problem in this setting, so as to avoid the use of sophisticated data structures as a blackbox. Not only are we successful in doing so, and give a much simpler .-time algorithm for the . problem; our insights into the specific structure of the problem lead to a作者: Substitution 時(shí)間: 2025-3-23 08:31
Solving Problems on Generalized Convex Graphs via Mim-Width,ximum degree or an arbitrarily large number of vertices of degree at least?3. In this way we are able to determine complexity dichotomies for the aforementioned graph problems. Afterwards we perform a more refined width-parameter analysis, which shows even more clearly which width parameters are bou作者: 尾巴 時(shí)間: 2025-3-23 11:53 作者: 討厭 時(shí)間: 2025-3-23 14:49
https://doi.org/10.1007/978-3-658-19626-4A terrain is an .-monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in . time, where . is the number of vertices defining the terrain. The best previous algorithm for this problem has a running time of ..作者: 來就得意 時(shí)間: 2025-3-23 20:51
Improved Bounds on the Spanning Ratio of the Theta-5-Graph,We show an upper bound of . on the spanning ratio of .-graphs, improving on the previous best known upper bound of . [Bose, Morin, van Renssen, and Verdonschot. The Theta-5-graph is a spanner. ., 2015.]作者: 猛擊 時(shí)間: 2025-3-24 00:06
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time,A terrain is an .-monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in . time, where . is the number of vertices defining the terrain. The best previous algorithm for this problem has a running time of ..作者: 嘲笑 時(shí)間: 2025-3-24 04:19 作者: gnarled 時(shí)間: 2025-3-24 10:16
978-3-030-83507-1Springer Nature Switzerland AG 2021作者: 夜晚 時(shí)間: 2025-3-24 13:14
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153153.jpg作者: 抗生素 時(shí)間: 2025-3-24 18:14 作者: 甜食 時(shí)間: 2025-3-24 21:17 作者: parasite 時(shí)間: 2025-3-25 00:20
https://doi.org/10.1007/978-3-322-81608-5ion can influence the duration of a task. Jobs have an unknown processing time that can be explored by running a test. Alternatively, jobs can be executed for the duration of a given upper limit. We consider this problem within the setting of multiple identical parallel machines and present competit作者: 使虛弱 時(shí)間: 2025-3-25 04:18 作者: hieroglyphic 時(shí)間: 2025-3-25 09:50
https://doi.org/10.1007/978-3-662-41559-7tant doubling dimension .. More precisely, given an input parameter ., the .-distortion problem is to find a one-to-one mapping from . to . that distorts distances by a factor at most .. We first show by a reduction from .-clique that, in doubling dimension ., this problem is NP-hard and W[1]-hard. 作者: Liability 時(shí)間: 2025-3-25 13:42
Bergung, Transport und Erste Hilfed graph such that . contains an edge from . to . if and only if . for any two points . and . in ., where |.| denotes the Euclidean distance between . and .. In this paper, we present a data structure of size . such that for any two points in ., we can check in . time if there is a path in . between 作者: TATE 時(shí)間: 2025-3-25 18:31
Taucherunfall — Druckkammerbehandlungf pairs of points in . (which we call .), find a minimum-cardinality superset of . such that every demand pair is connected by a path whose length is the .-distance of the pair. This problem is a variant of three well-studied problems that have arisen in computational geometry, data structures, and 作者: Spinal-Tap 時(shí)間: 2025-3-25 21:54
überdruckverletzung (Barotrauma)d high performance..Compared to the fastest universal hash functions on long strings (clhash and UMASH), HalftimeHash decreases collision probability while also increasing performance by over 50%, exceeding 16 bytes per cycle..In addition, HalftimeHash does not use any widening 64-bit multiplication作者: 增強(qiáng) 時(shí)間: 2025-3-26 00:41 作者: 主動(dòng)脈 時(shí)間: 2025-3-26 04:48
Lebensbedrohliche bakterielle Orbitaprozesseunded-degree (minimum) spanning trees, which have received significant attention. Let . be a set of . points in the plane, and let . be an angle. An .-spanning tree (.-ST) of . is a spanning tree of the complete Euclidean graph over ., with the following property: For each vertex ., the (smallest) a作者: forebear 時(shí)間: 2025-3-26 09:08 作者: gratify 時(shí)間: 2025-3-26 13:54
Der Notfall abseits der Routines the generating function of subsets of its vertices that have a common neighbor. We introduce a parameter for chordal graphs called anchor width and an algorithm to compute the neighborhood polynomial which runs in polynomial time if the anchor width is polynomially bounded. The anchor width is the作者: NEXUS 時(shí)間: 2025-3-26 17:54
Bergung, Transport und Erste Hilfenformation is missing: the Incomplete Directed Perfect Phylogeny (.) problem asks, given a collection of species described by a set of binary characters with some unknown states, to complete the missing states in such a way that the result can be explained with a directed perfect phylogeny. Pe’er et作者: 微粒 時(shí)間: 2025-3-26 23:41
Der Notfall abseits der Routineum-length matching on all points. We say that . is .-. if for any subset . of . edges of . it holds that . is a maximum-length matching on points .. We show that local maximum matchings are good approximations of global ones..Let . be the infimum ratio of the length of any .-local maximum matching t作者: RALES 時(shí)間: 2025-3-27 01:06
Bergung, Transport und Erste Hilfea connected subgraph of?.. Many .-complete problems become polynomial-time solvable for .-convex graphs when . is the set of paths. In this case, the class of .-convex graphs is known as the class of convex graphs. The underlying reason is that this class has bounded mim-width. We extend the latter 作者: Esalate 時(shí)間: 2025-3-27 09:08 作者: 一夫一妻制 時(shí)間: 2025-3-27 10:09 作者: Conjuction 時(shí)間: 2025-3-27 16:51
Algorithms and Data Structures978-3-030-83508-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 名次后綴 時(shí)間: 2025-3-27 18:16
Conference proceedings 2021 August 2021. The 47 full papers, presented together with two invited lectures, were carefully reviewed and selected from a total of 123 submissions. They present original research on the theory, design and application of algorithms and data structures..作者: 交響樂 時(shí)間: 2025-3-28 00:37
0302-9743 rtually in August 2021. The 47 full papers, presented together with two invited lectures, were carefully reviewed and selected from a total of 123 submissions. They present original research on the theory, design and application of algorithms and data structures..978-3-030-83507-1978-3-030-83508-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: happiness 時(shí)間: 2025-3-28 04:31
https://doi.org/10.1007/978-3-322-81608-5egy and a lower bound which approaches 2. In the case of uniform testing times, we can improve the SBS algorithm to be 3-competitive. For the preemptive case we provide a 2-competitive algorithm and a tight lower bound which approaches the same value.作者: Arroyo 時(shí)間: 2025-3-28 06:57 作者: 歡呼 時(shí)間: 2025-3-28 14:29
https://doi.org/10.1007/978-3-662-41559-7lem, which is an optimization version of the .-distortion problem where we allow scaling. For doubling spaces, we prove the same hardness results, and for fixed ., we give a .-approximation algorithm running in time ., where . denotes the minimum distortion between . and ..作者: overbearing 時(shí)間: 2025-3-28 16:15
Der Notfall abseits der Routinen the host tree of a subtree representation. We show that the anchor width of a chordal graph is at most . where . denotes the leafage. This shows that for some subclasses computing the neighborhood polynomial is possible in polynomial time while it is .-hard for general chordal graphs.作者: 遺產(chǎn) 時(shí)間: 2025-3-28 22:45 作者: BARK 時(shí)間: 2025-3-29 00:44
Scheduling with Testing on Multiple Identical Parallel Machines,egy and a lower bound which approaches 2. In the case of uniform testing times, we can improve the SBS algorithm to be 3-competitive. For the preemptive case we provide a 2-competitive algorithm and a tight lower bound which approaches the same value.作者: obnoxious 時(shí)間: 2025-3-29 06:07 作者: DAUNT 時(shí)間: 2025-3-29 10:08
Pattern Matching in Doubling Spaces,lem, which is an optimization version of the .-distortion problem where we allow scaling. For doubling spaces, we prove the same hardness results, and for fixed ., we give a .-approximation algorithm running in time ., where . denotes the minimum distortion between . and ..作者: exacerbate 時(shí)間: 2025-3-29 14:43 作者: Hallowed 時(shí)間: 2025-3-29 18:48 作者: 彈藥 時(shí)間: 2025-3-29 21:20 作者: 裂口 時(shí)間: 2025-3-30 00:08 作者: mercenary 時(shí)間: 2025-3-30 07:15 作者: 爭(zhēng)論 時(shí)間: 2025-3-30 10:20 作者: Enervate 時(shí)間: 2025-3-30 16:23
0302-9743 rtually in August 2021. The 47 full papers, presented together with two invited lectures, were carefully reviewed and selected from a total of 123 submissions. They present original research on the theory, design and application of algorithms and data structures..978-3-030-83507-1978-3-030-83508-8Se作者: cumulative 時(shí)間: 2025-3-30 19:05
Bergung, Transport und Erste Hilfeand .. In this paper, we present a data structure of size . such that for any two points in ., we can check in . time if there is a path in . between the two points. This is the first data structure for answering reachability queries whose performance depends only on . but not on the radius ratio.作者: CHOKE 時(shí)間: 2025-3-30 23:48
überdruckverletzung (Barotrauma)while also increasing performance by over 50%, exceeding 16 bytes per cycle..In addition, HalftimeHash does not use any widening 64-bit multiplications or any finite field arithmetic that could limit its portability.作者: strdulate 時(shí)間: 2025-3-31 01:09
Bisherige empirische Forschung zum Thema,ad that?. has small weight: this is the problem W. S. O. C. T.. We prove an almost-complete complexity dichotomy for W. S. O. C. T. for graphs that do not contain a graph?. as an induced subgraph. Our general approach can also be used for W. S. F. V. S., which enables us to generalize a recent result of Papadopoulos and Tzimas.作者: 高腳酒杯 時(shí)間: 2025-3-31 06:33
Reachability Problems for Transmission Graphs,and .. In this paper, we present a data structure of size . such that for any two points in ., we can check in . time if there is a path in . between the two points. This is the first data structure for answering reachability queries whose performance depends only on . but not on the radius ratio.作者: 意外的成功 時(shí)間: 2025-3-31 10:00 作者: offense 時(shí)間: 2025-3-31 16:03
Computing Weighted Subset Transversals in ,-Free Graphs,ad that?. has small weight: this is the problem W. S. O. C. T.. We prove an almost-complete complexity dichotomy for W. S. O. C. T. for graphs that do not contain a graph?. as an induced subgraph. Our general approach can also be used for W. S. F. V. S., which enables us to generalize a recent result of Papadopoulos and Tzimas.作者: FECT 時(shí)間: 2025-3-31 19:16 作者: 組裝 時(shí)間: 2025-4-1 00:07 作者: 圣歌 時(shí)間: 2025-4-1 03:18 作者: Ejaculate 時(shí)間: 2025-4-1 06:37 作者: 褻瀆 時(shí)間: 2025-4-1 11:17 作者: NUDGE 時(shí)間: 2025-4-1 17:16
On the Spanning and Routing Ratios of the Directed ,-Graph,tric graphs, no bound is known on the spanning and routing ratios of the directed .-graph. We show that the directed .-graph of a point set ., denoted ., is a 7-spanner and there exist point sets where the spanning ratio is at least ., for any .. It is known that the standard greedy .-routing algori作者: 流浪者 時(shí)間: 2025-4-1 21:15 作者: 毗鄰 時(shí)間: 2025-4-1 23:03 作者: GOAT 時(shí)間: 2025-4-2 03:33 作者: Hippocampus 時(shí)間: 2025-4-2 10:47
Pattern Matching in Doubling Spaces,tant doubling dimension .. More precisely, given an input parameter ., the .-distortion problem is to find a one-to-one mapping from . to . that distorts distances by a factor at most .. We first show by a reduction from .-clique that, in doubling dimension ., this problem is NP-hard and W[1]-hard.