A histomorphometric meta-analysis of sinus elevation with various grafting materials (2009)
Handschel, Jörg, Simonowska, Melani, Naujoks, Christian, Depprich, Rita A, Ommerborn, Michelle A, Meyer, Ulrich, ...
Abstract Several grafting materials have been used in sinus augmentation procedures including autogenous bone, demineralized freeze-dried bone (DFDBA), hydroxyapatite, β-tricalcium phosphate...
Osseointegration of zirconia implants compared with titanium: an in vivostudy (2008)
Depprich, Rita, Zipprich, Holger, Ommerborn, Michelle, Naujoks, Christian, Wiesmann, Hans-Peter, Kiattavorncharoen, Sirichai, ...
Abstract Background Titanium and titanium alloys are widely used for fabrication of dental implants. Since the material composition and the surface topography of a biomaterial play a fundamental role...
Behavior of osteoblastic cells cultured on titanium and structured zirconia surfaces (2008)
Depprich, Rita, Ommerborn, Michelle, Zipprich, Holger, Naujoks, Christian, Handschel, Jörg, Wiesmann, Hans-Peter, ...
Abstract Background Osseointegration is crucial for the long-term success of dental implants and depends on the tissue reaction at the tissue-implant interface. Mechanical properties and...
Ateriovenous subclavia-shunt for head and neck reconstruction (2008)
Depprich, Rita A, Naujoks, Christian D, Meyer, Ulrich, Kübler, Norbert R, Handschel, Jörg G
Abstract Reconstruction of the facial hard- and soft tissues is of special concern for the rehabilitation of patients especially after ablative tumor surgery has been performed. Impaired soft and...
Osseointegration of zirconia implants: an SEM observation of the bone-implant interface (2008)
Depprich, Rita, Zipprich, Holger, Ommerborn, Michelle, Mahn, Eduardo, Lammers, Lydia, Handschel, Jörg, ...
Abstract Background The successful use of zirconia ceramics in orthopedic surgery led to a demand for dental zirconium-based implant systems. Because of its excellent biomechanical characteristics,...
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...
Deepak Ajwani, Roman Dementiev, Ulrich Meyer, Vitaly Osipov
first search on massive graphs ∗
Abstract Improved external memory BFS implementations ∗ (2008)
Deepak Ajwani, Ulrich Meyer, Vitaly Osipov
Breadth first search (BFS) traversal on massive graphs in external memory was considered non-viable until recently, because of the large number of I/Os it incurs. Ajwani et al. [3] showed that the...
ii Datum des Kolloquiums: 21.10.2002 (2008)
Ulrich Meyer, Dekan Prof, Gutachter Prof, Dr. Kurt Mehlhorn, Prof Dr, ...
Abstract. We study the performance of algorithms for the Single-Source Shortest-Paths (SSSP) problem on graphs with nodes ¡ and edges with nonnegative random weights. All previously known SSSP...
ABSTRACT Heuristics for Semi-External Depth First Search on Directed Graphs (2008)
Jop F. Sibeyn, James Abello, Ulrich Meyer
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...
Abstract A Computational Study of External-Memory BFS Algorithms ∗ (2008)
Deepak Ajwani, Roman Dementiev, Ulrich Meyer
Breadth First Search (BFS) traversal is an archetype for many important graph problems. However, computing a BFS level decomposition for massive graphs was considered nonviable so far, because of the...
forthcoming Abstract 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...
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...
ii Datum des Kolloquiums: 21.10.2002 (2008)
Ulrich Meyer, Dekan Prof, Gutachter Prof, Dr. Kurt Mehlhorn, Prof Dr, ...
Abstract. We study the performance of algorithms for the Single-Source Shortest-Paths (SSSP) problem on graphs withÒnodes andÑedges with nonnegative random weights. All previously known SSSP...
Abstract Improved external memory BFS implementations ∗ (2008)
Deepak Ajwani, Ulrich Meyer, Vitaly Osipov
Breadth first search (BFS) traversal on massive graphs in external memory was considered non-viable until recently, because of the large number of I/Os it incurs. Ajwani et al. [3] showed that the...
External-Memory Breadth-First Search with Sublinear I/O (2008)
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...
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...
48. 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...
Oblivious gossiping on tori (2007)
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...
Sublinear I/o, Kurt Mehlhorn, Ulrich Meyer
Abstract. 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...
Acknowledgements Partially supported by the IST Programme of the EU under contract number (2007)
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...
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
An O(n 2.75 ) algorithm for online topological ordering (2006)
Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
Abstract. 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...
Algorithms and Experiments for the Webgraph (2006)
Donato, Debora, Laura, Luigi, Leonardi, Stefano, Millozzi, Stefano, Meyer, Ulrich, Sibeyn, Jop F.
In this paper we present an experimental study of the statistical and topological properties of the Webgraph. This work has required the development of a set of external and semi-external algorithms...
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths (2006)
Meyer, Ulrich, Zeh, Norbert, Azar, Yossi, Erlebach, Thomas
We show how to compute single-source shortest paths in undirected graphs with non-negative edge lengths in I/Os, where n is the number of vertices, m is the number of edges, B is the disk block size,...
A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs (2006)
Funke, Stefan, Kesselman, Alexander, Meyer, Ulrich, Segal, Michael
Several routing schemes in ad hoc networks first establish a virtual backbone and then route messages via backbone nodes. One common way of constructing such a backbone is based on the construction...
An O(n^2.75) algorithm for online topological ordering (2006)
Ajwani, Deepak, Friedrich, Tobias, Meyer, Ulrich, Arge, Lars, Freivalds, Rusins
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...
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...
A simple improved distributed algorithm for minimum cds in unit disk graphs (2005)
Stefan Funke, Er Kesselman, Ulrich Meyer, Michal Segal
Abstract — Several routing schemes in ad hoc networks first establish a virtual backbone and then route messages via backbone nodes. One common way of constructing such a backbone is based on the...
A simple improved distributed algorithm for minimum cds in unit disk graphs (2005)
Stefan Funke, Alex Kesselman, Ulrich Meyer, Michael Segal
1 We consider the problem of finding a minimum connected dominating set (CDS) in unit disk graphs. Algorithms for computing a small CDS are essential for efficient routing in ad hoc networks, where...
A simple improved distributed algorithm for minimum cds in unit disk graphs (2005)
Stefan Funke, Alex Kesselman, Ulrich Meyer, Michael Segal
1 We consider the problem of finding a minimum connected dominating set (CDS) in unit disk graphs. Algorithms for computing a small CDS are essential for efficient routing in ad hoc networks, where...
Debora Donato, Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn
In this paper we present an experimental study of the statistical and topological properties of the Webgraph. This work has required the development of a set of external and semi-external algorithms...
A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs (2005)
Funke, Stefan, Kesselmann, Alexander, Meyer, Ulrich, Segal, Michael
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, ...
Gerth Sto/lting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
Abstract. We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge weights....
Gerth Sto/lting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
Abstract. We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge weights....
Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
of all or part of this workis permitted for educational or research use on condition that this copyright notice isincluded in any copy. See back inner page for a list of recent BRICS Report Series...
Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
Abstract. We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge weights....
Copyright C, Gerth Stølting Brodal, Gerth Stølting Brodal, Gerth Stølting Brodal, Rolf Fagerberg, Rolf Fagerberg, ...
We present improved cache-oblivious data structures and algorithms for breadth-first search (BFS) on undirected graphs and the single-source shortest path (SSSP) problem on undirected graphs with...
Copyright C, Gerth Stølting Brodal, Gerth Stølting Brodal, Gerth Stølting Brodal, Rolf Fagerberg, Rolf Fagerberg, ...
Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent BRICS...
Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
Abstract. We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge weights....
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, ...
Brodal, Gerth Stølting, Fagerberg, Rolf, Meyer, Ulrich, Zeh, Norbert, Hagerup, Torben, Katajainen, Jyrki
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
I/O-efficient undirected shortest paths (2003)
Abstract. We present an I/O-efficient algorithm for the single-source shortest path problem on undirected graphs G =(V,E). Our algorithm performs O ( � (VE/B) log 2 (W/w) + sort(V + E) log...
On External-Memory Planar Depth-First Search (2003)
Lars Arge, Ulrich Meyer, Laura Toma, 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...
I/O-efficient undirected shortest paths (2003)
Abstract. We show how to compute single-source shortest paths in undirected graphs with non-negative edge lengths in O ( p nm/B log n + MST (n, m)) I/Os, where n is the number of vertices, m is the...
I/O-efficient undirected shortest paths (2003)
Abstract. We present an I/O-efficient algorithm for the single-source shortest path problem on undirected graphs G = (V, E). Our algorithm performs O ( p (V E/B) log 2 (W/w) + sort(V + E) log log(V...
I/O-efficient undirected shortest paths (2003)
Ulrich Meyer, Ulrich Meyer, Norbert Zeh, Norbert Zeh
Abstract. We present an algorithm for computing single-source shortest paths in undirected graphs with non-negative edge weights in O ( � nm/Blogn + MST(n,m)) I/Os, where n is the number of...
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...
External-memory breadth-first search with sublinear I/O (2002)
Abstract. 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...
Buckets strike back: improved parallel shortest-paths (2002)
www.uli-meyer.de 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...
Algorithms and experiments for the Webgraph (2002)
Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn
Abstract. In this paper we present an experimental study of the properties of web graphs. We study a large crawl from 2001 of 200M pages and about 1.4 billion edges made available by the WebBase...
Theory and practice of time-space trade-offs in memory limited search (2001)
Abstract. Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respect to...
Theory and practice of time-space trade-offs in memory limited search (2001)
Abstract. Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respect to...
Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time (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...
External Memory BFS on Undirected Graphs with Bounded Degree (2001)
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...
Thesis (Dr. Ing.)--Technischen Universitat Darmstadt, 2000.
Münster (Westfalen), Universiẗat, Diss., 2000 (Nicht für den Austausch).
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.
Köln, Univ., Diss., 1999.
Greifswald, Univ., Diss., 1999.
An Experimental Study of Priority Queues in External Memory (1999)
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.
I/O-optimal computation of segment intersections (1999)
Crauser, Andreas, Ferragina, Paolo, Mehlhorn, Kurt, Meyer, Ulrich, Ramos, Edgar A., Abello, James M., ...
Langzeitverlaufsbeobachtung von Patienten mit Erregungsleitungsstörungen des Herzens / (1998)
Lübeck, Med. Univ., Diss., 1999.
Delta-stepping: A parallel single source shortest path algorithm (1998)
Abstract. 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,...
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...
Time-Independent Gossiping on Full-Port Tori (1998)
Ulrich Meyer And, Ulrich Meyer, Jop F. Sibeyn
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...
A Parallelization of Dijkstra's Shortest Path Algorithm (1998)
Crauser, Andreas, Mehlhorn, Kurt, Meyer, Ulrich, Sanders, Peter, Brim, Lubos, Gruska, Jozef, ...
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-efficient. We propose simple criteria which divide Dijkstra's sequential SSSP algorithm...
Randomized External-Memory Algorithms for some Geometric Problems (1998)
Crauser, Andreas, Ferragina, Paolo, Mehlhorn, Kurt, Meyer, Ulrich, Ramos, Edgar A.
Berlin, Humboldt-Univ., Diss., 1997.
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
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...
Kürzeste-Wege-Berechnung bei sehr großen Datenmengen (1997)
Crauser, Andreas, Mehlhorn, Kurt, Meyer, Ulrich, Spaniol, Otto
In diesem Report untersuchen wir die Ein/Ausgabe-Komplexität (I/O Komplexität) des Kürzesten-Wege-Problems mit einem Startknoten (single source shortest path) auf Graphen mit nicht-negativen...
Braided geometry and the q-deformation of spacetime. (1995)
Thesis (Ph. D.)--University of Cambridge, 1995.
Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator (1995)
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....
Münster (Westfalen), Univ., Diss., 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...
Braided Matrix Structure of $q$-Minkowski Space and $q$-Poincare Group (1993)
We clarify the relation between the approach to $q$-Minkowski space of Carow-Watamura et al. with an approach based on the idea of $2\times 2$ braided Hermitean matrices. The latter are objects like...
Stuttgart, Universiẗat, Diss., 1995.
Leipzig, Univ., Diss., 1992.
Heidelberg, Univ., Diss., 1992 (Nicht für den Austausch).
Die Fettler [microform] / (1989)
Thesis (doctoral)--Westfälische Wilhelms-Universität Münster, 1989.
Thesis (doctoral)--Westfälische Wilhelms-Universität Münster, 1989.
Münster (Westfalen), Univ., Diss., 1989.
Dynamische Input-Output-Modelle : eine theoretische Analyse / (1977)
Proefschrift Munster.
Münster (Westfalen), Univ., Med. Fak., Diss. 1973. (Nicht f. d. Austausch.).
Beiträge zur Pharmakognosie der Umbelliferen : Anatomie d. Laubblattes. (1937)
Basel, Math.-naturwiss. Diss.
[Auszug nicht gedruckt.]
Tissue engineering: a challenge of today's medicine
Meyer, Ulrich, Wiesmann, Hans-Peter
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 the body...
Strain driven fast osseointegration of implants
Joos, Ulrich, Büchter, Andre, Wiesmann, Hans-Peter, Meyer, Ulrich
Biological and biomechanical evaluation of interface reaction at conical screw-type implants
Büchter, Andre, Joos, Ulrich, Wiesmann, Hans-Peter, Seper, László, Meyer, Ulrich
New paradigm in implant osseointegration
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 improvements...
Tissue engineering: a challenge of today's medicine
Meyer, Ulrich, Wiesmann, Hans-Peter
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 the body...
Strain driven fast osseointegration of implants
Joos, Ulrich, Büchter, Andre, Wiesmann, Hans-Peter, Meyer, Ulrich
Biological and biomechanical evaluation of interface reaction at conical screw-type implants
Büchter, Andre, Joos, Ulrich, Wiesmann, Hans-Peter, Seper, László, Meyer, Ulrich
New paradigm in implant osseointegration
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 improvements...
Depprich, Rita A, Handschel, Jörg GK, Naujoks, Christian, Hahn, Tobias, Meyer, Ulrich, Kübler, Norbert R
Prospects of micromass culture technology in tissue engineering
Handschel, Jörg GK, Depprich, Rita A, Kübler, Norbert R, Wiesmann, Hans-Peter, Ommerborn, Michelle, Meyer, Ulrich
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 scaffolds....
Versicherungswissenschaftliche Studien
Basedow, Jürgen, Meyer, Ulrich, Rückle, Dieter, Schwintowski, Hans-Peter
Versicherungswissenschaftliche Studien
Basedow, Jürgen, Meyer, Ulrich, Rückle, Dieter, Schwintowski, Hans-Peter
Perioperative complications in infant cleft repair
Fillies, Thomas, Homann, Christoph, Meyer, Ulrich, Reich, Alexander, Joos, Ulrich, Werkmeister, Richard
Hohoff, Ariane, Joos, Ulrich, Meyer, Ulrich, Ehmer, Ulrike, Stamm, Thomas
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 present article...
Cehreli, Murat, Cehreli, Zafer, Stamm, Thomas, Meyer, Ulrich, Wiesmann, Hans-Peter
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 research...
Stamm, Thomas, Meyer, Ulrich, Wiesmann, Hans-Peter, Kleinheinz, Johannes, Cehreli, Murat, Cehreli, Zafer C
Dentin dysplasia type I: a challenge for treatment with dental implants
Depprich, Rita A, Ommerborn, Michelle A, Handschel, Jörg GK, Naujoks, Christian D, Meyer, Ulrich, Kübler, Norbert R
Principles of cartilage tissue engineering in TMJ reconstruction
Naujoks, Christian, Meyer, Ulrich, Wiesmann, Hans-Peter, Jäsche-Meyer, Janine, Hohoff, Ariane, Depprich, Rita, ...
Diseases and defects of the temporomandibular joint (TMJ), compromising the cartilaginous layer of the condyle, impose a significant treatment challenge. Different regeneration approaches, especially...
Versicherungswissenschaftliche Studien
Basedow, Jürgen, Meyer, Ulrich, Rückle, Dieter, Schwintowski, Hans-Peter
Versicherungswissenschaftliche Studien
Basedow, Jürgen, Meyer, Ulrich, Rückle, Dieter, Schwintowski, Hans-Peter
Induction of osteogenic markers in differentially treated cultures of embryonic stem cells
Handschel, Jörg, Berr, Karin, Depprich, Rita A, Kübler, Norbert R, Naujoks, Christian, Wiesmann, Hans-Peter, ...
Osseointegration of zirconia implants: an SEM observation of the bone-implant interface
Depprich, Rita, Zipprich, Holger, Ommerborn, Michelle, Mahn, Eduardo, Lammers, Lydia, Handschel, Jörg, ...
Ateriovenous subclavia-shunt for head and neck reconstruction
Depprich, Rita A, Naujoks, Christian D, Meyer, Ulrich, Kübler, Norbert R, Handschel, Jörg G
Reconstruction of the facial hard- and soft tissues is of special concern for the rehabilitation of patients especially after ablative tumor surgery has been performed. Impaired soft and hard tissue...
Behavior of osteoblastic cells cultured on titanium and structured zirconia surfaces
Depprich, Rita, Ommerborn, Michelle, Zipprich, Holger, Naujoks, Christian, Handschel, Jörg, Wiesmann, Hans-Peter, ...
Osseointegration of zirconia implants compared with titanium: an in vivo study
Depprich, Rita, Zipprich, Holger, Ommerborn, Michelle, Naujoks, Christian, Wiesmann, Hans-Peter, Kiattavorncharoen, Sirichai, ...
A histomorphometric meta-analysis of sinus elevation with various grafting materials
Handschel, Jörg, Simonowska, Melani, Naujoks, Christian, Depprich, Rita A, Ommerborn, Michelle A, Meyer, Ulrich, ...
Several grafting materials have been used in sinus augmentation procedures including autogenous bone, demineralized freeze-dried bone (DFDBA), hydroxyapatite, β-tricalcium phosphate (β-TCP),...