Sciweavers

    2 search results - page 1 / 1
    » Power of Randomization in Automata on Infinite Strings
    Sort
    View
    CONCUR
    2009
    Springer
    85views Distributed And Parallel Com...» more  CONCUR 2009»
    Power of Randomization in Automata on Infinite Strings
    14 years 5 days ago
    Power of Randomization in Automata on Infinite Strings
    Download  www.cs.uic.edu
    Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
    claim paper
    Read More »
    TIT
    2008
    187views more  TIT 2008»
    The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
    13 years 5 months ago
    The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
    Download  www.dziembowski.net
    Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
    Stefan Dziembowski, Ueli M. Maurer
    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.