, Wiley Interscience Series in Discrete Mathematics and Optimization, 2000.
Boolean Functions and Computation Models, Texts in Theoretical Computer Science (an EATCS Series, 2002. ,
Very fast parallel polynomial arithmetic, SIAM Journal on Computing, vol.18, issue.5, pp.955-976, 1989. ,
Are lower bounds easier over the reals ?, Proc. 30th ACM Symposium on Theory of Computing, pp.507-513, 1998. ,
URL : https://hal.archives-ouvertes.fr/hal-02102035
Lower bounds are not easier over the reals : Inside PH, Proc. 27th International Colloquium on Automata, Languages and Programming, vol.1853, pp.832-843, 2000. ,
URL : https://hal.archives-ouvertes.fr/hal-02102035
Topological complexity of the range searching, Journal of Complexity, vol.16, pp.50-53, 2000. ,
Circuits versus trees in algebraic complexity, Proc. STACS, vol.1770, pp.35-52, 2000. ,
Point location in arrangements of hyperplanes, Information and Computation, vol.106, issue.2, pp.286-303, 1993. ,
A polynomial linear search algorithm for the n-dimensional knapsack problem, Journal of the ACM, vol.31, issue.3, pp.668-676, 1984. ,
Fast algorithms for n-dimensional restrictions of hard problems, Journal of the ACM, vol.35, issue.3, pp.740-747, 1988. ,
The probabilistic method yields deterministic parallel algorithms, Journal of Computer and System Sciences, vol.49, pp.478-516, 1994. ,
Combinatorial Identities, 1979. ,
On the topology of algorithms, I. Journal of Complexity, vol.3, pp.81-89, 1987. ,
Combinatorial Identities, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-01184212
On decision trees for orthants, Information Processing Letters, vol.62, issue.5, pp.265-268, 1997. ,
Introduction to Circuit Complexity : a Uniform Approach, Texts in Theoretical Computer Science (an EATCS Series, 1999. ,