Capture Resilient ElGamal Signature Protocols. - Hüseyin Acan; Kamer Kaya; Ali Aydin Selçuk (ISCIS, 2006)

Threshold Cryptography Based on Asmuth-Bloom Secret Sharing. - Kamer Kaya; Ali Aydin Selçuk; Zahir Tezcan (ISCIS, 2006)

Task assignment in heterogeneous computing systems. - Bora Uçar; Cevdet Aykanat; Kamer Kaya; Murat Ikinci (J. Parallel Distributed Comput., 2006)

Iterative-Improvement-Based Heuristics for Adaptive Scheduling of Tasks Sharing Files on Heterogeneous Master-Slave Environments. - Kamer Kaya; Cevdet Aykanat (IEEE Trans. Parallel Distributed Syst., 2006)

Threshold cryptography based on Asmuth-Bloom secret sharing. - Kamer Kaya; Ali Aydin Selçuk (Inf. Sci., 2007)

Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories. - Kamer Kaya; Bora Uçar; Cevdet Aykanat (J. Parallel Distributed Comput., 2007)

Robust Threshold Schemes Based on the Chinese Remainder Theorem. - Kamer Kaya; Ali Aydin Selçuk (AFRICACRYPT, 2008)

A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem. - Kamer Kaya; Ali Aydin Selçuk (INDOCRYPT, 2008)

Practical Threshold Signatures with Linear Secret Sharing Schemes. - Ilker Nadi Bozkurt; Kamer Kaya; Ali Aydin Selçuk (AFRICACRYPT, 2009)

Optimal subset-difference broadcast encryption with free riders. - Murat Ak; Kamer Kaya; Ali Aydin Selçuk (Inf. Sci., 2009)

Exact Algorithms for a Task Assignment Problem. - Kamer Kaya; Bora Uçar (Parallel Process. Lett., 2009)

