Complexity of Layered Binary Search Trees with Relaxed Balance
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Continuous-time symmetric Hopfield nets are computationally universal
Neural Computation
Exponential transients in continuous-time Liapunov systems
Theoretical Computer Science
On the Size of Stack and Synchronization Alphabets of Tree Automata
Fundamenta Informaticae
Hi-index | 0.00 |