1. STOC: Annual ACM Symposium on the Theory of Computing
Nemanja Soldo
03/2017

2. Conference summary 48th edition Cambridge (USA)
Common topics that are covered on this Symposium are about algorithms and data structures, randomness in computing, optimization problems, machine learning, parallel and distributed computing
92 papers presented

3. 1. A tight space bound for consensus
Consensus problem is one of most studied topics from the domain of distributed computing
Find a way to optimize process of getting a consensus, or making a deal on some action
It was proved that such algorithms must use Ω(√n) registers, or recently Ω(n) registers for problems where processes do not have identifiers
Finding out how many registers and how large that registers should be is a decision that should be smartly chosen.

4. 2. Watermarking Cryptographic Capabilities
Watermarking of digital formats
For security reasons, to prevent unauthorized access, identify ownership or preserve copyright
This paper explores ways to watermark various cryptographic capabilities such as PRF (pseudo random function) evaluation, ciphertext decryption and message signing
Watermarking should be good enough to preserve almost original state of digital object and yet to be secure enough

5. 3. Parallel exhaustive search without coordination
Optimization of parallel exhaustive search without coordination
Less time, less resource consuming
Deploying 2 or more search agents(parallel search) instead od single agent(single search)
“Smarter” planning to deploy more search agents but not to lose much time and resources on coordinating them, so keeping balance between coordinating the operations of processors, but without significant effect on resource cost of those computations

6. Thank you!