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

Electrochemical reduction of halogenated aromatic compounds at metal cathodes in acetonitrile

Electrochimica acta, 2020-02, Vol.332, p.135484, Article 135484

2020

Volltextzugriff (PDF)

Foundations of Inductive Logic Programming

1997

Volltextzugriff (PDF)

Evaluation of the changes in human milk lipid composition and conformational state with Raman spectroscopy during a breastfeed

Biomedical optics express, 2021-07, Vol.12 (7), p.3934-3947

2021

Volltextzugriff (PDF)

Algorithmic Clustering of Music Based on String Compression

Computer music journal, 2004-12, Vol.28 (4), p.49-67

2004

Volltextzugriff (PDF)

Communication complexity lower bounds by polynomials

Proceedings / IEEE Conference on Computational Complexity, 2001

2001

Volltextzugriff (PDF)

Bayesian approach to parameter estimation and model validation for nuclear fusion reactor mean-field edge turbulence modelling

Nuclear fusion, 2021-04, Vol.61 (4), p.46048

2021

Volltextzugriff (PDF)

Complexity measures and decision tree complexity: a survey

Theoretical computer science, 2002-10, Vol.288 (1), p.21-43

2002

Volltextzugriff (PDF)

Quantum fingerprinting

Physical review letters, 2001-10, Vol.87 (16), p.167902-167902, Article 167902

2001

Volltextzugriff (PDF)

Quantum lower bounds by polynomials

Journal of the ACM, 2001-07, Vol.48 (4), p.778-797

2001

Volltextzugriff (PDF)

Human milk fat globule size distributions: comparison between laser diffraction and 3D confocal laser scanning microscopy

Food research international, 2024-11, p.115282, Article 115282

2024

Volltextzugriff (PDF)

Exponential lower bound for 2-query locally decodable codes via a quantum argument

Journal of computer and system sciences, 2004-11, Vol.69 (3), p.395-420

2004

Volltextzugriff (PDF)

Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval

Automata, Languages and Programming, 2005, p.1424-1436

2005

Volltextzugriff (PDF)

Quantum communication and complexity

Theoretical computer science, 2002-09, Vol.287 (1), p.337-353

de Wolf, Ronald

2002

Volltextzugriff (PDF)

Communication complexity lower bounds by polynomials

Proceedings 16th Annual IEEE Conference on Computational Complexity, 2001, p.120-130

2001

Volltextzugriff (PDF)

Quantum algorithms for element distinctness

Proceedings / IEEE Conference on Computational Complexity, 2001, p.131-137

2001

Volltextzugriff (PDF)

Nondeterministic quantum query and communication complexities

SIAM journal on computing, 2003-01, Vol.32 (3), p.681-699

DE WOLF, Ronald

2003

Volltextzugriff (PDF)

Characterization of non-deterministic quantum query and quantum communication complexity

Proceedings / IEEE Conference on Computational Complexity, 2000, p.271-278

de Wolf, R.

2000

Volltextzugriff (PDF)

On Computation and Communication with Small Bias

Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 2007, p.24-32

2007

Volltextzugriff (PDF)

A note on quantum algorithms and the minimal degree of epsilon-error polynomials for symmetric functions

Quantum information & computation, 2008-11, Vol.8 (10), p.943-950

de Wolf, R.

2008

Volltextzugriff (PDF)

Quantum symmetrically-private information retrieval

Information processing letters, 2004-05, Vol.90 (3), p.109-114

2004

Volltextzugriff (PDF)

Near-Optimal and Explicit Bell Inequality Violations

2011 IEEE 26th Annual Conference on Computational Complexity, 2011, p.157-166

2011

Volltextzugriff (PDF)

Quantum Search on Bounded-Error Inputs

Automata, Languages and Programming, 2003, Vol.2719, p.291-299

2003

Volltextzugriff (PDF)

Quantum algorithms for element distinctness

SIAM journal on computing, 2005, Vol.34 (6), p.1324-1330

2005

Volltextzugriff (PDF)

Upper bounds on the noise threshold for fault-tolerant quantum computing

Quantum information & computation, 2010-05, Vol.10 (5&6), p.361-376

2010

Volltextzugriff (PDF)

De accountant en de kruipruimte

MAB ('s-Gravenhage. Online), 2004-01, Vol.78 (1), p.16-21

2004

Volltextzugriff (PDF)

1 – 25 von 4.113

Menü

Weitere Dienste

Einstellungen

Electrochemical reduction of halogenated aromatic compounds at metal cathodes in acetonitrile

Foundations of Inductive Logic Programming

Evaluation of the changes in human milk lipid composition and conformational state with Raman spectroscopy during a breastfeed

Algorithmic Clustering of Music Based on String Compression

Communication complexity lower bounds by polynomials

Bayesian approach to parameter estimation and model validation for nuclear fusion reactor mean-field edge turbulence modelling

Complexity measures and decision tree complexity: a survey

Quantum fingerprinting

Quantum lower bounds by polynomials

Human milk fat globule size distributions: comparison between laser diffraction and 3D confocal laser scanning microscopy

Exponential lower bound for 2-query locally decodable codes via a quantum argument

Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval

Quantum communication and complexity

Communication complexity lower bounds by polynomials

Quantum algorithms for element distinctness

Nondeterministic quantum query and communication complexities

Characterization of non-deterministic quantum query and quantum communication complexity

On Computation and Communication with Small Bias

A note on quantum algorithms and the minimal degree of epsilon-error polynomials for symmetric functions

Quantum symmetrically-private information retrieval

Near-Optimal and Explicit Bell Inequality Violations

Quantum Search on Bounded-Error Inputs

Quantum algorithms for element distinctness

Upper bounds on the noise threshold for fault-tolerant quantum computing

De accountant en de kruipruimte

Suchergebnisse filtern