| Publication | Date of Publication | Type |
|---|
| On continuous one-way functions | 2021-01-25 | Paper |
| Centralized and decentralized rumor blocking problems | 2017-10-17 | Paper |
| Competitive profit maximization in social networks | 2017-09-12 | Paper |
| An approximation algorithm for maximum weight budgeted connected set cover | 2016-05-11 | Paper |
| Some complexity issues on the simply connected regions of the two-dimensional plane | 2015-05-07 | Paper |
| Theory of Computational Complexity | 2014-03-04 | Paper |
| On the complexity of computing the Hausdorff distance | 2014-02-03 | Paper |
| On parallel complexity of analytic functions | 2013-12-19 | Paper |
| Jordan Curves with Polynomial Inverse Moduli of Continuity | 2013-05-10 | Paper |
| On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane | 2013-05-03 | Paper |
| On logarithmic-space computable real numbers | 2013-02-19 | Paper |
| Design and analysis of approximation algorithms | 2011-11-22 | Paper |
| On the complexity of non-unique probe selection | 2008-03-05 | Paper |
| Jordan curves with polynomial inverse moduli of continuity | 2007-09-03 | Paper |
| On the complexity of computing the logarithm and square root functions on a complex domain | 2007-03-12 | Paper |
| On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain | 2007-02-08 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| The computational complexity of distance functions of two-dimensional domains | 2005-06-30 | Paper |
| On the complexity of finding paths in a two-dimensional domain I: Shortest paths | 2005-02-16 | Paper |
| A greedy approximation for minimum connected dominating sets | 2005-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460840 | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942157 | 2000-03-20 | Paper |
| On the computability of fractal dimensions and Hausdorff measure | 1999-06-24 | Paper |
| In memoriam Ronald V. Book (1937--1997) | 1999-02-02 | Paper |
| A polynomial-time computable curve whose interior has a nonrecursive measure | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4883380 | 1996-09-26 | Paper |
| Computational Complexity of Two-Dimensional Regions | 1996-04-22 | Paper |
| Computational complexity of fixed points and intersection points | 1996-03-18 | Paper |
| On the longest circuit in an alterable digraph | 1996-02-01 | Paper |
| Instance complexity | 1995-03-01 | Paper |
| Three \(\sum^ P_ 2\)-complete problems in computational learning theory | 1993-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035313 | 1993-05-18 | Paper |
| On the computational complexity of integral equations | 1993-04-01 | Paper |
| A note of best fractions of a computable real number | 1993-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4002474 | 1992-09-18 | Paper |
| On adaptive versus nonadaptive bounded query machines | 1991-01-01 | Paper |
| Separating the low and high hierarchies by oracles | 1991-01-01 | Paper |
| On the Complexity of Learning Minimum Time-Bounded Turing Machines | 1991-01-01 | Paper |
| Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy | 1990-01-01 | Paper |
| A note on separating the relativized polynomial time hierarchy by immune sets | 1990-01-01 | Paper |
| On the complexity of an optimal routing tree problem | 1989-01-01 | Paper |
| Distinguishing conjunctive and disjunctive reducibilities by sparse sets | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3348420 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4205080 | 1989-01-01 | Paper |
| Relativized Polynomial Time Hierarchies Having Exactly K Levels | 1989-01-01 | Paper |
| Computing power series in polynomial time | 1988-01-01 | Paper |
| Searching for Two Objects by Underweight Feedback | 1988-01-01 | Paper |
| On Sets Truth-Table Reducible to Sparse Sets | 1988-01-01 | Paper |
| Corrigenda to: ``On the continued fraction representation of computable real numbers | 1987-01-01 | Paper |
| On helping by robust oracle machines | 1987-01-01 | Paper |
| Identification of pattern languages from examples and queries | 1987-01-01 | Paper |
| A note on the two-variable pattern-finding problem | 1987-01-01 | Paper |
| Some Completeness Results on Decision Trees and Group Testing | 1987-01-01 | Paper |
| Approximation to measurable functions and its relation to probabilistic computation | 1986-01-01 | Paper |
| On the notion of infinite pseudorandom sequences | 1986-01-01 | Paper |
| On the continued fraction representation of computable real numbers | 1986-01-01 | Paper |
| On one-way functions and polynomial-time isomorphisms | 1986-01-01 | Paper |
| On the computational complexity of best Chebyshev approximations | 1986-01-01 | Paper |
| On the number of queries necessary to identify a permutation | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4727431 | 1986-01-01 | Paper |
| On some natural complete operators | 1985-01-01 | Paper |
| Continuous optimization problems and a polynomial hierarchy of real functions | 1985-01-01 | Paper |
| On Circuit-Size Complexity and the Low Hierarchy in NP | 1985-01-01 | Paper |
| Nonlevelable sets and immune sets in the accepting density hierarchy inNP | 1985-01-01 | Paper |
| Reducibilities on real numbers | 1984-01-01 | Paper |
| On self-reducibility and weak P-selectivity | 1983-01-01 | Paper |
| On the definitions of some complexity classes of real numbers | 1983-01-01 | Paper |
| On the computational complexity of ordinary differential equations | 1983-01-01 | Paper |
| The maximum value problem and NP real numbers | 1982-01-01 | Paper |
| Some observations on the probabilistic algorithms and NP-hard problems | 1982-01-01 | Paper |
| Computational complexity of real functions | 1982-01-01 | Paper |
| Some negative results on the computational complexity of total variation and differentiation | 1982-01-01 | Paper |
