Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Luo Mai

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 Andrei-Octavian Brabete

> Home > Persons > Luo Mai

Publications

2024
[i14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2401-14351
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2401-14351
Yao Fu, Leyang Xue, Yeqi Huang, Andrei-Octavian Brabete, Dmitrii Ustiugov, Yuvraj Patel, Luo Mai:
ServerlessLLM: Locality-Enhanced Serverless Inference for Large Language Models. CoRR abs/2401.14351 (2024)
2020
[c9]
- view
  - electronic edition @ usenix.org (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/osdi/MaiLWFBP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/osdi/MaiLWFBP20
Luo Mai, Guo Li, Marcel Wagenländer, Konstantinos Fertakis, Andrei-Octavian Brabete, Peter R. Pietzuch:
KungFu: Making Training in Distributed Machine Learning Adaptive. OSDI 2020: 937-954
2019
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/sigops/MaiKLBP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigops/MaiKLBP19
Luo Mai, Alexandros Koliousis, Guo Li, Andrei-Octavian Brabete, Peter R. Pietzuch:
Taming Hyper-parameters in Deep Learning Systems. ACM SIGOPS Oper. Syst. Rev. 53(1): 52-58 (2019)

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.