default search action
Vicky Choi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [i7]Vicky Choi:
Essentiality of the Non-stoquastic Hamiltonians and Driver Graph Design in Quantum Optimization Annealing. CoRR abs/2105.02110 (2021) - 2020
- [j8]Vicky Choi
:
The effects of the problem Hamiltonian parameters on the minimum spectral gap in adiabatic quantum optimization. Quantum Inf. Process. 19(3): 90 (2020)
2010 – 2019
- 2011
- [j7]Vicky Choi:
Different adiabatic quantum optimization algorithms. Quantum Inf. Comput. 11(7&8): 638-648 (2011) - [j6]Vicky Choi:
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design. Quantum Inf. Process. 10(3): 343-353 (2011) - 2010
- [i6]Vicky Choi:
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design. CoRR abs/1001.3116 (2010) - [i5]Vicky Choi:
Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems. CoRR abs/1004.2226 (2010) - [i4]Vicky Choi:
Different Adiabatic Quantum Optimization Algorithms for the NP-Complete Exact Cover and 3SAT Problems. CoRR abs/1010.1221 (2010)
2000 – 2009
- 2009
- [j5]David Sankoff, Chunfang Zheng, Adriana Muñoz, Zhenyu Yang, Zaky Adam, Robert Warren, Vicky Choi, Qian Zhu:
Issues in the Reconstruction of Gene Order Evolution. J. Comput. Sci. Technol. 25(1): 10-25 (2009) - [j4]Qian Zhu, Zaky Adam, Vicky Choi, David Sankoff:
Generalized Gene Adjacencies, Graph Bandwidth, and Clusters in Yeast Evolution. IEEE ACM Trans. Comput. Biol. Bioinform. 6(2): 213-220 (2009) - 2008
- [j3]Vicky Choi:
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem. Quantum Inf. Process. 7(5): 193-209 (2008) - [c5]Qian Zhu, Zaky Adam, Vicky Choi, David Sankoff:
Generalized Gene Adjacencies, Graph Bandwidth and Clusters in Yeast Evolution. ISBRA 2008: 134-145 - 2007
- [j2]Vicky Choi, Navin Goyal:
An Algorithmic Approach to the Identification of Rigid Domains in Proteins. Algorithmica 48(4): 343-362 (2007) - [c4]Vicky Choi, Chunfang Zheng, Qian Zhu, David Sankoff:
Algorithms for the Extraction of Synteny Blocks from Comparative Maps. WABI 2007: 277-288 - 2006
- [j1]Vicky Choi:
On Updating Torsion Angles of Molecular Conformations. J. Chem. Inf. Model. 46(1): 438-444 (2006) - [c3]Vicky Choi, Navin Goyal:
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise. LATIN 2006: 298-310 - [i3]Vicky Choi:
Faster Algorithms for Constructing a Concept (Galois) Lattice. CoRR abs/cs/0602069 (2006) - 2005
- [i2]Vicky Choi, Navin Goyal:
An Efficient Approximation Algorithm for Point Pattern Matching Under Noise. CoRR abs/cs/0506019 (2005) - 2004
- [c2]Vicky Choi, Navin Goyal:
A Combinatorial Shape Matching Algorithm for Rigid Protein Docking. CPM 2004: 285-296 - [c1]Vicky Choi, Pankaj K. Agarwal, Herbert Edelsbrunner, Johannes Rudolph:
Local Search Heuristic for Rigid Protein Docking. WABI 2004: 218-229 - 2003
- [i1]Vicky Choi, Martin Farach-Colton:
Barnacle: An Assembly Algorithm for Clone-based Sequences of Whole Genomes. CoRR cs.DS/0302005 (2003)
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:56 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: