default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Gengler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[r2]Claude G. Diderich, Marc Gengler:
Alignment Problem. Encyclopedia of Optimization 2009: 54-61- [r1]Claude G. Diderich, Marc Gengler:
Minimax Game Tree Searching. Encyclopedia of Optimization 2009: 2079-2087 - 2001
- [j4]Cyril Gavoille, Marc Gengler:
Space-Efficiency for Routing Schemes of Stretch Factor Three. J. Parallel Distributed Comput. 61(5): 679-687 (2001) - [c16]Matthieu Martel, Marc Gengler:
Partial Evaluation of Concurrent Programs. Euro-Par 2001: 504-513 - 2000
- [c15]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 - [c14]Matthieu Martel, Marc Gengler:
Communication Topology Analysis for Concurrent Programs. SPIN 2000: 265-286
1990 – 1999
- 1998
- [j3]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
- [c13]Claude G. Diderich, Marc Gengler:
The Alignment Problem in a Linear Algebra Framework. HICSS (1) 1997: 586-595 - [c12]Marc Gengler, Matthieu Martel:
Self-Applicable Partial Evaluation for the pi-Calculus. PEPM 1997: 36-46 - [c11]Cyril Gavoille, Marc Gengler:
An Omega(n2)-Lower Bound for Space-Efficiency of Routing Schemes of Stretch Factor Three. SIROCCO 1997: 162-175 - 1996
- [c10]Claude G. Diderich, Marc Gengler:
A heuristic approach for finding a solution to the constant-degree parallelism alignment problem. IEEE PACT 1996: 127-132 - [c9]Claude G. Diderich, Marc Gengler:
Solving the Constant-Degree Parallelism Alginment Problem. Euro-Par, Vol. I 1996: 451-454 - [c8]Claude G. Diderich, Marc Gengler:
Solving Traveling Salesman Problems Using a Parallel Synchronized Branch and Bound Algorithm. HPCN Europe 1996: 633-638 - [c7]Claude G. Diderich, Marc Gengler:
Synchronization as a Strategy for Designing Efficient Parallel Algorithms. IRREGULAR 1996: 229-236 - [c6]Marc Gengler:
An introduction to parallel dynamic programming. Solving Combinatorial Optimization Problems in Parallel 1996: 87-114 - 1994
- [j2]Claude G. Diderich, Marc Gengler:
A Survey on Minimax Trees and Associated Algorithms. J. Int. Comput. Games Assoc. 17(4): 222 (1994) - [j1]Marc Gengler, Giovanni Coray:
A Parallel Best-first B&B Algorithm and its Axiomatization. Parallel Algorithms Appl. 2(1-2): 61-80 (1994) - [c5]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 - [c4]Claude G. Diderich, Marc Gengler, Stéphane Ubéda:
An efficient algorithm for solving the token distribution problem on k-ary d-cube networks. ISPAN 1994: 175-182 - 1992
- [c3]Marc Gengler, Giovanni Coray:
A Parallel Best-First B&B with Synchronization Phases. CONPAR 1992: 515-526 - [c2]Bernhard Rytz, Marc Gengler:
A Polyvariant Binding Time Analysis. PEPM 1992: 21-28 - [c1]Marc Gengler, M. Rytz:
A Polyvariant Binding Time Analysis Handling Partially Known Values. WSA 1992: 322-330
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
