標題: Titlebook: Algorithms and Data Structures; Third Workshop, WADS Frank Dehne,J?rg-Rüdiger Sack,Sue Whitesides Conference proceedings 1993 Springer-Verl [打印本頁] 作者: 從未沮喪 時間: 2025-3-21 19:47
書目名稱Algorithms and Data Structures影響因子(影響力)
書目名稱Algorithms and Data Structures影響因子(影響力)學科排名
書目名稱Algorithms and Data Structures網(wǎng)絡公開度
書目名稱Algorithms and Data Structures網(wǎng)絡公開度學科排名
書目名稱Algorithms and Data Structures被引頻次
書目名稱Algorithms and Data Structures被引頻次學科排名
書目名稱Algorithms and Data Structures年度引用
書目名稱Algorithms and Data Structures年度引用學科排名
書目名稱Algorithms and Data Structures讀者反饋
書目名稱Algorithms and Data Structures讀者反饋學科排名
作者: 字的誤用 時間: 2025-3-21 23:17 作者: 暴行 時間: 2025-3-22 02:10 作者: 無政府主義者 時間: 2025-3-22 07:55 作者: 土坯 時間: 2025-3-22 09:02 作者: CODE 時間: 2025-3-22 13:44
Probing a set of hyperplanes by lines and related problems,n points of a query line with the hyperplanes. Under this model, this paper investigates the complexity to find a generic line for . and further to determine the hyperplanes in .. This problem arises in factoring the .-resultant to solve systems of polynomials (e.g., Renegar [13]). We prove that d+1作者: NIL 時間: 2025-3-22 17:35 作者: Frisky 時間: 2025-3-23 00:28 作者: Monocle 時間: 2025-3-23 03:52
A dynamic separator algorithm,here separators of size .=O(n.) for a set of points in R...We present randomized, dynamic algorithms to maintain separators and answer queries about a dynamically changing point set. Our algorithms maintain a separator in expected time .(log .) and maintain a separator tree in expected time .(log..)作者: 支架 時間: 2025-3-23 07:26
Online load balancing of temporary tasks, arrival to one of the machines, increasing the load on this machine for the duration of the task. The goal is to minimize the maximum load..Azar, Broder and Karlin studied the . case where for each task there is a subset of machines capable of executing it; the increase in load due to assignment of作者: 雄辯 時間: 2025-3-23 11:14 作者: 為現(xiàn)場 時間: 2025-3-23 16:52
The complexity of finding certain trees in tournaments,zing various directed trees in tournaments. Hell and Rosenfeld considered orientations of paths, and showed the existence of oriented paths on . vertices finding which in .. requires . lg. n) “edge probes” where . ≤ 1 is any fixed non-negative constant. Here, we investigate the complexity of finding作者: Flu表流動 時間: 2025-3-23 22:05
Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planarnar embedding of a planar graph such that its orthogonal drawing has the minimum number of bends is a fundamental open problem in graph drawing. This paper provides the first partial solution to the problem. It gives a new combinatorial characterization of orthogonal drawings based on the concept of作者: OFF 時間: 2025-3-24 01:30 作者: evince 時間: 2025-3-24 06:13
Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with inteller-values (ANSV) problems) for input elements drawn from the integer domain [1., .] where .≥.. Recent work [4] has shown that parallel algorithms that are sensitive to the size of the input domain can improve on more general parallel algorithms. The cited paper demonstrates an .(log log log .)-ste作者: 卷發(fā) 時間: 2025-3-24 08:29
https://doi.org/10.1007/978-3-642-49798-8 in the plane, we consider the problem of computing the matrix of longest chain lengths between all pairs of points in ., and the matrix of “parent” pointers that describes the . longest chain trees. We present a simple sequential algorithm for computing these matrices. Our algorithm runs in ..) tim作者: MAIM 時間: 2025-3-24 11:51 作者: 轉向 時間: 2025-3-24 16:34 作者: 催眠藥 時間: 2025-3-24 22:01
https://doi.org/10.1007/978-3-642-49798-8ll polygons of . intersected by a query segment can be reported efficiently, and (ii) Preprocess a set . of . segments, so that the connected components of the arrangement of . intersected by a query segment can be reported quickly. In both cases the data structure should return the labels of the in作者: 口味 時間: 2025-3-24 23:12 作者: 防銹 時間: 2025-3-25 06:00 作者: 離開可分裂 時間: 2025-3-25 08:10
,Der prim?re Leberkrebs beim Tier,nables one to show lower bounds on the number of I/O-operations needed to solve a problem whenever a lower bound on the number of comparisons is known. We use the result to show lower bounds on the I/O-complexity on a number of problems where known techniques only give trivial bounds. Among these ar作者: 確定方向 時間: 2025-3-25 11:47 作者: magnanimity 時間: 2025-3-25 16:47
,Der prim?re Leberkrebs beim Tier,here separators of size .=O(n.) for a set of points in R...We present randomized, dynamic algorithms to maintain separators and answer queries about a dynamically changing point set. Our algorithms maintain a separator in expected time .(log .) and maintain a separator tree in expected time .(log..)作者: 坦白 時間: 2025-3-25 21:10 作者: 夜晚 時間: 2025-3-26 03:49 作者: Minikin 時間: 2025-3-26 07:47
https://doi.org/10.1007/978-3-642-92649-5zing various directed trees in tournaments. Hell and Rosenfeld considered orientations of paths, and showed the existence of oriented paths on . vertices finding which in .. requires . lg. n) “edge probes” where . ≤ 1 is any fixed non-negative constant. Here, we investigate the complexity of finding作者: 造反,叛亂 時間: 2025-3-26 08:39
https://doi.org/10.1007/978-3-642-92649-5nar embedding of a planar graph such that its orthogonal drawing has the minimum number of bends is a fundamental open problem in graph drawing. This paper provides the first partial solution to the problem. It gives a new combinatorial characterization of orthogonal drawings based on the concept of作者: 修飾語 時間: 2025-3-26 14:03
https://doi.org/10.1007/978-3-642-94543-4on can be easily solved in time .(√.) on a CREW PRAM with communication width one, this gives a separation between the two models. Our result can be extended to show a separation whenever the EREW PRAM has communication width . ε .(√.).作者: 美麗的寫 時間: 2025-3-26 18:23
https://doi.org/10.1007/978-3-642-94543-4ller-values (ANSV) problems) for input elements drawn from the integer domain [1., .] where .≥.. Recent work [4] has shown that parallel algorithms that are sensitive to the size of the input domain can improve on more general parallel algorithms. The cited paper demonstrates an .(log log log .)-ste作者: euphoria 時間: 2025-3-27 00:37 作者: Limpid 時間: 2025-3-27 01:45 作者: CRACK 時間: 2025-3-27 05:25
Der Privatisierungsproze? in Ru?landWe describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time .(log .) for point set input and .(log . log .) time for planar straight-line graphs, using .(.+./ log .) processors, where . measures input size and . output size.作者: eardrum 時間: 2025-3-27 10:42
Balanced search trees made simple,As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenance algorithms for balanced trees. In terms of code simplicity, our algorithms compare favourably with those for deterministic and probabilistic skip lists.作者: Colonnade 時間: 2025-3-27 16:52
Parallel construction of quadtrees and quality triangulations,We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time .(log .) for point set input and .(log . log .) time for planar straight-line graphs, using .(.+./ log .) processors, where . measures input size and . output size.作者: 欄桿 時間: 2025-3-27 20:45 作者: Abominate 時間: 2025-3-27 22:17
Algorithms and Data Structures978-3-540-47918-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: adroit 時間: 2025-3-28 04:33 作者: 危機 時間: 2025-3-28 10:17 作者: 環(huán)形 時間: 2025-3-28 14:18 作者: Heart-Rate 時間: 2025-3-28 17:10 作者: gruelling 時間: 2025-3-28 21:39 作者: Intellectual 時間: 2025-3-29 02:01 作者: 地牢 時間: 2025-3-29 05:17 作者: 事物的方面 時間: 2025-3-29 07:55
,Der prim?re Leberkrebs beim Tier,lem on AT-free graphs. These results, in addition to solving these problems on this large class of graphs, also strengthen the conjecture of White. et. al. [9] that these two problems are algorithmically closely related.作者: rods366 時間: 2025-3-29 13:29 作者: 排斥 時間: 2025-3-29 15:54 作者: 茁壯成長 時間: 2025-3-29 23:17 作者: 方舟 時間: 2025-3-30 03:45 作者: NAUT 時間: 2025-3-30 07:46 作者: 開玩笑 時間: 2025-3-30 08:19 作者: 抗生素 時間: 2025-3-30 14:51 作者: FECT 時間: 2025-3-30 18:50
A dynamic separator algorithm, .-neighborhood graphs..We also give a general technique for transforming a class of expected time randomized incremental algorithms that use random sampling into incremental algorithms with high likelihood time bounds. In particular, we show how we can maintain separators in time .(log..) with high likelihood.作者: 饒舌的人 時間: 2025-3-31 00:20
The complexity of finding certain trees in tournaments, outdegree .(.?1)/2) in .. is . We also establish an ..) lower bound for finding a vertex of maximum outdegree in ... These bounds are in sharp contrast to the . bounds for selection in the case of transitive tournaments.作者: Manifest 時間: 2025-3-31 04:53 作者: 千篇一律 時間: 2025-3-31 06:34
Connected component and simple polygon intersection searching,tersected polygons or components, not their complete description. Efficient data structures are presented for the static case, the dynamic case, and an efficient on-line construction algorithm for the connected components is given.作者: 性上癮 時間: 2025-3-31 10:12 作者: 流動才波動 時間: 2025-3-31 15:35 作者: 主動 時間: 2025-3-31 19:59
Conference proceedings 1993y R.M. Karp, and "Groups andalgebraiccomplexity" (abstract) by A.C. Yao. The volume continueswith 52 regular presentations selected from 165 submissions,each of which was evaluated by at least three programcommittee members, many of whom calledupon additionalreviewers.
