Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A random polynomial time algorithm for approximating the volume of convex bodies
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
SIAM Journal on Computing
Approximating center points with iterated radon points
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
A computational view of population genetics
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Complexity theory and genetics: the compuational power of crossing over
Information and Computation
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Rate of convergence of crossover operators
Random Structures & Algorithms
Fast convergence to Wardrop equilibria by adaptive sampling methods
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Complexity of reachability problems for finite discrete dynamical systems
Journal of Computer and System Sciences
Membrane computing and complexity theory: A characterization of PSPACE
Journal of Computer and System Sciences
A new method for modeling the behavior of finite population evolutionary algorithms
Evolutionary Computation
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
SIAM Journal on Computing
On computational complexity of counting fixed points in symmetric boolean graph automata
UC'05 Proceedings of the 4th international conference on Unconventional Computation
| Hi-index | 0.00 |