![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Di Fang
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i15]Run He, Huiping Zhuang, Di Fang, Yizhu Chen, Kai Tong, Cen Chen:
REAL: Representation Enhanced Analytic Learning for Exemplar-free Class-incremental Learning. CoRR abs/2403.13522 (2024) - [i14]Huiping Zhuang, Yizhu Chen, Di Fang, Run He, Kai Tong, Hongxin Wei, Ziqian Zeng, Cen Chen:
G-ACIL: Analytic Learning for Exemplar-Free Generalized Class Incremental Learning. CoRR abs/2403.15706 (2024) - [i13]Di Fang, Diyi Liu, Rahul Sarkar:
Time-dependent Hamiltonian Simulation via Magnus Expansion: Algorithm and Superconvergence. CoRR abs/2405.12925 (2024) - [i12]Huiping Zhuang, Run He, Kai Tong, Di Fang, Han Sun, Haoran Li, Tianyi Chen, Ziqian Zeng:
Analytic Federated Learning. CoRR abs/2405.16240 (2024) - [i11]Huiping Zhuang, Di Fang, Kai Tong, Yuchen Liu, Ziqian Zeng, Xu Zhou, Cen Chen:
Online Analytic Exemplar-Free Continual Learning with Large Models for Imbalanced Autonomous Driving Task. CoRR abs/2405.17779 (2024) - 2023
- [j9]Di Fang, Lin Lin, Yu Tong:
Time-marching based quantum solvers for time-dependent linear differential equations. Quantum 7: 955 (2023) - [j8]Di Fang, Albert Tres Vilanova:
Observable Error Bounds of the Time-Splitting Scheme for Quantum-Classical Molecular Dynamics. SIAM J. Numer. Anal. 61(1): 26-44 (2023) - 2022
- [j7]Dong An, Di Fang, Lin Lin
:
Parallel transport dynamics for mixed quantum states with applications to time-dependent density functional theory. J. Comput. Phys. 451: 110850 (2022) - [j6]Dong An, Di Fang, Lin Lin:
Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation. Quantum 6: 690 (2022) - [i10]Dong An, Di Fang, Stephen Jordan, Jin-Peng Liu, Guang Hao Low, Jiasu Wang:
Efficient quantum algorithm for nonlinear reaction-diffusion equations and energy estimation. CoRR abs/2205.01141 (2022) - [i9]Zhenning Cai, Di Fang, Jianfeng Lu:
Asymptotic analysis of diabatic surface hopping algorithm in the adiabatic and non-adiabatic limits. CoRR abs/2205.02312 (2022) - [i8]Di Fang, Lin Lin, Yu Tong:
Time-marching based quantum solvers for time-dependent linear differential equations. CoRR abs/2208.06941 (2022) - [i7]Yonah Borns-Weil, Di Fang:
Uniform observable error bounds of Trotter formulae for the semiclassical Schrödinger equation. CoRR abs/2208.07957 (2022) - [i6]Hsin-Yuan Huang, Yu Tong, Di Fang, Yuan Su:
Learning many-body Hamiltonians with Heisenberg-limited scaling. CoRR abs/2210.03030 (2022) - 2021
- [j5]Dong An, Di Fang, Lin Lin:
Time-dependent unbounded Hamiltonian simulation with vector norm scaling. Quantum 5: 459 (2021) - [i5]Dong An, Di Fang, Lin Lin:
Parallel transport dynamics for mixed quantum states with applications to time-dependent density functional theory. CoRR abs/2105.14755 (2021) - [i4]Di Fang, Albert Tres:
Observable Error Bounds of the Time-splitting Scheme for Quantum-Classical Molecular Dynamics. CoRR abs/2108.08245 (2021) - [i3]Dong An, Di Fang, Lin Lin:
Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics. CoRR abs/2111.03103 (2021) - 2020
- [i2]Dong An, Di Fang, Lin Lin:
Time-dependent unbounded Hamiltonian simulation with vector norm scaling. CoRR abs/2012.13105 (2020)
2010 – 2019
- 2018
- [j4]Di Fang, Shi Jin, Christof Sparber:
An Efficient Time-splitting Method for the Ehrenfest Dynamics. Multiscale Model. Simul. 16(2): 900-921 (2018) - [j3]Di Fang, Jianfeng Lu
:
A Diabatic Surface Hopping Algorithm Based on Time Dependent Perturbation Theory and Semiclassical Analysis. Multiscale Model. Simul. 16(4): 1603-1622 (2018) - 2015
- [j2]Luchun Yan
, Jiemin Liu, Di Fang:
Use of a Modified Vector Model for Odor Intensity Prediction of Odorant Mixtures. Sensors 15(3): 5697-5709 (2015) - 2014
- [j1]Hui Gao, Tiejun Lv, Di Fang, Shaoshi Yang
, Chau Yuen:
Limited Feedback-Based Interference Alignment for Interfering Multi-Access Channels. IEEE Commun. Lett. 18(4): 540-543 (2014) - [i1]Hui Gao, Tiejun Lv, Di Fang, Shaoshi Yang, Chau Yuen:
Limited Feedback-Based Interference Alignment for Interfering Multi-Access Channels. CoRR abs/1402.0391 (2014) - 2013
- [c3]Di Fang, Tiejun Lv:
Interference alignment design for two-cell MIMO uplink systems with limited feedback. WPMC 2013: 1-4 - 2012
- [c2]Di Fang, Sixi Su, Tiejun Lv, Hui Gao, Wei Long:
Joint quantization strategy for uplink cooperative cellular interference alignment with limited feedback. MILCOM 2012: 1-5 - 2011
- [c1]Peiyuan Wan, Wei Lang, Di Fang, Wei Cui, Pingfen Lin:
A 1.2-V 250-MS/s 8-bit pipelined ADC in 0.13-µm CMOS. ASICON 2011: 986-989
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-14 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint