default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Coudert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[c31]Olivier Coudert:
An efficient algorithm to verify generalized false paths. DAC 2010: 188-193
2000 – 2009
- 2002
- [c30]Olivier Coudert:
Optimization in an Integrated Physical Design Flow (Tutorial Abstract). ISQED 2002: 13-14 - [c29]Olivier Coudert:
Timing and Design Closure in Physical Design Flows (invited). ISQED 2002: 511-516 - 2001
- [c28]Rob A. Rutenbar, Olivier Coudert, Patrick Groeneveld, Jürgen Koehl, Scott Peterson, Vivek Raghavan, Naresh Soni:
Automatic Hierarchical Design: Fantasy or Reality? (Panel). ICCAD 2001: 656 - 2000
- [c27]Raul Camposano, Olivier Coudert, Patrick Groeneveld, Leon Stok, Ralph H. J. M. Otten:
Timing closure: the solution and its problems. ASP-DAC 2000: 359-364 - [c26]Olivier Coudert, Igor L. Markov, Christoph Meinel, Ellen Sentovich:
Web-based frameworks to enable CAD RD (abstract). DAC 2000: 711 - [c25]Olivier Coudert, Jason Cong, Sharad Malik
, Majid Sarrafzadeh:
Incremental CAD. ICCAD 2000: 236-243
1990 – 1999
- 1998
- [c24]Olivier Coudert:
A New Paradigm for Dichotomy-based Constrained Encoding. DATE 1998: 830-834 - [c23]Bwolen Yang, Randal E. Bryant, David R. O'Hallaron, Armin Biere, Olivier Coudert, Geert Janssen, Rajeev K. Ranjan, Fabio Somenzi:
A Performance Study of BDD-Based Model Checking. FMCAD 1998: 255-289 - 1997
- [j4]Olivier Coudert:
Gate sizing for constrained delay/power/area optimization. IEEE Trans. Very Large Scale Integr. Syst. 5(4): 465-472 (1997) - [c22]Olivier Coudert:
Exact Coloring of Real-Life Graphs is Easy. DAC 1997: 121-126 - [c21]Olivier Coudert:
Solving graph optimization problems with ZBDDs. ED&TC 1997: 224-228 - 1996
- [c20]Olivier Coudert:
On Solving Covering Problems. DAC 1996: 197-202 - [c19]Olivier Coudert, Ramsey W. Haddad, Srilatha Manne:
New Algorithms for Gate Sizing: A Comparative Study. DAC 1996: 734-739 - [c18]Olivier Coudert:
Gate Sizing: A General Purpose Optimization Approach. ED&TC 1996: 214-218 - [c17]Olivier Coudert, C.-J. Richard Shi:
Exact Dichotomy-based Constrained Encodi. ICCD 1996: 426-431 - [c16]Olivier Coudert, Ramsey W. Haddad:
Integrated resynthesis for low power. ISLPED 1996: 169-174 - [c15]Kurt Keutzer, Olivier Coudert, Ramsey W. Haddad:
What is the state of the art in commercial EDA tools for low power? ISLPED 1996: 181-187 - 1995
- [j3]Olivier Coudert, Jean Christophe Madre:
The Implicit Set Paradigm: A New Approach to Finite State System Verification. Formal Methods Syst. Des. 6(2): 133-145 (1995) - [c14]Olivier Coudert, Jean Christophe Madre:
New Ideas for Solving Covering Problems. DAC 1995: 641-646 - [c13]Olivier Coudert:
Doing Two-Level Logic Minimization 100 Times Faster. SODA 1995: 112-121 - 1994
- [j2]Olivier Coudert:
Two-level logic minimization: an overview. Integr. 17(2): 97-140 (1994) - [j1]Olivier Coudert, Jean Christophe Madre:
Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes. RAIRO Theor. Informatics Appl. 28(2): 125-149 (1994) - 1993
- [c12]Olivier Coudert, Jean Christophe Madre, Henri Fraisse:
A New Viewpoint on Two-Level Logic Minimization. DAC 1993: 625-630 - [c11]Olivier Coudert, Jean Christophe Madre:
Towards a Symbolic Logic Minimization Algorithm. VLSI Design 1993: 329-334 - 1992
- [c10]Olivier Coudert, Jean Christophe Madre:
Implicit and Incremental Computation of Primes and Essential Primes of Boolean Functions. DAC 1992: 36-39 - [c9]Bill Lin, Olivier Coudert, Jean Christophe Madre:
Symbolic Prime Generation for Multiple-Valued Functions. DAC 1992: 40-44 - 1991
- [c8]Jean Christophe Madre, Olivier Coudert:
A Logically Complete Reasoning Maintenance System Based on a Logical Constraint Solver. IJCAI 1991: 294-299 - 1990
- [c7]Olivier Coudert, Jean Christophe Madre, Christian Berthet:
Verifying Temporal Properties of Sequential Machines Without Building their State Diagrams. CAV 1990: 23-32 - [c6]Olivier Coudert, Jean Christophe Madre, Christian Berthet:
Verifying Temporal Properties of Sequential Machines without Building Their State Diagrams. CAV (DIMACS/AMS volume) 1990: 75-84 - [c5]Olivier Coudert, Christian Berthet, Jean Christophe Madre:
Formal boolean manipulations for the verification of sequential machines. EURO-DAC 1990: 57-61 - [c4]Olivier Coudert, Jean Christophe Madre:
A Unified Framework for the Formal Verification of Sequential Circuits. ICCAD 1990: 126-129 - [c3]Christian Berthet, Olivier Coudert, Jean Christophe Madre:
New ideas on symbolic manipulations of finite state machines. ICCD 1990: 224-227
1980 – 1989
- 1989
- [c2]Olivier Coudert, Christian Berthet, Jean Christophe Madre:
Verification of Synchronous Sequential Machines Based on Symbolic Execution. Automatic Verification Methods for Finite State Systems 1989: 365-373 - [c1]Jean Christophe Madre, Olivier Coudert, Jean-Paul Billon:
Automating the diagnosis and the rectification of design errors with PRIAM. ICCAD 1989: 30-33
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:43 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:
