| Publication | Date of Publication | Type |
|---|
On continuous one-way functions
Theoretical Computer Science | 2021-01-25 | Paper |
Centralized and decentralized rumor blocking problems
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
Competitive profit maximization in social networks
Theoretical Computer Science | 2017-09-12 | Paper |
An approximation algorithm for maximum weight budgeted connected set cover
Journal of Combinatorial Optimization | 2016-05-11 | Paper |
Some complexity issues on the simply connected regions of the two-dimensional plane
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
| Theory of Computational Complexity | 2014-03-04 | Paper |
On the complexity of computing the Hausdorff distance
Journal of Complexity | 2014-02-03 | Paper |
On parallel complexity of analytic functions
Theoretical Computer Science | 2013-12-19 | Paper |
Jordan curves with polynomial inverse moduli of continuity
Electronic Notes in Theoretical Computer Science | 2013-05-10 | Paper |
On the complexity of convex hulls of subsets of the two-dimensional plane
Electronic Notes in Theoretical Computer Science | 2013-05-03 | Paper |
On logarithmic-space computable real numbers
Theoretical Computer Science | 2013-02-19 | Paper |
Design and analysis of approximation algorithms
Springer Optimization and Its Applications | 2011-11-22 | Paper |
On the complexity of non-unique probe selection
Theoretical Computer Science | 2008-03-05 | Paper |
Jordan curves with polynomial inverse moduli of continuity
Theoretical Computer Science | 2007-09-03 | Paper |
On the complexity of computing the logarithm and square root functions on a complex domain
Journal of Complexity | 2007-03-12 | Paper |
On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
Journal of Complexity | 2007-02-08 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
The computational complexity of distance functions of two-dimensional domains
Theoretical Computer Science | 2005-06-30 | Paper |
On the complexity of finding paths in a two-dimensional domain I: Shortest paths
MLQ | 2005-02-16 | Paper |
A greedy approximation for minimum connected dominating sets
Theoretical Computer Science | 2005-02-09 | Paper |
| scientific article; zbMATH DE number 2063224 (Why is no real title available?) | 2004-03-29 | Paper |
| scientific article; zbMATH DE number 1418967 (Why is no real title available?) | 2000-03-20 | Paper |
On the computability of fractal dimensions and Hausdorff measure
Annals of Pure and Applied Logic | 1999-06-24 | Paper |
In memoriam Ronald V. Book (1937--1997)
Theoretical Computer Science | 1999-02-02 | Paper |
A polynomial-time computable curve whose interior has a nonrecursive measure
Theoretical Computer Science | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 895368 (Why is no real title available?) | 1996-09-26 | Paper |
Computational Complexity of Two-Dimensional Regions
SIAM Journal on Computing | 1996-04-22 | Paper |
Computational complexity of fixed points and intersection points
Journal of Complexity | 1996-03-18 | Paper |
On the longest circuit in an alterable digraph
Journal of Global Optimization | 1996-02-01 | Paper |
Instance complexity
Journal of the ACM | 1995-03-01 | Paper |
Three \(\sum^ P_ 2\)-complete problems in computational learning theory
Computational Complexity | 1993-10-10 | Paper |
| scientific article; zbMATH DE number 176209 (Why is no real title available?) | 1993-05-18 | Paper |
On the computational complexity of integral equations
Annals of Pure and Applied Logic | 1993-04-01 | Paper |
A note of best fractions of a computable real number
Journal of Complexity | 1993-01-17 | Paper |
| scientific article; zbMATH DE number 52121 (Why is no real title available?) | 1992-09-18 | Paper |
Separating the low and high hierarchies by oracles
Information and Computation | 1991-01-01 | Paper |
On the Complexity of Learning Minimum Time-Bounded Turing Machines
SIAM Journal on Computing | 1991-01-01 | Paper |
On adaptive versus nonadaptive bounded query machines
Theoretical Computer Science | 1991-01-01 | Paper |
Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Journal of the ACM | 1990-01-01 | Paper |
A note on separating the relativized polynomial time hierarchy by immune sets
RAIRO - Theoretical Informatics and Applications | 1990-01-01 | Paper |
On the complexity of an optimal routing tree problem
Acta Mathematicae Applicatae Sinica. English Series | 1989-01-01 | Paper |
Distinguishing conjunctive and disjunctive reducibilities by sparse sets
Information and Computation | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4199632 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4125012 (Why is no real title available?) | 1989-01-01 | Paper |
Relativized Polynomial Time Hierarchies Having Exactly <i>K</i> Levels
SIAM Journal on Computing | 1989-01-01 | Paper |
Computing power series in polynomial time
Advances in Applied Mathematics | 1988-01-01 | Paper |
Searching for Two Objects by Underweight Feedback
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
On Sets Truth-Table Reducible to Sparse Sets
SIAM Journal on Computing | 1988-01-01 | Paper |
Corrigenda to: ``On the continued fraction representation of computable real numbers''
Theoretical Computer Science | 1987-01-01 | Paper |
On helping by robust oracle machines
Theoretical Computer Science | 1987-01-01 | Paper |
Identification of pattern languages from examples and queries
Information and Computation | 1987-01-01 | Paper |
A note on the two-variable pattern-finding problem
Journal of Computer and System Sciences | 1987-01-01 | Paper |
Some Completeness Results on Decision Trees and Group Testing
SIAM Journal on Algebraic Discrete Methods | 1987-01-01 | Paper |
Approximation to measurable functions and its relation to probabilistic computation
Annals of Pure and Applied Logic | 1986-01-01 | Paper |
On the notion of infinite pseudorandom sequences
Theoretical Computer Science | 1986-01-01 | Paper |
On the continued fraction representation of computable real numbers
Theoretical Computer Science | 1986-01-01 | Paper |
On one-way functions and polynomial-time isomorphisms
Theoretical Computer Science | 1986-01-01 | Paper |
On the computational complexity of best Chebyshev approximations
Journal of Complexity | 1986-01-01 | Paper |
On the number of queries necessary to identify a permutation
Journal of Algorithms | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4001485 (Why is no real title available?) | 1986-01-01 | Paper |
On some natural complete operators
Theoretical Computer Science | 1985-01-01 | Paper |
Continuous optimization problems and a polynomial hierarchy of real functions
Journal of Complexity | 1985-01-01 | Paper |
On Circuit-Size Complexity and the Low Hierarchy in NP
SIAM Journal on Computing | 1985-01-01 | Paper |
Nonlevelable sets and immune sets in the accepting density hierarchy inNP
Mathematical Systems Theory | 1985-01-01 | Paper |
Reducibilities on real numbers
Theoretical Computer Science | 1984-01-01 | Paper |
On self-reducibility and weak P-selectivity
Journal of Computer and System Sciences | 1983-01-01 | Paper |
On the definitions of some complexity classes of real numbers
Mathematical Systems Theory | 1983-01-01 | Paper |
On the computational complexity of ordinary differential equations
Information and Control | 1983-01-01 | Paper |
The maximum value problem and NP real numbers
Journal of Computer and System Sciences | 1982-01-01 | Paper |
Some observations on the probabilistic algorithms and NP-hard problems
Information Processing Letters | 1982-01-01 | Paper |
Computational complexity of real functions
Theoretical Computer Science | 1982-01-01 | Paper |
Some negative results on the computational complexity of total variation and differentiation
Information and Control | 1982-01-01 | Paper |
