Biography
Amirmohammad Farzaneh received his BSc in Electrical Engineering from Sharif University of Technology, Tehran, Iran. He is currently a DPhil student at the University of Oxford under the supervision of Professor Justin Coon.
Most Recent Publications
Practical Random Tree Generation: Information-Theoretic Analysis and Applications to IoT
Practical Random Tree Generation: Information-Theoretic Analysis and Applications to IoT
TreeExplorer: a coding algorithm for rooted trees with application to wireless and ad hoc routing
TreeExplorer: a coding algorithm for rooted trees with application to wireless and ad hoc routing
An information theory approach to network evolution models
An information theory approach to network evolution models
Code for generating Erdos-Renyi Network Evolution Chains (ERNEC)
Code for generating Erdos-Renyi Network Evolution Chains (ERNEC)
Kolmogorov basic graphs and their application in network complexity analysis
Kolmogorov basic graphs and their application in network complexity analysis
Research Interests
Amirmohammad’s main research interests lie in the field of communication systems. His other research interests include machine learning, artificial intelligence and computational biology.
Research Groups
Related Academics
Most Recent Publications
Practical Random Tree Generation: Information-Theoretic Analysis and Applications to IoT
Practical Random Tree Generation: Information-Theoretic Analysis and Applications to IoT
TreeExplorer: a coding algorithm for rooted trees with application to wireless and ad hoc routing
TreeExplorer: a coding algorithm for rooted trees with application to wireless and ad hoc routing
An information theory approach to network evolution models
An information theory approach to network evolution models
Code for generating Erdos-Renyi Network Evolution Chains (ERNEC)
Code for generating Erdos-Renyi Network Evolution Chains (ERNEC)
Kolmogorov basic graphs and their application in network complexity analysis
Kolmogorov basic graphs and their application in network complexity analysis
