default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSerhat Nazim Avci
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c10]Serhat Nazim Avci, Cédric Westphal:
A content-based traffic engineering policy for Information-Centric Networks. CCNC 2016: 711-719- [c9]Serhat Nazim Avci, Zhenjiang Li, Fangping Liu:
Congestion aware priority flow control in data center networks. Networking 2016: 126-134 - 2015
- [j3]Serhat Nazim Avci, Ender Ayanoglu:
Link Failure Recovery Over Large Arbitrary Networks: The Case of Coding. IEEE Trans. Commun. 63(5): 1726-1740 (2015) - 2014
- [c8]Serhat Nazim Avci, Ender Ayanoglu:
Link failure recovery in large arbitrary networks via network coding. ITA 2014: 1-10 - 2013
- [j2]Serhat Nazim Avci, Ender Ayanoglu:
Optimal Algorithms for Near-Hitless Network Restoration via Diversity Coding. IEEE Trans. Commun. 61(9): 3878-3893 (2013) - [j1]Serhat Nazim Avci, Ender Ayanoglu:
Coded Path Protection: Efficient Conversion of Sharing to Coding. IEEE Trans. Commun. 61(10): 4294-4309 (2013) - [c7]Serhat Nazim Avci, Ender Ayanoglu:
Network coding-based link failure recovery over large arbitrary networks. GLOBECOM 2013: 1519-1525 - [c6]Serhat Nazim Avci, Ender Ayanoglu:
New diversity coding design algorithms for link failure recovery in communication networks. ICC 2013: 2337-2342 - [i7]Serhat Nazim Avci, Ender Ayanoglu:
Network Coding-Based Link Failure Recovery over Large Arbitrary Networks. CoRR abs/1304.6128 (2013) - [i6]Serhat Nazim Avci, Ender Ayanoglu:
Link Failure Recovery over Very Large Arbitrary Networks: The Case of Coding. CoRR abs/1308.2003 (2013) - 2012
- [c5]Serhat Nazim Avci, Ender Ayanoglu:
Optimal algorithms for near-hitless network restoration via diversity coding. GLOBECOM 2012: 1877-1883 - [c4]Serhat Nazim Avci, Ender Ayanoglu:
Coded path protection: Efficient conversion of sharing to coding. ICC 2012: 1198-1203 - [c3]Serhat Nazim Avci, Ender Ayanoglu:
Extended diversity coding: Coding protection and primary paths for network restoration. NetCod 2012: 119-124 - [i5]Serhat Nazim Avci, Ender Ayanoglu:
Optimal Algorithms for Near-Hitless Network Restoration via Diversity Coding. CoRR abs/1205.1552 (2012) - [i4]Serhat Nazim Avci, Ender Ayanoglu:
Coded Path Protection Part 1: Efficient Conversion of Sharing to Coding. CoRR abs/1208.5526 (2012) - [i3]Serhat Nazim Avci, Ender Ayanoglu:
Coded Path Protection Part 2: Design, Implementation, and Performance. CoRR abs/1208.5528 (2012) - 2011
- [c2]Serhat Nazim Avci, Xiaodan Hu, Ender Ayanoglu:
Recovery from Link Failures in Networks with Arbitrary Topology via Diversity Coding. GLOBECOM 2011: 1-6 - [c1]Serhat Nazim Avci, Xiaodan Hu, Ender Ayanoglu:
Hitless recovery from link failures in networks with arbitrary topology. ITA 2011: 50-55 - [i2]Serhat Nazim Avci, Xiaodan Hu, Ender Ayanoglu:
Recovery from Link Failures in Networks with Arbitrary Topology via Diversity Coding. CoRR abs/1106.0489 (2011) - [i1]Serhat Nazim Avci, Ender Ayanoglu:
Coded Path Protection: Efficient Conversion of Sharing to Coding. CoRR abs/1112.4955 (2011)
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 2025-01-09 12:53 CET 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:
