Publications.

Diderich, C. (2025). Design Thinking for Strategy: Innovating towards Competitive Advantage, 2^nd edition, Springer Nature, Cham, Switzerland.

Diderich, C. (2023). Strategieentwicklung mit Design Thinking: Mit Innovation zu Wettbewerbsvorteilen, Springer Gabler, Cham, Switzerland.

Diderich, C. (2019). Design Thinking for Strategy: Innovating towards Competitive Advantage, 1^st edition, Springer Nature, Cham, Switzerland.

Diderich, C. (2009). Positive Alpha Generation: Designing Sound Investment Processes, John Wiley & Sons, Chichester, United Kingdom.

Diderich, C. (2019). Strategizing about RoboAdvice. In: Schueffel, P. (ed) WealthTech: Wealth and Asset Management in the FinTech Age. Information Age Publishing, Charlotte, NC.

Diderich, C. (2018). The Wealth Management Canvas – A Framework for Designing the WealthTech Firm of the Future. In: Chrishti, S. (ed) The WealthTech Book: The FinTech Handbook for Investors, Entrepreneurs and Finance Visionaries. John Wiley & Sons, Chichester, United Kingdom. https://doi.org/10.1002/9781119444510.ch62

Diderich, C.G., Gengler, M. (2008). Alignment Problem . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_10

Diderich, C.G., Gengler, M. (2008). Minimax Game Tree Searching . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_370

Diderich, C.G., Gengler, M. (1995). Experiments with a Parallel Synchronized Branch and Bound Algorithm. In: Ferreira, A., Rolim, J.D.P. (eds) Parallel Algorithms for Irregular Problems: State of the Art. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6130-6_9

Diderich, C.G., Gengler, M. (1995). Some Strategies for Load Balancing. In: Ferreira, A., Rolim, J.D.P. (eds) Parallel Algorithms for Irregular Problems: State of the Art. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6130-6_16

Diderich, C.G., Gengler, M. (1995). A Survey on Minimax Trees And Associated Algorithms. In: Du, DZ., Pardalos, P.M. (eds) Minimax and Applications. Nonconvex Optimization and Its Applications, Vol. 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3557-3_2

Diderich, C. (2024). “An axiomatic model towards understanding value creation and appropriation in demand-driven markets”, Journal of Strategy and Management, 17(2), 375-390. https://doi.org/10.1108/JSMA-11-2023-0299

Diderich, C. G. and Gengler, M. (1998). “An extended dimension order token distribution algorithm on k-ary d-cubes and its complexity”, International Journal of Foundations of Computer Science 9(2), 213-234. https://doi.org/10.1142/S0129054198000155

Diderich, C. (2023). “The truth behind artificial intelligence: Illustrated by designing an investment advice solution”, Journal of Financial Transformation, Vol. 58, 116-125.

Diderich, C. (2023). “Kundenzentrierte Messung der Unternehmensleistung”, KMU Magazin, Nr. 3, 8-11.

Diderich, C. (2019). “Mit differenzierten Wertversprechen erfolgreich Neukunden gewinnen”, KMU Magazin, Nr. 9, 56-59.

Diderich C. and Deplazes, I. (2019). “Risikomanagement von illiquiden Anlagen: Zeit als zusätzliche Dimension”, Schweizer Personalvorsorge / Prévoyance Professionnelle Suisse, Nr. 8-19, 76-79.

Diderich, C. (2019). “Understanding the value of design thinking to innovation in banking”, Journal of Financial Transformation, Vol. 48, 64-73.

Diderich, C. G. and Gengler, M. (1994), “A parallel synchronized branch and bound algorithm”, Supercomputing Review, Vol. 6, 15-21.

Diderich, C. G. (1993), “A bibliography on minimax trees”, ACM SIGACT News 24(4), 82-89. https://doi.org/10.1145/164996.165007

Diderich, C. (2020). Digital Business Model Innovation Towards Competitive Advantage. In: Bach Tobji, M.A., Jallouli, R., Samet, A., Touzani, M., Strat, V.A., Pocatilu, P. (eds) Digital Economy. Emerging Technologies and Business Innovation (ICDEc 2020). Lecture Notes in Business Information Processing, Vol. 395. Springer, Cham. https://doi.org/10.1007/978-3-030-64642-4

Diderich, C. (2016). Initiating the Strategy Process Using Design Thinking. In: 36th Strategic Management Society (SMS) Annual International Conference, Berlin, Germany. https://dx.doi.org/10.2139/ssrn.2927941

