default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKamer Kaya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j39]Gökhan Göktürk, Kamer Kaya:
DiFuseR: a distributed sketch-based influence maximization algorithm for GPUs. J. Supercomput. 81(1): 21 (2025)- 2024
- [j38]Gökhan Göktürk
, Kamer Kaya:
Fast and error-adaptive influence maximization based on Count-Distinct sketches. Inf. Sci. 655: 119875 (2024) - 2023
- [j37]Kamer Kaya, Cevat Sener, Hüsnü Yenigün:
Special issue on High-Performance Computing Conference (BASARIM 2022). Concurr. Comput. Pract. Exp. 35(24) (2023) - [c58]Sila Akpinar, Emre Vardar, Serhat Yesilyurt, Kamer Kaya:
Solving Navier-Stokes Equations With Mixed Equation Physics Informed Neural Networks. SIU 2023: 1-4 - [i24]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, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - [i23]George Karypis, Christian Schulz, 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, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023) - 2022
- [j36]Anes Abdennebi, Anil Elakas, Fatih Tasyaran, Erdinç Öztürk, Kamer Kaya, Sinan Yildirim:
Machine learning-based load distribution and balancing in heterogeneous database management systems. Concurr. Comput. Pract. Exp. 34(4) (2022) - [j35]Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar:
Scaling matrices and counting the perfect matchings in graphs. Discret. Appl. Math. 308: 130-146 (2022) - [j34]Amro Alabsi Aljundi, Taha Atahan Akyildiz, Kamer Kaya:
Boosting Graph Embedding on a Single GPU. IEEE Trans. Parallel Distributed Syst. 33(11): 3092-3105 (2022) - [c57]Amro Alabsi Aljundi, Taha Atahan Akyildiz, Kamer Kaya:
Degree-Aware Kernels for Computing Jaccard Weights on GPUs. IPDPS 2022: 897-907 - [c56]Gökhan Göktürk, Kamer Kaya:
Fast and High-Quality Influence Maximization on Multiple GPUs. IPDPS 2022: 908-918 - [c55]Erhan Tezcan, Tugba Torun, Fahrican Kosar, Kamer Kaya, Didem Unat:
Mixed and Multi-Precision SpMV for GPUs with Row-wise Precision Selection. SBAC-PAD 2022: 31-40 - 2021
- [j33]N. Ege Saraç, Ömer Faruk Altun, Kamil Tolga Atam, Sertaç Karahoda, Kamer Kaya, Hüsnü Yenigün:
Boosting expensive synchronizing heuristics. Expert Syst. Appl. 167: 114203 (2021) - [j32]Mustafa Kemal Tas, Kamer Kaya, Hüsnü Yenigün:
Synchronizing billion-scale automata. Inf. Sci. 574: 162-175 (2021) - [j31]Gökhan Göktürk, Kamer Kaya:
Boosting Parallel Influence-Maximization Kernels for Undirected Networks With Fusing and Vectorization. IEEE Trans. Parallel Distributed Syst. 32(5): 1001-1013 (2021) - [c54]Alda Canito, Marta Fernandes, João Mourinho, Serkan Tosun, Kamer Kaya, Aysegül Turupcu, Angel Lagares, Hüseyin Karabulut, Goreti Marreiros:
Flexible Architecture for Data-Driven Predictive Maintenance with Support for Offline and Online Machine Learning Techniques. IECON 2021: 1-7 - [i22]Fatih Tasyaran, Berkay Demireller, Kamer Kaya, Bora Uçar:
Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments. CoRR abs/2103.05394 (2021) - [i21]Gökhan Göktürk, Kamer Kaya:
Fast and Error-Adaptive Influence Maximization based on Count-Distinct Sketches. CoRR abs/2105.04023 (2021) - [i20]Anes Abdennebi, Kamer Kaya:
A Bloom Filter Survey: Variants for Different Domain Applications. CoRR abs/2106.12189 (2021) - [i19]Amro Alabsi Aljundi, Taha Atahan Akyildiz, Kamer Kaya:
Boosting Graph Embedding on a Single GPU. CoRR abs/2110.10049 (2021) - [i18]Seyma Selcan Magara, Ceren Yildirim, Ferhat Yaman, Berke Dilekoglu, Furkan Reha Tutas, Erdinç Öztürk, Kamer Kaya, Öznur Tastan, Erkay Savas:
ML with HE: Privacy Preserving Machine Learning Inferences for Genome Studies. CoRR abs/2110.11446 (2021) - 2020
- [j30]Sertaç Karahoda, Osman Tufan Erenay, Kamer Kaya, Uraz Cengiz Türker, Hüsnü Yenigün:
Multicore and manycore parallelization of cheap synchronizing sequence heuristics. J. Parallel Distributed Comput. 140: 13-24 (2020) - [c53]Kamer Kaya, Johannes Langguth, Ioannis Panagiotas, Bora Uçar:
Karp-Sipser based kernels for bipartite graph matching. ALENEX 2020: 134-145 - [c52]Taha Atahan Akyildiz, Amro Alabsi Aljundi, Kamer Kaya:
Understanding Coarsening for Embedding Large-Scale Graphs. IEEE BigData 2020: 2937-2946 - [c51]Sinan Yildirim, Kamer Kaya, Soner Aydin, Hakan Bugra Erentug:
Differentially Private Frequency Sketches for Intermittent Queries on Large Data Streams. IEEE BigData 2020: 4083-4092 - [c50]Taha Atahan Akyildiz, Amro Alabsi Aljundi, Kamer Kaya:
GOSH: Embedding Big Graphs on Small Hardware. ICPP 2020: 4:1-4:11 - [c49]Kamer Kaya, Berker Demirel, Baris Batuhan Topal, Arda Asik, Ibrahim Bugra Demir:
Vertex Ordering Algorithms for Graph Coloring Problem. SIU 2020: 1-4 - [i17]Gökhan Göktürk, Kamer Kaya:
Boosting Parallel Influence-Maximization Kernels for Undirected Networks with Fusing and Vectorization. CoRR abs/2008.03095 (2020) - [i16]Arda Asik, Ibrahim Bugra Demir, Berker Demirel, Baris Batuhan Topal, Kamer Kaya:
Vertex Ordering Algorithms for Graph Coloring Problem. CoRR abs/2008.11454 (2020) - [i15]Taha Atahan Akyildiz, Amro Alabsi Aljundi, Kamer Kaya:
GOSH: Embedding Big Graphs on Small Hardware. CoRR abs/2008.12336 (2020) - [i14]Taha Atahan Akyildiz, Amro Alabsi Aljundi, Kamer Kaya:
Understanding Coarsening for Embedding Large-Scale Graphs. CoRR abs/2009.04925 (2020)
2010 – 2019
- 2019
- [j29]Kamer Kaya, Figen Öztoprak, S. Ilker Birbil, A. Taylan Cemgil, Umut Simsekli, Nurdan Kuru, Hazal Koptagel, M. Kaan Öztürk:
A framework for parallel second order incremental optimization algorithms for solving partially separable problems. Comput. Optim. Appl. 72(3): 675-705 (2019) - [j28]Kamer Kaya:
Parallel algorithms for computing sparse matrix permanents. Turkish J. Electr. Eng. Comput. Sci. 27(6): 4284-4297 (2019) - [j27]Julien Herrmann, M. Yusuf Özkaya, Bora Uçar, Kamer Kaya, Ümit V. Çatalyürek:
Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs. SIAM J. Sci. Comput. 41(4): A2117-A2145 (2019) - [j26]Hanefi Mercan, Cemal Yilmaz, Kamer Kaya:
CHiP: A Configurable Hybrid Parallel Covering Array Constructor. IEEE Trans. Software Eng. 45(12): 1270-1291 (2019) - [c48]Fatih Tasyaran, Kerem Yildirir, Mustafa Kemal Tas, Kamer Kaya:
One Table to Count Them All: Parallel Frequency Estimation on Single-Board Computers. Euro-Par 2019: 405-418 - [c47]Berk Çirisci, M. Yusa Emek, Ege Sorguç, Kamer Kaya, Hüsnü Yenigün:
Using Synchronizing Heuristics to Construct Homing Sequences. MODELSWARD 2019: 362-369 - [c46]Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar:
Effective Heuristics for Matchings in Hypergraphs. SEA² 2019: 248-264 - [i13]Fatih Tasyaran, Kerem Yildirir, Kamer Kaya, Mustafa Kemal Tas:
One Table to Count Them All: Parallel Frequency Estimation on Single-Board Computers. CoRR abs/1903.00729 (2019) - 2018
- [j25]Aras Mumcuyan, Baran Usta, Kamer Kaya, Hüsnü Yenigün:
Optimally bipartitioning sparse matrices with reordering and parallelization. Concurr. Comput. Pract. Exp. 30(21) (2018) - [j24]Cem Topcuoglu, Kamer Kaya, Erkay Savas:
A generic Private Information Retrieval scheme with parallel multi-exponentiations on multicore processors. Concurr. Comput. Pract. Exp. 30(21) (2018) - [j23]Sertaç Karahoda, Kamer Kaya, Hüsnü Yenigün:
Synchronizing heuristics: Speeding up the fastest. Expert Syst. Appl. 94: 265-275 (2018) - [j22]Izzet F. Senturk, Ponnuraman Balakrishnan, Anas Abu-Doleh, Kamer Kaya, Qutaibah M. Malluhi, Ümit V. Çatalyürek:
A resource provisioning framework for bioinformatics applications in multi-cloud environments. Future Gener. Comput. Syst. 78: 379-391 (2018) - [c45]Hanefi Mercan, Kamer Kaya, Cemal Yilmaz:
Enumerator: An Efficient Approach for Enumerating all Valid t-tuples. ICST Workshops 2018: 302-305 - [c44]Berk Çirisci, Baris Sevilmis, Emre Yasin Sivri, Poyraz Kivanç Karaçam, Kamer Kaya, Hüsnü Yenigün:
Synchronizing Heuristics for Weakly Connected Automata with Various Topologies. MODELSWARD (Revised Selected Papers) 2018: 475-493 - [c43]Berk Çirisci, Muhammed Kerem Kahraman, Cagri Uluc Yildirimoglu, Kamer Kaya, Hüsnü Yenigün:
Using Structure of Automata for Faster Synchronizing Heuristics. MODELSWARD 2018: 544-551 - [c42]Fanny Dufossé, Kamer Kaya, Ioannis Panagiotas, Bora Uçar:
Approximation algorithms for maximum matchings in undirected graphs. CSC 2018: 56-65 - 2017
- [j21]Gamze Tillem, Erkay Savas, Kamer Kaya:
A New Method for Computational Private Information Retrieval. Comput. J. 60(8): 1238-1250 (2017) - [j20]Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek:
Graph Manipulations for Fast Centrality Computation. ACM Trans. Knowl. Discov. Data 11(3): 26:1-26:25 (2017) - [c41]Julien Herrmann, Jonathan Kho, Bora Uçar, Kamer Kaya, Ümit V. Çatalyürek:
Acyclic Partitioning of Large Directed Acyclic Graphs. CCGrid 2017: 371-380 - [c40]Mustafa Kemal Tas, Kamer Kaya, Erik Saule:
Greed Is Good: Parallel Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures. ICPP 2017: 503-512 - [c39]Kamer Kaya, S. Ilker Birbil, M. Kaan Öztürk, Amir Gohari:
Parallelized Preconditioned Model Building Algorithm for Matrix Factorization. MOD 2017: 376-388 - [c38]Ömer Faruk Altun, Kamil Tolga Atam, Sertaç Karahoda, Kamer Kaya:
Synchronizing Heuristics: Speeding up the Slowest. ICTSS 2017: 243-256 - [c37]Hanefi Mercan, Cemal Yilmaz, Kamer Kaya:
An Approach for Choosing the Best Covering Array Constructor to Use. QRS Companion 2017: 77-84 - [i12]Mustafa Kemal Tas, Kamer Kaya, Erik Saule:
Greed is Good: Optimistic Algorithms for Bipartite-Graph Partial Coloring on Multicore Architectures. CoRR abs/1701.02628 (2017) - 2016
- [j19]Oguzhan Ersoy, Thomas Brochmann Pedersen, Kamer Kaya, Ali Aydin Selçuk, Emin Anarim:
A CRT-based verifiable secret sharing scheme secure against unbounded adversaries. Secur. Commun. Networks 9(17): 4416-4427 (2016) - [c36]Ersin Ersoy, Kamer Kaya, Metin Altinisik, Hasan Sözer:
Using Hypergraph Clustering for Software Architecture Reconstruction of Data-Tier Software. ECSA 2016: 326-333 - [c35]Gamze Tillem, Ömer Mert Candan, Erkay Savas, Kamer Kaya:
Hiding Access Patterns in Range Queries Using Private Information Retrieval and ORAM. Financial Cryptography Workshops 2016: 253-270 - [c34]Sertaç Karahoda, Osman Tufan Erenay, Kamer Kaya, Uraz Cengiz Türker, Hüsnü Yenigün:
Parallelizing Heuristics for Generating Synchronizing Sequences. ICTSS 2016: 106-122 - [c33]Stefan Wagner, Asim Abdulkhaleq, Kamer Kaya, Alexander Paar:
On the Relationship of Inconsistent Software Clones and Faults: An Empirical Study. SANER 2016: 79-89 - [i11]Oguzhan Ersoy, Kamer Kaya, Kerem Kaskaloglu:
Multilevel Threshold Secret and Function Sharing based on the Chinese Remainder Theorem. CoRR abs/1605.07988 (2016) - [i10]Stefan Wagner, Asim Abdulkhaleq, Kamer Kaya, Alexander Paar:
On the Relationship of Inconsistent Software Clones and Faults: An Empirical Study. CoRR abs/1611.08005 (2016) - 2015
- [j18]Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Regularizing graph centrality computations. J. Parallel Distributed Comput. 76: 106-119 (2015) - [j17]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) - [j16]Fanny Dufossé, Kamer Kaya, Bora Uçar:
Two approximation algorithms for bipartite matching on multicore architectures. J. Parallel Distributed Comput. 85: 62-78 (2015) - [j15]Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Incremental closeness centrality in distributed memory. Parallel Comput. 47: 3-18 (2015) - [c32]Ayat Hatem, Kamer Kaya, Jeffrey D. Parvin, Kun Huang, Ümit V. Çatalyürek:
MICA: MicroRNA integration for active module discovery. BCB 2015: 136-145 - [c31]Mehmet Deveci, Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
Fast and High Quality Topology-Aware Task Mapping. IPDPS 2015: 197-206 - 2014
- [j14]Kamer Kaya, Ali Aydin Selçuk:
Sharing DSS by the Chinese Remainder Theorem. J. Comput. Appl. Math. 259: 495-502 (2014) - [j13]Onur Küçüktunç, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Diversifying Citation Recommendations. ACM Trans. Intell. Syst. Technol. 5(4): 55:1-55:21 (2014) - [c30]Fanny Dufossé, Kamer Kaya, Bora Uçar:
Bipartite Matching Heuristics with Quality Guarantees on Shared Memory Parallel Computers. IPDPS 2014: 540-549 - [c29]Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Hardware/Software Vectorization for Closeness Centrality on Multi-/Many-Core Architectures. IPDPS Workshops 2014: 1386-1395 - [c28]Anas Abu-Doleh, Kamer Kaya, Mohamed Abouelhoda, Ümit V. Çatalyürek:
Extracting Maximal Exact Matches on GPU. IPDPS Workshops 2014: 1417-1426 - 2013
- [j12]Kamer Kaya, Johannes Langguth, Fredrik Manne, Bora Uçar:
Push-relabel based algorithms for the maximum transversal problem. Comput. Oper. Res. 40(5): 1266-1275 (2013) - [j11]Kamer Kaya, Bora Uçar:
Constructing Elimination Trees for Sparse Unsymmetric Matrices. SIAM J. Matrix Anal. Appl. 34(2): 345-354 (2013) - [j10]Onur Küçüktunç, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek:
Fast recommendation on bibliographic networks with sparse-matrix ordering and partitioning. Soc. Netw. Anal. Min. 3(4): 1097-1111 (2013) - [c27]Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek:
Betweenness centrality on GPUs and heterogeneous architectures. GPGPU@ASPLOS 2013: 76-85 - [c26]Onur Küçüktunç, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Towards a personalized, scalable, and exploratory academic recommendation service. ASONAM 2013: 636-641 - [c25]Ayat Hatem, Kamer Kaya, Ümit V. Çatalyürek:
PRASE: PageRank-based Active Subnetwork Extraction. BCB 2013: 286 - [c24]Anas Abu-Doleh, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Masher: Mapping Long(er) Reads with Hash-based Genome Indexing on GPUs. BCB 2013: 341 - [c23]Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek:
Incremental algorithms for closeness centrality. IEEE BigData 2013: 487-492 - [c22]Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
STREAMER: A distributed framework for incremental closeness centrality computation. CLUSTER 2013: 1-8 - [c21]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 - [c20]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 - [c19]Mehmet Deveci, Kamer Kaya, Ümit V. Çatalyürek:
Hypergraph Sparsification and Its Application to Partitioning. ICPP 2013: 200-209 - [c18]Onur Küçüktunç, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
TheAdvisor: a webservice for academic recommendation. JCDL 2013: 433-434 - [c17]Kamer Kaya, Bora Uçar, Ümit V. Çatalyürek:
Analysis of Partitioning Models and Metrics in Parallel Sparse Matrix-Vector Multiplication. PPAM (2) 2013: 174-184 - [c16]Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi. PPAM (1) 2013: 559-570 - [c15]Ümit V. Çatalyürek, Kamer Kaya, Ahmet Erdem Sariyüce, Erik Saule:
Shattering and Compressing Networks for Betweenness Centrality. SDM 2013: 686-694 - [c14]Onur Küçüktunç, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Diversified recommendation on graphs: pitfalls, measures, and algorithms. WWW 2013: 715-726 - [i9]Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Performance Evaluation of Sparse Matrix Multiplication Kernels on Intel Xeon Phi. CoRR abs/1302.1078 (2013) - [i8]Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek:
Incremental Algorithms for Network Management and Analysis based on Closeness Centrality. CoRR abs/1303.0422 (2013) - [i7]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
- [j9]Yang Xiang, David Fuhry, Kamer Kaya, Ruoming Jin, Ümit V. Çatalyürek, Kun Huang:
Merging network patterns: a general framework to summarize biomedical network data. Netw. Model. Anal. Health Informatics Bioinform. 1(3): 103-116 (2012) - [c13]Onur Kucuktunc, Kamer Kaya, Erik Saule, Ümit V. Çatalyürek:
Fast Recommendation on Bibliographic Networks. ASONAM 2012: 480-487 - [c12]Ayat Hatem, Kamer Kaya, Ümit V. Çatalyürek:
Microarray vs. RNA-Seq: a comparison for active subnetwork discovery. BCB 2012: 450-457 - [c11]Ü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 - [c10]Ümit V. Çatalyürek, Kamer Kaya, Johannes Langguth, Bora Uçar:
A partitioning-based divisive clustering technique for maximizing the modularity. Graph Partitioning and Graph Clustering 2012: 171-186 - [c9]Ümit V. Çatalyürek, Kamer Kaya, Bora Uçar:
On Shared-Memory Parallelization of a Sparse Matrix Scaling Algorithm. ICPP 2012: 68-77 - [c8]Ümit V. Çatalyürek, Mehmet Deveci, Kamer Kaya, Bora Uçar:
Multithreaded Clustering for Multi-level Hypergraph Partitioning. IPDPS 2012: 848-859 - [i6]Onur Küçüktunç, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Recommendation on Academic Networks using Direction Aware Citation Analysis. CoRR abs/1205.1143 (2012) - [i5]Onur Küçüktunç, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Diversifying Citation Recommendations. CoRR abs/1209.5809 (2012) - [i4]Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Shattering and Compressing Networks for Centrality Analysis. CoRR abs/1209.6007 (2012) - 2011
- [j8]Iain S. Duff, Kamer Kaya, Bora Uçar:
Design, implementation, and analysis of maximum transversal algorithms. ACM Trans. Math. Softw. 38(2): 13:1-13:31 (2011) - [c7]Kamer Kaya, François-Henry Rouet, Bora Uçar:
On Partitioning Problems with Complex Objectives. Euro-Par Workshops (1) 2011: 334-344 - [c6]Ümit V. Çatalyürek, Kamer Kaya, Bora Uçar:
Integrated data placement and task assignment for scientific workflows in clouds. DICT@HPDC 2011: 45-54 - 2010
- [j7]Murat Ak, Kamer Kaya, Kaan Onarlioglu, Ali Aydin Selçuk:
Efficient broadcast encryption with user profiles. Inf. Sci. 180(6): 1060-1072 (2010) - [i3]Kamer Kaya, Ali Aydin Selçuk:
Secret Sharing Extensions based on the Chinese Remainder Theorem. IACR Cryptol. ePrint Arch. 2010: 96 (2010)
2000 – 2009
- 2009
- [b1]Kamer Kaya:
Threshold cryptography with Chinese remainder theorem (Çin kalan teoremi\'ne dayalı eşik kriptografisi). İhsan Doğramacı Bilkent University, Turkey, 2009 - [j6]Murat Ak, Kamer Kaya, Ali Aydin Selçuk:
Optimal subset-difference broadcast encryption with free riders. Inf. Sci. 179(20): 3673-3684 (2009) - [j5]Kamer Kaya, Bora Uçar:
Exact Algorithms for a Task Assignment Problem. Parallel Process. Lett. 19(3): 451-465 (2009) - [c5]Ilker Nadi Bozkurt, Kamer Kaya, Ali Aydin Selçuk:
Practical Threshold Signatures with Linear Secret Sharing Schemes. AFRICACRYPT 2009: 167-178 - 2008
- [c4]Kamer Kaya, Ali Aydin Selçuk:
Robust Threshold Schemes Based on the Chinese Remainder Theorem. AFRICACRYPT 2008: 94-108 - [c3]Kamer Kaya, Ali Aydin Selçuk:
A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem. INDOCRYPT 2008: 414-425 - [i2]Murat Ak, Kamer Kaya, Ali Aydin Selçuk:
Optimal Subset-Difference Broadcast Encryption with Free Riders. IACR Cryptol. ePrint Arch. 2008: 389 (2008) - [i1]Kamer Kaya, Ali Aydin Selçuk:
Sharing DSS by the Chinese Remainder Theorem. IACR Cryptol. ePrint Arch. 2008: 483 (2008) - 2007
- [j4]Kamer Kaya, Ali Aydin Selçuk:
Threshold cryptography based on Asmuth-Bloom secret sharing. Inf. Sci. 177(19): 4148-4160 (2007) - [j3]Kamer Kaya, Bora Uçar, Cevdet Aykanat:
Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories. J. Parallel Distributed Comput. 67(3): 271-285 (2007) - 2006
- [j2]Bora Uçar, Cevdet Aykanat, Kamer Kaya, Murat Ikinci:
Task assignment in heterogeneous computing systems. J. Parallel Distributed Comput. 66(1): 32-46 (2006) - [j1]Kamer Kaya, Cevdet Aykanat:
Iterative-Improvement-Based Heuristics for Adaptive Scheduling of Tasks Sharing Files on Heterogeneous Master-Slave Environments. IEEE Trans. Parallel Distributed Syst. 17(8): 883-896 (2006) - [c2]Kamer Kaya, Ali Aydin Selçuk, Zahir Tezcan:
Threshold Cryptography Based on Asmuth-Bloom Secret Sharing. ISCIS 2006: 935-942 - [c1]Hüseyin Acan, Kamer Kaya, Ali Aydin Selçuk:
Capture Resilient ElGamal Signature Protocols. ISCIS 2006: 943-951
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-10-22 21:14 CEST 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:
