ovation 发表于 2025-3-30 11:53:42
VLSI Algorithms and Architectures978-0-387-34770-7Series ISSN 0302-9743 Series E-ISSN 1611-3349吗啡 发表于 2025-3-30 15:59:38
Deterministic parallel list ranking,In this paper we describe a simple parallel algorithm for list ranking. The algorithm is deterministic and runs in .(log .) time on EREW P-RAM with ./log . processor. The algorithm matches the performance of the Cole-Vishkin algorithm but is simple and has reasonable constant factors.万神殿 发表于 2025-3-30 16:35:58
Scheduling dags to minimize time and communication,We study the complexity of a generalization of the unit-execution-time multiprocessor scheduling problem under precedence constraints, in which the number of communication arcs is also minimized. Most versions of the problem are shown NP-complete, and two polynomial algorithms are presented for specialized cases.doxazosin 发表于 2025-3-30 22:00:09
Graph embeddings 1988: Recent breakthroughs, new directions,The past few years have seen a number of results on graph embeddings that deserve to be called . because of their settling hard open problems and/or their raising important issues that promise to alter the direction of subsequent research on graph embeddings. We describe and discuss several such results.CHAR 发表于 2025-3-31 03:09:11
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/v/image/980077.jpgbadinage 发表于 2025-3-31 07:40:51
https://doi.org/10.1007/BFb0040367VLSI; communication; complexity; interconnect; logic; simulationOvulation 发表于 2025-3-31 10:16:23
Parallel algorithms for evaluating sequences of set-manipulation operations,ery operation in . and returning the resulting set). We show that the problem of evaluating . is in NC for various combinations of common set-manipulation operations. Once we establish membership in NC (or, if membershp in NC is obvious), we develop techniques for improving the time and/or processor complexity.anesthesia 发表于 2025-3-31 17:21:23
http://reply.papertrans.cn/99/9801/980077/980077_58.pngCursory 发表于 2025-3-31 17:59:03
http://reply.papertrans.cn/99/9801/980077/980077_59.pngDeference 发表于 2025-4-1 00:49:47
Optimal parallel algorithms for expression tree evaluation and list ranking, parallel algorithmic technique for computations on trees; it yields the first ./log . processor, .(log .) time deterministic parallel algorithm for expression tree evaluation, and solves many other tree problems within the same complexity bounds.