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

Indoor and Outdoor Surface-Growing Fungi Contamination at Higher Institutional Buildings in a Malaysian University

IOP conference series. Earth and environmental science, 2018-04, Vol.140 (1), p.12118

2018

Volltextzugriff (PDF)

MEFV gene is a probable susceptibility gene for Behçet's disease

Scandinavian journal of rheumatology, 2005-02, Vol.34 (1), p.56-58

2005

Volltextzugriff (PDF)

The anonymity and proximity factors in group decision support systems

Decision Support Systems, 1995-05, Vol.14 (1), p.75-83

1995

Volltextzugriff (PDF)

Process frame: A cognitive device for recursion comprehension

Computers and education, 1995, Vol.24 (1), p.31-36

Er, M.C.

1995

Volltextzugriff (PDF)

On Generating the N-ary Reflected Gray Codes

IEEE transactions on computers, 1984-08, Vol.C-33 (8), p.739-741

Er, M. C.

1984

Volltextzugriff (PDF)

A simple algorithm for generating non regular trees in lexicographic order

Computer journal, 1988-01, Vol.31 (1), p.61-64

ER, M. C

1988

Volltextzugriff (PDF)

Decision Support Systems: A summary, problems, and future trends

Decision Support Systems, 1988-09, Vol.4 (3), p.355-363

Er, M.C.

1988

Volltextzugriff (PDF)

Indoor Fungal Growth on Variable Antifungal at Different Wall Finishing on Plasterboard

International journal of engineering & technology (Dubai), 2018-08, Vol.7 (3.23), p.53

2018

Volltextzugriff (PDF)

A General Algorithm for Finding a Shortest Path between two n-Configurations

Information sciences, 1987, Vol.42 (2), p.137-141

Er, M.C.

1987

Volltextzugriff (PDF)

An optimal algorithm for Reve's puzzle

Information sciences, 1988, Vol.45 (1), p.39-49

Er, M.C.

1988

Volltextzugriff (PDF)

Computing sums of order-k Fibonacci numbers in log time

Information processing letters, 1983-07, Vol.17 (1), p.1-5

Er, M.C.

1983

Volltextzugriff (PDF)

Practical considerations of global and local variables

Software, practice & experience, 1985-05, Vol.15 (5), p.499-502

Er, M. C.

1985

Volltextzugriff (PDF)

Optimizing procedure calls and returns

Software, practice & experience, 1983-10, Vol.13 (10), p.921-939

Er, M. C.

1983

Volltextzugriff (PDF)

An iterative algorithm for the cyclic towers of Hanoi problem

International Journal of Computer & Information Sciences, 1984-04, Vol.13 (2), p.123-129

ER, M. C

1984

Volltextzugriff (PDF)

A Linear space algorithm for solving the towers of hanoi problem by using a virtual disc

Information sciences, 1989-02, Vol.47 (1), p.47-52

Er, M.C.

1989

Volltextzugriff (PDF)

A fast algorithm for generating set partitions

Computer journal, 1988-06, Vol.31 (3), p.283-284

ER, M. C

1988

Volltextzugriff (PDF)

A loopless and optimal algorithm for the cyclic towers of hanoi problem

Information sciences, 1987-08, Vol.42 (3), p.283-287

Er, M.C.

1987

Volltextzugriff (PDF)

Lexicographic listing and ranking of t-ary trees

Computer journal, 1987-12, Vol.30 (6), p.569-572

ER, M. C

1987

Volltextzugriff (PDF)

Remark on "Algorithm 246: Graycode [Z]"

ACM transactions on mathematical software, 1985-12, Vol.11 (4), p.441-443

Er, M. C.

1985

Volltextzugriff (PDF)

A new algorithm for generating binary trees using rotations

Computer journal, 1989-10, Vol.32 (5), p.470-473

ER, M. C

1989

Volltextzugriff (PDF)

The Use of Computers in Accountancy Courses: A New Perspective

Accounting and business research, 1989-09, Vol.19 (76), p.319-326

1989

Volltextzugriff (PDF)

Efficient generation of binary trees from inorder-postorder sequences

Information sciences, 1986-12, Vol.40 (2), p.175-181

Er, M.C.

1986

Volltextzugriff (PDF)

Termination-indicator technique as structured programming tool

Information and software technology, 1989-12, Vol.31 (10), p.529-534

Er, MC

1989

Volltextzugriff (PDF)

Classes of admissible permutations that are generatable by depth-first traversals of ordered trees

Computer journal, 1989-02, Vol.32 (1), p.76-85

ER, M. C

1989

Volltextzugriff (PDF)

A smooth reshuffling algorithm for solving the Bulterman's problem

Computer journal, 1988-12, Vol.31 (6), p.557-560

ER, M. C

1988

Volltextzugriff (PDF)

1 – 25 von 16.176

Menü

Weitere Dienste

Einstellungen

Indoor and Outdoor Surface-Growing Fungi Contamination at Higher Institutional Buildings in a Malaysian University

MEFV gene is a probable susceptibility gene for Behçet's disease

The anonymity and proximity factors in group decision support systems

Process frame: A cognitive device for recursion comprehension

On Generating the N-ary Reflected Gray Codes

A simple algorithm for generating non regular trees in lexicographic order

Decision Support Systems: A summary, problems, and future trends

Indoor Fungal Growth on Variable Antifungal at Different Wall Finishing on Plasterboard

A General Algorithm for Finding a Shortest Path between two n-Configurations

An optimal algorithm for Reve's puzzle

Computing sums of order-k Fibonacci numbers in log time

Practical considerations of global and local variables

Optimizing procedure calls and returns

An iterative algorithm for the cyclic towers of Hanoi problem

A Linear space algorithm for solving the towers of hanoi problem by using a virtual disc

A fast algorithm for generating set partitions

A loopless and optimal algorithm for the cyclic towers of hanoi problem

Lexicographic listing and ranking of t-ary trees

Remark on "Algorithm 246: Graycode [Z]"

A new algorithm for generating binary trees using rotations

The Use of Computers in Accountancy Courses: A New Perspective

Efficient generation of binary trees from inorder-postorder sequences

Termination-indicator technique as structured programming tool

Classes of admissible permutations that are generatable by depth-first traversals of ordered trees

A smooth reshuffling algorithm for solving the Bulterman's problem

Suchergebnisse filtern