• Publications
  • Influence
A scalable verification solution for blockchains
TLDR
A new system consists of a financial incentive layer atop a dispute resolution layer where the latter takes form of a versatile "verification game" that brings scalable computation to Ethereum. Expand
SMT-Based Verification of Solidity Smart Contracts
TLDR
This paper presents how the component currently translates a subset of Solidity into SMT statements using different theories, and discusses future challenges such as multi-transaction and state invariants. Expand
Equivalence Problems for Circuits over Sets of Natural Numbers
TLDR
This work gives a systematic characterization of the complexity of equivalence problems over sets of natural numbers and provides an improved upper bound for the case of {∪,∩,−,+,×}-circuits. Expand
Applications of Discrepancy Theory in Multiobjective Approximation
We apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomizedExpand
The Shrinking Property for NP and coNP
TLDR
It is proved that the assumption is too weak to refute the shrinking property for in a relativizable way and an oracle is constructed relative to which, , and has theshrinking property is constructed. Expand
A Predictable Incentive Mechanism for TrueBit
TLDR
This work proposes to randomly select multiple solvers from a pool and evenly share the fees among them, while still allowing outside challengers, and a proof of independent execution will make it harder to establish computation pools which share computation results. Expand
Conjunctive grammars with restricted disjunction
TLDR
If it is furthermore required that each rule of the general form A->w has a nonempty w, then a substantial subfamily of conjunctive languages can be generated, yet it remains unknown whether such grammars are as powerful as conj unctive grammARS of thegeneral form. Expand
Approximability and Hardness in Multi-objective Optimization
TLDR
It is seen that in contrast to single-objective problems (where the solution notions coincide), the situation is more subtle for multiple objectives, so it is important to exactly specify the NP-hardness notion when discussing the complexity of multi-objectives problems. Expand
Satisfiability of algebraic circuits over sets of natural numbers
TLDR
This work proves that testing satisfiability for {@?,+,x}-circuits is already undecidable, and shows that satisfiability problems capture a wide range of complexity classes such as NL, P, NP, PSPACE, and beyond. Expand
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions
TLDR
This work investigates the autoreducibility and mitoticity of complete sets for several classes with respect to different polynomial-time and logarithmic-space reducibility notions and concludes that some of the results are hard or even impossible to improve. Expand
...
1
2
3
...