IPL 2002 - PDF Preprint Papers

IPL 2002

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IPL-2002 Paper

click to vote

IPL
2002

125views more IPL 2002»

A note concerning the closest point pair algorithm

14 years 3 days ago

Download www.cl.cam.ac.uk

An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...

Martin Richards

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	125	A note concerning the closest point pair algorithm	claim
2	119	Randomized splay trees: Theoretical and experimental results	claim
3	118	Lower bounds for approximate polygon decomposition and minimum gap	claim
4	118	Differential approximation results for the traveling salesman and related problems	claim
5	117	Complexity of weak acceptance conditions in tree automata	claim
6	110	New bounds on a hypercube coloring problem	claim
7	108	A heuristic to accelerate in-situ permutation algorithms	claim
8	107	Binary space partitions for axis-parallel line segments: Size-height tradeoffs	claim
9	105	Steiner trees in uniformly quasi-bipartite graphs	claim
10	98	Evolutionary induced decision trees for dangerous software modules prediction	claim
11	95	On a game in directed graphs	claim
12	93	Storing information with extractors	claim
13	92	Comparison of two code scalability tests	claim
14	90	Recognition and dualization of disguised bidual Horn functions	claim
15	90	On the approximability of two tree drawing conventions	claim
16	89	New bounds on the barycenter heuristic for bipartite graph drawing	claim
17	88	A note on practical construction of maximum bandwidth paths	claim
18	86	A semantics of sequence diagrams	claim
19	86	A polynomial algorithm for lot-size scheduling of two type tasks	claim
20	81	For completeness, sublogarithmic space is no space	claim
21	80	A note on models for non-probabilistic analysis of packet switching networks	claim
22	79	A self-adjusting quality of service control scheme	claim
23	79	4-edge-coloring graphs of maximum degree 3 in linear time	claim
24	74	Restricted rotation distance between binary trees	claim
25	72	On the location of Steiner points in uniformly-oriented Steiner trees	claim
26	71	Pancyclicity of recursive circulant graphs	claim
27	65	Parallel evolutionary algorithms can achieve super-linear performance	claim
28	65	A new bound for map labeling with uniform circle pairs	claim
29	62	Verifying lossy channel systems has nonprimitive recursive complexity	claim
30	60	s-partitions	claim
31	60	An optimal algorithm for reporting visible rectangles	claim
32	59	An efficient decoding technique for Huffman codes	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers