Ümit Çatalyürek: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
No edit summary
No edit summary
Line 31: Line 31:
==Education==
==Education==
Catalyurek completed his B.S. in Computer Engineering and Information Science at the Bilkent University in the year 1992 and received his Ph.D. in Computer Engineering and Information Science from the [[Bilkent University]] in 2000, under the supervision of Cevdet Aykanat. His dissertation was published by the Bilkent University as Hypergraph Models for Sparse Matrix Partitioning and Reordering.<ref>{{Cite web|url=https://www.cc.gatech.edu/~umit/|title=Umit V. Catalyurek|last=|first=|date=|website=College of Computing - Georgia Tech|archive-url=|archive-date=|dead-url=|access-date=21 October 2017}}</ref>
Catalyurek completed his B.S. in Computer Engineering and Information Science at the Bilkent University in the year 1992 and received his Ph.D. in Computer Engineering and Information Science from the [[Bilkent University]] in 2000, under the supervision of Cevdet Aykanat. His dissertation was published by the Bilkent University as Hypergraph Models for Sparse Matrix Partitioning and Reordering.<ref>{{Cite web|url=https://www.cc.gatech.edu/~umit/|title=Umit V. Catalyurek|last=|first=|date=|website=College of Computing - Georgia Tech|archive-url=|archive-date=|dead-url=|access-date=21 October 2017}}</ref>

==Major publications==
Catalyurek has co-authored over 200 articles in peer-reviewed journals and conferences.
* {{Cite journal|last=Catalyurek|first=U. V.|last2=Aykanat|first2=C.|date=July 1999|title=Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication|url=http://ieeexplore.ieee.org/abstract/document/780863/?reload=true|journal=IEEE Transactions on Parallel and Distributed Systems|volume=10|issue=7|pages=673–693|doi=10.1109/71.780863|issn=1045-9219}}
* {{Cite journal|last=Yoo|first=A.|last2=Chow|first2=E.|last3=Henderson|first3=K.|last4=McLendon|first4=W.|last5=Hendrickson|first5=B.|last6=Catalyurek|first6=U.|date=November 2005|title=A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L|url=http://ieeexplore.ieee.org/abstract/document/1559977/|journal=Supercomputing, 2005. Proceedings of the ACM/IEEE SC 2005 Conference|pages=25–25|doi=10.1109/SC.2005.4}}
* {{Cite journal|last=Beynon|first=Michael D|last2=Kurc|first2=Tahsin|last3=Catalyurek|first3=Umit|last4=Chang|first4=Chialin|last5=Sussman|first5=Alan|last6=Saltz|first6=Joel|date=2001-10-01|title=Distributed processing of very large datasets with DataCutter|url=http://www.sciencedirect.com/science/article/pii/S0167819101000990|journal=Parallel Computing|series=Clusters and computational grids for scientific computing|volume=27|issue=11|pages=1457–1478|doi=10.1016/S0167-8191(01)00099-0}}
* {{Cite journal|last=Devine|first=K. D.|last2=Boman|first2=E. G.|last3=Heaphy|first3=R. T.|last4=Bisseling|first4=R. H.|last5=Catalyurek|first5=U. V.|date=April 2006|title=Parallel hypergraph partitioning for scientific computing|url=http://ieeexplore.ieee.org/abstract/document/1639359/|journal=Proceedings 20th IEEE International Parallel Distributed Processing Symposium|pages=10 pp.–|doi=10.1109/IPDPS.2006.1639359}}
* {{Cite journal|last=Sertel|first=O.|last2=Kong|first2=J.|last3=Shimada|first3=H.|last4=Catalyurek|first4=U. V.|last5=Saltz|first5=J. H.|last6=Gurcan|first6=M. N.|date=2009-06-01|title=Computer-aided prognosis of neuroblastoma on whole-slide images: Classification of stromal development|url=http://www.sciencedirect.com/science/article/pii/S0031320308003439|journal=Pattern Recognition|series=Digital Image Processing and Pattern Recognition Techniques for the Detection of Cancer|volume=42|issue=6|pages=1093–1103|doi=10.1016/j.patcog.2008.08.027}}
* {{Cite journal|last=Aykanat|first=C.|last2=Pinar|first2=A.|last3=Çatalyürek|first3=Ü.|date=2004-01-01|title=Permuting Sparse Rectangular Matrices into Block-Diagonal Form|url=http://epubs.siam.org/doi/abs/10.1137/S1064827502401953|journal=SIAM Journal on Scientific Computing|volume=25|issue=6|pages=1860–1879|doi=10.1137/S1064827502401953|issn=1064-8275}}
* {{Cite journal|last=Sertel|first=Olcay|last2=Kong|first2=Jun|last3=Catalyurek|first3=Umit V.|last4=Lozanski|first4=Gerard|last5=Saltz|first5=Joel H.|last6=Gurcan|first6=Metin N.|date=2009-04-01|title=Histopathological Image Analysis Using Model-Based Intermediate Representations and Color Texture: Follicular Lymphoma Grading|url=https://link.springer.com/article/10.1007/s11265-008-0201-y|journal=Journal of Signal Processing Systems|language=en|volume=55|issue=1-3|pages=169|doi=10.1007/s11265-008-0201-y|issn=1939-8018}}
* {{Cite journal|last=Hatem|first=Ayat|last2=Bozdağ|first2=Doruk|last3=Toland|first3=Amanda E.|last4=Çatalyürek|first4=Ümit V.|date=2013-06-07|title=Benchmarking short sequence mapping tools|url=https://doi.org/10.1186/1471-2105-14-184|journal=BMC Bioinformatics|volume=14|pages=184|doi=10.1186/1471-2105-14-184|issn=1471-2105}}
* {{Cite journal|last=Eren|first=K.|last2=Deveci|first2=M.|last3=Kucuktunc|first3=O.|last4=Catalyurek|first4=U. V.|date=2013-05-01|title=A comparative analysis of biclustering algorithms for gene expression data|url=https://academic.oup.com/bib/article-abstract/14/3/279/255334|journal=Briefings in Bioinformatics|language=en|volume=14|issue=3|pages=279–292|doi=10.1093/bib/bbs032|issn=1467-5463}}


== References ==
== References ==

Revision as of 06:05, 21 October 2017

Umit V. Catalyurek
Alma materBilkent University
Known forGraph and hypergraph partitioning, High performance computing, combinatorial scientific computing and biomedical informatics
SpouseGamze Catalyurek
AwardsIEEE Fellow
NSF CAREER
Lumley Interdisciplinary Research Award
Scientific career
FieldsComputer Science, Electrical & Computer Engineering, Biomedical Informatics
InstitutionsOhio State University
Georgia Institute of Technology
Thesis Hypergraph Models for Sparse Matrix Partitioning and Reordering
Doctoral advisorCevdet Aykanat
Doctoral studentsDoruk Bozdag, Olcay Sertel, Timothy D.R. Hartley, Onur Kucuktunc, Ayat Hatem, Ahmet Erdem Sariyuce, Mehmet Deveci, Anas Abu Doleh

Umit Catalyurek is a professor of computer science at the Georgia Institute of Technology, and Adjunct Professor in department of Biomedical Informatics at the Ohio State University. He is known for his work on graph analytics, parallel algorithms for scientific applications, data-intensive computing, and large scale genomic and biomedical applications. He was the director of the High Performance Computing Lab at the Ohio State University. He was named Fellow of the Institute of Electrical and Electronics Engineers (IEEE) in 2016[1] for contributions to combinatorial scientific computing and parallel computing.

Education

Catalyurek completed his B.S. in Computer Engineering and Information Science at the Bilkent University in the year 1992 and received his Ph.D. in Computer Engineering and Information Science from the Bilkent University in 2000, under the supervision of Cevdet Aykanat. His dissertation was published by the Bilkent University as Hypergraph Models for Sparse Matrix Partitioning and Reordering.[2]

Major publications

Catalyurek has co-authored over 200 articles in peer-reviewed journals and conferences.

References

  1. ^ "2016 elevated fellow" (PDF). IEEE Fellows Directory. {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)
  2. ^ "Umit V. Catalyurek". College of Computing - Georgia Tech. Retrieved 21 October 2017. {{cite web}}: Cite has empty unknown parameter: |dead-url= (help)