default search action
Ralph H. J. M. Otten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [c26]Gerard J. M. Smit, Gerrit F. van der Hoeven, Jan Friso Groote, Ralph H. J. M. Otten, Hans Tonino, Ben H. H. Juurlink, Boudewijn R. H. M. Haverkort:
The 3TU embedded systems master in the Netherlands. WESE@ESWEEK 2009: 8-12 - 2008
- [r1]Ralph H. J. M. Otten:
Layout Synthesis. Handbook of Algorithms for Physical Design Automation 2008 - 2006
- [j5]Jochen A. G. Jess, Kerim Kalafala, Srinath R. Naidu, Ralph H. J. M. Otten, Chandramouli Visweswariah:
Statistical Timing for Parametric Yield Prediction of Digital Integrated Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(11): 2376-2392 (2006) - 2004
- [c25]Giuseppe S. Garcea, N. P. van der Meijs, Kees-Jan van der Kolk, Ralph H. J. M. Otten:
Statistically Aware Buffer Planning. DATE 2004: 1402-1403 - 2003
- [c24]Jochen A. G. Jess, Kerim Kalafala, Srinath R. Naidu, Ralph H. J. M. Otten, Chandramouli Visweswariah:
Statistical timing for parametric yield prediction of digital integrated circuits. DAC 2003: 932-937 - [c23]Jurjen Westra, Dirk-Jan Jongeneel, Ralph H. J. M. Otten, Chandu Visweswariah:
Time Budgeting in a Wireplanning Context. DATE 2003: 10436-10441 - [c22]Giuseppe S. Garcea, Nick van der Meijs, Ralph H. J. M. Otten:
Analytic model for area and power constrained optimal repeater insertion. ESSCIRC 2003: 591-594 - [c21]Giuseppe S. Garcea, N. P. van der Meijs, Ralph H. J. M. Otten:
Simultaneous Analytic Area and Power Optimization for Repeater Insertion. ICCAD 2003: 568-573 - 2002
- [j4]Ralph H. J. M. Otten:
Shifts in INTEGRATION: 20 years of VLSI design. Integr. 32(1-2): 1-4 (2002) - [c20]Ralph H. J. M. Otten, Raul Camposano, Patrick Groeneveld:
Design Automation for Deepsubmicron: Present and Future. DATE 2002: 650-657 - 2001
- [c19]Ralph H. J. M. Otten, Giuseppe S. Garcea:
Are wires plannable? SLIP 2001: 59-66 - 2000
- [j3]Ralph H. J. M. Otten, Robert K. Brayton:
Performance planning. Integr. 29(1): 1-24 (2000) - [j2]Dirk-Jan Jongeneel, Ralph H. J. M. Otten:
Technology mapping for area and speed. Integr. 29(1): 45-66 (2000) - [c18]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 - [c17]Dirk-Jan Jongeneel, Yosinori Watanabe, Robert K. Brayton, Ralph H. J. M. Otten:
Area and search space control for technology mapping. DAC 2000: 86-91 - [c16]Ralph H. J. M. Otten, Paul Stravers:
Challenges in Physical Chip Design. ICCAD 2000: 84-91 - [c15]Ralph H. J. M. Otten:
What is a floorplan?. ISPD 2000: 201-206
1990 – 1999
- 1999
- [c14]Sunil P. Khatri, Amit Mehrotra, Robert K. Brayton, Ralph H. J. M. Otten, Alberto L. Sangiovanni-Vincentelli:
A Novel VLSI Layout Fabric for Deep Sub-Micron Applications. DAC 1999: 491-496 - 1998
- [c13]Ralph H. J. M. Otten, Robert K. Brayton:
Planning for Performance. DAC 1998: 122-127 - [c12]Bogdan G. Arsintescu, Ralph H. J. M. Otten:
Constraints Space Management for the Layout of Analog IC's. DATE 1998: 971-972 - [c11]Ralph H. J. M. Otten:
Global wires: harmful?. ISPD 1998: 104-109 - 1997
- [c10]Serban Bruma, Ralph H. J. M. Otten:
Novel Simulation of Deep-Submicron MOSFET Circuits. ICCD 1997: 62-67 - [e2]Ralph H. J. M. Otten, Hiroto Yasuura:
Proceedings of the 1997 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1997, San Jose, CA, USA, November 9-13, 1997. IEEE Computer Society / ACM 1997, ISBN 0-8186-8200-0 [contents] - 1996
- [c9]Ireneusz Karkowski, Ralph H. J. M. Otten:
An Automatic Hardware-Software Partitioner Based on the Possibilistic Programming. ED&TC 1996: 467-472 - [c8]Ralph H. J. M. Otten, Lukas P. P. P. van Ginneken, Narendra V. Shenoy:
Embedded tutorial: Speed - new paradigms in design for performance. ICCAD 1996: 700 - [e1]Rob A. Rutenbar, Ralph H. J. M. Otten:
Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 1996, San Jose, CA, USA, November 10-14, 1996. IEEE Computer Society / ACM 1996, ISBN 0-8186-7597-7 [contents] - 1995
- [c7]Ireneusz Karkowski, Ralph H. J. M. Otten:
Retiming Synchronous Circuitry with Imprecise Delays. DAC 1995: 322-326 - 1992
- [c6]Michiel Kraak, Ralph H. J. M. Otten:
Tackling cost optimization in testable design by forward inferencing. EURO-DAC 1992: 252-257 - 1990
- [c5]Lukas P. P. P. van Ginneken, Ralph H. J. M. Otten:
Optimal slicing of plane point placements. EURO-DAC 1990: 322-326 - [c4]Ralph H. J. M. Otten, Lukas P. P. P. van Ginneken:
The complexity of adaptive annealing. ICCD 1990: 404-407
1980 – 1989
- 1989
- [j1]Hong Cai, Ralph H. J. M. Otten:
Conflict-free channel definition in building-block layout. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(9): 981-988 (1989) - 1988
- [c3]Ralph H. J. M. Otten, Lukas P. P. P. van Ginneken:
Stop criteria in simulated annealing. ICCD 1988: 549-552 - 1982
- [c2]Ralph H. J. M. Otten:
Automatic floorplan design. DAC 1982: 261-267 - 1980
- [c1]Antoni A. Szepieniec, Ralph H. J. M. Otten:
The genealogical approach to the layout problem. DAC 1980: 535-542
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-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint