2009 |
19 | EE | Claude G. Diderich,
Marc Gengler:
Minimax Game Tree Searching.
Encyclopedia of Optimization 2009: 2079-2087 |
18 | EE | Claude G. Diderich,
Marc Gengler:
Alignment Problem.
Encyclopedia of Optimization 2009: 54-61 |
2001 |
17 | EE | Matthieu Martel,
Marc Gengler:
Partial Evaluation of Concurrent Programs.
Euro-Par 2001: 504-513 |
16 | EE | Cyril Gavoille,
Marc Gengler:
Space-Efficiency for Routing Schemes of Stretch Factor Three.
J. Parallel Distrib. Comput. 61(5): 679-687 (2001) |
2000 |
15 | EE | Alain Darte,
Claude G. Diderich,
Marc Gengler,
Frédéric Vivien:
Scheduling the Computations of a Loop Nest with Respect to a Given Mapping.
Euro-Par 2000: 405-414 |
14 | | Matthieu Martel,
Marc Gengler:
Communication Topology Analysis for Concurrent Programs.
SPIN 2000: 265-286 |
1998 |
13 | | Claude G. Diderich,
Marc Gengler:
An Extended Dimension Order Token Distribution Algorithm on k-Ary d-Cubes and Its Complexity.
Int. J. Found. Comput. Sci. 9(2): 213-234 (1998) |
1997 |
12 | EE | Claude G. Diderich,
Marc Gengler:
The Alignment Problem in a Linear Algebra Framework.
HICSS (1) 1997: 586-595 |
11 | EE | Marc Gengler,
Matthieu Martel:
Self-Applicable Partial Evaluation for the pi-Calculus.
PEPM 1997: 36-46 |
10 | | Cyril Gavoille,
Marc Gengler:
An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three.
SIROCCO 1997: 162-175 |
1996 |
9 | | Claude G. Diderich,
Marc Gengler:
Solving the Constant-Degree Parallelism Alginment Problem.
Euro-Par, Vol. I 1996: 451-454 |
8 | | Claude G. Diderich,
Marc Gengler:
Solving Traveling Salesman Problems Using a Parallel Synchronized Branch and Bound Algorithm.
HPCN Europe 1996: 633-638 |
7 | | Claude G. Diderich,
Marc Gengler:
Synchronization as a Strategy for Designing Efficient Parallel Algorithms.
IRREGULAR 1996: 229-236 |
6 | | Marc Gengler:
An introduction to parallel dynamic programming.
Solving Combinatorial Optimization Problems in Parallel 1996: 87-114 |
1994 |
5 | | Michèle Dion,
Marc Gengler,
Stéphane Ubéda:
Comparing two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm.
CONPAR 1994: 359-370 |
4 | EE | Marc Gengler,
Giovanni Coray:
A Parallel Best-first B&B Algorithm and its Axiomatization.
Parallel Algorithms Appl. 2(1-2): 61-80 (1994) |
1992 |
3 | | Marc Gengler,
Giovanni Coray:
A Parallel Best-First B&B with Synchronization Phases.
CONPAR 1992: 515-526 |
2 | | Bernhard Rytz,
Marc Gengler:
A Polyvariant Binding Time Analysis.
PEPM 1992: 21-28 |
1 | | Marc Gengler,
M. Rytz:
A Polyvariant Binding Time Analysis Handling Partially Known Values.
WSA 1992: 322-330 |