Most problems in computational geometry are algebraic. A general approach to address nonrobustness in such problems is Exact Geometric Computation (EGC). There are now general lib...
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
We describe a proof dedicated meta-language, called Ltac, in the context of the Coq proof assistant. This new layer of meta-language is quite appropriate to write small and local ...
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
The aim of this work is to show that (oriented) matroid methods can be applied to many discrete geometries, namely those based on modules over integral (ordered) domains. The tric...