Brief Announcement: TheToolkit for Building Your Own Balls-into-Bins Algorithm Pierre Bertrand1 and Christoph Lenzen2 1 Ecole Normale Suprieure Cachan

Source URL: people.mpi-inf.mpg.de

• Algorithm
• Mathematical logic
• Theoretical computer science
• Time complexity
• Mathematics
• With high probability
• Computer science
• Applied mathematics
• Balls into bins
• EdmondsPruhs protocol

CS711008Z Algorithm Design and Analysis Lecture 2. Analysis techniques 1 Dongbo Bu

Source URL: bioinfo.ict.ac.cn

• Analysis of algorithms
• Theory of computation
• Computational complexity theory
• Computer science
• Theoretical computer science
• Quicksort
• Average-case complexity
• Best
• worst and average case
• Algorithm
• Sorting algorithm
• Time complexity
• Worst-case complexity

Circuits for Datalog Provenance Daniel Deutch Tova Milo Tel Aviv University

Source URL: www.cs.tau.ac.il

• Mathematics
• Computing
• Mathematical logic
• Database theory
• Complexity classes
• Boolean algebra
• Algebraic structures
• Relational model
• Datalog
• Relational algebra
• Tuple
• FO

The String-Meaning Relations Definable by Lambek Grammars and Context-Free Grammars Makoto Kanazawa and Sylvain Salvati 1

Source URL: research.nii.ac.jp

• Complexity classes
• Type theory
• Categorial grammar
• Theoretical computer science
• NP
• Grammar
• P
• Mathematics
• Washington State Judicial election
• 18th South African Parliament

The Complexity of Crowdsourcing: Theoretical Problems in Human Computation Anand Kulkarni Department of Industrial Engineering and Operations Research 4141 Etcheverry Hall, University of California,

Source URL: crowdresearch.org

• Human-based computation
• Crowdsourcing
• Theoretical computer science
• Computing
• Business
• Collective intelligence
• Workflow technology
• Social information processing
• Amazon Mechanical Turk
• Microtask
• Algorithm
• Computation

Complexity of the PSVM Sepp Hochreiter Institute of Bioinformatics, Johannes Kepler Universit¨at Linz 4040 Linz, Austria

Source URL: www.bioinf.jku.at

Sound Proof of Proximity of Knowledge Serge Vaudenay ÉCOLE POLYTECHNIQUE FÉDÉRALE DE LAUSANNE

Source URL: security-lab.jaist.ac.jp

• Cryptography
• IP
• Distance-bounding protocol
• Challengeresponse authentication
• Computational complexity theory
• Interactive proof system

Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1

Source URL: drops.dagstuhl.de

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Constraint programming
• NP-complete problems
• Boolean algebra
• Parameterized complexity
• Boolean satisfiability problem
• Constraint satisfaction problem
• Exponential time hypothesis
• Treewidth
• Tree decomposition

New Hardness Results for Diophantine Approximation Friedrich Eisenbrand & Thomas Rothvoß Institute of Mathematics EPFL, Lausanne

Source URL: www.math.washington.edu

• Computational complexity theory
• Diophantine approximation
• Approximation algorithm