![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Lukas P. P. P. van Ginneken
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [c16]Lukas P. P. P. van Ginneken:
The Annealing Algorithm revisted. ISPD 2016: 109-111
2000 – 2009
- 2003
- [c15]Alok Mehrotra, Lukas P. P. P. van Ginneken, Yatin Trivedi:
Design flow and methodology for 50M gate ASIC. ASP-DAC 2003: 640-647 - 2002
- [c14]Kolja Sulimma, Wolfgang Kunz, Ingmar Neumann, Lukas P. P. P. van Ginneken:
Improving Placement under the Constant Delay Model. DATE 2002: 677-682 - [c13]Kolja Sulimma, Ingmar Neumann, Lukas P. P. P. van Ginneken, Wolfgang Kunz:
Improving Placement under the Constant Delay Model. MBMV 2002: 67-75 - 2001
- [c12]Amir H. Ajami, Kaustav Banerjee, Massoud Pedram, Lukas P. P. P. van Ginneken:
Analysis of Non-Uniform Temperature-Dependent Interconnect Performance in High Performance ICs. DAC 2001: 567-572
1990 – 1999
- 1999
- [j1]Shih-Chieh Chang, Lukas P. P. P. van Ginneken, Malgorzata Marek-Sadowska:
Circuit Optimization by Rewiring. IEEE Trans. Computers 48(9): 962-970 (1999) - 1997
- [c11]Ramsey W. Haddad, Lukas P. P. P. van Ginneken, Narendra V. Shenoy:
Discrete Drive Selection for Continuous Sizing. ICCD 1997: 110-115 - 1996
- [c10]Shih-Chieh Chang, Lukas P. P. P. van Ginneken, Malgorzata Marek-Sadowska:
Fast Boolean optimization by rewiring. ICCAD 1996: 262-269 - [c9]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 - 1995
- [c8]Michel R. C. M. Berkelaar, Lukas P. P. P. van Ginneken:
Efficient orthonormality testing for synthesis with pass-transistor selectors. ICCAD 1995: 256-263 - 1994
- [c7]Andreas Kuehlmann, Lukas P. P. P. van Ginneken:
Grammar-Based Optimization of Synthesis Scenarios. ICCD 1994: 20-25 - [c6]Robert E. Mains, Thomas A. Mosher, Lukas P. P. P. van Ginneken, Robert F. Damiano:
Timing Verification and Optimization for the PowerPCTM Processor Family. ICCD 1994: 390-393 - [c5]Daniel Brand, Robert F. Damiano, Lukas P. P. P. van Ginneken, Anthony D. Drumm:
In the Driver's Seat of BooleDozer. ICCD 1994: 518-521 - 1992
- [c4]Lukas P. P. P. van Ginneken:
Fanin Ordering in Multi-Slot Timing Analysis. ICCD 1992: 44-47 - 1990
- [c3]Lukas P. P. P. van Ginneken, Ralph H. J. M. Otten:
Optimal slicing of plane point placements. EURO-DAC 1990: 322-326 - [c2]Ralph H. J. M. Otten, Lukas P. P. P. van Ginneken:
The complexity of adaptive annealing. ICCD 1990: 404-407
1980 – 1989
- 1988
- [c1]Ralph H. J. M. Otten, Lukas P. P. P. van Ginneken:
Stop criteria in simulated annealing. ICCD 1988: 549-552
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 02: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