Kamer Kaya

Orcid: 0000-0001-8678-5467

According to our database1, Kamer Kaya authored at least 110 papers between 2006 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
DiFuseR: a distributed sketch-based influence maximization algorithm for GPUs.
J. Supercomput., January, 2025

2024
Fast and error-adaptive influence maximization based on Count-Distinct sketches.
Inf. Sci., January, 2024

Approximating Spanning Centrality with Random Bouquets.
CoRR, 2024

2023
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).
Dagstuhl Reports, 2023

Open Problems in (Hyper)Graph Decomposition.
CoRR, 2023

Special issue on High-Performance Computing Conference (BASARIM 2022).
Concurr. Comput. Pract. Exp., 2023

Solving Navier-Stokes Equations With Mixed Equation Physics Informed Neural Networks.
Proceedings of the 31st Signal Processing and Communications Applications Conference, 2023

2022
Boosting Graph Embedding on a Single GPU.
IEEE Trans. Parallel Distributed Syst., 2022

Scaling matrices and counting the perfect matchings in graphs.
Discret. Appl. Math., 2022

Machine learning-based load distribution and balancing in heterogeneous database management systems.
Concurr. Comput. Pract. Exp., 2022

Mixed and Multi-Precision SpMV for GPUs with Row-wise Precision Selection.
Proceedings of the 2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), 2022

Fast and High-Quality Influence Maximization on Multiple GPUs.
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

Degree-Aware Kernels for Computing Jaccard Weights on GPUs.
Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium, 2022

2021
Boosting Parallel Influence-Maximization Kernels for Undirected Networks With Fusing and Vectorization.
IEEE Trans. Parallel Distributed Syst., 2021

Synchronizing billion-scale automata.
Inf. Sci., 2021

Boosting expensive synchronizing heuristics.
Expert Syst. Appl., 2021

ML with HE: Privacy Preserving Machine Learning Inferences for Genome Studies.
CoRR, 2021

A Bloom Filter Survey: Variants for Different Domain Applications.
CoRR, 2021

Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments.
CoRR, 2021

Flexible Architecture for Data-Driven Predictive Maintenance with Support for Offline and Online Machine Learning Techniques.
Proceedings of the IECON 2021, 2021

2020
Multicore and manycore parallelization of cheap synchronizing sequence heuristics.
J. Parallel Distributed Comput., 2020

Vertex Ordering Algorithms for Graph Coloring Problem.
Proceedings of the 28th Signal Processing and Communications Applications Conference, 2020

GOSH: Embedding Big Graphs on Small Hardware.
Proceedings of the ICPP 2020: 49th International Conference on Parallel Processing, 2020

Differentially Private Frequency Sketches for Intermittent Queries on Large Data Streams.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

Understanding Coarsening for Embedding Large-Scale Graphs.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

Karp-Sipser based kernels for bipartite graph matching.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
CHiP: A Configurable Hybrid Parallel Covering Array Constructor.
IEEE Trans. Software Eng., 2019

Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs.
SIAM J. Sci. Comput., 2019

Parallel algorithms for computing sparse matrix permanents.
Turkish J. Electr. Eng. Comput. Sci., 2019

A framework for parallel second order incremental optimization algorithms for solving partially separable problems.
Comput. Optim. Appl., 2019

Effective Heuristics for Matchings in Hypergraphs.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Using Synchronizing Heuristics to Construct Homing Sequences.
Proceedings of the 7th International Conference on Model-Driven Engineering and Software Development, 2019

One Table to Count Them All: Parallel Frequency Estimation on Single-Board Computers.
Proceedings of the Euro-Par 2019: Parallel Processing, 2019

2018
A resource provisioning framework for bioinformatics applications in multi-cloud environments.
Future Gener. Comput. Syst., 2018

Synchronizing heuristics: Speeding up the fastest.
Expert Syst. Appl., 2018

A generic Private Information Retrieval scheme with parallel multi-exponentiations on multicore processors.
Concurr. Comput. Pract. Exp., 2018

Optimally bipartitioning sparse matrices with reordering and parallelization.
Concurr. Comput. Pract. Exp., 2018

Approximation algorithms for maximum matchings in undirected graphs.
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018

