Emre Kiciman

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 Mike Y. Chen

> Home > Persons > Emre Kiciman

Publications

2004
[c10]
- view
  - electronic edition @ usenix.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/nsdi/ChenAKPFB04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nsdi/ChenAKPFB04
Mike Y. Chen, Anthony J. Accardi, Emre Kiciman, David A. Patterson, Armando Fox, Eric A. Brewer:
Path-Based Failure and Evolution Management. NSDI 2004: 309-322
2003
[c8]
- view
  - electronic edition @ usenix.org
  - no references & citations available
- export record
  dblp key:
  - conf/hotos/ChenKAFB03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hotos/ChenKAFB03
Mike Y. Chen, Emre Kiciman, Anthony J. Accardi, Armando Fox, Eric A. Brewer:
Using Runtime Paths for Macroanalysis. HotOS 2003: 79-84
2002
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/dsn/ChenKFFB02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dsn/ChenKFFB02
Mike Y. Chen, Emre Kiciman, Eugene Fratkin, Armando Fox, Eric A. Brewer:
Pinpoint: Problem Determination in Large, Dynamic Internet Services. DSN 2002: 595-604
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/sigopsE/ChenKB02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sigopsE/ChenKB02
Mike Y. Chen, Emre Kiciman, Eric A. Brewer:
An online evolutionary approach to developing internet services. ACM SIGOPS European Workshop 2002: 161-164

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.