Sciweavers

    FSTTCS   2009 Foundations of Software Technology and Theoretical Computer Science
    Wall of Fame | Most Viewed FSTTCS-2009 Paper
    FSTTCS
    2009
    Springer
    180views Software Engineering» more  FSTTCS 2009»
    Non-Local Box Complexity and Secure Function Evaluation
    13 years 11 months ago
    Non-Local Box Complexity and Secure Function Evaluation
    Download  drops.dagstuhl.de
    ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
    Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...
    claim paper
    Read More »
    Disclaimer and Copyright Notice
    Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
    IdReadViewsTitleStatus
    1Download preprint from source180
    Non-Local Box Complexity and Secure Function Evaluation
    claim
    2Download preprint from source177
    Arithmetic Circuits and the Hadamard Product of Polynomials
    claim
    3Download preprint from source168
    Bounded Size Graph Clustering with Applications to Stream Processing
    claim
    4Download preprint from source158
    Fighting bit Rot with Types (Experience Report: Scala Collections)
    claim
    5Download preprint from source146
    Covering of ordinals
    claim
    6Download preprint from source145
    Iterative Methods in Combinatorial Optimization
    claim
    7Download preprint from source143
    Approximating Fault-Tolerant Group-Steiner Problems
    claim
    8Download preprint from source137
    The Covering and Boundedness Problems for Branching Vector Addition Systems
    claim
    9Download preprint from source135
    Automata and temporal logic over arbitrary linear time
    claim
    10Download preprint from source135
    Fractional Pebbling and Thrifty Branching Programs
    claim
    11Download preprint from source132
    Donation Center Location Problem
    claim
    12Download preprint from source131
    Deterministic Automata and Extensions of Weak MSO
    claim
    13Download preprint from source130
    Kernels for Feedback Arc Set In Tournaments
    claim
    14Download preprint from source129
    Simulation based security in the applied pi calculus
    claim
    15Download preprint from source125
    Subexponential Algorithms for Partial Cover Problems
    claim
    16Download preprint from source121
    Algorithms for Message Ferrying on Mobile ad hoc Networks
    claim
    17Download preprint from source120
    Domination Problems in Nowhere-Dense Classes
    claim
    18Download preprint from source118
    Continuous-Time Stochastic Games with Time-Bounded Reachability
    claim
    19Download preprint from source116
    Verification and Refutation of Probabilistic Specifications via Games
    claim
    20Download preprint from source116
    On the Memory Consumption of Probabilistic Pushdown Automata
    claim
    21Download preprint from source113
    Deductive Verification of Continuous Dynamical Systems
    claim
    22Download preprint from source108
    Kolmogorov Complexity in Randomness Extraction
    claim
    23Download preprint from source106
    Mediating for Reduction (on Minimizing Alternating Büchi Automata)
    claim
    24Download preprint from source102
    On Nondeterministic Unranked Tree Automata with Sibling Constraints
    claim
    25Download preprint from source100
    Using Elimination Theory to construct Rigid Matrices
    claim
    26Download preprint from source99
    A Fine-grained Analysis of a Simple Independent Set Algorithm
    claim
    27Download preprint from source97
    Nash Equilibrium in Generalised Muller Games
    claim
    28Download preprint from source97
    Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
    claim
    29Download preprint from source95
    Recurrence and Transience for Probabilistic Automata
    claim
    30Download preprint from source93
    On Timed Alternating Simulation for Concurrent Timed Games
    claim
    31Download preprint from source93
    The Power of Depth 2 Circuits over Algebras
    claim
    32Download preprint from source88
    Synthesis of Finite-state and Definable Winning Strategies
    claim
    33Download preprint from source77
    Randomness extractors -- applications and constructions
    claim
    34Download preprint from source76
    Functionally Private Approximations of Negligibly-Biased Estimators
    claim
    35Download preprint from source73
    The Wadge Hierarchy of Max-Regular Languages
    claim
    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.