Arun Iyengar

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 Lorenzo Alvisi

> Home > Persons > Arun Iyengar

Publications

2010
[j20]
- view
  authority control:
- export record
  dblp key:
  - journals/tdsc/GaoDZAI10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tdsc/GaoDZAI10
Lei Gao, Michael Dahlin, Jiandan Zheng, Lorenzo Alvisi, Arun Iyengar:
Dual-Quorum: A Highly Available and Consistent Replication System for Edge Services. IEEE Trans. Dependable Secur. Comput. 7(2): 159-174 (2010)
2005
[c26]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/middleware/GaoDZAI05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/middleware/GaoDZAI05
Lei Gao, Michael Dahlin, Jiandan Zheng, Lorenzo Alvisi, Arun Iyengar:
Dual-Quorum Replication for Edge Services. Middleware 2005: 184-204
2002
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/toit/YinADI02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toit/YinADI02
Jian Yin, Lorenzo Alvisi, Michael Dahlin, Arun Iyengar:
Engineering web cache consistency. ACM Trans. Internet Techn. 2(3): 224-259 (2002)
2001
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/www/YinADI01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/www/YinADI01
Jian Yin, Lorenzo Alvisi, Michael Dahlin, Arun Iyengar:
Engineering server-driven consistency for large scale dynamic Web services. WWW 2001: 45-57

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.