Z. Li

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 A. Odian

> Home > Persons > Z. Li

Publications

2023
[i2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2303-06311
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2303-06311
S. Li, I. Ostrovskiy, Z. Li, L. Yang, S. Al Kharusi, G. Anton, I. Badhrees, P. S. Barbeau, D. Beck, V. Belov, T. Bhatta, M. Breidenbach, T. Brunner, G. F. Cao, W. R. Cen, C. Chambers, B. Cleveland, M. Coon, A. Craycraft, T. Daniels, L. Darroch, S. J. Daugherty, J. Davis, S. Delaquis, A. Der Mesrobian-Kabakian, R. DeVoe, J. Dilling, A. Dolgolenko, M. J. Dolinski, J. Echevers, W. Fairbank Jr., D. Fairbank, J. Farine, S. Feyzbakhsh, P. Fierlinger, Y. S. Fu, D. Fudenberg, P. Gautam, R. Gornea, G. Gratta, C. Hall, E. V. Hansen, J. Hoessl, P. Hufschmidt, M. Hughes, A. Iverson, A. Jamil, C. Jessiman, M. J. Jewell, A. Johnson, A. Karelin, L. J. Kaufman, T. Koffas, R. Krücken, A. Kuchenkov, K. S. Kumar, Y. Lan, A. Larson, B. G. Lenardo, D. S. Leonard, G. S. Li, C. Licciardi, Y. H. Lin, R. MacLellan, T. McElroy, T. Michel, B. Mong, D. C. Moore, K. Murray, O. Njoya, O. Nusair, A. Odian, A. Perna, A. Piepke, A. Pocar, F. Retière, A. L. Robinson, P. C. Rowson, J. Runge, S. Schmidt, D. Sinclair, K. Skarpaas, A. K. Soma, V. Stekhanov, M. Tarka, S. Thibado, J. Todd, T. Tolba, T. I. Totev, R. Tsang:
Generative Adversarial Networks for Scintillation Signal Simulation in EXO-200. CoRR abs/2303.06311 (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.