Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.”https://doi.org/10.1016/s0020-0190(97)00032-x__Information Processing Letters, 1995, 103–10.https://doi.org/10.1016/s0020-0190(97)00032-x .
LibreCat: /record/16566
DOI: 10.1016/s0020-0190(97)00032-x

Golubitsky, Martin, Jerrold Marsden, Ian Stewart, and Michael Dellnitz. “The Constrained Liapunov-Schmidt Procedure and Periodic Orbits.”https://doi.org/10.1090/fic/004/05__In Normal Forms and Homoclinic Chaos. Providence, Rhode Island, 1995.https://doi.org/10.1090/fic/004/05 .
LibreCat: /record/16611
DOI: 10.1090/fic/004/05

Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.”https://doi.org/10.1007/3-540-59042-0_81__In STACS 95. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-59042-0_81 .
LibreCat: /record/16704
DOI: 10.1007/3-540-59042-0_81

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared Memory Simulations with Triple-Logarithmic Delay.”https://doi.org/10.1007/3-540-60313-1_133__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60313-1_133 .
LibreCat: /record/16705
DOI: 10.1007/3-540-60313-1_133

Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.”https://doi.org/10.1145/215399.215430__In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995.https://doi.org/10.1145/215399.215430 .
LibreCat: /record/16706
DOI: 10.1145/215399.215430

Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.”https://doi.org/10.1109/istcs.1995.377051__In Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.https://doi.org/10.1109/istcs.1995.377051 .
LibreCat: /record/16707
DOI: 10.1109/istcs.1995.377051

Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.”https://doi.org/10.1007/3-540-60618-1_77__In Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60618-1_77 .
LibreCat: /record/16717
DOI: 10.1007/3-540-60618-1_77

Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.”https://doi.org/10.1007/3-540-60313-1_131__In Lecture Notes in Computer Science. Berlin, Heidelberg, 1995.https://doi.org/10.1007/3-540-60313-1_131 .
LibreCat: /record/16874
DOI: 10.1007/3-540-60313-1_131

Platzner, Marco, Bernhard Rinner, and Reinhold Weiss. “Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation.” J.UCS Journal of Universal Computer Science 12 (1995): 811–20.
LibreCat: /record/10610

Dugast, Christian, Peter Beyerlein, and Reinhold Haeb-Umbach. “Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition.” In ICASSP, Detroit, 1995.
LibreCat: /record/11757