default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Albrecht
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c6]Christoph Albrecht, Arif Merchant, Murray Stokely, Muhammad Waliji, François Labelle, Nate Coehlo, Xudong Shi, Eric Schrock:
Janus: Optimal Flash Provisioning for Cloud Storage Workloads. USENIX ATC 2013: 91-102
2000 – 2009
- 2008
- [r2]Christoph Albrecht:
Optimization Techniquesin Routing. Handbook of Algorithms for Physical Design Automation 2008 - 2007
- [r1]Ion I. Mandoiu, Andrew B. Kahng, Christoph Albrecht, Alexander Zelikovsky
:
Multicommodity Flow Algorithms for Buffered Global Routing. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [c5]Christoph Albrecht:
Efficient incremental clock latency scheduling for large circuits. DATE 2006: 1091-1096 - 2005
- [c4]Zhong Xiu, David A. Papa, Philip Chong, Christoph Albrecht, Andreas Kuehlmann, Rob A. Rutenbar, Igor L. Markov:
Early research experience with OpenAccess gear: an open source development environment for physical design. ISPD 2005: 94-100 - [i1]Christoph Albrecht, Andrew B. Kahng, Ion I. Mandoiu, Alexander Zelikovsky:
Multicommodity Flow Algorithms for Buffered Global Routing. CoRR abs/cs/0508045 (2005) - 2003
- [j3]Christoph Albrecht, Andrew B. Kahng, Bao Liu, Ion I. Mandoiu, Alexander Zelikovsky:
On the skew-bounded minimum-buffer routing tree problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(7): 937-945 (2003) - 2002
- [j2]Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen:
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. Discret. Appl. Math. 123(1-3): 103-127 (2002) - [c3]Christoph Albrecht, Andrew B. Kahng, Ion I. Mandoiu, Alexander Zelikovsky:
Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing. ASP-DAC/VLSI Design 2002: 580- - 2001
- [j1]Christoph Albrecht:
Global routing by new approximation algorithms for multicommodityflow. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 20(5): 622-632 (2001) - 2000
- [c2]Christoph Albrecht:
Provably good global routing by a new approximation algorithm for multicommodity flow. ISPD 2000: 19-25
1990 – 1999
- 1999
- [c1]Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen:
Cycle time and slack optimization for VLSI-chips. ICCAD 1999: 232-238
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-07-17 20:29 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:
