Address CWI
Visiting address: Science Park 123, NL-1098 XG Amsterdam
Postal address: P.O. Box 94079, NL-1090 GB Amsterdam
The Netherlands
Office L234 (2nd floor of the new wing of the CWI building)
Telephone 020-5924078 (+31 20 5924078)
Telefax 020-5924199 (+31 20 5924199)
E-mail rdewolf at cwidotnl
I recently received funding for a postdoc
in quantum computing (specifically: quantum
algorithms, communication complexity, fault-tolerance). If you're good
and you're interested: send me an e-mail.
I'm looking for people whose primary focus is computer science aspects,
not physics.
If you're interested in a summer internship: in principle I don't have
any avaliable, but I might try to work something out if you have a very
strong background in the type of research I'm doing.
I am a researcher at PNA6 of CWI
(Dutch Centre for Mathematics and Computer Science), Amsterdam, the Netherlands.
My main interests are quantum computing and complexity theory.
A. Ambainis and R. de Wolf.
Average-Case
Quantum Query Complexity.
In 17th Annual Symposium on Theoretical Aspects of Computer Science
(STACS 00), LNCS 1770, pp.133-144.
quant-ph/9904079 Journal
version in Journal of Physics A: Mathematical and General,
Special Issue on Quantum Information and Computation, 34(35):6741-6754,
2001.
H. Buhrman, I. Newman, H. Röhrig, and R. de Wolf.
Robust
Quantum Algorithms and Polynomials.
In 22nd Annual Symposium on Theoretical Aspects of Computer Science
(STACS 05), LNCS 3404, pp.593-604.
quant-ph/0309220 Journal
version in Theory of Computing Systems, 40(4):379-395,
2007 (special issue on STACS 05).
A. Ambainis, M. Mosca, A. Tapp, and R. de Wolf.
Private
Quantum Channels.
In 41st IEEE Symposium on Foundations of Computer Science (FOCS 00),
pp.547-553. quant-ph/0003101
S.H. Nienhuys-Cheng and R. de Wolf. Foundations of
Inductive Logic Programming, Lecture Notes in Artificial
Intelligence 1228, Springer, May 1997 (amazon.com
link). This is a very theoretical book on ILP. The first part gives
a self-contained introduction to the theory of resolution-based theorem
proving and logic programming, the second part in-depth covers most of
the topics in ILP that we considered of foundational
importance for the field. Writing this book took us about two and a
half years of sweat and struggle, but I'm still quite happy with the
final result (except for a serious error in the appendix to Chapter 18,
which was pointed out to us by Chandra Reddy). Krzysztof Apt kindly wrote
the foreword to our book, and also put it as review 97-6 on a
page
of positive reviews.
S.H. Nienhuys-Cheng and R. de Wolf.
A
Complete
Method for Program Specialization Based on Unfolding.
In 12th European Conference on Artificial
Intelligence (ECAI 96), pp.438-442, Wiley.
As I'm having some trouble compiling this file into pdf, you may
download the LaTeX-source of the paper instead.
S.H. Nienhuys-Cheng and R. de Wolf.
Least
Generalizations under Implication.
In 6th Workshop on Inductive Logic
Programming (ILP 96), LNAI 1314, pp.285-298, 1997.
R. de Wolf.
Book
review of:
C.P. Williams and S.H. Clearwater, Explorations in Quantum
Computing, Springer, 1998.
In Science of Computer Programming, 32:213-216, 1998.
R. de Wolf.
Book
review of
three quantum books by Pittenger, Hirvensalo, and Kitaev-Shen-Vyalyi.
In Quantum Information and Computation, 3(1):93-96, 2003.
I have no real publications here, though you might be interested in
Philosophical
applications of computational learning theory,
my Master's thesis in philosophy.
The first part gives a formal "proof" of Chomsky's ideas about the
necessity of an innate universal grammar. The second part is about
proofs of Occam's razor, which states that you should always select the
simplest hypothesis consistent with given data.
The thesis also contains a lot of historical and philosophical
background concerning these two topics.
I recently received funding for a postdoc
in quantum computing (specifically: quantum
algorithms, communication complexity, fault-tolerance). If you're good
and you're interested: send me an e-mail.
I'm looking for people whose primary focus is computer science aspects,
not physics.
If you're interested in a summer internship: in principle I don't have
any avaliable, but I might try to work something out if you have a very
strong background in the type of research I'm doing.
