default search action

combined dblp search
author search
venue search
publication search

ask others

Lev M. Berkovich

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2000 – 2009

see FAQ

What is the meaning of the colors in the publication lists?

2006
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/cca/Berkovich06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cca/Berkovich06
Lev M. Berkovich:
Factorization of self-conjugated and reducible linear differential operators. ACM Commun. Comput. Algebra 40(2): 35-37 (2006)
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/pcs/BerkovichE06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pcs/BerkovichE06
Lev M. Berkovich, S. A. Evlakhov:
On the Euler-Imshenetskii-Darboux transformation of linear second-order equations. Program. Comput. Softw. 32(3): 154-165 (2006)
2005
[c1]
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/birthday/BerkovichB05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/birthday/BerkovichB05
Lev M. Berkovich, Ephraim Fedor L. Berkovitch:
An Algorithm for Factorization of Some Second Order Differential Equations. Algorithmic Algebra and Logic 2005: 41-47
2000
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/pcs/Berkovich00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pcs/Berkovich00
Lev M. Berkovich:
Exact linearization of nonlinear ordinary autonomous differential equations. Program. Comput. Softw. 26(1): 25-27 (2000)

Coauthor Index

see FAQ

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.