Diderich, C., Marty, W. (2001). The Min-Max Portfolio Optimization Strategy: An Empirical Study on Balanced Portfolios. In: Vulkov, L., Yalamov, P., Waśniewski, J. (eds) Numerical Analysis and Its Applications (NAA 2000). Lecture Notes in Computer Science, Vol. 1988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45262-1_29

Darte, A., Diderich, C., Gengler, M., Vivien, F. (2000). Scheduling the Computations of a Loop Nest with Respect to a Given Mapping. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing (Euro-Par 2000). Lecture Notes in Computer Science, Vol. 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_52

Diderich, C. G. and Gengler, M. (1997). The alignment problem in a linear algebra framework. In: Proceedings of the Hawaii International Conference on System Sciences (HICSS-30), Software Technology Track. IEEE Computer Society Press, Wailea, HI. https://doi.org/10.1109/HICSS.1997.667406

Diderich, C. G. and Gengler, M. (1997). A General Solution to the Alignment Problem on Distributed Memory Machines. In: Proceedings of the 3rd Workshop on Automatic Data Layout and Performance Prediction (AP’97). Barcelona, Spain.

Diderich, C.G., Gengler, M. (1996). Solving the constant-degree parallelism alignment problem. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par’96 Parallel Processing (Euro-Par 1996). Lecture Notes in Computer Science, Vol. 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_60

Diderich, C.G., Gengler, M. (1996). Solving traveling salesman problems using a parallel synchronized branch and bound algorithm. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking (HPCN-Europe 1996). Lecture Notes in Computer Science, Vol. 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_607

Diderich, C.G., Gengler, M. (1996). Synchronization as a strategy for designing efficient parallel algorithms. In: Ferreira, A., Rolim, J., Saad, Y., Yang, T. (eds) Parallel Algorithms for Irregularly Structured Problems (IRREGULAR 1996). Lecture Notes in Computer Science, Vol. 1117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030113

Diderich, C. G. and Gengler, M. (1996), Strategies for parallelizing branch and bound algorithms, In: Proceedings of the Parallel Optimization Colloquium (POC ’96). Versailles, France.

Diderich, C. G. and Gengler, M. (1996). A heuristic approach for finding a solution to the constant-degree parallelism alignment problem. In: Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT ’96). IEEE Computer Society Press, Boston, MA. https://doi.org/10.1109/PACT.1996.552656

Diderich, C. G., Gengler, M., and Ubeda, S. (1994). An efficient algorithm for solving the token distribution problem on k-ary d-cube networks, In: Proceedings of the 1994 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN ’94). IEEE Computer Society Press, Kanazawa, Japan. https://doi.org/10.1109/ISPAN.1994.367149

Diderich, C. G. (1993), Expert systems and their risks: An ethical study. In: Proceedings of the European Conference on Computer Science, Communication and Society: A Technical and Cultural Challenge. Neuchâtel, Switzerland.

Diderich, C. (2022). An axiomatic model of customer value creation and firm value appropriation enhancing strategic decision-making based on the jobs to be done theory. http://dx.doi.org/10.2139/ssrn.4060648

Diderich, C. G. and Gengler, M. (1997), Simultaneous construction of scheduling and data mapping functions when parallelizing loop nests, Technical Report 97/244, Computer Science Department, Swiss Federal Institute of Technology – Lausanne, Lausanne, Switzerland.

Diderich, C. G. and Gengler, M. (1996), Solving the constant-degree parallelism alignment problem, Technical Report 96/195, Swiss Federal Institute of Technology – Lausanne, Computer Science Department, Lausanne, Switzerland.

Diderich, C. G. and Gengler, M. (1995), Experiments with a parallel synchronized branch and bound algorithm, Technical Report 95/105, Swiss Federal Institute of Technology – Lausanne, Computer Science Department, Lausanne, Switzerland.

Amaldi, E., Diderich C. G., and Hauser, R. (1994) On the probabilistic and thermal perceptron training algorithms, Technical Report ORWP-8-94, Department of Mathematics, Swiss Federal Institute of Technology – Lausanne, Lausanne, Switzerland

Diderich, C. G. (1998), Automatic Data Distribution for Distributed Memory Parallel Computers, PhD Thesis, Swiss Federal Institute of Technology – Lausanne, Computer Science Department, Lausanne, Switzerland. https://doi.org/10.5075/epfl-thesis-1810