default search action
Jean-Francois Collard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j10]Marc Gouttefarde, Jean-Francois Collard, Nicolas Riehl, Cédric Baradat:
Geometry Selection of a Redundantly Actuated Cable-Suspended Parallel Robot. IEEE Trans. Robotics 31(2): 501-510 (2015) - 2012
- [c23]Marc Gouttefarde, Jean-Francois Collard, Nicolas Riehl, Cédric Baradat:
Simplified static analysis of large-dimension parallel cable-driven robots. ICRA 2012: 2299-2305
2000 – 2009
- 2006
- [j9]Sami Yehia, Jean-Francois Collard, Olivier Temam:
Load squared: Adding logic close to memory to reduce the latency of indirect loads in embedded and general systems. J. Embed. Comput. 2(1): 5-14 (2006) - [c22]Eduard Ayguadé, Wolfgang Karl, Koen De Bosschere, Jean-Francois Collard:
Topic 7: Parallel Computer Architecture and Instruction Level Parallelism. Euro-Par 2006: 459 - [c21]Jack Sampson, Rubén González, Jean-Francois Collard, Norman P. Jouppi, Michael S. Schlansker, Brad Calder:
Exploiting Fine-Grained Data Parallelism with Chip Multiprocessors and Fast Barriers. MICRO 2006: 235-246 - [c20]Christophe Lemuet, Jack Sampson, Jean-Francois Collard, Norman P. Jouppi:
Architecture - The potential energy efficiency of vector acceleration. SC 2006: 77 - 2005
- [j8]Sami Yehia, Jean-Francois Collard, Olivier Temam:
Load squared: adding logic close to memory to reduce the latency of indirect loads with high miss ratios. SIGARCH Comput. Archit. News 33(3): 17-24 (2005) - [j7]Jack Sampson, Rubén González, Jean-Francois Collard, Norman P. Jouppi, Michael S. Schlansker:
Fast synchronization for chip multiprocessors. SIGARCH Comput. Archit. News 33(4): 64-69 (2005) - [c19]Gary Gostin, Jean-Francois Collard, Kirby Collins:
The architecture of the HP Superdome shared-memory multiprocessor. ICS 2005: 239-245 - [c18]Jean-Francois Collard, Norman P. Jouppi, Sami Yehia:
System-wide performance monitors and their application to the optimization of coherent memory accesses. PPoPP 2005: 247-254 - 2004
- [c17]Sami Yehia, Jean-Francois Collard, Olivier Temam:
Load squared: adding logic close to memory to reduce the latency of indirect loads with high miss ratios. MEDEA@PACT 2004: 17-24 - 2003
- [b1]Jean-Francois Collard:
Reasoning about program transformations - imperative programming and flow of data. Springer 2003, ISBN 978-0-387-95391-5, pp. I-XVIII, 1-237 - [c16]Jean-Francois Collard, Daniel M. Lavery:
Optimizations to Prevent Cache Penalties for the Intel ® Itanium 2 Processor. CGO 2003: 105-114 - [c15]Stamatis Vassiliadis, Nikitas J. Dimopoulos, Jean-Francois Collard, Arndt Bode:
Topic Introduction. Euro-Par 2003: 541-542 - 2000
- [j6]Denis Barthou, Albert Cohen, Jean-Francois Collard:
Maximal Static Expansion. Int. J. Parallel Program. 28(3): 213-243 (2000) - [c14]Samuel P. Midkiff, Barbara M. Chapman, Jean-Francois Collard, Jens Knoop:
Compilers for High Performance. Euro-Par 2000: 329-330 - [c13]Jens Knoop, Jean-Francois Collard, Roy Dz-Ching Ju:
Partial Redundancy Elimination on Predicated Code. SAS 2000: 260-279
1990 – 1999
- 1999
- [j5]Roy Dz-Ching Ju, Jean-Francois Collard, Karim Oukbir:
Probabilistic memory disambiguation and its application to data speculation. SIGARCH Comput. Archit. News 27(1): 27-30 (1999) - [c12]Jean-Francois Collard:
Array SSA for Explicitly Parallel Programs. Euro-Par 1999: 383-390 - [c11]Jean-Francois Collard, Martin Griebl:
A Precise Fixpoint Reaching Definition Analysis for Arrays. LCPC 1999: 286-302 - 1998
- [c10]Albert Cohen, Jean-Francois Collard:
Instance-Wise Reaching Definition Analysis for Recursive Programs using Context-Free Transductions. IEEE PACT 1998: 332-339 - [c9]Jean-Francois Collard:
Automatic Parallelization and High-Performance Compilers. Euro-Par 1998: 411-412 - [c8]Jean-Francois Collard:
The Advantages of Instance-Wise Reaching Definition Analyses in Array (S)SA. LCPC 1998: 338-352 - [c7]Denis Barthou, Albert Cohen, Jean-Francois Collard:
Maximal Static Expansion. POPL 1998: 98-106 - 1997
- [j4]Denis Barthou, Jean-Francois Collard, Paul Feautrier:
Fuzzy Array Dataflow Analysis. J. Parallel Distributed Comput. 40(2): 210-226 (1997) - [j3]Jean-Francois Collard, Martin Griebl:
Array Dataflow Analysis for Explicitly Parallel Programs. Parallel Process. Lett. 7(2): 117-131 (1997) - 1996
- [c6]Jean-Francois Collard, Martin Griebl:
Array Dataflow Analysis for Explicitly Parallel Programs. Euro-Par, Vol. I 1996: 406-413 - [c5]Denis Barthou, Jean-Francois Collard, Paul Feautrier:
Applicaions of Fuzzy Array Dataflow Analysis. Euro-Par, Vol. I 1996: 424-427 - 1995
- [j2]Jean-Francois Collard:
Automatic parallelization of while -loops using speculative execution. Int. J. Parallel Program. 23(2): 191-219 (1995) - [j1]Jean-Francois Collard, Tanguy Risset, Paul Feautrier:
Construction of Do Loops from Systems of Affine Constraints. Parallel Process. Lett. 5: 421-436 (1995) - [c4]Martin Griebl, Jean-Francois Collard:
Generation of Synchronous Code for Automatic Parallelization of while Loops. Euro-Par 1995: 315-326 - [c3]Jean-Francois Collard, Denis Barthou, Paul Feautrier:
Fuzzy Array Dataflow Analysis. PPoPP 1995: 92-101 - 1994
- [c2]Jean-Francois Collard:
Code Generation in Automatic Parallelizers. Applications in Parallel and Distributed Computing 1994: 185-194 - [c1]Björn Lisper, Jean-Francois Collard:
Extended Analysis of Data Fields. SAS 1994: 208-222
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-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint