Eine cache-optimale Implementierung eines Navier-Stokes Lösers unter besonderer Berücksichtigung physikalischer Erhaltungssätze
(2005)
Thesis
Weinzierl, T. (2005). Eine cache-optimale Implementierung eines Navier-Stokes Lösers unter besonderer Berücksichtigung physikalischer Erhaltungssätze. (Dissertation). Fakultät für Informatik, Technische Universität München Fakultät für Informatik, Technische Universität München. Retrieved from https://durham-repository.worktribe.com/output/1698173
Outputs (29)
Adaptable Analysis of Dependable System Architectures Through Monitoring (2005)
Book Chapter
Dias, M., & Richardson, D. J. (2005). Adaptable Analysis of Dependable System Architectures Through Monitoring. In R. D. Lemos, C. Gacek, & A. Romanovsky (Eds.), Architecting dependable systems III (122-147). Springer Verlag. https://doi.org/10.1007/11556169_6Every day, our society becomes more dependent on complex software systems with high availability requirements, such as those present in telecommunications, air traffic control, power plants and distribution lines, among others. In order to facilitate... Read More about Adaptable Analysis of Dependable System Architectures Through Monitoring.
Finding Frequent Patterns in a String in Sublinear Time (2005)
Book Chapter
Berenbrink, P., Ergun, F., & Friedetzky, T. (2005). Finding Frequent Patterns in a String in Sublinear Time. In Algorithms – ESA 2005. https://doi.org/10.1007/11561071_66
On Weighted Balls-into-Bins Games (2005)
Book Chapter
Berenbrink, P., Friedetzky, T., Hu, Z., & Martin, R. (2005). On Weighted Balls-into-Bins Games. In STACS 2005. https://doi.org/10.1007/978-3-540-31856-9_19
Common path interferometric wavefront sensor for extreme adaptive optics (2005)
Journal Article
Love, G., Oag, T., & Kirby, A. (2005). Common path interferometric wavefront sensor for extreme adaptive optics. Optics Express, 13(9), 3491-3499
A complete complexity classification of the role assignment problem (2005)
Journal Article
Fiala, J., & Paulusma, D. (2005). A complete complexity classification of the role assignment problem. Theoretical Computer Science, 349(1), 67-81. https://doi.org/10.1016/j.tcs.2005.09.029In social network theory a society is often represented by a simple graph G, where vertices stand for individuals and edges represent relationships between those individuals. The description of the social network is tried to be simplified by assignin... Read More about A complete complexity classification of the role assignment problem.
Multi-server support for large scale distributed virtual environments (2005)
Journal Article
Ng, B., Lau, R. W., Si, A., & Li, F. (2005). Multi-server support for large scale distributed virtual environments. IEEE Transactions on Multimedia, 7(6), 1054-1065. https://doi.org/10.1109/tmm.2005.858388CyberWalk is a distributed virtual walkthrough system that we have developed. It allows users at different geographical locations to share information and interact within a shared virtual environment (VE) via a local network or through the Internet.... Read More about Multi-server support for large scale distributed virtual environments.
Regular maps and principal congruence subgroups of Hecke groups. (2005)
Journal Article
Ivrissimtzis, I., & Singerman, D. (2005). Regular maps and principal congruence subgroups of Hecke groups. European Journal of Combinatorics, 26(3-4), 437-356. https://doi.org/10.1016/j.ejc.2004.01.010
Opportunistic scheduling in a constraint-rich world (2005)
Journal Article
Johnstone, D., & Bradley, S. (2005). Opportunistic scheduling in a constraint-rich world. SIGBED review, 2(2), https://doi.org/10.1145/1121788.1121795
(QUASI) SPANNERS FOR MOBILE AD HOC NETWORKS (2005)
Journal Article
Berenbrink, P., Friedetzky, T., MaŇuch, J., & Stacho, L. (2005). (QUASI) SPANNERS FOR MOBILE AD HOC NETWORKS. Journal of Interconnection Networks, 06(02), https://doi.org/10.1142/s0219265905001320