The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the parallel computation for the knapsack problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Lower bounds for solving linear diophantine equations on random access machines
Journal of the ACM (JACM)
Fast algorithms for N-dimensional restrictions of hard problems
Journal of the ACM (JACM)
Linear decision trees: volume estimates and topological bounds
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A lower bound for randomized algebraic decision trees
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomized Ω(n2) lower bound for knapsack
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Are lower bounds easier over the reals?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Lower bounds for linear satisfiability problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Calculs sur les structures de langage dénombrable
Theoretical Computer Science
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Lower Bounds Are Not Easier over the Reals: Inside PH
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Circuits versus Trees in Algebraic Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Preprocessing chains for fast dihedral rotations is hard or even impossible
Computational Geometry: Theory and Applications
Lower bounds for linear degeneracy testing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
IEEE/ACM Transactions on Networking (TON)
Lower bounds for linear degeneracy testing
Journal of the ACM (JACM)
Where are the hard knapsack problems?
Computers and Operations Research
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Finding a vector orthogonal to roughly half a collection of vectors
Journal of Complexity
Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Decision versus evaluation in algebraic complexity
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Enhanced quantum evolutionary algorithms for difficult knapsack problems
PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
The complexity of semilinear problems in succinct representation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Time complexity of decision trees
Transactions on Rough Sets III
An efficient algorithm for the sign condition problem in the semi-algebraic context
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
Efficient evaluation of specific queries in constraint databases
Information Processing Letters
Unimprovable Upper Bounds on Time Complexity of Decision Trees
Fundamenta Informaticae
| Hi-index | 0.01 |