Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColin P. Williams
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2011
[b3]Colin P. Williams:
Explorations in Quantum Computing, Second Edition. Texts in Computer Science, Springer 2011, ISBN 978-1-84628-886-9, pp. I-XXII, 1-717- 2000
- [b2]Colin P. Williams, Scott H. Clearwater:
Ultimate zero and one - computing at the quantum frontier. Copernicus 2000, ISBN 978-0-387-94769-3, pp. I-XIV, 1-250 - 1998
- [b1]Colin P. Williams, Scott H. Clearwater:
Explorations in quantum computing. Springer 1998, ISBN 978-0-387-94768-6, pp. I-XX, 1-307
Journal Articles
- 2006
- [j9]Colin P. Williams, Pieter Kok, Hwang Lee, Jonathan P. Dowling:
Quantum lithography: A non-computing application of quantum information. Inform. Forsch. Entwickl. 21(1-2): 73-82 (2006) - 2001
- [j8]Colin P. Williams:
Quantum search algorithms in science and engineering. Comput. Sci. Eng. 3(2): 44-51 (2001) - [j7]Pierre M. Echternach, Colin P. Williams, S. C. Dultz, Samuel L. Braunstein, Jonathan P. Dowling:
Universal quantum gates for single cooper pair box based quantum computing. Quantum Inf. Comput. 1(4): 143-150 (2001) - 2000
- [j6]Nicolas J. Cerf, Lov K. Grover, Colin P. Williams:
Nested Quantum Search and NP-Hard Problems. Appl. Algebra Eng. Commun. Comput. 10(4/5): 311-338 (2000) - [j5]Richard J. Hughes, Colin P. Williams:
Quantum Computing: The Final Frontier? IEEE Intell. Syst. 15(5): 10-18 (2000) - 1996
- [j4]Tad Hogg, Bernardo A. Huberman, Colin P. Williams:
Phase Transitions and the Search Problem. Artif. Intell. 81(1-2): 1-15 (1996) - 1994
- [j3]Tad Hogg, Colin P. Williams:
The Hardest Constraint Problems: A Double Phase Transition. Artif. Intell. 69(1-2): 359-377 (1994) - [j2]Colin P. Williams, Tad Hogg:
Exploiting the Deep Structure of Constraint Problems. Artif. Intell. 70(1-2): 73-117 (1994) - 1993
- [j1]Colin P. Williams, Tad Hogg:
The Typicality of Phase Transitions in Search. Comput. Intell. 9: 221-238 (1993)
Conference and Workshop Papers
- 1998
- [c7]Amir Fijany, Colin P. Williams:
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits. QCQC 1998: 10-33 - [c6]Michail Zak, Colin P. Williams:
Quantum Recurrent Networks for Simulating Stochastic Processes. QCQC 1998: 75-88 - [c5]Colin P. Williams, Alexander G. Gray:
Automated Design of Quantum Circuits. QCQC 1998: 113-125 - 1994
- [c4]Tad Hogg, Colin P. Williams:
Expected Gains from Parallelizing Constraint Solving for Hard Problems. AAAI 1994: 331-336 - 1993
- [c3]Colin P. Williams, Tad Hogg:
Extending Deep Structure. AAAI 1993: 152-157 - [c2]Tad Hogg, Colin P. Williams:
Solving the Really Hard Problems with Cooperative Search. AAAI 1993: 231-236 - 1992
- [c1]Colin P. Williams, Tad Hogg:
Using Deep Structure to Locate Hard Problems. AAAI 1992: 472-477
Editorship
- 1998
- [e1]Colin P. Williams:
Quantum Computing and Quantum Communications, First NASA International Conference, QCQC'98, Palm Springs, California, USA, February 17-20, 1998, Selected Papers. Lecture Notes in Computer Science 1509, Springer 1998, ISBN 3-540-65514-X [contents]
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 02:20 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:
