Claude G. Diderich - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2000

Scheduling the Computations of a Loop Nest with Respect to a Given MappingAlain Darte, Claude G. Diderich, Marc Gengler, Frédéric Vivien. europar 2000: 405-414 [doi]

The Min-Max Portfolio Optimization Strategy: An Empirical Study on Balanced PortfoliosClaude G. Diderich, Wolfgang Marty. naa 2001: 238-245 [doi]

1998

An Extended Dimension Order Token Distribution Algorithm on k-Ary d-Cubes and Its ComplexityClaude G. Diderich, Marc Gengler. ijfcs, 9(2):213-234, 1998.

1997

The Alignment Problem in a Linear Algebra FrameworkClaude G. Diderich, Marc Gengler. hicss 1997: 586-595 [doi]

1996

Synchronization as a Strategy for Designing Efficient Parallel AlgorithmsClaude G. Diderich, Marc Gengler. irregular 1996: 229-236

Solving the Constant-Degree Parallelism Alginment ProblemClaude G. Diderich, Marc Gengler. europar 1996: 451-454

Solving Traveling Salesman Problems Using a Parallel Synchronized Branch and Bound AlgorithmClaude G. Diderich, Marc Gengler. hpcn 1996: 633-638

A heuristic approach for finding a solution to the constant-degree parallelism alignment problemClaude G. Diderich, Marc Gengler. IEEEpact 1996: 127-132 [doi]

1994

An efficient algorithm for solving the token distribution problem on k-ary d-cube networksClaude G. Diderich, Marc Gengler, Stéphane Ubéda. ispan 1994: 175-182 [doi]

A Bibliography on Minimax TreesClaude G. Diderich. icga, 17(4):222, 1994. [doi]

A Survey on Minimax Trees and Associated AlgorithmsClaude G. Diderich, Marc Gengler. icga, 17(4):222, 1994. [doi]

1993

A bibliography on minimax treesClaude G. Diderich. sigact, 24(4):82-89, 1993. [doi]

Sign in or sign up to see more results.

runs on WebDSL