Filters








37 Hits in 6.4 sec

Amortization results for chromatic search trees, with an application to priority queues [chapter]

Joan Boyar, Rolf Fagerberg, Kim S. Larsen
1995 Lecture Notes in Computer Science  
In this paper, we prove that only an amortized constant amount of rebalancing is necessary after an update in a chromatic search tree.  ...  Based on these trees, a priority queue with possibilities for a greater degree of parallelism than previous proposals can be implemented. ] 1997 Academic Press  ...  Having obtained logarithmic worst-case bounds, the next result to hope and search for when dealing with trees is an amortized constant number of rebalancing operations.  ... 
doi:10.1007/3-540-60220-8_69 fatcat:7u3k2wy7ovaobdeknema5zrjqi

Amortization Results for Chromatic Search Trees, with an Application to Priority Queues

Joan Boyar, Rolf Fagerberg, Kim S Larsen
1997 Journal of computer and system sciences (Print)  
In this paper, we prove that only an amortized constant amount of rebalancing is necessary after an update in a chromatic search tree.  ...  Based on these trees, a priority queue with possibilities for a greater degree of parallelism than previous proposals can be implemented. ] 1997 Academic Press  ...  Having obtained logarithmic worst-case bounds, the next result to hope and search for when dealing with trees is an amortized constant number of rebalancing operations.  ... 
doi:10.1006/jcss.1997.1511 fatcat:i23bglnivbbijiqutdwgokuccu

Page 1259 of Mathematical Reviews Vol. , Issue 99b [page]

1991 Mathematical Reviews  
(DK-ODNS-CS; Odense) Amortization results for chromatic search trees, with an application to priority queues. (English summary) J. Comput. System Sci. 55 (1997), no. 3, 504-521.  ...  Their results also imply that a linear number of processes can access the tree simul- taneously. They also apply this structure to implement a better concurrent priority queue.  ... 

Dynamic half-space reporting, geometric optimization, and minimum spanning trees

P.K. Agarwal, D. Eppstein, J. Matousek
1992 Proceedings., 33rd Annual Symposium on Foundations of Computer Science  
Using these data structures, we obtain efficient dynamic algorithms for a number of geometric problems, including closest/farthest neighbor searching, fixed dimension linear programming, bi-chromatic closest  ...  pair, diameter, and Euclidean minimum spanning tree.  ...  We now apply these results in an algorithm for maintaining the Euclidean minimum spanning tree of a point set.  ... 
doi:10.1109/sfcs.1992.267816 dblp:conf/focs/AgarwalEM92 fatcat:sowinnkgevawxny6dobkp6va3e

Page 1834 of Mathematical Reviews Vol. , Issue 98C [page]

1998 Mathematical Reviews  
Larsen, Amortization results for chromatic search trees, with an application to priority queues (270-281); Gerth Stoelting Bro- dal, Fast meldable priority queues (282-290); Dimitrios Kagaris, Grammati  ...  , On-line re- source management with applications to routing and scheduling (303-314); H.  ... 

Chromatic nearest neighbor searching: A query sensitive approach☆☆A preliminary version of this paper appeared in the Proceedings of the 7th Canadian Conference on Computational Geometry, 1995, pp. 261–266

David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu
2000 Computational geometry  
We also allow the user to specify an error bound ε 0, and consider the same problem in the context of approximate nearest neighbor searching.  ...  The chromatic version of the nearest neighbor problem is used in many applications in pattern recognition and learning.  ...  We would also like to thank Sunil Arya for his helpful insights on the analysis of the branch-and-bound search.  ... 
doi:10.1016/s0925-7721(00)00021-3 fatcat:jokacr6x6rfcdmiwjps6kfyyye

Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree

Dan E. Willard
2000 SIAM journal on computing (Print)  
Acknowledgement: I would like to thank both referees for their helpful comments.  ...  The McCreight and Chazelle versions of Priority-Search trees have many uses in computer science [34]. The Fusion Priority-Search trees pertain to all such problems.  ...  Then regardless of the details of the structure of the node v, it is possible to devise an insertion and deletion algorithm for this tree that runs in amortized time O(h), with the O(h) asymptote using  ... 
doi:10.1137/s0097539797322425 fatcat:fte3pvveq5bxxc4x6ifo4bmh44

Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling

Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson
2016 ACM Transactions on Parallel Computing  
This paper introduces PRISM, a chromatic-scheduling algorithm for executing dynamic data-graph computations.  ...  On the seven application benchmarks studied, PRISM-R incurs a 7% geometric mean overhead relative to PRISM.  ...  Thanks to Aydın Buluç of Lawrence Berkeley Laboratory for helping us in our search for collections of large sparse graphs.  ... 
doi:10.1145/2896850 fatcat:62v4zz3plvfwve54umhkro2vbu

