# Marc Gengler

According to our database

Collaborative distances:

^{1}, Marc Gengler authored at least 22 papers between 1992 and 2009.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2009

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2001

J. Parallel Distributed Comput., 2001

Proceedings of the Euro-Par 2001: Parallel Processing, 2001

2000

Proceedings of the SPIN Model Checking and Software Verification, 7th International SPIN Workshop, Stanford, CA, USA, August 30, 2000

Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1998

An Extended Dimension Order Token Distribution Algorithm on k-Ary d-Cubes and Its Complexity.

Int. J. Found. Comput. Sci., 1998

1997

An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three.

Proceedings of the SIROCCO'97, 1997

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '97), 1997

Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

1996

Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

Solving Traveling Salesman Problems Using a Parallel Synchronized Branch and Bound Algorithm.

Proceedings of the High-Performance Computing and Networking, 1996

Proceedings of the Euro-Par '96 Parallel Processing, 1996

A heuristic approach for finding a solution to the constant-degree parallelism alignment problem.

Proceedings of the Fifth International Conference on Parallel Architectures and Compilation Techniques, 1996

1994

Parallel Algorithms Appl., 1994

J. Int. Comput. Games Assoc., 1994

An efficient algorithm for solving the token distribution problem on k-ary d-cube networks.

Proceedings of the International Symposium on Parallel Architectures, 1994

Comparing two Probabilistic Models of the Computational Complexity of the Branch and Bound Algorithm.

Proceedings of the Parallel Processing: CONPAR 94, 1994

1992

A Polyvariant Binding Time Analysis Handling Partially Known Values.

Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992

A Polyvariant Binding Time Analysis.

Proceedings of the PEPM'92, 1992

Proceedings of the Parallel Processing: CONPAR 92, 1992