We recently showed that arbitrarily reliable communication is possible within a single coherence interval in Rayleigh flat fading as the symbol-duration of the coherence interval ...
Thomas L. Marzetta, Babak Hassibi, Bertrand M. Hoc...
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...