Executing dynamic data-graph computations deterministically using chromatic scheduling

Tim Kaler, William Hasenplaugh, Tao B. Schardl, Charles E. Leiserson
2014 Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures - SPAA '14  
This paper introduces PRISM, a chromatic-scheduling algorithm for executing dynamic data-graph computations.  ...  On the seven application benchmarks studied, PRISM-R incurs a 7% geometric mean overhead relative to PRISM.  ...  Thanks to Aydın Buluç of Lawrence Berkeley Laboratory for helping us in our search for collections of large sparse graphs.  ... 
doi:10.1145/2612669.2612673 dblp:conf/spaa/KalerHSL14 fatcat:uf75x4odrnbghm2xjy6ue63zl4

Ordering heuristics for parallel graph coloring

William Hasenplaugh, Tim Kaler, Tao B. Schardl, Charles E. Leiserson
2014 Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures - SPAA '14  
This paper introduces PRISM, a chromatic-scheduling algorithm for executing dynamic data-graph computations.  ...  We modified GraphLab to incorporate PRISM and studied seven application benchmarks on a 12-core multicore machine.  ...  Thanks to Aydın Buluç of Lawrence Berkeley Laboratory for helping us in our search for collections of large sparse graphs.  ... 
doi:10.1145/2612669.2612697 dblp:conf/spaa/HasenplaughKSL14 fatcat:bwui6b4ngjaqbn3whk6z2tulsm

Testing bipartiteness of geometric intersection graphs

David Eppstein
2009 ACM Transactions on Algorithms  
For unit balls in R^d, connectivity testing has equivalent randomized complexity to construction of Euclidean minimum spanning trees, and hence is unlikely to be solved as efficiently as bipartiteness  ...  We show how to test the bipartiteness of an intersection graph of n line segments or simple polygons in the plane, or of balls in R^d, in time O(n log n).  ...  . 2 The second data structure we maintain is an event queue: a priority queue of a set of events at which the structures maintained by the algorithm need to change.  ... 
doi:10.1145/1497290.1497291 fatcat:md4v3ip5hzfchgy2wilggzpgyu

A unified approach for computing top-k pairs in multidimensional space

Muhammad Aamir Cheema, Xuemin Lin, Haixun Wang, Jianmin Wang, Wenjie Zhang
2011 2011 IEEE 27th International Conference on Data Engineering  
Our proposed approach allows the users to define a local scoring function for each attribute involved in the query and a global scoring function that computes the final score of each pair by combining  ...  Our approach does not require any pre-built indexes, is easy to implement and has low memory requirement. We conduct extensive experiments to demonstrate the efficiency of our proposed approach.  ...  stored in the main memory reserved for an external priority queue.  ... 
doi:10.1109/icde.2011.5767903 dblp:conf/icde/CheemaLWWZ11 fatcat:ujocbs4w7jda7lfqg7cqfo64me

Efficient Algorithms and Data Structures for Massive Data Sets [article]

Alka
2010 arXiv   pre-print
. (2) The first external memory version of soft heap, an approximate meldable priority queue. (3) Hard heap, the first meldable external memory priority queue that matches the amortised I/O performance  ...  On the external memory model, we obtain the following results. (1) An I/O efficient algorithm for computing minimum spanning trees of graphs that improves on the performance of the best known algorithm  ...  See [13] for an experimental study on some of these priority queues.  ... 
arXiv:1005.3473v1 fatcat:qgy3ii4v2vc6hn4tx43x25jtkq

Certifying algorithms

R.M. McConnell, K. Mehlhorn, S. Näher, P. Schweitzer
2011 Computer Science Review  
A certifying algorithm is an algorithm that produces, with each output, a certificate or witness (easy-to-verify proof) that the particular output has not been compromised by a bug.  ...  We put forward the thesis that certifying algorithms are much superior to non-certifying algorithms, and that for complex algorithmic tasks, only certifying algorithms are satisfactory.  ...  Acknowledgements We want to thank many colleages for discussions about aspects of this paper, in particular, Ernst Althaus, Peter van Emde Boas, Harry Buhmann, Arno Eigenwillig, Uli Finkler, Stefan Funke  ... 
doi:10.1016/j.cosrev.2010.09.009 fatcat:lapencdbozbklferou45leawtm

Page 1593 of Mathematical Reviews Vol. 31, Issue Index [page]

Mathematical Reviews  
Amortization results for chromatic search trees, with an application to priority queues. (English summary) 99b:68041 Brodal, Gerth Stoelting (with Pinotti, M.  ...  (with Zaks, Shmuel) Labelled trees and pairs of input-output permutations in priority queues.  ... 
« Previous Showing results 1 — 15 out of 37 results