Algorithms Software

OS OS

  • More...

Category Category

License License

Programming Language Programming Language

Status Status

Audience Audience

Algorithms Software

  • Searching for Affordable Business Phone Service? Searching for Affordable Business Phone Service? Icon
    Searching for Affordable Business Phone Service? Icon

    If you're on the hunt for business phone service that is reliable and budget-friendly, Voice over Internet Protocol (VoIP) is your answer.

    Today's small-to-medium-sized (SMB) businesses and large enterprises are saving on their monthly communications costs by making one simple decision: to switch to a VoIP service solution from their old, outdated Plain Old Telephone Service (POTS). By choosing a new VoIP service, these companies enjoy the flexibility, reliability, call features, and audio quality that only a VoIP service can provide. Plus, they cut their phone bill by up to 70%!
  • Compare Cell Phone Plans at Wirefly Compare Cell Phone Plans at Wirefly Icon
    Compare Cell Phone Plans at Wirefly Icon

    You’re probably paying too much for cell phone service. Wirefly compares hundreds of plans to help you save.

    You’re probably paying too much for cell phone service. Wirefly compares hundreds of plans to help you save. Enter what you need (minutes, data, texts) into Wirefly’s innovative plan comparison tools and see your savings instantly.
  • nedtries

    A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit finds and iteration. Is approx. 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables.

    Downloads: 0 This Week Last Update: See Project
  • Generic parallel partition

    Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.

  • Parallel partition for string qsort/qsel

    Sequential and parallel implementation of string quicksorts(-select) . Articles: On the number of string lookups in BSTs (and related algorithms) with digital access/ Combining digital access and parallel partition for quicksort and quickselect.

    Downloads: 0 This Week Last Update: See Project
  • Cache-conscious STL lists

    Implementation of cache conscious STL lists in Frias, L., Petit, J., and Roura, S. 2009. Lists revisited: Cache-conscious STL lists. J. Exp. Algorithmics 14 (Dec. 2009), 3.5-3.27. DOI= http://doi.acm.org/10.1145/1498698.1564505

  • Previous
  • You're on page 1
  • Next

Get latest updates about Open Source Projects, Conferences and News.

No, Thank you