Christian Reitwießner

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

VLDB 2026 Research / reviewers in the wild / expert

dblp:73/336 · DBLP profile ↗

← Back

14ranked-venue papers

0as first author

0since 2021 · last 2018

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 12Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

1 paper

Computational complexity · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Computational complexity › reduction autoreducibility	0.2	1	2013	Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions · ICALP (1) 2013
Computational complexity › reduction logspace reductions	0.2	1	2013	Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions · ICALP (1) 2013
Computational complexity › reduction polynomial-time reduction	0.2	1	2013	Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions · ICALP (1) 2013

Year	Publication	Venue	Position
2018	SMT-Based Verification of Solidity Smart Contracts Leonardo Alt, Christian Reitwießner	ISoLA (4)	2
2013	Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions Christian Glaßer, Christian Reitwießner, Alan L. Selman, Maximilian Witek	ICALP (1)	3
2012	Structural Complexity of Multiobjective NP Search Problems Krzysztof Fleszar 0001, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek	LATIN	4
2012	Parsing Boolean grammars over a one-letter alphabet using online convolution Alexander Okhotin, Christian Reitwießner	Theor. Comput. Sci.	2
2011	Applications of Discrepancy Theory in Multiobjective Approximation abstract 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 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiablilty problem is 1/2-approximable. Christian Glaßer, Christian Reitwießner, Maximilian Witek	FSTTCS	2
2011	The shrinking property for NP and coNP Christian Glaßer, Christian Reitwießner, Victor L. Selivanov	Theor. Comput. Sci.	2
2010	Approximability and Hardness in Multi-objective Optimization Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek	CiE	2
2010	Satisfiability of algebraic circuits over sets of natural numbers Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr	Discret. Appl. Math.	2
2010	Equivalence Problems for Circuits over Sets of Natural Numbers Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr	Theory Comput. Syst.	3
2010	Conjunctive grammars with restricted disjunction Alexander Okhotin, Christian Reitwießner	Theor. Comput. Sci.	2
2009	Conjunctive Grammars with Restricted Disjunction Alexander Okhotin, Christian Reitwießner	SOFSEM	2
2008	The Shrinking Property for NP and coNP Christian Glaßer, Christian Reitwießner, Victor L. Selivanov	CiE	2
2008	Multiobjective Disk Cover Admits a PTAS Christian Glaßer, Christian Reitwießner, Heinz Schmitz	ISAAC	2
2007	Satisfiability of Algebraic Circuits over Sets of Natural Numbers Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr	FSTTCS	2