Synchronizing Heuristics for Weakly Connected Automata with Various Topologies.
Proceedings of the Model-Driven Engineering and Software Development, 2018

Using Structure of Automata for Faster Synchronizing Heuristics.
Proceedings of the 6th International Conference on Model-Driven Engineering and Software Development, 2018

Enumerator: An Efficient Approach for Enumerating all Valid t-tuples.
Proceedings of the 2018 IEEE International Conference on Software Testing, 2018

2017
Graph Manipulations for Fast Centrality Computation.
ACM Trans. Knowl. Discov. Data, 2017

Greed is Good: Optimistic Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures.
CoRR, 2017

A New Method for Computational Private Information Retrieval.
Comput. J., 2017

An Approach for Choosing the Best Covering Array Constructor to Use.
Proceedings of the 2017 IEEE International Conference on Software Quality, 2017

Synchronizing Heuristics: Speeding up the Slowest.
Proceedings of the Testing Software and Systems, 2017

Parallelized Preconditioned Model Building Algorithm for Matrix Factorization.
Proceedings of the Machine Learning, Optimization, and Big Data, 2017

Greed Is Good: Parallel Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures.
Proceedings of the 46th International Conference on Parallel Processing, 2017

Acyclic Partitioning of Large Directed Acyclic Graphs.
Proceedings of the 17th IEEE/ACM International Symposium on Cluster, 2017

2016
A CRT-based verifiable secret sharing scheme secure against unbounded adversaries.
Secur. Commun. Networks, 2016

Multilevel Threshold Secret and Function Sharing based on the Chinese Remainder Theorem.
CoRR, 2016

On the Relationship of Inconsistent Software Clones and Faults: An Empirical Study.
Proceedings of the IEEE 23rd International Conference on Software Analysis, 2016

Parallelizing Heuristics for Generating Synchronizing Sequences.
Proceedings of the Testing Software and Systems, 2016

Hiding Access Patterns in Range Queries Using Private Information Retrieval and ORAM.
Proceedings of the Financial Cryptography and Data Security, 2016

Using Hypergraph Clustering for Software Architecture Reconstruction of Data-Tier Software.
Proceedings of the Software Architecture - 10th European Conference, 2016

2015
Incremental closeness centrality in distributed memory.
Parallel Comput., 2015

Regularizing graph centrality computations.
J. Parallel Distributed Comput., 2015

Two approximation algorithms for bipartite matching on multicore architectures.
J. Parallel Distributed Comput., 2015

Hypergraph partitioning for multiple communication cost metrics: Model and methods.
J. Parallel Distributed Comput., 2015

Fast and High Quality Topology-Aware Task Mapping.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

MICA: MicroRNA integration for active module discovery.
Proceedings of the 6th ACM Conference on Bioinformatics, 2015

2014
Diversifying Citation Recommendations.
ACM Trans. Intell. Syst. Technol., 2014

Sharing DSS by the Chinese Remainder Theorem.
J. Comput. Appl. Math., 2014

Hardware/Software Vectorization for Closeness Centrality on Multi-/Many-Core Architectures.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

Bipartite Matching Heuristics with Quality Guarantees on Shared Memory Parallel Computers.
Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

Extracting Maximal Exact Matches on GPU.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

2013
Fast recommendation on bibliographic networks with sparse-matrix ordering and partitioning.
Soc. Netw. Anal. Min., 2013

Constructing Elimination Trees for Sparse Unsymmetric Matrices.
SIAM J. Matrix Anal. Appl., 2013

Incremental Algorithms for Network Management and Analysis based on Closeness Centrality
CoRR, 2013

Push-relabel based algorithms for the maximum transversal problem.
Comput. Oper. Res., 2013

Diversified recommendation on graphs: pitfalls, measures, and algorithms.
Proceedings of the 22nd International World Wide Web Conference, 2013

Shattering and Compressing Networks for Betweenness Centrality.
Proceedings of the 13th SIAM International Conference on Data Mining, 2013

Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi.
Proceedings of the Parallel Processing and Applied Mathematics, 2013

Analysis of Partitioning Models and Metrics in Parallel Sparse Matrix-Vector Multiplication.
Proceedings of the Parallel Processing and Applied Mathematics, 2013

