( en | de | ru )

 

Disambiguation of "Klein, N."

Author of the publication

copydeleteadd this publication to your clipboard
Nonlinear charging effect of quantum dots in a p-i-n diode

, , , , , , , , and . Phys.~Rev.~B, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

n n n

Johannes E M N Klein

n AÊ¿w n

N -L N Nguyen

n-hy n Yi

 

Other publications of authors with the same name

Web-enabled Co-operation in Tourism - A Case Study from the Lake Constance Region. Paper for the EMOT Workshop - Inter-Firm Networks: Outcomes and Policy Implications. Modena, Italy, 6-8 September 1996, (1996)Nonlinear charging effect of quantum dots in a p-i-n diode, , , , , , , , and . Phys.~Rev.~B, (2003)Combined S- and Z-shaped current bistability induced by charging of quantum dots, , , , , , , and . Proc. 25th International Conference on the Physics of Semiconductors (ICPS-25), Osaka 2000, Springer, Berlin, (2001)Endothelial adhesion molecule expression and its inhibition by recombinant bactericidal/permeability-increasing protein are influenced by the capsulation and lipooligosaccharide structure of Neisseria meningitidis, , , , , , , and . Infection and Immunity, 67 (11): 5626--5633 (November 1999)PMID: 10531209.Enhancing alignment based context prediction by using multiple context sources: experiment and analysis, , , and . page 159-172. 7th International and Interdisciplinary Conference Context 2011, Karlsruhe, Springer LNAI6967 Proceedings, (September 2011)An efficient polynomial-time approximation scheme for Steiner forest in planar graphs., , and . SODA, page 626-638. SIAM, (2012)Tatsächliche und rechtliche Risiken drahtloser Computernetzwerke., , and . Datenschutz und Datensicherheit, (2002)Approximation Algorithms for Steiner and Directed Multicuts., , , and . J. Algorithms, 22 (2): 241-269 (1997)Multiple-source shortest paths in planar graphs.. SODA, page 146-155. SIAM, (2005)Detecting Race Conditions in Parallel Programs that Use One Semaphore., , and . WADS, volume 709 of Lecture Notes in Computer Science, page 471-482. Springer, (1993)