Titlebook: Algorithms and Data Structures; Third Workshop, WADS Frank Dehne,Jörg-Rüdiger Sack,Sue Whitesides Conference proceedings 1993 Springer-Verl

从未沮丧

书目名称Algorithms and Data Structures影响因子(影响力)




书目名称Algorithms and Data Structures影响因子(影响力)学科排名




书目名称Algorithms and Data Structures网络公开度




书目名称Algorithms and Data Structures网络公开度学科排名




书目名称Algorithms and Data Structures被引频次




书目名称Algorithms and Data Structures被引频次学科排名




书目名称Algorithms and Data Structures年度引用




书目名称Algorithms and Data Structures年度引用学科排名




书目名称Algorithms and Data Structures读者反馈




书目名称Algorithms and Data Structures读者反馈学科排名

字的误用

暴行

无政府主义者

土坯

CODE

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

Frisky

Monocle

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..)

支架

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