UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Study of the attentive behavior of novice and expert map users using eye tracking

Cartography and geographic information science, 2014-01, Vol.41 (1), p.37-54

2014

Volltextzugriff (PDF)

Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions

IEEE transactions on information theory, 2008-09, Vol.54 (9), p.4335-4339

2008

Volltextzugriff (PDF)

On the reduction of Yutsis graphs

Discrete mathematics, 2007-05, Vol.307 (11), p.1506-1515

2007

Volltextzugriff (PDF)

CALCULATING LEAST RISK PATHS IN 3D INDOOR SPACE

International archives of the photogrammetry, remote sensing and spatial information sciences., 2013-01, Vol.XL-2/W2, p.113-120

2013

Volltextzugriff (PDF)

Analyzing the applicability of the least risk path algorithm in indoor space

ISPRS annals of the photogrammetry, remote sensing and spatial information sciences, 2013-11, Vol.II-4/W1, p.19-26

2013

Volltextzugriff (PDF)

GYutsis: heuristic based calculation of general recoupling coefficients

Computer physics communications, 2003-08, Vol.154 (3), p.219-232

2003

Volltextzugriff (PDF)

New heuristic approach to the calculation of general recoupling coefficients

Computer physics communications, 2003-04, Vol.151 (3), p.354-368

2003

Volltextzugriff (PDF)

Prospects and limitations of full-text index structures in genome analysis

Nucleic acids research, 2012-08, Vol.40 (15), p.6993-7015

2012

Volltextzugriff (PDF)

On rotation distance between binary coupling trees and applications for 3nj-coefficients

Computer physics communications, 1999-06, Vol.119 (2-3), p.99-114

1999

Volltextzugriff (PDF)

Calculation of general recoupling coefficients using graphical methods

Computer physics communications, 1997, Vol.101 (1), p.155-170

1997

Volltextzugriff (PDF)

Optimal data exchange algorithms on star graphs

Computers & mathematics with applications (1987), 1994-02, Vol.27 (3), p.21-25

1994

Volltextzugriff (PDF)

Numerical methods for solving radial Schrödinger equations

Journal of computational and applied mathematics, 1989-12, Vol.28, p.391-401

1989

Volltextzugriff (PDF)

On bounds for the rotation distance between binary coupling trees

Electronic notes in discrete mathematics, 2000-04, Vol.3, p.1-5

2000

Volltextzugriff (PDF)

To be or not to be Yutsis: Algorithms for the decision problem

Computer physics communications, 2005-12, Vol.173 (1), p.61-70

2005

Volltextzugriff (PDF)

On the smallest maximal partial ovoids and spreads of the generalized quadrangles W ( q ) and Q ( 4 , q )

European journal of combinatorics, 2007-10, Vol.28 (7), p.1934-1942

2007

Volltextzugriff (PDF)

A parallel fifth-order algorithm for the numerical solution of Volterra equations

Journal of computational and applied mathematics, 1996-07, Vol.71 (1), p.115-124

1996

Volltextzugriff (PDF)

Algorithms for generating labelled graphs with given degree

Journal of computational and applied mathematics, 1991-11, Vol.37 (1), p.187-194

1991

Volltextzugriff (PDF)

To be or not to be Yutsis

Electronic notes in discrete mathematics, 2004-10, Vol.17, p.275-279

2004

Volltextzugriff (PDF)

A parallel iterated correction algorithm for the numerical solution of Volterra equations

Applied numerical mathematics, 1995-03, Vol.17 (1), p.19-32

1995

Volltextzugriff (PDF)

Total exchange algorithms on ‘sandwich graphs’

Computers & mathematics with applications (1987), 1991, Vol.22 (10), p.45-48

1991

Volltextzugriff (PDF)

Parallel computation of recoupling coefficients using transputers

Computer physics communications, 1992, Vol.71 (3), p.285-304

1992

Volltextzugriff (PDF)

On the diameter of the rotation graph of binary coupling trees

Discrete mathematics, 2002-02, Vol.245 (1), p.1-18

2002

Volltextzugriff (PDF)

Some finite difference methods for computing eigenvalues and eigenvectors of special two-point boundary value problems

Journal of computational and applied mathematics, 1987, Vol.20, p.211-217

1987

Volltextzugriff (PDF)

On rotation distance between binary coupling trees and applications for 3 nj-coefficients

Computer physics communications, 1999, Vol.119 (2), p.99-114

1999

Volltextzugriff (PDF)

(Extended) Numerov method for computing eigenvalues of specific Schrodinger equations

Journal of physics. A, Mathematical and general, 1987-09, Vol.20 (13), p.4153-4160

1987

Volltextzugriff (PDF)

1 – 25 von 55

Menü

Weitere Dienste

Einstellungen

Study of the attentive behavior of novice and expert map users using eye tracking

Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions

On the reduction of Yutsis graphs

CALCULATING LEAST RISK PATHS IN 3D INDOOR SPACE

Analyzing the applicability of the least risk path algorithm in indoor space

GYutsis: heuristic based calculation of general recoupling coefficients

New heuristic approach to the calculation of general recoupling coefficients

Prospects and limitations of full-text index structures in genome analysis

On rotation distance between binary coupling trees and applications for 3nj-coefficients

Calculation of general recoupling coefficients using graphical methods

Optimal data exchange algorithms on star graphs

Numerical methods for solving radial Schrödinger equations

On bounds for the rotation distance between binary coupling trees

To be or not to be Yutsis: Algorithms for the decision problem

On the smallest maximal partial ovoids and spreads of the generalized quadrangles W ( q ) and Q ( 4 , q )

A parallel fifth-order algorithm for the numerical solution of Volterra equations

Algorithms for generating labelled graphs with given degree

To be or not to be Yutsis

A parallel iterated correction algorithm for the numerical solution of Volterra equations

Total exchange algorithms on ‘sandwich graphs’

Parallel computation of recoupling coefficients using transputers

On the diameter of the rotation graph of binary coupling trees

Some finite difference methods for computing eigenvalues and eigenvectors of special two-point boundary value problems

On rotation distance between binary coupling trees and applications for 3 nj-coefficients

(Extended) Numerov method for computing eigenvalues of specific Schrodinger equations

Suchergebnisse filtern