Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
32
click to vote
MEMOCODE
2008
IEEE
favorite
Email
discuss
report
103
views
Formal Methods
»
more
MEMOCODE 2008
»
High-throughput Pipelined Mergesort
14 years 5 months ago
Download
people.csail.mit.edu
Abstract: We present an implementation of a highthroughput cryptosorter, capable of sorting an encrypted database of eight megabytes in .15 seconds; 1102 times faster than a software implementation.
Kermin Fleming, Myron King, Man Cheuk Ng, Asif Kha
Real-time Traffic
Encrypted
|
Formal Methods
|
Megabytes
|
MEMOCODE 2008
|
Software Implementation
|
claim paper
Post Info
More Details (n/a)
Added
31 May 2010
Updated
31 May 2010
Type
Conference
Year
2008
Where
MEMOCODE
Authors
Kermin Fleming, Myron King, Man Cheuk Ng, Asif Khan, Muralidaran Vijayaraghavan
Comments
(0)
Researcher Info
Formal Methods Study Group
Computer Vision