Threshold cryptography with Chinese remainder theorem (Çin kalan teoremi 'ne dayalı eşik kriptografisi) - Kamer Kaya (2009)

Secret Sharing Extensions based on the Chinese Remainder Theorem. - Kamer Kaya; Ali Aydin Selçuk (IACR Cryptol. ePrint Arch., 2010)

Efficient broadcast encryption with user profiles. - Murat Ak; Kamer Kaya; Kaan Onarlioglu; Ali Aydin Selçuk (Inf. Sci., 2010)

On Partitioning Problems with Complex Objectives. - Kamer Kaya; François-Henry Rouet; Bora Uçar (Euro-Par Workshops (1), 2011)

Integrated data placement and task assignment for scientific workflows in clouds. - Ümit V. Çatalyürek; Kamer Kaya; Bora Uçar (DICT@HPDC, 2011)

Design, implementation, and analysis of maximum transversal algorithms. - Iain S. Duff; Kamer Kaya; Bora Uçar (ACM Trans. Math. Softw., 2011)

Fast Recommendation on Bibliographic Networks. - Onur Kucuktunc; Kamer Kaya; Erik Saule; Ümit V. Çatalyürek (ASONAM, 2012)

Microarray vs. RNA-Seq: a comparison for active subnetwork discovery. - Ayat Hatem; Kamer Kaya; Ümit V. Çatalyürek (BCB, 2012)

UMPa: A multi-objective, multi-level partitioner for communication minimization. - Ümit V. Çatalyürek; Mehmet Deveci; Kamer Kaya; Bora Uçar (Graph Partitioning and Graph Clustering, 2012)

A partitioning-based divisive clustering technique for maximizing the modularity. - Ümit V. Çatalyürek; Kamer Kaya; Johannes Langguth; Bora Uçar (Graph Partitioning and Graph Clustering, 2012)

On Shared-Memory Parallelization of a Sparse Matrix Scaling Algorithm. - Ümit V. Çatalyürek; Kamer Kaya; Bora Uçar (ICPP, 2012)

Multithreaded Clustering for Multi-level Hypergraph Partitioning. - Ümit V. Çatalyürek; Mehmet Deveci; Kamer Kaya; Bora Uçar (IPDPS, 2012)

Recommendation on Academic Networks using Direction Aware Citation Analysis - Onur Küçüktunç; Erik Saule; Kamer Kaya; Ümit V. Çatalyürek (CoRR, 2012)

Shattering and Compressing Networks for Centrality Analysis - Ahmet Erdem Sariyüce; Erik Saule; Kamer Kaya; Ümit V. Çatalyürek (CoRR, 2012)

Merging network patterns: a general framework to summarize biomedical network data. - Yang Xiang; David Fuhry; Kamer Kaya; Ruoming Jin; Ümit V. Çatalyürek; Kun Huang 001 (Netw. Model. Anal. Health Informatics Bioinform., 2012)

Betweenness centrality on GPUs and heterogeneous architectures. - Ahmet Erdem Sariyüce; Kamer Kaya; Erik Saule; Ümit V. Çatalyürek (GPGPU@ASPLOS, 2013)

Towards a personalized, scalable, and exploratory academic recommendation service. - Onur Küçüktunç; Erik Saule; Kamer Kaya; Ümit V. Çatalyürek (ASONAM, 2013)

Masher: Mapping Long(er) Reads with Hash-based Genome Indexing on GPUs. - Anas Abu-Doleh; Erik Saule; Kamer Kaya; Ümit V. Çatalyürek (BCB, 2013)

PRASE: PageRank-based Active Subnetwork Extraction. - Ayat Hatem; Kamer Kaya; Ümit V. Çatalyürek (BCB, 2013)

Incremental algorithms for closeness centrality. - Ahmet Erdem Sariyüce; Kamer Kaya; Erik Saule; Ümit V. Çatalyürek (IEEE BigData, 2013)

STREAMER: A distributed framework for incremental closeness centrality computation. - Ahmet Erdem Sariyüce; Erik Saule; Kamer Kaya; Ümit V. Çatalyürek (CLUSTER, 2013)

GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs. - Mehmet Deveci; Kamer Kaya; Bora Uçar; Ümit V. Çatalyürek (Euro-Par, 2013)

Hypergraph Sparsification and Its Application to Partitioning. - Mehmet Deveci; Kamer Kaya; Ümit V. Çatalyürek (ICPP, 2013)

A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs. - Mehmet Deveci; Kamer Kaya; Bora Uçar; Ümit V. Çatalyürek (ICPP, 2013)

TheAdvisor: a webservice for academic recommendation. - Onur Küçüktunç; Erik Saule; Kamer Kaya; Ümit V. Çatalyürek (JCDL, 2013)

Analysis of Partitioning Models and Metrics in Parallel Sparse Matrix-Vector Multiplication. - Kamer Kaya; Bora Uçar; Ümit V. Çatalyürek (PPAM (2), 2013)

Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi. - Erik Saule; Kamer Kaya; Ümit V. Çatalyürek (PPAM (1), 2013)

Shattering and Compressing Networks for Betweenness Centrality. - Ümit V. Çatalyürek; Kamer Kaya; Ahmet Erdem Sariyüce; Erik Saule (SDM, 2013)

Diversified recommendation on graphs: pitfalls, measures, and algorithms. - Onur Küçüktunç; Erik Saule; Kamer Kaya; Ümit V. Çatalyürek (WWW, 2013)

Push-relabel based algorithms for the maximum transversal problem. - Kamer Kaya; Johannes Langguth; Fredrik Manne; Bora Uçar (Comput. Oper. Res., 2013)

Incremental Algorithms for Network Management and Analysis based on Closeness Centrality - Ahmet Erdem Sariyüce; Kamer Kaya; Erik Saule; Ümit V. Çatalyürek (CoRR, 2013)

Constructing Elimination Trees for Sparse Unsymmetric Matrices. - Kamer Kaya; Bora Uçar (SIAM J. Matrix Anal. Appl., 2013)

Fast recommendation on bibliographic networks with sparse-matrix ordering and partitioning. - Onur Küçüktunç; Kamer Kaya; Erik Saule; Ümit V. Çatalyürek (Soc. Netw. Anal. Min., 2013)

Extracting Maximal Exact Matches on GPU. - Anas Abu-Doleh; Kamer Kaya; Mohamed Abouelhoda; Ümit V. Çatalyürek (IPDPS Workshops, 2014)

Bipartite Matching Heuristics with Quality Guarantees on Shared Memory Parallel Computers. - Fanny Dufossé; Kamer Kaya; Bora Uçar (IPDPS, 2014)

Hardware/Software Vectorization for Closeness Centrality on Multi-/Many-Core Architectures. - Ahmet Erdem Sariyüce; Erik Saule; Kamer Kaya; Ümit V. Çatalyürek (IPDPS Workshops, 2014)

Sharing DSS by the Chinese Remainder Theorem. - Kamer Kaya; Ali Aydin Selçuk (J. Comput. Appl. Math., 2014)

Diversifying Citation Recommendations. - Onur Küçüktunç; Erik Saule; Kamer Kaya; Ümit V. Çatalyürek (ACM Trans. Intell. Syst. Technol., 2014)

MICA: MicroRNA integration for active module discovery. - Ayat Hatem; Kamer Kaya; Jeffrey D. Parvin; Kun Huang 001; Ümit V. Çatalyürek (BCB, 2015)

Fast and High Quality Topology-Aware Task Mapping. - Mehmet Deveci; Kamer Kaya; Bora Uçar; Ümit V. Çatalyürek (IPDPS, 2015)

Hypergraph partitioning for multiple communication cost metrics: Model and methods. - Mehmet Deveci; Kamer Kaya; Bora Uçar; Ümit V. Çatalyürek (J. Parallel Distributed Comput., 2015)

Two approximation algorithms for bipartite matching on multicore architectures. - Fanny Dufossé; Kamer Kaya; Bora Uçar (J. Parallel Distributed Comput., 2015)

Regularizing graph centrality computations. - Ahmet Erdem Sariyüce; Erik Saule; Kamer Kaya; Ümit V. Çatalyürek (J. Parallel Distributed Comput., 2015)

Incremental closeness centrality in distributed memory. - Ahmet Erdem Sariyüce; Erik Saule; Kamer Kaya; Ümit V. Çatalyürek (Parallel Comput., 2015)

Using Hypergraph Clustering for Software Architecture Reconstruction of Data-Tier Software. - Ersin Ersoy 001; Kamer Kaya; Metin Altinisik; Hasan Sözer (ECSA, 2016)

Hiding Access Patterns in Range Queries Using Private Information Retrieval and ORAM. - Gamze Tillem; Ömer Mert Candan; Erkay Savas; Kamer Kaya (Financial Cryptography Workshops, 2016)

Parallelizing Heuristics for Generating Synchronizing Sequences. - Sertaç Karahoda; Osman Tufan Erenay; Kamer Kaya; Uraz Cengiz Türker; Hüsnü Yenigün (ICTSS, 2016)

On the Relationship of Inconsistent Software Clones and Faults: An Empirical Study. - Stefan Wagner 001; Asim Abdulkhaleq; Kamer Kaya; Alexander Paar (SANER, 2016)

Multilevel Threshold Secret and Function Sharing based on the Chinese Remainder Theorem. - Oguzhan Ersoy; Kamer Kaya; Kerem Kaskaloglu (CoRR, 2016)

A CRT-based verifiable secret sharing scheme secure against unbounded adversaries. - Oguzhan Ersoy; Thomas Brochmann Pedersen; Kamer Kaya; Ali Aydin Selçuk; Emin Anarim (Secur. Commun. Networks, 2016)

Acyclic Partitioning of Large Directed Acyclic Graphs. - Julien Herrmann; Jonathan Kho; Bora Uçar; Kamer Kaya; Ümit V. Çatalyürek (CCGrid, 2017)

Greed Is Good: Parallel Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures. - Mustafa Kemal Tas; Kamer Kaya; Erik Saule (ICPP, 2017)

Parallelized Preconditioned Model Building Algorithm for Matrix Factorization. - Kamer Kaya; S. Ilker Birbil; M. Kaan Öztürk; Amir Gohari (MOD, 2017)

Synchronizing Heuristics: Speeding up the Slowest. - Ömer Faruk Altun; Kamil Tolga Atam; Sertaç Karahoda; Kamer Kaya (ICTSS, 2017)

An Approach for Choosing the Best Covering Array Constructor to Use. - Hanefi Mercan; Cemal Yilmaz 001; Kamer Kaya (QRS Companion, 2017)

A New Method for Computational Private Information Retrieval. - Gamze Tillem; Erkay Savas; Kamer Kaya (Comput. J., 2017)

Greed is Good: Optimistic Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures. - Mustafa Kemal Tas; Kamer Kaya; Erik Saule (CoRR, 2017)

Graph Manipulations for Fast Centrality Computation. - Ahmet Erdem Sariyüce; Kamer Kaya; Erik Saule; Ümit V. Çatalyürek (ACM Trans. Knowl. Discov. Data, 2017)

Enumerator: An Efficient Approach for Enumerating all Valid t-tuples. - Hanefi Mercan; Kamer Kaya; Cemal Yilmaz 001 (ICST Workshops, 2018)

Using Structure of Automata for Faster Synchronizing Heuristics. - Berk Çirisci; Muhammed Kerem Kahraman; Cagri Uluc Yildirimoglu; Kamer Kaya; Hüsnü Yenigün (MODELSWARD, 2018)

Synchronizing Heuristics for Weakly Connected Automata with Various Topologies. - Berk Çirisci; Baris Sevilmis; Emre Yasin Sivri; Poyraz Kivanç Karaçam; Kamer Kaya; Hüsnü Yenigün (MODELSWARD (Revised Selected Papers), 2018)

Approximation algorithms for maximum matchings in undirected graphs. - Fanny Dufossé; Kamer Kaya; Ioannis Panagiotas; Bora Uçar (CSC, 2018)

Optimally bipartitioning sparse matrices with reordering and parallelization. - Aras Mumcuyan; Baran Usta; Kamer Kaya; Hüsnü Yenigün (Concurr. Comput. Pract. Exp., 2018)

A generic Private Information Retrieval scheme with parallel multi-exponentiations on multicore processors. - Cem Topcuoglu; Kamer Kaya; Erkay Savas (Concurr. Comput. Pract. Exp., 2018)

Synchronizing heuristics: Speeding up the fastest. - Sertaç Karahoda; Kamer Kaya; Hüsnü Yenigün (Expert Syst. Appl., 2018)

A resource provisioning framework for bioinformatics applications in multi-cloud environments. - Izzet F. Senturk; Ponnuraman Balakrishnan; Anas Abu-Doleh; Kamer Kaya; Qutaibah M. Malluhi; Ümit V. Çatalyürek (Future Gener. Comput. Syst., 2018)

One Table to Count Them All: Parallel Frequency Estimation on Single-Board Computers. - Fatih Tasyaran; Kerem Yildirir; Mustafa Kemal Tas; Kamer Kaya (Euro-Par, 2019)

Using Synchronizing Heuristics to Construct Homing Sequences. - Berk Çirisci; M. Yusa Emek; Ege Sorguç; Kamer Kaya; Hüsnü Yenigün (MODELSWARD, 2019)

Effective Heuristics for Matchings in Hypergraphs. - Fanny Dufossé; Kamer Kaya; Ioannis Panagiotas; Bora Uçar (SEA², 2019)

A framework for parallel second order incremental optimization algorithms for solving partially separable problems. - Kamer Kaya; Figen Öztoprak; S. Ilker Birbil; A. Taylan Cemgil; Umut Simsekli; Nurdan Kuru; Hazal Koptagel; M. Kaan Öztürk (Comput. Optim. Appl., 2019)

Parallel algorithms for computing sparse matrix permanents. - Kamer Kaya (Turkish J. Electr. Eng. Comput. Sci., 2019)

Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs. - Julien Herrmann; M. Yusuf Özkaya; Bora Uçar; Kamer Kaya; Ümit V. Çatalyürek (SIAM J. Sci. Comput., 2019)

CHiP: A Configurable Hybrid Parallel Covering Array Constructor. - Hanefi Mercan; Cemal Yilmaz 001; Kamer Kaya (IEEE Trans. Software Eng., 2019)

Karp-Sipser based kernels for bipartite graph matching. - Kamer Kaya; Johannes Langguth; Ioannis Panagiotas; Bora Uçar (ALENEX, 2020)

Understanding Coarsening for Embedding Large-Scale Graphs. - Taha Atahan Akyildiz; Amro Alabsi Aljundi; Kamer Kaya (IEEE BigData, 2020)

Differentially Private Frequency Sketches for Intermittent Queries on Large Data Streams. - Sinan Yildirim; Kamer Kaya; Soner Aydin; Hakan Bugra Erentug (IEEE BigData, 2020)

GOSH: Embedding Big Graphs on Small Hardware. - Taha Atahan Akyildiz; Amro Alabsi Aljundi; Kamer Kaya (ICPP, 2020)

Vertex Ordering Algorithms for Graph Coloring Problem. - Kamer Kaya; Berker Demirel; Baris Batuhan Topal; Arda Asik; Ibrahim Bugra Demir (SIU, 2020)

Multicore and manycore parallelization of cheap synchronizing sequence heuristics. - Sertaç Karahoda; Osman Tufan Erenay; Kamer Kaya; Uraz Cengiz Türker; Hüsnü Yenigün (J. Parallel Distributed Comput., 2020)

Flexible Architecture for Data-Driven Predictive Maintenance with Support for Offline and Online Machine Learning Techniques. - Alda Canito; Marta Fernandes; João Mourinho; Serkan Tosun; Kamer Kaya; Aysegül Turupcu; Angel Lagares; Hüseyin Karabulut; Goreti Marreiros (IECON, 2021)

Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments. - Fatih Tasyaran; Berkay Demireller; Kamer Kaya; Bora Uçar (CoRR, 2021)

A Bloom Filter Survey: Variants for Different Domain Applications. - Anes Abdennebi; Kamer Kaya (CoRR, 2021)

ML with HE: Privacy Preserving Machine Learning Inferences for Genome Studies. - Seyma Selcan Magara; Ceren Yildirim; Ferhat Yaman; Berke Dilekoglu; Furkan Reha Tutas; Erdinç Öztürk; Kamer Kaya; Öznur Tastan; Erkay Savas (CoRR, 2021)

Boosting expensive synchronizing heuristics. - N. Ege Saraç; Ömer Faruk Altun; Kamil Tolga Atam; Sertaç Karahoda; Kamer Kaya; Hüsnü Yenigün (Expert Syst. Appl., 2021)

Synchronizing billion-scale automata. - Mustafa Kemal Tas; Kamer Kaya; Hüsnü Yenigün (Inf. Sci., 2021)

Boosting Parallel Influence-Maximization Kernels for Undirected Networks With Fusing and Vectorization. - Gökhan Göktürk; Kamer Kaya (IEEE Trans. Parallel Distributed Syst., 2021)

Degree-Aware Kernels for Computing Jaccard Weights on GPUs. - Amro Alabsi Aljundi; Taha Atahan Akyildiz; Kamer Kaya (IPDPS, 2022)

Fast and High-Quality Influence Maximization on Multiple GPUs. - Gökhan Göktürk; Kamer Kaya (IPDPS, 2022)

Mixed and Multi-Precision SpMV for GPUs with Row-wise Precision Selection. - Erhan Tezcan; Tugba Torun; Fahrican Kosar; Kamer Kaya; Didem Unat (SBAC-PAD, 2022)

Machine learning-based load distribution and balancing in heterogeneous database management systems. - Anes Abdennebi; Anil Elakas; Fatih Tasyaran; Erdinç Öztürk; Kamer Kaya; Sinan Yildirim (Concurr. Comput. Pract. Exp., 2022)

Scaling matrices and counting the perfect matchings in graphs. - Fanny Dufossé; Kamer Kaya; Ioannis Panagiotas; Bora Uçar (Discret. Appl. Math., 2022)

Boosting Graph Embedding on a Single GPU. - Amro Alabsi Aljundi; Taha Atahan Akyildiz; Kamer Kaya (IEEE Trans. Parallel Distributed Syst., 2022)

Solving Navier-Stokes Equations With Mixed Equation Physics Informed Neural Networks. - Sila Akpinar; Emre Vardar; Serhat Yesilyurt; Kamer Kaya (SIU, 2023)

Special issue on High-Performance Computing Conference (BASARIM 2022). - Kamer Kaya; Cevat Sener; Hüsnü Yenigün (Concurr. Comput. Pract. Exp., 2023)

Open Problems in (Hyper)Graph Decomposition. - Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; Tobias Heuer; George Karypis; Kamer Kaya; et al. (CoRR, 2023)

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). - George Karypis; Christian Schulz 003; Darren Strash; Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; et al. (Dagstuhl Reports, 2023)

