default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHamid Shojaei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c15]Hamid Shojaei, Vincent Augusto
:
"Constructing Machine Learning models for Orthodontic Treatment Planning: a comparison of different methods". IEEE Big Data 2022: 2790-2799- 2021
- [c14]Shobha Vasudevan, Wenjie Jiang, David Bieber, Rishabh Singh, Hamid Shojaei, Richard Ho, Charles Sutton:
Learning Semantic Representations to Verify Hardware Designs. NeurIPS 2021: 23491-23504
2010 – 2019
- 2013
- [j2]Hamid Shojaei, Twan Basten, Marc Geilen, Azadeh Davoodi:
A fast and scalable multidimensional multiple-choice knapsack heuristic. ACM Trans. Design Autom. Electr. Syst. 18(4): 51:1-51:32 (2013) - [j1]Hamid Shojaei, Azadeh Davoodi, Twan Basten:
Collaborative Multiobjective Global Routing. IEEE Trans. Very Large Scale Integr. Syst. 21(7): 1308-1321 (2013) - [c13]Hamid Shojaei, Azadeh Davoodi, Jeffrey T. Linderoth:
Planning for local net congestion in global routing. ISPD 2013: 85-92 - 2012
- [c12]Hamid Shojaei, Azadeh Davoodi, Parmeswaran Ramanathan:
Confidentiality preserving integer programming for global routing. DAC 2012: 709-716 - 2011
- [c11]Neil Steiner, Aaron Wood, Hamid Shojaei, Jacob Couch, Peter Athanas, Matthew French:
Torc: towards an open-source tool flow. FPGA 2011: 41-44 - [c10]Hamid Shojaei, Azadeh Davoodi, Jeffrey T. Linderoth:
Congestion analysis for global routing via integer programming. ICCAD 2011: 256-262 - 2010
- [c9]Hamid Shojaei, Azadeh Davoodi:
Trace signal selection to enhance timing and logic visibility in post-silicon validation. ICCAD 2010: 168-172 - [c8]Hamid Shojaei, Tai-Hsuan Wu, Azadeh Davoodi, Twan Basten:
A pareto-algebraic framework for signal power optimization in global routing. ISLPED 2010: 407-412
2000 – 2009
- 2009
- [c7]Hamid Shojaei, Amir Hossein Ghamarian, Twan Basten, Marc Geilen, Sander Stuijk, Rob Hoes:
A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for CMP run-time management. DAC 2009: 917-922 - 2008
- [c6]Hamid Shojaei, Twan Basten, Marc Geilen, Phillip Stanley-Marbell:
SPaC: a symbolic pareto calculator. CODES+ISSS 2008: 179-184 - 2007
- [c5]Majid Nabi, Hamid Shojaei, Siamak Mohammadi, Zainalabedin Navabi:
Optimized Assignment Coverage Computation in Formal Verification of Digital Systems. ATS 2007: 172-177 - [c4]Mohammad Reza Kakoee, Hamid Shojaei, Hassan Ghasemzadeh, Marjan Sirjani, Zainalabedin Navabi:
A New Approach for Design and Verification of Transaction Level Models. ISCAS 2007: 3760-3763 - 2006
- [c3]Hamid Shojaei, Mohammad Sayyaran:
Signal Coverage Computation in Formal Verification. VLSI-SoC 2006: 92-97 - 2005
- [c2]Pejman Lotfi-Kamran, Mohammad Hosseinabady, Hamid Shojaei, Mehran Massoumi, Zainalabedin Navabi:
TED+: a data structure for microprocessor verification. ASP-DAC 2005: 567-572 - 2004
- [c1]Hamid Shojaei, Habib Ghayoumi:
Techniques for Formal Verification of Digital Systems: A System Approach. DSD 2004: 444-449
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:58 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:
