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

A Master Class on Recursion

Adventures Between Lower Bounds and Higher Altitudes, 2018, Vol.11011, p.610-633

2018

Volltextzugriff (PDF)

The spurs of D. H. Lehmer: Hamiltonian paths in neighbor-swap graphs of permutations

Designs, codes, and cryptography, 2017-07, Vol.84 (1-2), p.295-310

Verhoeff, Tom

2017

Volltextzugriff (PDF)

The spurs of D. H. Lehmer

Designs, codes, and cryptography, 2017-07, Vol.84 (1), p.295-310

Verhoeff, Tom

2017

Volltextzugriff (PDF)

The IOI is (not) a Science Olympiad

Informatics in education, 2006-01, Vol.5 (1), p.147-159

Verhoeff, Tom

2006

Volltextzugriff (PDF)

Staying DRY with OO and FP

OLYMPIADS IN INFORMATICS, 2024, p.113-128

VERHOEFF, Tom

2024

Volltextzugriff (PDF)

Settling Multiple Debts Efficiently: An Invitation to Computing Science

Informatics in education, 2004-01, Vol.3 (1), p.105-126

Verhoeff, Tom

2004

Volltextzugriff (PDF)

Understanding and Designing Recursive Functions via Syntactic Rewriting

OLYMPIADS IN INFORMATICS, 2023, p.99-119

VERHOEFF, Tom

2023

Volltextzugriff (PDF)

Look Ma, Backtracking without Recursion

OLYMPIADS IN INFORMATICS, 2021-06, p.119-132

VERHOEFF, Tom

2021

Volltextzugriff (PDF)

3D turtle geometry: artwork, theory, program equivalence and symmetry

International journal of arts and technology, 2010, Vol.3 (2/3), p.288

Verhoeff, Tom

2010

Volltextzugriff (PDF)

Exploration of modularity and reusability of domain-specific languages: an expression DSL in MetaMod

Computer languages, systems & structures, 2018-01, Vol.51, p.48-70

2018

Volltextzugriff (PDF)

Programming, Software Development, and Computer Science – The Golden Triangle

Olympiads in Informatics, 2019, Vol.13, p.157-170

VERHOEFF, Tom

2019

Volltextzugriff (PDF)

A Survey of Open Source Multiphysics Frameworks in Engineering

Procedia computer science, 2015, Vol.51, p.1088-1097

2015

Volltextzugriff (PDF)

Finding the median under IOI condition

Informatics in education, 2002-10, Vol.1 (1), p.73-92

2002

Volltextzugriff (PDF)

Problem Solving, Presenting, and Programming: A Matter of Giving and Taking

Olympiads in Informatics, 2016, Vol.10 (1), p.231-235

VERHOEFF, Tom

2016

Volltextzugriff (PDF)

A Master Class Software Engineering for Secondary Education

Informatics Education – The Bridge between Using and Understanding Computers, 2006, p.150-158

2006

Volltextzugriff (PDF)

Numerical Difficulties in Pre-University Informatics Education and Competitions

Informatics in education, 2003-01, Vol.2 (1), p.21-38

2003

Volltextzugriff (PDF)

Delay-insensitive codes-An overview

Distributed computing, 1988-03, Vol.3 (1), p.1-8

VERHOEFF, T

1988

Volltextzugriff (PDF)

Handling Sub-symmetry in Integer Programming using Activation Handlers

Graphs and Combinatorial Optimization: from Theory to Applications, 2024, Vol.13, p.95-107

2024

Volltextzugriff (PDF)

An updated table of minimum-distance bounds for binary linear codes

IEEE transactions on information theory, 1993-03, Vol.39 (2), p.662-677

1993

Volltextzugriff (PDF)

An updated table of minimum-distance bounds for binary linear codes

IEEE transactions on information theory, 1987-09, Vol.33 (5), p.665-680

Verhoeff, T.

1987

Volltextzugriff (PDF)

A Generic Solution for Syntax-Driven Model Co-evolution

Objects, Components, Models, Patterns, 2011, Vol.6705, p.36-51

2011

Volltextzugriff (PDF)

Finding the Median under IOI Conditions

Informatics in education, 2002, Vol.1 (1), p.73-92

2002

Volltextzugriff (PDF)

Halting Still Standing – Programs versus Specifications

Unifying Theories of Programming, 2010, Vol.6445, p.226-233

2010

Volltextzugriff (PDF)

Formal Methods for Model-Driven Engineering: 12th International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2012, Bertinoro, Italy, June 18-23, 2012. Advanced Lectures

1, 2012

Volltextzugriff (PDF)

Some new binary, quasi-cyclic codes

IEEE transactions on information theory, 1998-09, Vol.44 (5), p.1994-1996

1998

Volltextzugriff (PDF)

1 – 25 von 70

Menü

Weitere Dienste

Einstellungen

A Master Class on Recursion

The spurs of D. H. Lehmer: Hamiltonian paths in neighbor-swap graphs of permutations

The spurs of D. H. Lehmer

The IOI is (not) a Science Olympiad

Staying DRY with OO and FP

Settling Multiple Debts Efficiently: An Invitation to Computing Science

Understanding and Designing Recursive Functions via Syntactic Rewriting

Look Ma, Backtracking without Recursion

3D turtle geometry: artwork, theory, program equivalence and symmetry

Exploration of modularity and reusability of domain-specific languages: an expression DSL in MetaMod

Programming, Software Development, and Computer Science – The Golden Triangle

A Survey of Open Source Multiphysics Frameworks in Engineering

Finding the median under IOI condition

Problem Solving, Presenting, and Programming: A Matter of Giving and Taking

A Master Class Software Engineering for Secondary Education

Numerical Difficulties in Pre-University Informatics Education and Competitions

Delay-insensitive codes-An overview

Handling Sub-symmetry in Integer Programming using Activation Handlers

An updated table of minimum-distance bounds for binary linear codes

An updated table of minimum-distance bounds for binary linear codes

A Generic Solution for Syntax-Driven Model Co-evolution

Finding the Median under IOI Conditions

Halting Still Standing – Programs versus Specifications

Formal Methods for Model-Driven Engineering: 12th International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2012, Bertinoro, Italy, June 18-23, 2012. Advanced Lectures

Some new binary, quasi-cyclic codes

Suchergebnisse filtern