Elif Haytaoglu

Orcid: 0000-0002-6341-9701

According to our database1, Elif Haytaoglu authored at least 22 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Guessing Cost: Bounds and Applications to Data Repair in Distributed Storage.
IEEE Trans. Inf. Theory, October, 2024

2023
CoRMAC: A Connected Random Topology Formation With Maximal Area Coverage in Wireless Ad-Hoc Networks.
IEEE Internet Things J., July, 2023

Minimum Repair Bandwidth LDPC Codes for Distributed Storage Systems.
IEEE Commun. Lett., February, 2023

2022
Data Repair-Efficient Fault Tolerance for Cellular Networks Using LDPC Codes.
IEEE Trans. Commun., 2022

LDPC Kodlarında Artık Veri Kullanımı Residual Data Usage in LDPC Codes.
Proceedings of the 30th Signal Processing and Communications Applications Conference, 2022

Base Station-Assisted Cooperative Network Coding for Cellular Systems with Link Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Improved Bounds on the Moments of Guessing Cost.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Cooperative Network Coding for Distributed Storage using Base Stations with Link Constraints.
CoRR, 2021

Bİ-Yardimli Dağitik Depolama Ağlannda Ortalama Bant Genişliği Maliyeti ve Depolama Ödunleşimi Average Bandwidth-Cost vs. Storage Trade-off for BS-assisted Distributed Storage Networks.
Proceedings of the 29th Signal Processing and Communications Applications Conference, 2021

2020
On the Fault Tolerant Distributed Data Caching using LDPC Codes in Cellular Networks.
CoRR, 2020

Cost of Guessing: Applications to Distributed Data Storage and Repair.
CoRR, 2020

A Novel Distributed CDS Algorithm for Extending Lifetime of WSNs With Solar Energy Harvester Nodes for Smart Agriculture Applications.
IEEE Access, 2020

Cost of Guessing: Applications to Data Repair.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2018
A minimal weight and routing cost connected dominating set algorithm for wireles sensor networks.
Proceedings of the 26th Signal Processing and Communications Applications Conference, 2018

A New Distributed Weighted Connected Dominating Set Algorithm for WSNs.
Proceedings of the 8th IEEE International Conference on Consumer Electronics - Berlin, 2018

2017
A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes.
Computing, 2017

On the Communication Cost of MDS Erasure Codes in Distributed Storage Systems.
Comput. Informatics, 2017

File repair with cluster based distributed storage system.
Proceedings of the 25th Signal Processing and Communications Applications Conference, 2017

2015
Dağıtık depolama sistemleri için tamir ve yapılandırım üzerine bir çalışma (A study on node repair and data reconstruction for distributed storage systems)
PhD thesis, 2015

Managing TCP connections of file reconstruction process in erasure codes.
Proceedings of the 2015 23nd Signal Processing and Communications Applications Conference (SIU), 2015

2013
Homomorphic Minimum Bandwidth Repairing Codes.
Proceedings of the Information Sciences and Systems 2013, 2013

2011
A simple shuffle-based stable in-place merge algorithm.
Proceedings of the First World Conference on Information Technology, 2011


  Loading...