default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAssefaw Hadish Gebremedhin
Assefaw H. Gebremedhin
Person information
- affiliation: Washington State University, Pullman, WA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j26]James Halvorsen
, Clemente Izurieta, Haipeng Cai, Assefaw Hadish Gebremedhin:
Applying Generative Machine Learning to Intrusion Detection: A Systematic Mapping Study and Review. ACM Comput. Surv. 56(10): 257 (2024)- [c37]Jarren Briscoe, Assefaw H. Gebremedhin:
Facets of Disparate Impact: Evaluating Legally Consistent Bias in Machine Learning. CIKM 2024: 3637-3641 - [c36]James Crabb, Christopher D. Hundhausen, Assefaw H. Gebremedhin:
A Critical Review of Cybersecurity Education in the United States. SIGCSE (1) 2024: 241-247 - 2022
- [j25]Julia Stachofsky, Assefaw Hadish Gebremedhin, Robert E. Crossler:
Cast to Vote: A Socio-technical Network Analysis of an Election Smartphone Application. Digit. Gov. Res. Pract. 3(1): 3:1-3:17 (2022) - [j24]Xu T. Liu, Andrew Lumsdaine, Mahantesh Halappanavar, Kevin J. Barker, Assefaw Hadish Gebremedhin:
Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis. ACM J. Exp. Algorithmics 27: 1.12:1-1.12:31 (2022) - [j23]Yunshu Du, Garrett Warnell, Assefaw H. Gebremedhin, Peter Stone, Matthew E. Taylor:
Lucid dreaming for experience replay: refreshing past states with the current policy. Neural Comput. Appl. 34(3): 1687-1712 (2022) - [j22]Lusha Wang, Anamika Dubey, Assefaw H. Gebremedhin, Anurag K. Srivastava, Noel N. Schulz:
MPC-Based Decentralized Voltage Control in Power Distribution Systems With EV and PV Coordination. IEEE Trans. Smart Grid 13(4): 2908-2919 (2022) - [c35]Xu T. Liu, Jesun Firoz, Assefaw H. Gebremedhin, Andrew Lumsdaine:
NWHy: A Framework for Hypergraph Analytics: Representations, Data structures, and Algorithms. IPDPS Workshops 2022: 275-284 - [c34]Xu T. Liu, Jesun Firoz, Sinan Aksoy, Ilya Amburg, Andrew Lumsdaine, Cliff A. Joslyn, Brenda Praggastis, Assefaw H. Gebremedhin:
High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis. IPDPS 2022: 784-794 - [i9]Xu T. Liu, Jesun Firoz, Sinan Aksoy, Ilya Amburg, Andrew Lumsdaine, Cliff A. Joslyn, Assefaw H. Gebremedhin, Brenda Praggastis:
High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis. CoRR abs/2201.11326 (2022) - 2021
- [j21]Ramyar Saeedi, K. Sadanandan Sajan, Anurag K. Srivastava, Kevin Davies, Assefaw H. Gebremedhin:
An Adaptive Machine Learning Framework for Behind-the-Meter Load/PV Disaggregation. IEEE Trans. Ind. Informatics 17(10): 7060-7069 (2021) - [c33]Sayan Ghosh, Yanfei Guo, Pavan Balaji, Assefaw H. Gebremedhin:
RMACXX: An Efficient High-Level C++ Interface over MPI-3 RMA. CCGRID 2021: 143-155 - [c32]Xu T. Liu, Jesun Firoz, Andrew Lumsdaine, Cliff A. Joslyn, Sinan Aksoy, Brenda Praggastis, Assefaw H. Gebremedhin:
Parallel Algorithms for Efficient Computation of High-Order Line Graphs of Hypergraphs. HiPC 2021: 312-321 - [c31]Gayathri Krishnamoorthy, Anamika Dubey, Assefaw H. Gebremedhin:
Reinforcement Learning for Battery Energy Storage Dispatch augmented with Model-based Optimizer. SmartGridComm 2021: 289-294 - 2020
- [j20]Ramyar Saeedi, Keyvan Sasani, Assefaw H. Gebremedhin:
Collaborative Multi-Expert Active Learning for Mobile Health Monitoring: Architecture, Algorithms, and Evaluation. Sensors 20(7): 1932 (2020) - [j19]Ramyar Saeedi, Assefaw H. Gebremedhin:
A Signal-Level Transfer Learning Framework for Autonomous Reconfiguration of Wearable Systems. IEEE Trans. Mob. Comput. 19(3): 513-527 (2020) - [j18]Assefaw H. Gebremedhin, Andrea Walther:
An introduction to algorithmic differentiation. WIREs Data Mining Knowl. Discov. 10(1) (2020) - [c30]Xu T. Liu, Mahantesh Halappanavar, Kevin J. Barker, Andrew Lumsdaine, Assefaw H. Gebremedhin:
Direction-optimizing label propagation and its application to community detection. CF 2020: 192-201 - [i8]Yunshu Du, Garrett Warnell, Assefaw Hadish Gebremedhin, Peter Stone, Matthew E. Taylor:
Lucid Dreaming for Experience Replay: Refreshing Past States with the Current Policy. CoRR abs/2009.13736 (2020) - [i7]Jesun Firoz, Xu T. Liu, Andrew Lumsdaine, Cliff A. Joslyn, Brenda Praggastis, Assefaw Hadish Gebremedhin:
Efficient Computation of High-Order Line Graphs of Hypergraphs. CoRR abs/2010.11448 (2020)
2010 – 2019
- 2019
- [j17]Yunshu Du, Assefaw H. Gebremedhin, Matthew E. Taylor:
Analysis of University Fitness Center Data Uncovers Interesting Patterns, Enables Prediction. IEEE Trans. Knowl. Data Eng. 31(8): 1478-1490 (2019) - [c29]Xu Liu, Jesun Sahariar Firoz, Marcin Zalewski, Mahantesh Halappanavar, Kevin J. Barker, Andrew Lumsdaine, Assefaw H. Gebremedhin:
Distributed Direction-Optimizing Label Propagation for Community Detection. HPEC 2019: 1-6 - [c28]Sayan Ghosh, Mahantesh Halappanavar, Ananth Kalyanaraman, Arif Khan, Assefaw H. Gebremedhin:
Exploring MPI Communication Models for Graph Applications Using Graph Matching as a Case Study. IPDPS 2019: 761-770 - 2018
- [j16]Helen N. Catanese, Kelly A. Brayton, Assefaw H. Gebremedhin:
A nearest-neighbors network model for sequence data reveals new insight into genotype distribution of a pathogen. BMC Bioinform. 19(1): 475:1-475:18 (2018) - [j15]Helen N. Catanese, Carl Hauser, Assefaw Hadish Gebremedhin:
Evaluation of native and transfer students' success in a computer science course. Inroads 9(2): 53-57 (2018) - [c27]Ehdieh Khaledian, Assefaw H. Gebremedhin, Kelly A. Brayton, Shira L. Broschat:
A Network Science Approach for Determining the Ancestral Phylum of Bacteria. BCB 2018: 398-403 - [c26]Keyvan Sasani, Mohammad Hossein Namaki, Yinghui Wu, Assefaw Hadish Gebremedhin:
Multi-metric Graph Query Performance Prediction. DASFAA (1) 2018: 289-306 - [c25]Skyler Norgaard, Ramyar Saeedi, Keyvan Sasani, Assefaw H. Gebremedhin:
Synthetic Sensor Data Generation for Health Applications: A Supervised Deep Learning Approach. EMBC 2018: 1164-1167 - [c24]Ramyar Saeedi, Keyvan Sasani, Skyler Norgaard, Assefaw H. Gebremedhin:
Personalized Human Activity Recognition using Wearables: A Manifold Learning-based Knowledge Transfer. EMBC 2018: 1193-1196 - [c23]Sayan Ghosh, Mahantesh Halappanavar, Antonino Tumeo, Ananth Kalyanaraman, Assefaw H. Gebremedhin:
Scalable Distributed Memory Community Detection Using Vite. HPEC 2018: 1-7 - [c22]Sayan Ghosh, Mahantesh Halappanavar, Antonino Tumeo, Ananth Kalyanaraman, Hao Lu, Daniel G. Chavarría-Miranda, Arif Khan, Assefaw Hadish Gebremedhin:
Distributed Louvain Algorithm for Graph Community Detection. IPDPS 2018: 885-895 - [c21]Antonino Tumeo, Mahantesh Halappanavar, John Feo, Assefaw Hadish Gebremedhin, Abhinav Vishnu:
Introduction to GraML 2018. IPDPS Workshops 2018: 1166-1167 - [c20]Keyvan Sasani, Mohammad Hossein Namaki, Assefaw Hadish Gebremedhin:
Network Similarity Prediction in Time-Evolving Graphs: A Machine Learning Approach. IPDPS Workshops 2018: 1184-1193 - [c19]Sayan Ghosh, Mahantesh Halappanavar, Antonino Tumeo, Ananth Kalyanaraman, Assefaw H. Gebremedhin:
MiniVite: A Graph Analytics Benchmarking Tool for Massively Parallel Systems. PMBS@SC 2018: 51-56 - 2017
- [j14]Hao Lu, Mahantesh Halappanavar, Daniel G. Chavarría-Miranda, Assefaw Hadish Gebremedhin, Ajay Panyala, Ananth Kalyanaraman:
Algorithms for Balanced Graph Colorings with Applications in Parallel Computing. IEEE Trans. Parallel Distributed Syst. 28(5): 1240-1256 (2017) - [c18]Ramyar Saeedi, Keyvan Sasani, Assefaw Hadish Gebremedhin:
Co-MEAL: Cost-Optimal Multi-Expert Active Learning Architecture for Mobile Health Monitoring. BCB 2017: 432-441 - [c17]Ramyar Saeedi, Skyler Norgaard, Assefaw Hadish Gebremedhin:
A closed-loop deep learning architecture for robust activity recognition using wearable sensors. IEEE BigData 2017: 473-479 - [c16]Mohammad Hossein Namaki, Keyvan Sasani, Yinghui Wu, Assefaw Hadish Gebremedhin:
Performance Prediction for Graph Queries. NDA@SIGMOD 2017: 4:1-4:9 - 2016
- [j13]Mu Wang, Assefaw Hadish Gebremedhin, Alex Pothen:
Capitalizing on live variables: new algorithms for efficient Hessian computation via automatic differentiation. Math. Program. Comput. 8(4): 393-433 (2016) - [c15]Ramyar Saeedi, Hassan Ghasemzadeh, Assefaw Hadish Gebremedhin:
Transfer learning algorithms for autonomous reconfiguration of wearable systems. IEEE BigData 2016: 563-569 - [c14]Sayan Ghosh, Assefaw Hadish Gebremedhin:
Parallelization of Bin Packing on Multicore Systems. HiPC 2016: 311-320 - [c13]Sayan Ghosh, Jeff R. Hammond, Antonio J. Peña, Pavan Balaji, Assefaw Hadish Gebremedhin, Barbara M. Chapman:
One-Sided Interface for Matrix Operations Using MPI-3 RMA: A Case Study with Elemental. ICPP 2016: 185-194 - [e2]Assefaw Hadish Gebremedhin, Erik G. Boman, Bora Uçar:
2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, CSC 2016, Albuquerque, New Mexico, USA, October 10-12, 2016. SIAM 2016, ISBN 978-1-61197-469-0 [contents] - 2015
- [j12]Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw Hadish Gebremedhin, Wei-keng Liao, Alok N. Choudhary:
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection. Internet Math. 11(4-5): 421-448 (2015) - [j11]Ryan A. Rossi, David F. Gleich, Assefaw Hadish Gebremedhin:
Parallel Maximum Clique Algorithms with Applications to Network Analysis. SIAM J. Sci. Comput. 37(5) (2015) - [c12]Hao Lu, Mahantesh Halappanavar, Daniel G. Chavarría-Miranda, Assefaw Hadish Gebremedhin, Ananth Kalyanaraman:
Balanced Coloring for Parallel Computing Applications. IPDPS 2015: 7-16 - 2014
- [c11]Ryan A. Rossi, David F. Gleich, Assefaw Hadish Gebremedhin, Md. Mostofa Ali Patwary:
Fast maximum clique algorithms for large graphs. WWW (Companion Volume) 2014: 365-366 - [i6]Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw Hadish Gebremedhin, Wei-keng Liao, Alok N. Choudhary:
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection. CoRR abs/1411.7460 (2014) - 2013
- [j10]Assefaw Hadish Gebremedhin, Duc C. Nguyen, Md. Mostofa Ali Patwary, Alex Pothen:
ColPack: Software for graph coloring and related problems in scientific computing. ACM Trans. Math. Softw. 40(1): 1:1-1:31 (2013) - [c10]Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw Hadish Gebremedhin, Wei-keng Liao, Alok N. Choudhary:
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs. WAW 2013: 156-169 - [i5]Ryan A. Rossi, David F. Gleich, Assefaw Hadish Gebremedhin, Md. Mostofa Ali Patwary:
A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components. CoRR abs/1302.6256 (2013) - 2012
- [j9]Ümit V. Çatalyürek, John Feo, Assefaw Hadish Gebremedhin, Mahantesh Halappanavar, Alex Pothen:
Graph coloring algorithms for multi-core and massively multithreaded architectures. Parallel Comput. 38(10-11): 576-594 (2012) - [i4]Ümit V. Çatalyürek, John Feo, Assefaw Hadish Gebremedhin, Mahantesh Halappanavar, Alex Pothen:
Graph Coloring Algorithms for Muti-core and Massively Multithreaded Architectures. CoRR abs/1205.3809 (2012) - [i3]Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw Hadish Gebremedhin, Wei-keng Liao, Alok N. Choudhary:
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs. CoRR abs/1209.5818 (2012) - [i2]Ryan A. Rossi, David F. Gleich, Assefaw Hadish Gebremedhin, Md. Mostofa Ali Patwary:
What if CLIQUE were fast? Maximum Cliques in Information Networks and Strong Components in Temporal Networks. CoRR abs/1210.5802 (2012) - 2011
- [c9]Md. Mostofa Ali Patwary, Assefaw Hadish Gebremedhin, Alex Pothen:
New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures. Euro-Par (2) 2011: 250-262 - [c8]Ümit V. Çatalyürek, Florin Dobrian, Assefaw Hadish Gebremedhin, Mahantesh Halappanavar, Alex Pothen:
Distributed-Memory Parallel Algorithms for Matching and Coloring. IPDPS Workshops 2011: 1971-1980 - [c7]Sri Hari Krishna Narayanan, Boyana Norris, Paul D. Hovland, Duc C. Nguyen, Assefaw Hadish Gebremedhin:
Sparse Jacobian Computation Using ADIC2 and ColPack. ICCS 2011: 2115-2123 - 2010
- [j8]Doruk Bozdag, Ümit V. Çatalyürek, Assefaw H. Gebremedhin, Fredrik Manne, Erik G. Boman, Füsun Özgüner:
Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation. SIAM J. Sci. Comput. 32(4): 2418-2446 (2010)
2000 – 2009
- 2009
- [j7]Assefaw Hadish Gebremedhin, Arijit Tarafdar, Alex Pothen, Andrea Walther:
Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation. INFORMS J. Comput. 21(2): 209-223 (2009) - [i1]Assefaw Hadish Gebremedhin:
The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and Parallel Processing. Combinatorial Scientific Computing 2009 - 2008
- [j6]Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik Manne, Erik G. Boman, Ümit V. Çatalyürek:
A framework for scalable greedy coloring on distributed-memory parallel computers. J. Parallel Distributed Comput. 68(4): 515-535 (2008) - 2007
- [j5]Assefaw Hadish Gebremedhin, Arijit Tarafdar, Fredrik Manne, Alex Pothen:
New Acyclic and Star Coloring Algorithms with Application to Computing Hessians. SIAM J. Sci. Comput. 29(3): 1042-1072 (2007) - 2006
- [j4]Assefaw Hadish Gebremedhin, Mohamed Essaïdi, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle:
PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms. Nord. J. Comput. 13(4): 215-239 (2006) - 2005
- [j3]Assefaw Hadish Gebremedhin, Fredrik Manne, Alex Pothen:
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives. SIAM Rev. 47(4): 629-705 (2005) - [c6]Erik G. Boman, Doruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne:
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. Euro-Par 2005: 241-251 - [c5]Doruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne, Erik G. Boman, Füsun Özgüner:
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers. HPCC 2005: 796-806 - 2004
- [c4]Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woods:
Speeding up Parallel Graph Coloring. PARA 2004: 1079-1088 - 2003
- [j2]Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle:
Graph coloring on coarse grained multicomputers. Discret. Appl. Math. 131(1): 179-198 (2003) - 2002
- [c3]Assefaw Hadish Gebremedhin, Fredrik Manne, Alex Pothen:
Parallel Distance-k Coloring Algorithms for Numerical Optimization. Euro-Par 2002: 912-921 - [c2]Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle:
PRO: A Model for Parallel Resource-Optimal Computation. HPCS 2002: 106-113 - 2001
- [e1]Tor Sørevik, Fredrik Manne, Randi Moe, Assefaw Hadish Gebremedhin:
Applied Parallel Computing, New Paradigms for HPC in Industry and Academia, 5th International Workshop, PARA 2000 Bergen, Norway, June 18-20, 2000 Proceedings. Lecture Notes in Computer Science 1947, Springer 2001, ISBN 3-540-41729-X [contents] - 2000
- [j1]Assefaw Hadish Gebremedhin, Fredrik Manne:
Scalable parallel graph coloring algorithms. Concurr. Pract. Exp. 12(12): 1131-1146 (2000) - [c1]Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle:
Graph Coloring on a Coarse Grained Multiprocessor. WG 2000: 184-195
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 2024-11-20 21:58 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:
