Ahmed Younes
|
Computer Science Lecturer
Department of Math. & Computer Science
Faculty of Science
AlexandriaUniversity
Egypt
a.younes-at-sci.alex.edu.eg
ayounes2-at-yahoo.com Tel : 002-010- 136 8289
|
|
Education
q B.Sc. in Computer Science (Special Degree) – Faculty of Science, Alexandria University [May 1999] with grade “Excellent with honour” (First Class), ranked first over the batch.
q M.Sc. qualifications in Computer Science – Faculty of Science, Alexandria University [2000/2001] with grade “Excellent”, ranked first over the batch.
q Ph.D. in Computer Science – School of Computer Science, the University of Birmingham, United Kingdom [August 2004]
.
Work Experience
q Software/Hardware Support - PC-LINK [1997 -1999].
q Network Administrator - Representing PC-LINK in INCOGUM [1999].
q Database Developer - IST [2000].
q Teaching Assistance - Faculty of Science, Mathematics Dept. (CS division) [2000-2002].
q Research Student and Postgraduate Tutor – School of Computer Science, the University of Birmingham, United Kingdom [2002-2004].
q Currently working as a Computer Science Lecturer - Faculty of Science, CS & Math. Dept. Alexandria University, Alexandria, Egypt.
Teaching
- Discrete Structures
- Structured Programming using C.
- Object Oriented Programming using C++
- Data Structures using C++
- Algorithm Analysis and Design
- Computational Complexity
- Computer Architecture
- Operating Systems Concepts and Design
- Compiler Design and Construction
- Theory of Computation
- Database Management Systems
- Multimedia Systems
- Quantum Computation and Information(postgrad)
- Biologically Inspired Computation(postgrad)
Research Interests
I am generally interested in Non standard computation such as Quantum Computation and DNA computation.
I am also interested in algorithms analysis and design, computation complexity, circuits optimizations.
My special interests are Quantum Algorithms, Boolean Quantum Circuits,
Research and Publications
ÞPh.D. Thesis
[1] Ahmed Younes, Practical Search Algorithms and Boolean Circuits for Quantum Computers. Ph.D. Thesis, the University of Birmingham , UK (July 2004).
ÞJournal Papers:
[2] Younes, A., Miller, J., Representation of Boolean Quantum Circuits as Reed-Muller Expansions. International Journal of Electronics. Vol.(No.7)pp. 431-444 (2004). quant-ph/0305134.
[3] Younes, A., Rowe, J. and Miller, J.,Enhanced Quantum Searching via Entanglement and Partial Diffusion. Physica D. Vol. 237(8) pp. 1074-1078 (2007).
ÞConference Papers:
[4] Younes, A., Rowe, J. and Miller, J., Quantum Search Algorithm with more Reliable Behaviour using Partial Diffusion. In Proceedings of the Seventh International Conference on Quantum Communication, Measurement and Computing, pp. 171 – 174. quant-ph/ 0312022
[5] Younes, A., Miller, J., Automated Method for Building CNOT Based Quantum Circuits for Boolean Functions. In Proceeding of ICENCO2004 pp. 562- 565 (2004). quant-ph/0304099.
[6] Younes, A., Rowe, J. and Miller, J., A Hybrid Quantum Search Engine: A Fast Quantum Algorithm for Multiple Matches. In Proceeding of ICENCO2006. quant-ph/0311171.
[7] Younes, A., Rowe, J. and Miller, J., Quantum Searching via Entanglement and Partial Diffusion. Accepted in Einstein Symposium 2005, Bibliotheca Alexandrina. quant-ph/ 0406207.
ÞChapters in Books
[8] Ahmed Younes, Tradeoff in Quantum Amplitude Amplification Techniques, Chapter in “Trends in Quantum Computing Research”. Nova Publisher (2006).
ÞLANL arXiv (In progress)
[11] Ahmed Younes, Synthesis and Optimization of Reversible Circuits for Homogeneous Boolean Functions. quant-ph/ arXiv:0710.0664
[12] Ahmed Younes, Hiding Quantum States in a Superposition. arXiv:0807.4732
[13]Ahmed Younes, Constant-Time Quantum Algorithm For The Unstructured Search Problem.arXiv:0811.4247v1[quant-ph]
[14]Ahmed Younes, Strength and Weakness in Grover's Quantum Search Algorithm.arXiv:0811.4481v1[quant-ph]