default search action
Ping Gao 0002
Person information
- affiliation: Aries Design Automation, Chicago, IL, USA
Other persons with the same name
- Ping Gao — disambiguation page
- Ping Gao 0001 — Marvell Semiconductor Inc., Santa Clara, CA, USA (and 1 more)
- Ping Gao 0003
— University of Manchester, Global Development Institute, Manchester, UK (and 1 more)
- Ping Gao 0004 — Jiangsu Meteorological Bureau, Nanjing, China
- Ping Gao 0005
- Ping Gao 0006 — Chinese Academy of Sciences, Institute of Optics and Electronics, Chengdu, China
- Ping Gao 0007 — Duke University, Department of Electrical and Computer Engineering, Durham, NC, USA
- Ping Gao 0008 — Fudan University, Shanghai, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [c20]Miroslav N. Velev, Ping Gao:
Application of Hierarchical Hybrid Encodings to Solve CSPs as Equivalent SAT Problems. ISAIM 2016 - 2015
- [c19]Miroslav N. Velev
Exploiting abstraction, learning from random simulation, and SVM classification for efficient dynamic prediction of software health problems. ISQED 2015: 412-418 - 2014
- [c18]Miroslav N. Velev
Efficient parallel GPU algorithms for BDD manipulation. ASP-DAC 2014: 750-755 - [c17]Miroslav N. Velev
Improving the efficiency of automated debugging of pipelined microprocessors by symmetry breaking in modular schemes for boolean encoding of cardinality. ICCAD 2014: 676-683 - [c16]Miroslav N. Velev
Formal verification of safety of polymorphic heterogeneous multi-core architectures. ISQED 2014: 611-617 - 2012
- [c15]Miroslav N. Velev
Automated debugging of counterexamples in formal verification of pipelined microprocessors. ASP-DAC 2012: 689-694 - 2011
- [c14]Miroslav N. Velev
Automatic formal verification of reconfigurable DSPs. ASP-DAC 2011: 293-296 - [c13]Miroslav N. Velev
Automatic formal verification of multithreaded pipelined microprocessors. ICCAD 2011: 679-686 - [c12]Miroslav N. Velev
Exploiting Abstraction for Efficient Formal Verification of DSPs with Arrays of Reconfigurable Functional Units. ICFEM 2011: 307-322 - [c11]Miroslav N. Velev
CNF encodings of cardinality in formal methods for robustness checking of gate-level circuits. ISCAS 2011: 1479-1482 - [c10]Miroslav N. Velev, Ping Gao:
Efficient Pseudo-Boolean Satisfiability Encodings for Routing and Wavelength Assignment in Optical Networks. SARA 2011 - [c9]Miroslav N. Velev, Ping Gao:
Modular Schemes for Constructing Equivalent Boolean Encodings of Cardinality Constraints and Application to Error Diagnosis in Formal Verification of Pipelined Microprocessors. SARA 2011 - 2010
- [c8]Miroslav N. Velev
A method for debugging of pipelined processors in formal verification by correspondence checking. ASP-DAC 2010: 619-624 - [c7]Miroslav N. Velev
Method for Formal Verification of Soft-Error Tolerance Mechanisms in Pipelined Microprocessors. ICFEM 2010: 355-370 - [c6]Miroslav N. Velev, Ping Gao:
Design of parallel portfolios for SAT-based solving of Hamiltonian cycle problems. ISAIM 2010
2000 – 2009
- 2009
- [c5]Miroslav N. Velev
Efficient SAT Techniques for Relative Encoding of Permutations with Constraints. Australasian Conference on Artificial Intelligence 2009: 517-527 - [c4]Miroslav N. Velev
Exploiting hierarchical encodings of equality to design independent strategies in parallel SMT decision procedures for a logic of equality. HLDVT 2009: 8-13 - [c3]Miroslav N. Velev
Efficient SAT-based techniques for Design of Experiments by using static variable ordering. ISQED 2009: 371-376 - [c2]Miroslav N. Velev, Ping Gao:
Efficient SAT Techniques for Absolute Encoding of Permutation Problems: Application to Hamiltonian Cycles. SARA 2009 - 2008
- [c1]Miroslav N. Velev
Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems. DATE 2008: 1268-1273
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-12-05 21:39 CET 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: