Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Douglas Baldwin

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 Willy Hereman

> Home > Persons > Douglas Baldwin

Publications

2010
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/ijcm/BaldwinH10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcm/BaldwinH10
Douglas Baldwin, Willy Hereman:
A symbolic algorithm for computing recursion operators of nonlinear partial differential equations. Int. J. Comput. Math. 87(5): 1094-1119 (2010)
2004
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/cphysics/BaldwinGH04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cphysics/BaldwinGH04
Douglas Baldwin, Ünal Göktas, Willy Hereman:
Symbolic computation of hyperbolic tangent solutions for nonlinear differential-difference equations. Comput. Phys. Commun. 162(3): 203-217 (2004)
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jsc/BaldwinGHHMM04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsc/BaldwinGHHMM04
Douglas Baldwin, Ünal Göktas, Willy Hereman, Linda Hong, Ryan S. Martino, Joel C. Miller:
Symbolic computation of exact solutions expressible in hyperbolic and elliptic functions for nonlinear PDEs. J. Symb. Comput. 37(6): 669-705 (2004)

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.