Algorithms for Learning by Distances (2001)

Cached

Download Links

by Ronit Fraiman , Shai Ben-david
Venue:Information and Computation
Citations:13 - 0 self

Active Bibliography

A Heap-Based Optimal Inversions-Sensitive Sorting Algorithm – Srinath Sridhar - 2003
2 Discrete-Event Simulation on the Bulk-Synchronous Parallel Model – Mauricio Marin, St Cross College, Supervisor Prof, W. F. Mccoll - 1998
4 An Empirical Comparison of Priority Queue Algorithms – Mauricio Marín
8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
Rank-Pairing Heaps – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
11 Functional Binomial Queues – David King - 1994
3 On the Pending Event Set and Binary Tournaments – Mauricio Marín
2 A Generalization of Binomial Queues – Rolf Fagerberg - 1996
3 Dynamic data structures: Finite files, limiting profiles and variance analysis – L. Cnend, P. Flajolet, J. Francdn, C. Puech, J. Vuillemin - 1980
7 Are Fibonacci Heaps Optimal? – Diab Abuaiadh, Jeffrey H. Kingston - 1994
2 Checking and Certifying Computational Results – Jonathan D. Bright - 1994
1 On the Comparison Cost of Partial Orders – Joseph C. Culberson, Gregory J. E. Rawlins - 1992
9 A General Technique for Implementation of Efficient Priority Queues – Peter Høyer - 1994
37 Worst-Case Efficient External-Memory Priority Queues – Gerth Stølting Brodal, Jyrki Katajainen - 1998
16 Efficient Simulation of Multiple Cache Configurations using Binomial Trees – Rabin A. Sugumar, Santosh G. Abraham - 1991
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
A New Priority Queue for Simulation of Many Objects – Ricardo Baeza-yates, Mauricio Marín
9 Portable Distributed Priority Queues with MPI – Bernard Mans, North Queensland - 1995
5 Functional Pearls: Explaining Binomial Heaps – Ralf Hinze - 1999