Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Martin Hühne"'
Publikováno v:
Comptes Rendus Chimie. 21:943-951
Six new palladium complexes based on allyl and alkenolate ligands were synthesized and structurally characterized. Combination of delocalized allylic sp2-hybridized carbon centers and a strongly binding NˆO chelating unit (e.g., 3,3,3-trifluoro(pyri
Autor:
Rhett Kempe, Johannes Obenauf, Martin Friedrich, Sven-Martin Hühne, Günter Motz, Daniel Forberg, Werner Mader
Publikováno v:
Catal. Sci. Technol.. 4:4188-4192
Pyrroles are important compounds with several applications in medicine and material science. They can be synthesized sustainably from secondary alcohols and amino alcohols. Hydrogen and water are liberated in the course of this reaction. Here, we pre
Autor:
Sabine Lepper, Oliver Brunkahl, Manuela Schebera, Regina Böhm, Marco Witte, Günter Gottstein, Werner Mader, Jutta Klöwer, Matthias Svete, Sven-Martin Hühne, Michael Bäcker, Brygida Wojtyniak, Nicole de Boer, Stefan Gilges
Publikováno v:
Advanced Engineering Materials. 16:539-549
The aim of the joint industrial and academic project “SupraMetall” is to enable the large scale production of superconducting tapes. This is a report of the recent achievements in the production of cube textured metal substrates and the coating t
Publikováno v:
The Journal of Physical Chemistry C
Two-step chemical vapor deposition (CVD) in combination with metal-catalyzed vapor–liquid–solid (VLS) growth mechanism was used as a new approach to synthesize and modify the morphology of SnO2–TiO2 core–shell nanowires. SnO2 nanowires were g
Publikováno v:
ACM Journal of Experimental Algorithmics. 12:1-25
We describe experimental results on an implementation of a dynamic dictionary. The basis of our implementation is “dynamic perfect hashing” as described by Dietzfelbinger et al. ( SIAM J. Computing 23 , 1994, pp. 738--761), an extension of the st
Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape
Autor:
Martin Dietzfelbinger, Martin Hühne
Publikováno v:
Computational Complexity. 8:371-392
We prove an O(t(n) d (t(n)) ½ / log t(n)) time bound for the sim-ulation of t(n) steps of a Turing machine using several one-dimensional work tapes on a Turing machine using one d-dimensional work tape, $ d \ge 2 $ . We prove a matching lower bound
Publikováno v:
Parallel Processing Letters. :275-280
For circuits the expected delay is a suitable measure for the average case time complexity. In this paper, new upper and lower bounds on the expected delay of circuits for disjunction and conjunction are derived. The circuits presented yield asymptot
Publikováno v:
Applied Spectroscopy. 49:177-180
The design and applications of a near-infrared (near-IR) spectrometer with an acousto-optic tunable filter (AOTF) as monochromator and light fiber optics are described. The aim of this spectrometer is rapid product and reaction control via remote sen
Autor:
Martin Hühne
Publikováno v:
Information Processing Letters. 47:313-318
It is well known that on Turing machines using tapes as storage it is possible to speed up the computation time by any constant factor. Using Kolmogorov complexity we show that on Turing machines using tree storages this effect does not occur.
Autor:
Martin Hühne
Publikováno v:
Theoretical Computer Science. 113(1):75-91
We present almost matching upper and lower time bounds for the simulation of Turing machines with many queues, tapes, or stacks on Turing machines with few queues. In particular, the power of two queues in comparison with other storage types is clari