Behnaz Arzani

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 Daniel Crankshaw

> Home > Persons > Behnaz Arzani

Publications

2024
[c21]
- view
  - electronic edition @ usenix.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/nsdi/NamyarAKSCKGR24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nsdi/NamyarAKSCKGR24
Pooria Namyar, Behnaz Arzani, Srikanth Kandula, Santiago Segarra, Daniel Crankshaw, Umesh Krishnaswamy, Ramesh Govindan, Himanshu Raj:
Solving Max-Min Fair Resource Allocations Quickly on Large Graphs. NSDI 2024
2023
[i10]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2305-13792
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2305-13792
Pooria Namyar, Behnaz Arzani, Daniel Crankshaw, Daniel S. Berger, Kevin Hsieh, Srikanth Kandula, Ramesh Govindan:
Mitigating the Performance Impact of Network Failures in Public Clouds. CoRR abs/2305.13792 (2023)
[i9]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2310-09699
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2310-09699
Pooria Namyar, Behnaz Arzani, Srikanth Kandula, Santiago Segarra, Daniel Crankshaw, Umesh Krishnaswamy, Ramesh Govindan, Himanshu Raj:
Solving Max-Min Fair Resource Allocations Quickly on Large Graphs. CoRR abs/2310.09699 (2023)

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.