Dr. Claude Diderich's Publications

JOURNAL PUBLICATIONS

Diderich, C. G. (2024). ` An axiomatic model towards understanding value creation and appropriation in demand-driven markets', Journal of Strategy and Management, Vol. ahead-of-print, No. ahead-of-print. DOI: 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.
Diderich, C. G. and Gengler, M. (1994), `A parallel synchronized branch and bound algorithm', Supercomputing Review (6), 15-21.
Diderich, C. G. (1993), `A bibliography on minimax trees', ACM SIGACT News 24(4), 82-89.

PUBLICATIONS IN BOOKS

Diderich, C. G. and Gengler, M. (1995), Parallel Algorithms for irregular Problems: State of the Art, Kluwer Academic Publishers, The Netherlands, Chapter 9 - Experiments with a Parallel Synchronized Branch and Bound Algorithm, pp. 177-193.
Diderich, C. G. and Gengler, M. (1995), Parallel Algorithms for Irregular Problems: State of the Art, Kluwer Academic Publishers, The Netherlands, Chapter 16 - Some Strategies for Load Balancing, pp. 323-338.
Diderich, C. G. and Gengler, M. (1995), Minimax and Its Applications, Kluwer Academic Publishers, The Netherlands, Chapter: A Survey on Minimax Trees and Associated Algorithms, pp. 25-54.

CONFERENCE PUBLICATIONS

Darte A., Diderich, C. G., Gengler, M., and Vivien F. (2000), Scheduling the computation of a loop nest with respect to a given mapping, in `Proceedings of EuroPar 2000', Vol. 1900 of LNCS, Springer Verlag, Munich, Germany, pp. 405-414.
Diderich, C. G. and Marty, W. (2000), The min-max portfolio optimization strategy: an empirical study considering transaction costs, in `Second Conference on Numerical Analysis and Applications', Vol. 1988 of LNCS, Springer Verlag, Rousse, Bulgaria, pp. 238-245.
Diderich, C. G. and Gengler, M. (1997), The alignment problem in a linear algebra framework, in `Proceedings of the Hawai`i International Conference on System Sciences (HICSS-30), Software Technology Track', IEEE Computer Society Press, Wailea, HI, pp. 586-595.
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. and Gengler, M. (1996), Solving the Constant-Degree Parallelism Alignment Problem, in `Proceedings of EuroPar '97', Vol. 1123 of LNCS, Springer Verlag, Lyon, France, pp. 451-454.
Diderich, C. G. and Gengler, M. (1996), Synchronization as a strategy for designing efficient parallel algorithms, in `Proceedings of the 3rd International Workshop on Parallel Algorithms for Irregular Structures Problems (IRREGULAR '96)', Vol. 1117 of LNCS, Springer Verlag, St. Barbara, CA, pp. 229-236.
Diderich, C. G. and Gengler, M. (1996), Solving traveling salesman problems using a parallel synchronized branch and bound algorithm, in `Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking 1996 (HPCN Europe '96)', Vol. 1067 of LNCS, Springer Verlag, Brussels, Belgium, pp. 633-638.
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, pp. 127-132.
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, pp. 175-182.
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, pp. 387-396.

TECHNICAL REPORTS

Diderich, C. G. and Gengler, M. (1997), Simultaneous construction of scheduling and data mapping functions when parallelizing loop nests, Technical Report 97/244, Swiss Federal Institute of Technology - Lausanne, Computer Science Department, 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.

PHD THESIS

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.