Sciweavers

    2 search results - page 1 / 1
    » Communication-Efficient Private Protocols for Longest Common...
    Sort
    View
    CTRSA
    2009
    Springer
    106views Cryptology» more  CTRSA 2009»
    Communication-Efficient Private Protocols for Longest Common Subsequence
    13 years 8 months ago
    Communication-Efficient Private Protocols for Longest Common Subsequence
    Download  eprint.iacr.org
    We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
    Matthew K. Franklin, Mark Gondree, Payman Mohassel
    claim paper
    Read More »
    SPAA
    2006
    ACM
    112views Distributed And Parallel Com...» more  SPAA 2006»
    The cache complexity of multithreaded cache oblivious algorithms
    13 years 11 months ago
    The cache complexity of multithreaded cache oblivious algorithms
    Download  www.fftw.org
    We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
    Matteo Frigo, Volker Strumpen
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.