TESTIMONY OF Kathryn Haun Rodriguez Former Assistant U.S. Attorney, U.S. Department of Justice, Lecturer in Law on Cybercrime and Digital Currency, Stanford University Current Member of the Board of Directors, Coinbase

Source URL: financialservices.house.gov

• Cryptocurrencies
• Economy
• Alternative currencies
• Money
• Finance
• Bitcoin
• Decentralization
• Digital currencies
• Virtual currency
• Mt. Gox
• Money laundering
• Blockchain

COSC 544 Probabilistic Proof SystemsLFKN’s Interactive Proof for #SAT Lecturer: Justin Thaler

Source URL: people.cs.georgetown.edu

• Computational complexity theory
• Complexity classes
• Boolean algebra
• IP
• True quantified Boolean formula
• Interactive proof system
• PSPACE
• NP
• Boolean satisfiability problem
• FO
• Linear temporal logic
• ArthurMerlin protocol

COSC 544 Probabilistic Proof SystemsTurning Computer Programs Into Circuits (Part 1) Lecturer: Justin Thaler

Source URL: people.cs.georgetown.edu

• Circuit complexity
• Complexity classes
• Theory of computation
• Theoretical computer science
• Computer science
• NC
• Circuit
• Computer
• IP
• NP
• Multiplication algorithm
• Matrix multiplication algorithm

COSC 544 Probabilistic Proof SystemsThe GKR Protocol and Its Efficient Implementation Lecturer: Justin Thaler

Source URL: people.cs.georgetown.edu

• Computational complexity theory
• Mathematics
• Complexity classes
• IP
• Circuit complexity
• True quantified Boolean formula
• NP
• SchwartzZippel lemma
• NC

COSC 544 Probabilistic Proof SystemsA State of the Art MIP For Circuit Satisfiability Lecturer: Justin Thaler

Source URL: people.cs.georgetown.edu

• Mathematics
• Complexity classes
• Randomized algorithms
• IP
• Probabilistically checkable proof
• NP
• NEXPTIME
• Soundness
• Variable
• Interactive proof system
• Proof of knowledge

COSC 544 Probabilistic Proof SystemsA PCP of Quasilinear Size for Arithmetic Circuit-SAT Lecturer: Justin Thaler

Source URL: people.cs.georgetown.edu

• Mathematics
• Algebra
• Polynomials
• Probabilistically checkable proof
• Computer algebra
• IP
• Complex number
• MAX-3SAT

COSC 544 Probabilistic Proof SystemsThe Power of Randomness: Fingerprinting and Freivalds’ Algorithm Lecturer: Justin Thaler

Source URL: people.cs.georgetown.edu

• Computational complexity theory
• Randomized algorithms
• Analysis of algorithms
• With high probability
• PP
• IP
• RP
• P
• Freivalds' algorithm

Probability Theory II Summer term 2018 Lecturer: Prof. Dr. Enno Mammen Assistant: Marilena M¨ uller

Source URL: nps.math.uni-heidelberg.de

Subject name Subject code Department Faculty Subject supervisor/Lecturer

Source URL: studyinenglish.urk.edu.pl

LECTURER: (here the name of the professor who gives the lecture) Title of the lecture Scientific Secretaries: (here the 2 names of the secretaries)

Source URL: www.ccsem.infn.it