Colin P. Williams

According to our database, Colin P. Williams authored at least 19 papers between 1992 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2011

Explorations in Quantum Computing, Second Edition.

Colin P. Williams

Texts in Computer Science, Springer, ISBN: 978-1-84628-887-6, 2011

2006

Quantum lithography: A non-computing application of quantum information.

Colin P. Williams, Pieter Kok, Hwang Lee, Jonathan P. Dowling

Inform. Forsch. Entwickl., 2006

2001

Universal quantum gates for single cooper pair box based quantum computing.

Pierre M. Echternach, Colin P. Williams, S. C. Dultz, Samuel L. Braunstein, Jonathan P. Dowling

Quantum Inf. Comput., 2001

Quantum search algorithms in science and engineering.

Colin P. Williams

Comput. Sci. Eng., 2001

2000

Quantum Computing: The Final Frontier?

Richard J. Hughes, Colin P. Williams

IEEE Intell. Syst., 2000

Nested Quantum Search and NP-Hard Problems.

Nicolas J. Cerf, Lov K. Grover, Colin P. Williams

Appl. Algebra Eng. Commun. Comput., 2000

Ultimate zero and one - computing at the quantum frontier.

Colin P. Williams, Scott H. Clearwater

Copernicus, ISBN: 978-0-387-94769-3, 2000

1998

Quantum Recurrent Networks for Simulating Stochastic Processes.

Michail Zak, Colin P. Williams

Proceedings of the Quantum Computing and Quantum Communications, 1998

Automated Design of Quantum Circuits.

Colin P. Williams, Alexander G. Gray

Proceedings of the Quantum Computing and Quantum Communications, 1998

Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits.

Amir Fijany, Colin P. Williams

Proceedings of the Quantum Computing and Quantum Communications, 1998

Explorations in quantum computing.

Colin P. Williams, Scott H. Clearwater

Springer, ISBN: 978-0-387-94768-6, 1998

1996

Phase Transitions and the Search Problem.

Tad Hogg, Bernardo A. Huberman, Colin P. Williams

Artif. Intell., 1996

1994

Exploiting the Deep Structure of Constraint Problems.

Colin P. Williams, Tad Hogg

Artif. Intell., 1994

The Hardest Constraint Problems: A Double Phase Transition.

Tad Hogg, Colin P. Williams

Artif. Intell., 1994

Expected Gains from Parallelizing Constraint Solving for Hard Problems.

Tad Hogg, Colin P. Williams

Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993

The Typicality of Phase Transitions in Search.

Colin P. Williams, Tad Hogg

Comput. Intell., 1993

Extending Deep Structure.

Colin P. Williams, Tad Hogg

Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

Solving the Really Hard Problems with Cooperative Search.

Tad Hogg, Colin P. Williams

Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

1992

Using Deep Structure to Locate Hard Problems.

Colin P. Williams, Tad Hogg

Proceedings of the 10th National Conference on Artificial Intelligence, 1992