Induction of osteogenic markers in differentially treated cultures of embryonic stem cells (2008)
Handschel, Jörg, Berr, Karin, Depprich, Rita A, Kübler, Norbert R, Naujoks, Christian, Wiesmann, Hans-Peter, ...
Abstract Background Facial trauma or tumor surgery in the head and face area often lead to massive destruction of the facial skeleton. Cell-based bone reconstruction therapies promise to offer new...
Principles of cartilage tissue engineering in TMJ reconstruction (2008)
Naujoks, Christian, Meyer, Ulrich, Wiesmann, Hans-Peter, Jäsche-Meyer, Janine, Hohoff, Ariane, Depprich, Rita, ...
Abstract Diseases and defects of the temporomandibular joint (TMJ), compromising the cartilaginous layer of the condyle, impose a significant treatment challenge. Different regeneration approaches,...
On Dynamic Breadth-First Search in External-Memory (2008)
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially $n$ nodes and $O(n)$ edges and monotone update...
On Dynamic Breadth-First Search in External-Memory (2008)
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially $n$ nodes and $O(n)$ edges and monotone update...
On Dynamic Breadth-First Search in External-Memory (2008)
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially $n$ nodes and O(n) edges and monotone update...
Stamm, Thomas, Meyer, Ulrich, Wiesmann, Hans-Peter, Kleinheinz, Johannes, Cehreli, Murat, Cehreli, Zafer C
Abstract Background Head & Face Medicine (HFM) was launched in August 2005 to provide multidisciplinary science in the field of head and face disorders with an open access and open peer review...
Cehreli, Murat, Cehreli, Zafer, Stamm, Thomas, Meyer, Ulrich, Wiesmann, Hans-Peter
Abstract The purpose of this article is to draw attention to current transgressions in scientific writing and to promote commitment to ethical standards and good science. All participants of any...
Hohoff, Ariane, Joos, Ulrich, Meyer, Ulrich, Ehmer, Ulrike, Stamm, Thomas
Abstract In the PubMed accessible literature, information on the characteristics of interdisciplinary orthodontic and surgical treatment of patients with Apert syndrome is rare. The aim of the...
Perioperative complications in infant cleft repair (2007)
Fillies, Thomas, Homann, Christoph, Meyer, Ulrich, Reich, Alexander, Joos, Ulrich, Werkmeister, Richard
Abstract Background Cleft surgery in infants includes special risks due to the kind of the malformation. These risks can be attributed in part to the age and the weight of the patient. Whereas a lot...
Prospects of micromass culture technology in tissue engineering (2007)
Handschel, Jörg GK, Depprich, Rita A, Kübler, Norbert R, Wiesmann, Hans-Peter, Ommerborn, Michelle, Meyer, Ulrich
Abstract Tissue engineering of bone and cartilage tissue for subsequent implantation is of growing interest in cranio- and maxillofacial surgery. Commonly it is performed by using cells coaxed with...
Depprich, Rita A, Handschel, Jörg GK, Naujoks, Christian, Hahn, Tobias, Meyer, Ulrich, Kübler, Norbert R
Abstract Background Functional rehabilitation of patients afflicted with severe mandibular and maxillary alveolar atrophy might be challenging especially in malformed patients. Methods Treatment...
New paradigm in implant osseointegration (2006)
Abstract During the last years, implant dentistry has seen an dramatic increase as a treatment option in oral rehabilitation. This is based to a large extent on scientific advances and clinical...
Biological and biomechanical evaluation of interface reaction at conical screw-type implants (2006)
Büchter, Andre, Joos, Ulrich, Wiesmann, Hans-Peter, Seper, László, Meyer, Ulrich
Abstract Background Initial stability of the implant is, in effect, one of the fundamental criteria for obtaining long-term osseointegration. Achieving implant stability depends on the implant-bone...
An O(n^{2.75}) algorithm for online topological ordering (2006)
Ajwani, Deepak, Friedrich, Tobias, Meyer, Ulrich
We present a simple algorithm which maintains the topological order of a directed acyclic graph with n nodes under an online edge insertion sequence in O(n^{2.75}) time, independent of the number of...
There are many parallels between the role of possible worlds in modal logic and that of times in tense logic. But the similarities only go so far, and it is important to note where the two come...
Möglichkeiten und Grenzen der Hill-Gleichungen für die Schwerefeldbestimmung (2006)
Zugl.: München, Techn Univ., Diss., 2006
Strain driven fast osseointegration of implants (2005)
Joos, Ulrich, Büchter, Andre, Wiesmann, Hans-Peter, Meyer, Ulrich
Abstract Background Although the bone's capability of dental implant osseointegration has clinically been utilised as early as in the Gallo-Roman population, the specific mechanisms for the emergence...
Tissue engineering: a challenge of today's medicine (2005)
Meyer, Ulrich, Wiesmann, Hans-Peter
Abstract During the last years, tissue engineering-based therapies have been introduced in clinical practice in the head and face area. The regeneration of complex tissue structures for all sites of...
Design and analysis of sequential and parallel single-source shortest-paths algorithms (2004)
We study the performance of algorithms for the Single-Source Shortest-Paths (SSSP) problem on graphs with n nodes and m edges with nonnegative random weights. All previously known SSSP algorithms for...
Basedow, Jürgen, Meyer, Ulrich, Rückle, Dieter, Schwintowski, Hans-Peter
Der Tagungsband fasst die Referate und Diskussionen der 13. Wissenschaftstagung des Bundes der Versicherten zusammen, die den im Titel genannten Themenbereichen gewidmet war.
Brodal, Gerth Stølting, Fagerberg, Rolf, Meyer, Ulrich, Zeh, Norbert, Hagerup, Torben, Katajainen, Jyrki
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs (2004)
Arge, Lars, Meyer, Ulrich, Toma, Laura, Diaz, Josep, Karhumäki, Juhani, Lepistö, Arto, ...
Journal of Graph Algorithms and Applications (2003)
Lars Arge, Ulrich Meyer, Norbert Zeh
Even though a large number of I/O-e#cient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-e#cient algorithms are known for...
Algorithms and Experiments for the Webgraph (2003)
Laura,Luigi, Leonardi,Stefano, Millozzi,Stefano, Meyer,Ulrich, Sibeyn,Jop F.
Algorithms and Experiments for the Webgraph (2003)
Laura, Luigi, Leonardi, Stefano, Millozzi, Stefano, Meyer, Ulrich, Sibeyn, Jop F., Di Battista, Giuseppe, ...
Full-Text Indexes in External Memory (2003)
Kärkkäinen, Juha, Rao, S. Srinivasa, Meyer, Ulrich, Sanders, Peter, Sibeyn, Jop
Elementary Graph Algorithms in External Memory (2003)
Katriel, Irit, Meyer, Ulrich, Meyer, Ulrich, Sanders, Peter, Sibeyn, Jop
I/O-Efficient Undirected Shortest Paths (2003)
Meyer, Ulrich, Zeh, Norbert, Di Battista, Giuseppe, Zwick, Uri
External-Memory Breadth-First Search with Sublinear I/O (2002)
Breadth-first search (BFS) is a basic graph exploration technique. We give the first external memory algorithm for sparse undirected graphs with sublinear I/O. The best previous algorithm requires (n...
Oblivious Gossiping on Tori (2002)
Near-optimal gossiping algorithms are given for two- and higher dimensional tori assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved...
Buckets strike back: Improved Parallel Shortest-Paths (2002)
We study the average-case complexity of the parallel single-source shortest-path (SSSP) problem, assuming arbitrary directed graphs with n nodes, m edges, and independent random edge weights...
Design and analysis of sequential and parallel single-source shortest-paths algorithms (2002)
We study the performance of algorithms for the Single-Source Shortest-Paths (SSSP) problem on graphs with n nodes and m edges with nonnegative random weights. All previously known SSSP algorithms for...
Heuristics for Semi-External Depth First Search on Directed Graphs (2002)
Sibeyn,Jop F., Abello,James, Meyer,Ulrich
Computing the strong components of a directed graph is an essential operation for a basic structural analysis of it. This problem can be solved by twice running a depth-first search (DFS). In an...
External-Memory Breadth-First Search with Sublinear I/O (2002)
Breadth-first search (BFS) is a basic graph exploration technique. We give the first external-memory algorithm for sparse undirected graphs with sublinear I/O. The best previous algorithm requires O(...
Oblivious Gossiping on Tori (2002)
Near-optimal gossiping algorithms are given for two- and higher dimensional tori assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved...
Heuristics for Semi-External Depth First Search on Directed Graphs (2002)
Sibeyn, Jop F., Abello, James, Meyer, Ulrich
Computing the strong components of a directed graph is an essential operation for a basic structural analysis of it. This problem can be solved by twice running a depth-first search (DFS). In an...
External-Memory Breadth-First Search with Sublinear I/O (2002)
Mehlhorn, Kurt, Meyer, Ulrich, Möhring, Rolf, Raman, Rajeev
Breadth-first search (BFS) is a basic graph exploration technique. We give the first external-memory algorithm for sparse undirected graphs with sublinear I/O. The best previous algorithm requires O(...
Oblivious Gossiping on Tori (2002)
Near-optimal gossiping algorithms are given for two- and higher dimensional tori assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved...
Buckets Strike Back: Improved Parallel Shortest-Paths (2002)
We study the average-case complexity of the parallel single-source shortest-path (SSSP) problem, assuming arbitrary directed graphs with $n$ nodes, $m$ edges, and independent random edge weights...
Directed Single--Source (2001)
The quest for a linear-time single-source shortest-path (SSSP) algorithm on directed graphs with positive edge weights is an ongoing hot research topic. While Thorup recently found an O(n + m) time...
On External-Memory Planar Depth First Search (2001)
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algorithms are known for...
Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time (2000)
The quest for a linear-time single-source shortest-path (SSSP) algorithm on directed graphs with positive edge weights is an ongoing hot research topic. While Thorup recently found an O(n + m) time...
External Memory BFS on Undirected Graphs with Bounded Degree (2000)
We give the rst external memory algorithm for breadth-rst search (BFS) which achieves o(n) I/Os on arbitrary undirected graphs with n nodes and maximum node degree d. Let M and B > d denote the main...
An Experimental Study of Priority Queues in External Memory (2000)
Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer
this paper we show that this hierarchical approach offers some advantages over the tree-based data structures which make it appealing also in practice.
Thesis (Dr. Ing.)--Technischen Universitat Darmstadt, 2000.
Münster (Westfalen), Universiẗat, Diss., 2000 (Nicht für den Austausch).
Gossiping Large Packets on Full-Port Tori (1999)
Near-optimal gossiping algorithms are given for two- and higher dimensional tori. It is assumed that the amount of data each PU is contributing is so large, that start-up time may be neglected. For...
Gossiping Large Packets on Full-Port Tori (1999)
. Near-optimal gossiping algorithms are given for two- and higher dimensional tori. It is assumed that the amount of data each PU is contributing is so large, that start-up time may be neglected. For...
Ozon wird nicht durch natürliche oder anthropogene Quellen in die Atmosphäre emittiert, sondern ausschließlich durch chemische Prozesse in der Atmosphäre gebildet. 90 % des Ozons befinden sich in...
Köln, Universiẗat, Diss., 1999.
Gossiping Large Packets on Full-Port Tori (1998)
. Near-optimal gossiping algorithms are given for two- and higher dimensional tori. It is assumed that the amount of data each PU is contributing is so large, that start-up time may be neglected. For...
Gossiping Large Packets on Full-Port Tori (1998)
. Near-optimal gossiping algorithms are given for two- and higher dimensional tori. It is assumed that the amount of data each PU is contributing is so large, that start-up time may be neglected. For...
Time-Independent Gossiping on Full-Port Tori (1998)
Near-optimal gossiping algorithms are given for two- and higher dimensional tori. It is assumed that the amount of data each PU contributes is so large that start-up time may be neglected. For...
Gossiping Large Packets on Full-Port Tori (1998)
. Near-optimal gossiping algorithms are given for two- and higher dimensional tori. It is assumed that the amount of data each PU is contributing is so large, that start-up time may be neglected. For...
Ulrich Meyer, Peter Sanders (1998)
In spite of intensive research, little progress has been made towards fast and work-efficient parallel algorithms for the single source shortest path problem. Our Delta-stepping algorithm, a...
Time-Independent Gossiping on Full-Port Tori (1998)
Near-optimal gossiping algorithms are given for two- and higher dimensional tori. It is assumed that the amount of data each PU contributes is so large that start-up time may be neglected. For...
Langzeitverlaufsbeobachtung von Patienten mit Erregungsleitungsstörungen des Herzens / (1998)
Lübeck, Med. Univ., Diss., 1999.
Matrix Transpose on Meshes: Theory and Practice (1997)
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
We consider the problem of matrix transpose on mesh-connected processor networks. On the theoretical side, we present the first optimal algorithm for matrix transpose on twodimensional meshes. Then...
Matrix Transpose on Meshes: Theory and Practice (1997)
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
We consider the problem of matrix transpose on mesh-connected processor networks. On the theoretical side, we present the first optimal algorithm for matrix transpose on twodimensional meshes. Then...
Matrix Transpose on Meshes: Theory and Practice (1997)
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
Matrix transpose is a fundamental communication operation which is not dealt with optimally by general purpose routing schemes. For two dimensional meshes, the first optimal routing schedule is...
Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator (1997)
this paper, we sketch our experiences with a deterministic PRAM simulator for two-dimensional meshes. The success of a PRAM simulator depends on the achieved speed-up. We made considerable progress....
Matrix Transpose on Meshes: Theory and Practice (1997)
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
Matrix transpose is a fundamental communication operation which is not dealt with optimally by general purpose routing schemes. For two dimensional meshes, the first optimal routing schedule is...
Matrix Transpose on Meshes: Theory and Practice (1997)
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
Matrix transpose is a fundamental communication operation which is not dealt with optimally by general purpose routing schemes. For two dimensional meshes, the first optimal routing schedule is...
Matrix Transpose on Meshes: Theory and Practice (1997)
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn, Im Stadtwald
Matrix transpose is a fundamental communication operation which is not dealt with optimally by general purpose routing schemes. For two dimensional meshes, the first optimal routing schedule is...
Berlin, Humboldt-Univ., Diss., 1997.
Deterministic PRAM Simulation on a Mesh Simulator (1996)
this paper, we sketch our experiences with a deterministic PRAM simulator for two-dimensional meshes. The success of a PRAM simulator depends on the achieved speed-up. We made considerable progress....
Deterministic PRAM Simulation on a Mesh Simulator (1996)
this paper, we sketch our experiences with a deterministic PRAM simulator for two-dimensional meshes. The success of a PRAM simulator depends on the achieved speed-up. We made considerable progress....
Simulating the Simulator: (1996)
this paper, we sketch our experiences with a deterministic PRAM simulator for two-dimensional meshes
Braided geometry and the q-deformation of spacetime. (1995)
Thesis (Ph. D.)--University of Cambridge, 1995.
Projective quantum spaces (1994)
Associated to the standard $SU_{q}(n)$ R-matrices, we introduce quantum spheres $S_{q}^{2n-1}$, projective quantum spaces $CP_{q}^{n-1}$, and quantum Grassmann manifolds $G_{k}(C_{q}^{n})$. These...
We show how to construct central and grouplike quantum determinants for FRT algebras A(R). As an application of the general construction we give a quantum determinant for the q-Lorentz group.
Wave Equations on q-Minkowski space (1994)
We give a systematic account of the exterior algebra of forms on q-Minkowski space, introducing the q-exterior derivative, q-Hodge star operator, q-coderivative, q-Laplace-Beltrami operator and the...