COLIC 发表于 2025-3-23 12:47:22

https://doi.org/10.1007/978-3-642-86145-1l reconfigurable buses. In this paper, we present lower bounds and nearly matching upper bounds for packet routing on these two models. As a consequence, we solve two of the open problems mentioned in .

Fabric 发表于 2025-3-23 15:49:19

http://reply.papertrans.cn/16/1532/153120/153120_12.png

HEPA-filter 发表于 2025-3-23 18:54:07

Remembering conflicts in history yields dynamic algorithms,or to be deleted by the next deletion. We apply our general technique to obtain new and efficient algorithms for dynamically maintaining arrangements of line segments, lower envelopes of triangles, convex hulls and Voronoi diagrams of points in any dimension, and Voronoi diagrams of line segments in a plane.

Progesterone 发表于 2025-3-24 01:29:26

http://reply.papertrans.cn/16/1532/153120/153120_14.png

cravat 发表于 2025-3-24 03:04:47

http://reply.papertrans.cn/16/1532/153120/153120_15.png

灿烂 发表于 2025-3-24 09:18:38

http://reply.papertrans.cn/16/1532/153120/153120_16.png

GILD 发表于 2025-3-24 12:45:14

http://reply.papertrans.cn/16/1532/153120/153120_17.png

syring 发表于 2025-3-24 18:45:51

http://reply.papertrans.cn/16/1532/153120/153120_18.png

撕裂皮肉 发表于 2025-3-24 22:22:38

http://reply.papertrans.cn/16/1532/153120/153120_19.png

乱砍 发表于 2025-3-25 02:38:09

http://reply.papertrans.cn/16/1532/153120/153120_20.png
页: 1 [2] 3 4 5 6 7
查看完整版本: Titlebook: Algorithms and Computation; 4th International Sy K. W. Ng,P. Raghavan,F. Y. L. Chin Conference proceedings 1993 Springer-Verlag Berlin Heid