Kamer Kaya

According to our database1, Kamer Kaya
  • authored at least 76 papers between 2006 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

2017
Graph Manipulations for Fast Centrality Computation.
TKDD, 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.
Security and Communication 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.
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 Computing, 2015

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

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

Hypergraph partitioning for multiple communication cost metrics: Model and methods.
J. Parallel Distrib. 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 TIST, 2014

Sharing DSS by the Chinese Remainder Theorem.
J. Computational Applied Mathematics, 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.
Social Netw. Analys. Mining, 2013

Constructing Elimination Trees for Sparse Unsymmetric Matrices.
SIAM J. Matrix Analysis Applications, 2013

GPU accelerated maximum cardinality matching algorithms for bipartite graphs
CoRR, 2013

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

Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi
CoRR, 2013

Push-relabel based algorithms for the maximum transversal problem.
Computers & OR, 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, 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.
NetMAHIB, 2012

Shattering and Compressing Networks for Centrality Analysis
CoRR, 2012

Diversifying Citation Recommendations
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 Cryptology ePrint Archive, 2010

2009
Exact Algorithms for a Task Assignment Problem.
Parallel Processing Letters, 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
Sharing DSS by the Chinese Remainder Theorem.
IACR Cryptology ePrint Archive, 2008

Optimal Subset-Difference Broadcast Encryption with Free Riders.
IACR Cryptology ePrint Archive, 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 Distrib. 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 Distrib. Syst., 2006

Task assignment in heterogeneous computing systems.
J. Parallel Distrib. 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...