TheAdvisor: a webservice for academic recommendation.
Proceedings of the 13th ACM/IEEE-CS Joint Conference on Digital Libraries, 2013

A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs.
Proceedings of the 42nd International Conference on Parallel Processing, 2013

Hypergraph Sparsification and Its Application to Partitioning.
Proceedings of the 42nd International Conference on Parallel Processing, 2013

GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs.
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

STREAMER: A distributed framework for incremental closeness centrality computation.
Proceedings of the 2013 IEEE International Conference on Cluster Computing, 2013

Incremental algorithms for closeness centrality.
Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

PRASE: PageRank-based Active Subnetwork Extraction.
Proceedings of the ACM Conference on Bioinformatics, 2013

Masher: Mapping Long(er) Reads with Hash-based Genome Indexing on GPUs.
Proceedings of the ACM Conference on Bioinformatics, 2013

Towards a personalized, scalable, and exploratory academic recommendation service.
Proceedings of the Advances in Social Networks Analysis and Mining 2013, 2013

Betweenness centrality on GPUs and heterogeneous architectures.
Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units, 2013

2012
Merging network patterns: a general framework to summarize biomedical network data.
Netw. Model. Anal. Health Informatics Bioinform., 2012

Shattering and Compressing Networks for Centrality Analysis
CoRR, 2012

Recommendation on Academic Networks using Direction Aware Citation Analysis
CoRR, 2012

Multithreaded Clustering for Multi-level Hypergraph Partitioning.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

On Shared-Memory Parallelization of a Sparse Matrix Scaling Algorithm.
Proceedings of the 41st International Conference on Parallel Processing, 2012

A partitioning-based divisive clustering technique for maximizing the modularity.
Proceedings of the Graph Partitioning and Graph Clustering, 2012

UMPa: A multi-objective, multi-level partitioner for communication minimization.
Proceedings of the Graph Partitioning and Graph Clustering, 2012

Microarray vs. RNA-Seq: a comparison for active subnetwork discovery.
Proceedings of the ACM International Conference on Bioinformatics, 2012

Fast Recommendation on Bibliographic Networks.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011
Design, implementation, and analysis of maximum transversal algorithms.
ACM Trans. Math. Softw., 2011

Integrated data placement and task assignment for scientific workflows in clouds.
Proceedings of the DIDC'11, 2011

On Partitioning Problems with Complex Objectives.
Proceedings of the Euro-Par 2011: Parallel Processing Workshops - CCPI, CGWS, HeteroPar, HiBB, HPCVirt, HPPC, HPSS, MDGS, ProPer, Resilience, UCHPC, VHPC, Bordeaux, France, August 29, 2011

2010
Efficient broadcast encryption with user profiles.
Inf. Sci., 2010

Secret Sharing Extensions based on the Chinese Remainder Theorem.
IACR Cryptol. ePrint Arch., 2010

2009
Threshold cryptography with Chinese remainder theorem (Çin kalan teoremi\'ne dayalı eşik kriptografisi)
PhD thesis, 2009

Exact Algorithms for a Task Assignment Problem.
Parallel Process. Lett., 2009

Optimal subset-difference broadcast encryption with free riders.
Inf. Sci., 2009

Practical Threshold Signatures with Linear Secret Sharing Schemes.
Proceedings of the Progress in Cryptology, 2009

2008
A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem.
Proceedings of the Progress in Cryptology, 2008

Robust Threshold Schemes Based on the Chinese Remainder Theorem.
Proceedings of the Progress in Cryptology, 2008

2007
Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories.
J. Parallel Distributed Comput., 2007

Threshold cryptography based on Asmuth-Bloom secret sharing.
Inf. Sci., 2007

2006
Iterative-Improvement-Based Heuristics for Adaptive Scheduling of Tasks Sharing Files on Heterogeneous Master-Slave Environments.
IEEE Trans. Parallel Distributed Syst., 2006

Task assignment in heterogeneous computing systems.
J. Parallel Distributed Comput., 2006

Threshold Cryptography Based on Asmuth-Bloom Secret Sharing.
Proceedings of the Computer and Information Sciences, 2006

Capture Resilient ElGamal Signature Protocols.
Proceedings of the Computer and Information Sciences, 2006


  Loading...