![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Berksan Serbetci
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Derya Malak
, Mohammad Reza Deylam Salehi
, Berksan Serbetci
, Petros Elia
:
Multi-Server Multi-Function Distributed Computation. Entropy 26(6): 448 (2024) - [i10]Derya Malak, Mohammad Reza Deylam Salehi, Berksan Serbetci, Petros Elia:
Multi-Server Multi-Function Distributed Computation. CoRR abs/2405.08732 (2024) - 2023
- [j5]Berksan Serbetci
, Eleftherios Lampiris
, Thrasyvoulos Spyropoulos, Giuseppe Caire
, Petros Elia
:
Multi-Transmitter Coded Caching Networks With Transmitter-Side Knowledge of File Popularity. IEEE/ACM Trans. Netw. 31(3): 1277-1292 (2023) - [j4]Adeel Malik
, Berksan Serbetci
, Petros Elia
:
Coded Caching in Networks With Heterogeneous User Activity. IEEE/ACM Trans. Netw. 31(6): 2886-2901 (2023) - 2022
- [c11]Adeel Malik, Berksan Serbetci, Petros Elia:
Stochastic Coded Caching with Optimized Shared-Cache Sizes and Reduced Subpacketization. ICC 2022: 2918-2923 - [c10]Adeel Malik, Berksan Serbetci, Petros Elia:
Resolving Cache-Load Imbalance Bottleneck of Stochastic Shared-Cache Networks. WCNC 2022: 304-309 - [i9]Adeel Malik, Berksan Serbetci, Petros Elia:
Coded Caching in Networks with Heterogeneous User Activity. CoRR abs/2201.10250 (2022) - 2021
- [j3]Adeel Malik
, Berksan Serbetci
, Emanuele Parrinello, Petros Elia:
Fundamental Limits of Stochastic Shared-Cache Networks. IEEE Trans. Commun. 69(7): 4433-4447 (2021) - [i8]Eleftherios Lampiris, Berksan Serbetci, Thrasyvoulos Spyropoulos, Giuseppe Caire, Petros Elia:
Multi-Transmitter Coded Caching Networks with Transmitter-side Knowledge of File Popularity. CoRR abs/2103.11623 (2021) - [i7]Adeel Malik, Berksan Serbetci, Petros Elia:
Stochastic Coded Caching with Optimized Shared-Cache Sizes and Reduced Subpacketization. CoRR abs/2112.14114 (2021) - 2020
- [c9]Adeel Malik, Berksan Serbetci, Emanuele Parrinello, Petros Elia:
Stochastic Analysis of Coded Multicasting for Shared Caches Networks. GLOBECOM 2020: 1-6 - [c8]Berksan Serbetci, Eleftherios Lampiris, Thrasyvoulos Spyropoulos, Petros Elia:
Augmenting Multiple-Transmitter Coded Caching using Popularity Knowledge at the Transmitters. WiOpt 2020: 9-16 - [i6]Adeel Malik, Berksan Serbetci, Emanuele Parrinello, Petros Elia:
Fundamental Limits of Stochastic Caching Networks. CoRR abs/2005.13847 (2020)
2010 – 2019
- 2019
- [c7]Berksan Serbetci, Emanuele Parrinello, Petros Elia
:
Multi-access coded caching: gains beyond cache-redundancy. ITW 2019: 1-5 - [c6]Konstantin Avrachenkov
, Jasper Goseling, Berksan Serbetci
:
Distributed Cooperative Caching for Utility Maximization of VoD Systems. SPAWC 2019: 1-5 - [c5]Konstantin Avrachenkov
, Jasper Goseling, Berksan Serbetci:
Distributed Cooperative Caching for VoD with Geographic Constraints. WiOpt 2019: 1-8 - [i5]Berksan Serbetci, Ali Emre Pusane:
Practical Polar Code Construction Using Generalised Generator Matrices. CoRR abs/1901.01280 (2019) - [i4]Konstantin Avrachenkov, Jasper Goseling, Berksan Serbetci:
Distributed Cooperative Caching for VoD with Geographic Constraints. CoRR abs/1903.02406 (2019) - 2017
- [j2]Konstantin Avrachenkov
, Jasper Goseling, Berksan Serbetci:
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints. Proc. ACM Meas. Anal. Comput. Syst. 1(1): 27:1-27:25 (2017) - [c4]Konstantin Avrachenkov, Jasper Goseling, Berksan Serbetci:
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints. SIGMETRICS (Abstracts) 2017: 2 - [c3]Berksan Serbetci
, Jasper Goseling:
On Optimal Geographical Caching in Heterogeneous Cellular Networks. WCNC 2017: 1-6 - [i3]Konstantin Avrachenkov, Jasper Goseling, Berksan Serbetci:
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints. CoRR abs/1704.04465 (2017) - [i2]Berksan Serbetci, Jasper Goseling:
Optimal Geographical Caching in Heterogeneous Cellular Networks with Nonhomogeneous Helpers. CoRR abs/1710.09626 (2017) - 2016
- [i1]Berksan Serbetci, Jasper Goseling:
On Optimal Geographical Caching in Heterogeneous Cellular Networks. CoRR abs/1601.07322 (2016) - 2014
- [j1]Berksan Serbetci
, Ali Emre Pusane:
Practical polar code construction using generalised generator matrices. IET Commun. 8(4): 419-426 (2014) - 2012
- [c2]Berksan Serbetci
, Ali Emre Pusane:
On the selection of generator matrices for polar coded communication systems. SIU 2012: 1-4 - [c1]Berksan Serbetci
, Ali Emre Pusane:
Finite-length polarization measures for polar coded systems. SPAWC 2012: 364-368
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-07 22:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint