default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMehmet Deveci
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i5]Sameer Kumar, James Bradbury, Cliff Young, Yu Emma Wang, Anselm Levskaya, Blake A. Hechtman, Dehao Chen, HyoukJoong Lee, Mehmet Deveci, Naveen Kumar, Pankaj Kanwar, Shibo Wang, Skye Wanderman-Milne, Steve Lacy, Tao Wang, Tayo Oguntebi, Yazhou Zu, Yuanzhong Xu, Andy Swing:
Exploring the limits of Concurrency in ML Training on Google TPUs. CoRR abs/2011.03641 (2020)
2010 – 2019
- 2019
- [j6]Mehmet Deveci, Karen D. Devine
, Kevin T. Pedretti, Mark A. Taylor, Sivasankaran Rajamanickam, Ümit V. Çatalyürek:
Geometric Mapping of Tasks to Processors on Parallel Computers with Mesh or Torus Networks. IEEE Trans. Parallel Distributed Syst. 30(9): 2018-2032 (2019) - 2018
- [j5]Mehmet Deveci, Christian Trott, Sivasankaran Rajamanickam:
Multithreaded sparse matrix-matrix multiplication for many-core and GPU architectures. Parallel Comput. 78: 33-46 (2018) - [i4]Mehmet Deveci, Christian Trott, Sivasankaran Rajamanickam:
Multi-threaded Sparse Matrix-Matrix Multiplication for Many-Core and GPU Architectures. CoRR abs/1801.03065 (2018) - [i3]Mehmet Deveci, Simon D. Hammond, Michael M. Wolf, Sivasankaran Rajamanickam:
Sparse Matrix-Matrix Multiplication on Multilevel Memory Architectures : Algorithms and Experiments. CoRR abs/1804.00695 (2018) - [i2]Mehmet Deveci, Karen D. Devine, Kevin T. Pedretti, Mark A. Taylor, Sivasankaran Rajamanickam, Ümit V. Çatalyürek:
Geometric Partitioning and Ordering Strategies for Task Mapping on Parallel Computers. CoRR abs/1804.09798 (2018) - 2017
- [c11]Michael M. Wolf, Mehmet Deveci, Jonathan W. Berry, Simon D. Hammond, Sivasankaran Rajamanickam:
Fast linear algebra-based triangle counting with KokkosKernels. HPEC 2017: 1-7 - [c10]Mehmet Deveci, Christian Trott, Sivasankaran Rajamanickam:
Performance-Portable Sparse Matrix-Matrix Multiplication for Many-Core Architectures. IPDPS Workshops 2017: 693-702 - [c9]Kyungjoo Kim, Timothy B. Costa, Mehmet Deveci, Andrew M. Bradley, Simon D. Hammond, Murat Efe Guney, Sarah Knepper, Shane Story, Sivasankaran Rajamanickam:
Designing vector-friendly compact BLAS and LAPACK kernels. SC 2017: 55 - 2016
- [j4]Mehmet Deveci, Sivasankaran Rajamanickam, Karen D. Devine, Ümit V. Çatalyürek:
Multi-Jagged: A Scalable Parallel Spatial Partitioning Algorithm. IEEE Trans. Parallel Distributed Syst. 27(3): 803-817 (2016) - [c8]Mehmet Deveci, Erik G. Boman, Karen D. Devine, Sivasankaran Rajamanickam:
Parallel Graph Coloring for Manycore Architectures. IPDPS 2016: 892-901 - 2015
- [j3]Mehmet Deveci, Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
Hypergraph partitioning for multiple communication cost metrics: Model and methods. J. Parallel Distributed Comput. 77: 69-83 (2015) - [c7]Mehmet Deveci, Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
Fast and High Quality Topology-Aware Task Mapping. IPDPS 2015: 197-206 - 2014
- [j2]Mehmet Deveci, Ümit V. Çatalyürek, Amanda E. Toland:
mrSNP: Software to detect SNP effects on microRNA binding. BMC Bioinform. 15: 73 (2014) - [c6]Mehmet Deveci, Sivasankaran Rajamanickam, Vitus J. Leung, Kevin T. Pedretti, Stephen L. Olivier, David P. Bunde, Ümit V. Çatalyürek, Karen D. Devine:
Exploiting Geometric Partitioning in Task Mapping for Parallel Computers. IPDPS 2014: 27-36 - 2013
- [j1]Kemal Eren, Mehmet Deveci, Onur Küçüktunç, Ümit V. Çatalyürek:
A comparative analysis of biclustering algorithms for gene expression data. Briefings Bioinform. 14(3): 279-292 (2013) - [c5]Mehmet Deveci, Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs. Euro-Par 2013: 850-861 - [c4]Mehmet Deveci, Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs. ICPP 2013: 21-29 - [c3]Mehmet Deveci, Kamer Kaya, Ümit V. Çatalyürek:
Hypergraph Sparsification and Its Application to Partitioning. ICPP 2013: 200-209 - [i1]Mehmet Deveci, Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
GPU accelerated maximum cardinality matching algorithms for bipartite graphs. CoRR abs/1303.1379 (2013) - 2012
- [c2]Ümit V. Çatalyürek, Mehmet Deveci, Kamer Kaya, Bora Uçar:
UMPa: A multi-objective, multi-level partitioner for communication minimization. Graph Partitioning and Graph Clustering 2012: 53-66 - [c1]Ümit V. Çatalyürek, Mehmet Deveci, Kamer Kaya, Bora Uçar:
Multithreaded Clustering for Multi-level Hypergraph Partitioning. IPDPS 2012: 848-859
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
