Öznur Özkasap

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Sena Cebeci

> Home > Persons > Öznur Özkasap

Publications

2016
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/csur/BrienzaCMHOA16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/csur/BrienzaCMHOA16
Simone Brienza, Sena Efsun Cebeci, Seyed Saeid Masoumzadeh, Helmut Hlavacs, Öznur Özkasap, Giuseppe Anastasi:
A Survey on Energy Efficiency in P2P Systems: File Distribution, Content Streaming, and Epidemics. ACM Comput. Surv. 48(3): 36:1-36:37 (2016)
2014
[j18]
- view
  authority control:
- export record
  dblp key:
  - journals/fgcs/OzkasapCCK14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fgcs/OzkasapCCK14
Öznur Özkasap, Emrah Çem, Sena Cebeci, Tugba Koc:
Flat and hierarchical epidemics in P2P systems: Energy cost models and analysis. Future Gener. Comput. Syst. 36: 257-266 (2014)
[c38]
- view
  authority control:
- export record
  dblp key:
  - conf/nca/CebeciOA14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nca/CebeciOA14
Sena Efsun Cebeci, Öznur Özkasap, Giuseppe Anastasi:
Green Proxy-Based Approaches for BitTorrent. NCA 2014: 153-156
2013
[c36]
- view
  authority control:
- export record
  dblp key:
  - conf/cost/CebeciOA13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cost/CebeciOA13
Sena Cebeci, Öznur Özkasap, Giuseppe Anastasi:
Large Scale Analysis of BitTorrent Proxy for Green Internet File Sharing. EE-LSDS 2013: 264-270

a service of

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.