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

The AETG system: an approach to testing based on combinatorial design

IEEE transactions on software engineering, 1997-07, Vol.23 (7), p.437-444

1997

Volltextzugriff (PDF)

Surpassing the information theoretic bound with fusion trees

Journal of computer and system sciences, 1993-12, Vol.47 (3), p.424-436

1993

Volltextzugriff (PDF)

On the Complexity of Dualization of Monotone Disjunctive Normal Forms

Journal of algorithms, 1996-11, Vol.21 (3), p.618-628

1996

Volltextzugriff (PDF)

Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Journal of computer and system sciences, 1994-06, Vol.48 (3), p.533-551

1994

Volltextzugriff (PDF)

Data Structures for Traveling Salesmen

Journal of algorithms, 1995-05, Vol.18 (3), p.432-479

1995

Volltextzugriff (PDF)

Lower Bounds for Fully Dynamic Connectivity Problems in Graphs

Algorithmica, 1998-11, Vol.22 (3), p.351-362

1998

Volltextzugriff (PDF)

A Priority Queue Transform

Algorithm Engineering, 1999, p.243-257

1999

Volltextzugriff (PDF)

Algorithms for computing evolutionary similarity measures with length independent gap penalties

Bulletin of mathematical biology, 1984-01, Vol.46 (4), p.553-566

Fredman, M.L

1984

Volltextzugriff (PDF)

On the size of separating systems and families of perfect hash functions

SIAM journal on algebraic and discrete methods, 1984-03, Vol.5 (1), p.61-68

1984

Volltextzugriff (PDF)

On the efficiency of pairing heaps and related data structures

Journal of the ACM, 1999-07, Vol.46 (4), p.473-501

Fredman, Michael L

1999

Volltextzugriff (PDF)

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM, 1987-07, Vol.34 (3), p.596-615

1987

Volltextzugriff (PDF)

Three Stacks

Journal of algorithms, 1994-07, Vol.17 (1), p.45-70

1994

Volltextzugriff (PDF)

Storing a sparse table with 0(1) worst case access time

Journal of the ACM, 1984-06, Vol.31 (3), p.538-544

1984

Volltextzugriff (PDF)

Optimal biweighted binary trees and the complexity of maintaining partial sums

SIAM journal on computing, 1999, Vol.28 (1), p.1-9

1999

Volltextzugriff (PDF)

Worst case constant time priority queue

The Journal of systems and software, 2005-12, Vol.78 (3), p.249-256

2005

Volltextzugriff (PDF)

The number of tests required to search an unordered table

Information processing letters, 2003-07, Vol.87 (2), p.85-88

Fredman, Michael L.

2003

Volltextzugriff (PDF)

Refined complexity analysis for heap operations

Journal of computer and system sciences, 1987-12, Vol.35 (3), p.269-284

1987

Volltextzugriff (PDF)

Lower bounds for fully dynamic connectivity problems in graphs: Dynamic graph algorithms

Algorithmica, 1998, Vol.22 (3), p.351-362

1998

Volltextzugriff (PDF)

Adaptive Sorting and the Information Theoretic Lower Bound

Lecture notes in computer science, 2003, Vol.2607, p.654-662

2003

Volltextzugriff (PDF)

The spanning bound as a measure of range query complexity

Journal of algorithms, 1981-01, Vol.2 (1), p.77-87

Fredman, M.L

1981

Volltextzugriff (PDF)

Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums

SIAM journal on computing, 1998-01, Vol.28 (1), p.1-9

1998

Volltextzugriff (PDF)

Weighted binary tree for concurrent searching

Journal of algorithms, 1996, Vol.20 (1), p.87-112

1996

Volltextzugriff (PDF)

BLASTING through the information theoretic barrier with FUSION TREES

Proceedings of the twenty-second annual ACM symposium on Theory of Computing, 1990, p.1-7

1990

Volltextzugriff (PDF)

New techniques for designing qualitatively independent systems

Journal of combinatorial designs, 1998, Vol.6 (6), p.411-416

1998

Volltextzugriff (PDF)

Hadamard Spectroscopy

Journal of the Optical Society of America (1930), 1970-12, Vol.60 (12), p.1664

1970

Volltextzugriff (PDF)

1 – 25 von 193

Menü

Weitere Dienste

Einstellungen

The AETG system: an approach to testing based on combinatorial design

Surpassing the information theoretic bound with fusion trees

On the Complexity of Dualization of Monotone Disjunctive Normal Forms

Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Data Structures for Traveling Salesmen

Lower Bounds for Fully Dynamic Connectivity Problems in Graphs

A Priority Queue Transform

Algorithms for computing evolutionary similarity measures with length independent gap penalties

On the size of separating systems and families of perfect hash functions

On the efficiency of pairing heaps and related data structures

Fibonacci heaps and their uses in improved network optimization algorithms

Three Stacks

Storing a sparse table with 0(1) worst case access time

Optimal biweighted binary trees and the complexity of maintaining partial sums

Worst case constant time priority queue

The number of tests required to search an unordered table

Refined complexity analysis for heap operations

Lower bounds for fully dynamic connectivity problems in graphs: Dynamic graph algorithms

Adaptive Sorting and the Information Theoretic Lower Bound

The spanning bound as a measure of range query complexity

Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums

Weighted binary tree for concurrent searching

BLASTING through the information theoretic barrier with FUSION TREES

New techniques for designing qualitatively independent systems

Hadamard Spectroscopy

Suchergebnisse filtern