# Christian Reitwießner

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

A scalable verification solution for blockchains

- Jason Teutsch, Christian Reitwießner
- Computer Science, Economics
- ArXiv
- 12 August 2019

Bitcoin and Ethereum, whose miners arguably collectively comprise the most powerful computational resource in the history of mankind, offer no more power for processing and verifying transactions… Expand

SMT-Based Verification of Solidity Smart Contracts

- Leonardo Alt, Christian Reitwießner
- Computer Science
- ISoLA
- 5 November 2018

Ethereum smart contracts are programs that run inside a public distributed database called a blockchain. These smart contracts are used to handle tokens of value, can be accessed and analyzed by… Expand

Equivalence Problems for Circuits over Sets of Natural Numbers

- C. Glaßer, K. Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
- Mathematics, Computer Science
- Theory of Computing Systems
- 18 December 2009

We investigate the complexity of equivalence problems for {∪,∩,−,+,×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer and Meyer (1973). We continue this… Expand

Applications of Discrepancy Theory in Multiobjective Approximation

- Christian Glaßer, Christian Reitwießner, Maximilian Witek
- Computer Science, Mathematics
- FSTTCS
- 4 July 2011

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 randomized… Expand

The Shrinking Property for NP and coNP

- C. Glaßer, Christian Reitwießner, V. Selivanov
- Computer Science, Mathematics
- CiE
- 15 June 2008

We study the shrinking and separation properties (two notions well-known in descriptive set theory) for and and show that under reasonable complexity-theoretic assumptions, both properties do not… Expand

A Predictable Incentive Mechanism for TrueBit

- Julia Koch, Christian Reitwießner
- Computer Science
- ArXiv
- 29 June 2018

TrueBit is a protocol that uses interactive verification to allow a resource-constrained computation environment like a blockchain to perform much larger computations than usual in a trusted way. As… Expand

Conjunctive grammars with restricted disjunction

- A. Okhotin, Christian Reitwießner
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1 June 2010

It is shown that every conjunctive language is generated by a conjunctive grammar from a special subclass, in which every nonterminal A has at most one rule of the general form A->@a"[email… Expand

Satisfiability of algebraic circuits over sets of natural numbers

- C. Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
- Mathematics, Computer Science
- Discret. Appl. Math.
- 1 July 2010

We investigate the complexity of satisfiability problems for {@?,@?,^-,+,x}-circuits computing sets of natural numbers. These problems are a natural generalization of membership problems for… Expand

Approximability and Hardness in Multi-objective Optimization

- Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek
- Computer Science
- CiE
- 30 June 2010

We study the approximability and the hardness of combinatorial multi-objective NP optimization problems (multi-objective problems, for short). Our contributions are: - We define and compare several… Expand

Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions

- C. Glaßer, D. Nguyen, Christian Reitwießner, A. Selman, M. Witek
- Mathematics, Computer Science
- ICALP
- 8 July 2013

We investigate the autoreducibility and mitoticity of complete sets for several classes with respect to different polynomial-time and logarithmic-space reducibility notions.
Previous work in this… Expand