✦ LIBER ✦

A Simple Randomized Sieve Algorithm for the Closest-Pair Problem

✍ Scribed by S. Khuller; Y. Matias

Book ID: 112252138
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 337 KB
Volume: 118
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1049

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Reliable Randomized Algorithm for the

A Reliable Randomized Algorithm for the Closest-Pair Problem

✍ Martin Dietzfelbinger; Torben Hagerup; Jyrki Katajainen; Martti Penttonen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 361 KB

The following two computational problems are studied: Duplicate grouping: Assume that n items are given, each of which is labeled by an Ä 4 integer key from the set 0, . . . , U y 1 . Store the items in an array of size n such that items with the same key occupy a contiguous segment of the array. C

A fast parallel algorithm for the closes

A fast parallel algorithm for the closest pair problem

✍ Charles R. Dyer 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 506 KB

Randomized Data Structures for the Dynam

Randomized Data Structures for the Dynamic Closest-Pair Problem

✍ Golin, Mordecai; Raman, Rajeev; Schwarz, Christian; Smid, Michiel 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 544 KB

An optimal algorithm for the on-line clo

An optimal algorithm for the on-line closest-pair problem

✍ C. Schwarz; M. Smid; J. Snoeyink 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 712 KB

A Subexponential Randomized Algorithm fo

A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem

✍ W. Ludwig 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 397 KB

An Optimized Divide-and-Conquer Algorith

An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

✍ Pereira, José C.; Lobo, Fernando G. 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 833 KB