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

Generating hard instances of lattice problems (extended abstract)

Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, 1996, p.99-108

Ajtai, M.

1996

Volltextzugriff (PDF)

Dementia-Friendly Communities: a Review of Current Literature and Reflections on Implementation

Current geriatrics reports, 2020-09, Vol.9 (3), p.176-182

2020

Volltextzugriff (PDF)

A comparison of intermediate filament markers for presumptive astroglia in the developing rat neocortex: immunostaining against nestin reveals more detail, than GFAP or vimentin

International journal of developmental neuroscience, 2001-02, Vol.19 (1), p.101-108

2001

Volltextzugriff (PDF)

The complexity of the Pigeonhole Principle

Combinatorica (Budapest. 1981), 1994-12, Vol.14 (4), p.417-433

Ajtai, M.

1994

Volltextzugriff (PDF)

1-formulae on finite structures

Annals of pure and applied logic, 1983-07, Vol.24 (1), p.1

AJTAI, M

1983

Volltextzugriff (PDF)

Generating Hard Instances of the Short Basis Problem

Automata, Languages and Programming, 1999, p.1-9

1999

Volltextzugriff (PDF)

Glial fibrillary acidic protein expression but no glial demarcation follows the lesion in the molecular layer of cerebellum

Brain research, 1998-08, Vol.802 (1), p.285-288

1998

Volltextzugriff (PDF)

Sampling short lattice vectors and the closest lattice vector problem

Proceedings - IEEE Conference on Computational Complexity, 2002, p.53-57

2002

Volltextzugriff (PDF)

Recursive construction for 3-regular expanders

Combinatorica (Budapest. 1981), 1994-12, Vol.14 (4), p.379-416

Ajtai, M.

1994

Volltextzugriff (PDF)

Determinism versus Nondeterminism for Linear Time RAMs with Memory Restrictions

Journal of computer and system sciences, 2002-08, Vol.65 (1), p.2-37

Ajtai, Miklós

2002

Volltextzugriff (PDF)

Reactive glia support and guide axon growth in the rat thalamus during the first postnatal week. A sharply timed transition from permissive to non‐permissive stage

International journal of developmental neuroscience, 2001-10, Vol.19 (6), p.589-597

2001

Volltextzugriff (PDF)

A sieve algorithm for the shortest lattice vector problem

Proceedings of the thirty-third annual ACM symposium on Theory of computing, 2001, p.601-610

2001

Volltextzugriff (PDF)

Characteristics of glial reaction in the perinatal rat cortex: effect of lesion size in the 'critical period'

Neural plasticity, 2000, Vol.7 (3), p.147-165

2000

Volltextzugriff (PDF)

Capability for Reactive Gliosis Develops Prenatally in the Diencephalon but Not in the Cortex of Rats

Experimental neurology, 1997-07, Vol.146 (1), p.151-158

1997

Volltextzugriff (PDF)

A lower bound for finding predecessors in Yao's cell probe model

Combinatorica (Budapest. 1981), 1988-09, Vol.8 (3), p.235-247

AJTAI, M

1988

Volltextzugriff (PDF)

Axon growth failure following corpus callosum lesions precedes glial reaction in perinatal rats

Anatomy and Embryology, 2000-10, Vol.202 (4), p.313-321

2000

Volltextzugriff (PDF)

Lesions do not provoke GFAP-expression in the GFAP-immunonegative areas of the teleost brain

Annals of anatomy, 2000-09, Vol.182 (5), p.459-463

2000

Volltextzugriff (PDF)

First-order definability on finite structures

Annals of pure and applied logic, 1989-12, Vol.45 (3), p.211-225

Ajtai, M.

1989

Volltextzugriff (PDF)

An Architecture for Provably Secure Computation

LATIN 2006: Theoretical Informatics, 2006, p.56-67

2006

Volltextzugriff (PDF)

Sorting in c log n parallel steps

Combinatorica (Budapest. 1981), 1983-03, Vol.3 (1), p.1-19

1983

Volltextzugriff (PDF)

Compactly encoding unstructured inputs with differential compression

Journal of the ACM, 2002-05, Vol.49 (3), p.318-367

2002

Volltextzugriff (PDF)

Neuroimaging of dementia

Neurologic clinics, 2014-02, Vol.32 (1), p.59-93

2014

Volltextzugriff (PDF)

On optimal matchings

Combinatorica (Budapest. 1981), 1984-12, Vol.4 (4), p.259-264

1984

Volltextzugriff (PDF)

An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem

Cryptography and Lattices, 2001, Vol.2146, p.1-3

2001

Volltextzugriff (PDF)

Random lattices and a conjectured 0 - 1 law about their polynomial time computable properties

Annual Symposium on Foundations of Computer Science, 2002, p.733-742

Ajtai, M.

2002

Volltextzugriff (PDF)

1 – 25 von 113

Menü

Weitere Dienste

Einstellungen

Generating hard instances of lattice problems (extended abstract)

Dementia-Friendly Communities: a Review of Current Literature and Reflections on Implementation

A comparison of intermediate filament markers for presumptive astroglia in the developing rat neocortex: immunostaining against nestin reveals more detail, than GFAP or vimentin

The complexity of the Pigeonhole Principle

1-formulae on finite structures

Generating Hard Instances of the Short Basis Problem

Glial fibrillary acidic protein expression but no glial demarcation follows the lesion in the molecular layer of cerebellum

Sampling short lattice vectors and the closest lattice vector problem

Recursive construction for 3-regular expanders

Determinism versus Nondeterminism for Linear Time RAMs with Memory Restrictions

Reactive glia support and guide axon growth in the rat thalamus during the first postnatal week. A sharply timed transition from permissive to non‐permissive stage

A sieve algorithm for the shortest lattice vector problem

Characteristics of glial reaction in the perinatal rat cortex: effect of lesion size in the 'critical period'

Capability for Reactive Gliosis Develops Prenatally in the Diencephalon but Not in the Cortex of Rats

A lower bound for finding predecessors in Yao's cell probe model

Axon growth failure following corpus callosum lesions precedes glial reaction in perinatal rats

Lesions do not provoke GFAP-expression in the GFAP-immunonegative areas of the teleost brain

First-order definability on finite structures

An Architecture for Provably Secure Computation

Sorting in c log n parallel steps

Compactly encoding unstructured inputs with differential compression

Neuroimaging of dementia

On optimal matchings

An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem

Random lattices and a conjectured 0 - 1 law about their polynomial time computable properties

Suchergebnisse filtern