Marius Zimand is a Professor in the Department of Computer and Information Sciences at Towson University. His academic expertise spans computational complexity , algorithmic information theory , and cryptography . Holding Ph.D.s in both Computer Science (University of Rochester) and Mathematics (University of Bucharest), he contributes to the advancement of randomness extraction and theoretical computer science. Education: Ph.D. in Computer Science (University of Rochester), Ph.D. in Mathematics (University of Bucharest) Zimand's research focuses on transforming low-quality randomness into high-quality randomness through efficient algorithms. His work, supported by NSF grants 0634830 (2006-2009) and 1016158 (2010-2014) , explores randomness extractors' applications in cryptography, error-correcting codes, and data structures, with mathematical implications in Kolmogorov complexity and constructive Hausdorff dimension. His recent publications analyze topics such as time-bounded Kolmogorov complexity , dynamic matching in expanders , and universal coding theorems , reflecting a consistent emphasis on randomness extraction and complexity theory. Awards include Best Paper at CSR'2008 and Best Paper at ICALP 2005, Track C . Professional Service: Editorial Board Member of Journal of Universal Computer Science Grant Reviewer for NSF, National Research Council Canada, ANR France, and US-Israel BSF Zimand's contributions to theoretical computer science bridge mathematical rigor with practical applications, maintaining active research and service roles within the academic community.











0319.jpg)
