SC2 challenges: when Satisfiability Checking and Symbolic Computation join forces James H. Davenport, Pascal Fontaine, Alberto Griggio (and the others partners whose details wouldn’t fit)1 University of Bath, LORIA, Fo

Source URL: staff.bath.ac.uk

• Theoretical computer science
• Logic
• Logic in computer science
• Mathematics
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Uninterpreted function
• Satisfiability
• Solver

Fairness in an Unfair World: Fair Multiparty Computation from public Bulletin Boards Arka Rai Choudhuri Johns Hopkins University Matthew Green

Source URL: eprint.iacr.org

• Cryptography
• Secure multi-party computation
• Authenticated encryption
• Ciphertext indistinguishability
• Public-key cryptography
• Cryptographic protocol
• Encryption
• Digital signature
• Standard model
• Key
• Advantage

Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation

Source URL: acmccs.github.io

S3ORAM: A Computation-Efficient and Constant Client Bandwidth Blowup ORAM with Shamir Secret Sharing

Source URL: acmccs.github.io

Best of Both Worlds in Secure Computation, with Low Communication Overhead

Source URL: web.eecs.umich.edu

• Cryptography
• Mathematics
• Theoretical computer science
• Computational complexity theory
• Secret sharing
• Quantum complexity theory
• Secure multi-party computation
• IP
• PP
• Polynomial
• Communication complexity
• Lagrange polynomial

Giving State to the Stateless: Augmenting Trustworthy Computation with Ledgers Gabriel Kaptchuk Johns Hopkins University

Source URL: eprint.iacr.org

• Cryptocurrencies
• Cryptography
• Computing
• Blockchains
• Economy
• Decentralization
• Alternative currencies
• Cryptographic protocols
• Secure multi-party computation
• Bitcoin
• Digital signature
• Ledger

THREE PUZZLES ON MATHEMATICS, COMPUTATION, AND GAMES GIL KALAI HEBREW UNIVERSITY OF JERUSALEM AND YALE UNIVERSITY Abstract. In this lecture I will talk about three mathematical puzzles involving mathematics and computati

Source URL: eta.impa.br

• Computational complexity theory
• Mathematics
• Theoretical computer science
• Complexity classes
• Analysis of algorithms
• Quantum computing
• Linear programming
• Simplex algorithm
• Quantum algorithm
• P versus NP problem
• Quantum supremacy
• Time complexity

Leveraging Router Programmability for Traffic Matrix Computation ⇤ Giacomo Balestra‡

Source URL: www0.cs.ucl.ac.uk

• Computing
• Internet architecture
• Network architecture
• Information and communications technology
• Routing
• Internet Standards
• Computer networking
• Border Gateway Protocol
• Router
• Control plane
• IP routing
• NetFlow

Verifying the Floating-Point Computation Equivalence of Manually and Automatically Differentiated Code — 1st International Workshop on Software Correctness for HPC Applications, Nov 12, 2017, CO, USA

Source URL: correctness-workshop.github.io

• Computing
• Software engineering
• Computer programming
• X86 instructions
• MOVAPD
• X86 instruction listings
• J
• Compiler
• MOVDDUP

Advances in Mathematics of Communications Volume X, No. 0X, 200X, X–XX Web site: http://www.aimSciences.org IMPROVEMENTS IN THE COMPUTATION OF IDEAL CLASS

Source URL: www.lix.polytechnique.fr

• Algebra
• Mathematics
• Linear algebra
• Numerical linear algebra
• Integer factorization algorithms
• Polynomials
• Gaussian elimination
• Quadratic sieve
• Index calculus algorithm
• Factorization
• Factorial
• Kernel