Albert Levi

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 Murat Ergun

> Home > Persons > Albert Levi

Publications

2011
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/cj/ErgunLS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cj/ErgunLS11
Murat Ergun, Albert Levi, Erkay Savas:
Increasing Resiliency in Multi-phase Wireless Sensor Networks: Generationwise Key Predistribution Approach. Comput. J. 54(4): 602-616 (2011)
2010
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/jim/LeviTLLBE10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jim/LeviTLLBE10
Albert Levi, Sinan Emre Tasçi, Young Jae Lee, Yong Jae Lee, Ersoy Bayramoglu, Murat Ergun:
Simple, extensible and flexible random key predistribution schemes for wireless sensor networks using reusable key pools. J. Intell. Manuf. 21(5): 635-645 (2010)
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/pimrc/ErgunL10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pimrc/ErgunL10
Murat Ergun, Albert Levi:
Using combined keying materials for key distribution in wireless sensor networks. PIMRC 2010: 2603-2608
2009
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/iscis/ErgunLS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iscis/ErgunLS09
Murat Ergun, Albert Levi, Erkay Savas:
A resilient key predistribution scheme for multiphase wireless sensor networks. ISCIS 2009: 375-380

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.