P-MoVE: Performance Monitoring and Visualization with Encoded Knowledge. - Fatih Tasyaran; Osman Yasal; José A. Morgado; Aleksandar Ilic; Didem Unat; Kamer Kaya (SC Workshops, 2024)

Approximating Spanning Centrality with Random Bouquets. - Gökhan Göktürk; Kamer Kaya (CoRR, 2024)

A Retrieval-Augmented Generation Framework for Academic Literature Navigation in Data Science. - Ahmet Yasin Aytar; Kemal Kilic; Kamer Kaya (CoRR, 2024)

Fast and error-adaptive influence maximization based on Count-Distinct sketches. - Gökhan Göktürk; Kamer Kaya (Inf. Sci., 2024)

Distributed landmark labeling for social networks. - Arda Sener; Hüsnü Yenigün; Kamer Kaya (J. Parallel Distributed Comput., 2025)

Fully-Automated Code Generation for Efficient Computation of Sparse Matrix Permanents on GPUs. - Deniz Elbek; Kamer Kaya (CoRR, 2025)

DiFuseR: a distributed sketch-based influence maximization algorithm for GPUs. - Gökhan Göktürk; Kamer Kaya (J. Supercomput., 2025)

SUperman: Efficient Permanent Computation on GPUs. - Deniz Elbek; Fatih Tasyaran; Bora Uçar; Kamer Kaya (CoRR, 2025)

MCMC for Bayesian estimation of Differential Privacy from Membership Inference Attacks. - Ceren Yildirim; Kamer Kaya; Sinan Yildirim; Erkay Savas (CoRR, 2025)