This action might not be possible to undo. Are you sure you want to continue?
: : :
University of Amsterdam Algorithms and Complexity Dr. P. van Emde Boas
1. Full title
Algorithms and Complexity
2. General Information
The Algorithms and Complexity programme is carried out by the Theoretical Computer Science group at the Institute for Language Logic and Computation (ILLC, which has participating members from the Faculty of Science, the Faculty of Humanities and the Faculty of Social and Behavioral Sciences, all at the University of Amsterdam. The ILLC participates in the Dutch Graduate School in Logic (OzSL). Group leader: Dr P. van Emde Boas firstname.lastname@example.org
3. Programme Members
Professors (hoogleraren) Adriaans, prof. dr. P. Apt, prof. dr. K.R. Buhrman, prof. dr. H.M. van Emde Boas, dr. P. Vit´ anyi, prof. dr. ir. P.M.B. Associate professors (UHDs) Torenvliet, dr. L. Assistant professors (UDs) Janssen, dr. T.M.V. from 01-01-1998 until 01-01-2000 from 01-01-2001
Computational complexity, quantum computing, theory of information, descriptive complexity, learning theory, game models, distributed computing, communication complexity.
5. Research Input Academic Staff (wp)
Note: in the table below 0.8 fte is used for PhD students. fte wp1 AIOs other wp2 OIOs other wp3 AIOs other total 1996 2.4 1.2 0.8 0.0 0.8 0.0 5.2 1997 3.2 1.2 0.8 0.0 0.8 0.0 6 1998 3.0 1.28 0.8 0.0 0.8 0.0 5.88 1999 2.4 1.28 0.8 0.0 0.0 0.0 4.48 2000 2.0 1.2 0.0 0.0 0.0 0.0 3.2 2001 0.6 1.2 0.0 0.0 0.0 0.0 1.8 total 13.6 7.36 3.2 0.0 2.4 0.0 25.56
Main sources for contract research: NWO(-SION), EC, Min. RIVM. 1
Machine learning.0 0.64 0.0 0.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr.OIO) other junior staff total wp1 0.64 0. Speciﬁc subjects are quantum information processing.54 Main Themes 8. Research Output Research Output in Numbers PhD theses Refereed journal articles Refereed contributions to international conferences Academic publications Other refereed academic publications (including books and chapters) totals 1996 2 8 12 1997 1 2 12 1998 3 10 15 1999 1 10 14 2000 0 10 16 2001 2 11 6 total 9 51 75 1 23 7 22 1 29 4 24 2 28 3 22 18 151 7.2 0.54 wp2 0.0 0. van Emde Boas 6.0 0. e.0 0 total 0. beta and gamma disciplines. cognitive psychology and planning and scheduling. 2 .0 0. Quantum computing. cognition and AI). The study of Algorithms an complexity in the context of the manipulation of real world systems. network algorithms.0 0.2 0. Programme design The main themes of the project are algorithmic methods.0 0 wp3 0.0 0.2 0.lec) associate professor (uhd) assistant professor (ud) other senior staff PhD students (AIO. computational complexity theory.0 0.0 0. the minimum description length principle.0 0.g. descriptive complexity and its applications and computational game models. e. computational learning (focusing at grammar induction.g. Currently research in our groups focuses on two domains: ¯ The study of Algorithms and Complexity in the context of alternative paradigms of computation. Two lines of investigation A leading conception structuring the research at the University of Amsterdam is the view that informatics is a unifying paradigm between alpha. From this perspective the potential domains and application areas of research in complexity are numerous and range from fundamental issues in quantum computing to questions in biology. complexity analysis and programming methodology.0 0. human language and human cognition and object orientation. P.0 1. ¯ Complexity and the real world.5 0. Composition of Research Input of Academic Staff in 2001 fte professor (hgl.2 0.0 1.5 0.0 0.
It is a common observation in AI and cognitive psychology that human beings perform reasonably efﬁciently in problem domains with exponential (or worse) upper bounds for time and/or space complexity. but also lead to increased understanding of quantum phenomena in nature. various games like checkers and chess. The results obtained by Buhrman.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr. van Emde Boas The motivation of the ﬁrst line of research lies in a fundamental rethinking of the foundations of computation in the light of the results of modern physics together with the promise of more efﬁcient algorithms for some important classes of problems. At the start of the period covered by this six year’s report two examples of such problems were known: Shor’s factorization algorithm and the sub-linear search algorithm invented by Grover. A central theme in Machine learning is the so-called ”Minimum Description Length Principle”. Aside from this potential for technological development these models are also of theoretical interest as they may lead to the solution of open problems in complexity theory. de Wolf and others on lower bound techniques and communication complexity provide both new examples answering this challenge and new insights in the way quantum computing can improve over standard computing. Examples are: planning. In distributed computations and network models problems like mutual search and naming conventions in networks are investigated. scheduling. Quantum Coherent Computation Quantum coherent computation is a new ﬁeld of research that has attracted an increasing number of computer scientists and physicists over the last 10 years. Research in Complexity Theory focuses on reductions and completeness notions. The recent ﬁeld of computational game models aims at bridging the conceptual gap between the anthropomorphic conceptions invoked in agent theory in AI and Object technology on the one side and traditional computational models on the other side. Complexity in the real world In this line of research various themes dealing with the application of complexity theory are combined. The work on programming methodology focused on the efforts of rendering declarative programming more efﬁcient and usable. This led to research on integrating logic programming with imperative programming and on various aspects of constraint programming. The second line of investigation is driven by a wish to gain a better understanding of the relation between theoretical results in complexity theory and the factual efﬁciency of various problem solving systems in the real world. which states that any regularity in any give set of data can be used to compress these data. language learning. A speciﬁc example investigated involves learning context free grammars from positive examples. A main theme in the study of algorithms is Kolmogorov Complexity. P. the more compression. An understanding of the search bias that make these tasks feasible is of the utmost importance. Modeling imperfect information of agents turns out to be the major bottleneck. results One of the great challenges in the area of Quantum Computing is to present good examples of problems which are easier to solve by quantum computers than (as far as we know) by a standard computer. and other human cognitive capabilities. The relevance for society of these two lines of research is clear. The more regularity. 3 . In the last years evidence has arisen that the proposed coherent quantum computers may be (and for some tasks are) intrinsically much faster than classical computing devices.
In fact. both in the study of natural and formal languages. European quantum computing project. MDL and Bayesian Inference to the practical work on building an autopilot on a single handed sailing ship trained by the experience of previous voyages. The reason for this is that this programme is strongly interwoven. In September 2001 M. Models based on games provide the most promising representation for the interactive aspects of these agents. the majority of the PhD projects reported in this section were carried out at the CWI. which gave extra emphasis to this union. P. As algorithms and complexity are not central in the research effort of the ILLC. Societal/technological relevance The main societal impact of quantum computing is that its possible realization will destroy the computational intractability of most. In the ﬁeld of learning theory our results range from the very theoretical work on the relations between Kolmogorov Complexity. there are presently no plans of strengthening the participation of the UvA in this research area. In computational complexity a number of results have been obtained on separating complexity classes relative oracles. The research output has certainly not. de Graaf was hired on the NWO project of Buhrman and Torenvliet “Extending feasible computation: Quantum Computing”.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr. through personal union. Lee was hired as a PhD student by UvA on the ongoing quantum computing project lead by Buhrman. coordinated by Buhrman. van Emde Boas and van Benthem obtained funds for their ENIGMA project. 10. and T. The. Machine learning algorithms are key in developing the truly intelligent agents which are currently being used in contemporary information processing and decision support systems in business and government. Programme development The research input has reached an all time low in 2001. In part these results invoke yet another use of Kolmogorov complexity. if not all cryptographical mechanisms and protocols on which the security of todays electronic information exchange in the world is based. and the analysis of imperfect information. 4 . automatic translation. will be continued in a next phase of three years. already mentioned. compositionality has remained a prime source of inspiration. In distributed computing interesting results have been obtained on routing. but also resource sensitive measure theory has become a useful ingredient. with the programme INS 4 of the CWI. Work in programming methodology converged on the design of the hybrid language ALMA which combines ideas from logic programming with constraint programming. In 2001 Harry Buhrman was appointed full professor at the University of Amsterdam. which will start September 2002. In our research in areas related to semantics. Several important results in this area were obtained during the past six years. van Emde Boas The idea of proving lower bound proofs for speciﬁc algorithmic problems using Kolmogorov Complexity based arguments has been used many times over the past 25 years. Also the use of this technique in solving standard Mathematical problems (as exempliﬁed by the Heillbron triangle example) is a convincing example illustrating the power of this technique. but also in the study of the structure and meaning of graphical representations. among which the more prominent one is the analysis of the Shellsort algorithm. 9. and communication in a network. Other investigations concern learning of grammars from corpus data in known and unknown natural languages.
Efﬁcient algorithm design and analysis remain a must for solving the increasingly large problem instances submitted. Harry Buhrman is editor of Theory of Computing Systems. Cleve. Buhrman. P. Harry Buhrman served on 11 program and steering committees of international conferences and gave 15 keynote lectures. H. Science of Computer Programming. Mach. Parallel Processing Letters. Vit´ anyi Algorithmic statistics. Journal of New Generation Computer Systems. Mathematical Systems Theory/Mathematical Computing Theory. Fundamenta Informaticae. Assoc. gave 4 invited lectures and obtained 3 IT related international patents in the period 1998-2001. 2001...  R. the CWI board. 2001. J. ACM Transactions on Computational Logic. least we build no systems based on solving intractable sub-problems. Torenvliet. and Frontiers in Computing Systems Research. 63–69. At the same time it is required to obtain a better understanding of those aspects on computational problems which make these problems really intractable. Separating complexity classes using autoreducibility.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr. Inform. 48(4):778–797. L. John Tromp. He served on 5 program committees. Other Indicators for Quality. 31th ACM Symp. Reputation and Innovative Potential Krzysztof Apt is editor of: Theory and Practice of Logic Programming. He is a member of the steering committee of the ICGI (International Conference on Grammar Induction). de Wolf. Information Processing national conferences. Beals.  H. Comp. Mach.  H. the HPCN board. He is a member of the Board of the International Federation for Computational Logic.M. Fortnow. Journal of Logic Programming. Cleve. Quantum vs. How to share concurrent wait-free variables. 1996. Buhrman. SIAM Journal on Computing. 43:723–746. Assoc. Key Publications  Ming Li. D. Information and Computation. van Emde Boas Short of the arrival of quantum computers eventually all systems are realized on machines patterned after an architecture which has not changed essentially over the past decades. Buhrman.” Paul Vit´ anyi has served on 26 program committees of international conferences in the period 1996– 2001. notwithstanding the fact that so far according to Moore’s Law the speed and capacity of hardware keeps on increasing exponentially. M. 11. G´ acs. and P. 12. 5 . classical communication and computation. on the Theory of Computing (STOC).  P. Wigderson. Quantum lower bounds by polynomials. Wiley/Teubner Series in Computer Science. Comp. He is also coordinator of the 5th framework project: Quantum Algorithms and Information Processing. 29(5):1497–1520. and A. in which 13 European and 4 North American sites participate. 2000. Pieter Adriaansis senior research advisor for Perot Systems Corporation. RAIRO. R. and gave 15 invited keynote lectures at international conferences. Tromp. J. IEEE Trans. J. and Paul Vit´ anyi. he also served on 8 program committees and gave several invited lectures at inter´ nyi is editor of: Distributed Computing. and L. 47(6):2443– 2463. Theoretical Informatics. and has served on 14 program committees of international conferences in the period 1996–2001. Mosca. and R.. Journal of Logic and Computation. Paul Vit a Letters. R. Th. He is also president of the association for Logic Programming and chairman and co-founder of the ERCIM Working Group on Constraints. He gave 9 invited lectures at international conferences in the period 1996-2001. the ICT Forum and the committee for for Biomolecular Informatics. Journal of Computer and System Sciences (guest editor). International Journal of Foundations of Computer Science. He is also a Member of the Scientiﬁc Board “Encyclopedia of Mathematics. van Melkebeek. In Proc. 1998. Peter van Emde Boas is editor of RAIRO and Information and Computation.
43:723–746. PhD thesis. Category 1.B.B.R.A. University of Amsterdam. P. June 1996. de Haas Logics for OO Information Systems: A Semantic Study of Object Orientation from a Categorial-Substructural Perspective. Scha.  B.H. Apt and R. bounded quantiﬁcation and iteration in logic and constraint logic programming. 28 2:147–180.  K. Ambos-Spies. M.  S. or in praise of ambivalent syntax. Comp. Optimal advice. Category 1.  E. Meta-variables in logic programming. A closer look at declarative interpretations. University of Amsterdam. Scientiﬁc publications 1996 Articles  K.M.  Lane Hemaspaandra and Leen Torenvliet. Funtamenta Informatica. Category 1.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr. University of Amsterdam. PhD thesis. Promotores: H. Promotor: P. Promotor: P. May 2001. University of Amsterdam. L. 1996. 26 1–3:133–148. Promotor: P.M. and Paul Vit´ anyi. 28 1–2:23–26.J. de Jongh. Theoretical Computer Science. van Emde Boas. Cramer Modular Design of Secure Yet Practical Cryptographic Protocols. Co-promotores: D.R. Gr¨ unwald The Minimum Description Length Principle and Reasoning under Uncertainty.R. H.  Harry Buhrman and Leen Torenvliet. Terhal Quantum Algorithms and Quantum Entanglement. Dissertations  J-H. Torenvliet. Arrays. 1996. Pedreschi. 6 .  K. PhD thesis.R.-C. J. Ben-Eliyahu. P. University of Amsterdam.  P.M.  Klaus Ambos-Spies. Neis.  R. Synchronization and Fault Tolerance. PhD thesis. 1996.B. John Tromp. Assoc. Promotor: K. van Emde Boas 13. University of Amsterdam. Vit´ anyi. 53(2):210–217.J. Apt. 1996.  R. Apt. Category 1. University of Amsterdam. Promotor: P.M. Gabrielli and D. University of Amsterdam. Category 1. Category 1. Category 1.F. Category 1. Mach.  Ming Li. P-selective self-reducible sets: A new characterization of È . Vit´ anyi. PhD thesis. October 1998. Adriaans. November 1999. Science of Computer Programming. Vit´ anyi  M.M. Promotores: R. Genericity and measure for exponential time. september 2001. and Bas Terwijn. 1996. 154 (2):367–377. Vit´ anyi. September 1996. 1996. P.. P. University of Amsterdam. Buhrman. 14. Teusink Logic Programming and Non-monotonic Reasoning. 1996. (168)1:3–19. Promotores: P.D. Journal of Computer and System Sciences. How to share concurrent wait-free variables.M. Journal of Logic Programming. Dastani Languages of Perception PhD thesis. PhD thesis. Promotor: K. March 1998. Category 1.B. Terwijn Computability and Measure PhD thesis. Hoepman Communication.  F.B. December 1998. van Emde Boas. January 1997. de Wolf Quantum Computing and Communication Complexity PhD thesis. Theoretical Computer Science. Vit´ anyi.M. Apt.
Royal Society of London. In EDBT proceedings. In Logic Collquium 96: European Summer Meeting of the Association for Symbolic Logic. and Martin L. Stokhof. Yunes. AID’96. volume 1046 of LNCS. Reversible simulation of irreversible computation. Complete sets and structure in sub-recursive classes. and Paul Vit´ anyi. Janssen. Melbourne. Royal Society of London. Statistics and Induction in Science.B. Chapters  Ming Li and Paul Vit´ anyi. pages 1–11. University of Amsterdam. Optimal routing tables. J. Margenstern and J. 7 . volume II. The convenience of tiling. 1996.. Space-energy trade-off in reversible simulations. Ideal MDL and its relation to bayesianism. Hoepman. In Proc. pages 75–86. Thierauf. Springer-Verlag. editors. In proc Symposium on Theoretical Aspects of Computer Science (STACS).  Yuri Engelhardt. Institute for Logic Language and computation (ILLC). Proceedings  Peter A. 1996.  Ming Li and Paul Vit´ anyi. pages 38–70. Reasoning and Interaction in Design. P.  Harry Buhrman and Luc Longpr´ e. Boncz. pages 407–424. pages 769–789. pages 67–82. Jos de Bruin. and Remko Scha. The complexity of generating and checking proofs of membership. Kersten. In 4th Workshop on Physics and Computation.  Ming Li and Paul Vit´ anyi. 1996. Monet and its geographic extensions: a novel approach to high performance GIS processing. In Proc. pages –. Mass.V. Dekker and M. van Emde Boas  Ming Li and Paul Vit´ anyi. Amsterdam. Theo Janssen. LITP 96/31. on Principles of Distributed Computing. 15th ACM Symp. New York. pages 134–142. 1996. Proceedings of the 10th Amsterdam colloquium. Reversibility and adiabatic computation: trading time and space for energy. The visual grammar of information graphics.  Harry Buhrman and Leen Torenvliet. In Proc. pages 301–306.  Ming Li and Paul Vit´ anyi. 1996.  Harry Buhrman. volume 452. Genetic ﬁtness optimization using rapidly mixing Markov chains. Springer. Springer-Verlag.  Harry Buhrman and Th. 11th IEEE Conference on Computational Complexity (CCC). In Proc. In proc Symposium on Theoretical Aspects of Computer Science (STACS). ISIS: Information. In Ron Book Memorial Volume. Average-case analysis using Kolmogorov complexity. Stanford. In M. Boston. In Proceedings Workshop on Visual Representation. editors. Springer.  Peter van Emde Boas. Series A. Australia. volume 1046 of LNCS.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr. 7th Int’nl Workshop on Algorithmic Learning Theory. 1996.  Theo M.  Paul Vit´ anyi. pages 13–24. 1996. Is compositionality of meaning possible? In P. the Netherlands. 1996. Compressibility and resource bounded measure. 1996. Actes de MCU/UMC’95 . 1996. 1996. volume 1160 of Lecture Notes in Artiﬁcial Intelligence. pages –. pages 59–64.Proceedings of MCU/UMC’95. Wilko Quak. pages –. In Proc. 1996. Heidelberg.H. 1996. 1996.
Results on resource-bounded measure. The complexity of universal text-learners. Physical Review A. pages 2–12. van Emde Boas 1997 Articles  R. pages 237–256. Mach. and P. Apt From Chaotic Iteration to Constraint Propagation.H. Nienhuys-Cheng and R. Buhrman and L. Buhrman. Fortnow. Kolmogorov random graphs and the incompressibility method. Fortnow. Dekker. number 1279 in Lecture Notes in Computer Science. P. In Proceedings of the 11-th International Symposium on Fundamentals of Computation Theory. Seiferas.M.B. Buhrman.M. Two heads are better than two tapes.R. Springer-Verlag. pages 105–116. Van Emde Boas. Heidelberg.  M. M. On prediction by data compression. Cleve and H.  T. of Philosophy. 9th European Conference on Machine Learning. pages 1–16. number 1224 in Lecture Notes in Artiﬁcial Intelligence. Six hypotheses in search of a theorem. 1997. 8 . Vit´ anyi. Jiang. editor. Schaerf Search and Imperative Programming Proc. 1997. 1997.  H.  T. In Proc.B. pages 67-79. 1997. pages 441–451.  H.A. 1997.C. Janssen. pages 38–50. Resource-bounded Kolmogorov complexity revisited. 24th Annual SIGPLANSIGACT Symposium on Principles of Programming Languages (POPL ’97). Substituting quantum entanglement for communication complexity. Vit´ anyi. 1997. Average-case analysis via incompressibility. Stephan and S. number 1279 in Lecture Notes in Computer Science. In Proceedings of Conference on Compression and Complexity of Sequences. Assoc.  P. New York. of the 11th Amsterdam colloquium.  H. Berlijn. In Lecture Notes in Artiﬁcial Intelligence.  F. In Proc. A compositional semantics for the game-theoretical interpretation of logic. M. In Proceedings of the 12th IEEE Conference on Computational Complexity (CCC). pages 2–12. Springer-Verlag. volume 1228. Li. Fortnow.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr. Resistance is futile: observations on the formal linguistic status of design patterns.. 1997. pages 181– 185. 1997.R. pages 188–194. 1997. Buhrman. Comp. Heidelberg.. 56(2):1201–1204. and L. Institute for Logic. In Proceedings 24th ICALP Lecture Notes in Computer Science.B.  K. Proc. Torenvliet. Dept. 1997. Venema P. Apt and A. Foundations of inductive logic programming. In Proceedings of the 14th Symposium on Theoretical Aspects of Computer Science (STACS). Stokhof. Proceedings  K. Buhrman. Li and P. 1997. OOPSLA’97. Springer-Verlag. Terwijn. IEEE Computer Society Press. and P. 11th Conference on Fundamentals of Computation Theory. Springer-Verlag. Fenner.  S.  Ming Li and P. J. 1997. L. IEEE. In Y. de Wolf. Springer. pages 14–30. Vit´ anyi. Springer. In J. S. Vit´ anyi.M. Language and Information. 1997. Heidelberg.A. and L.M.V. University of Amsterdam. 1997.  H. Proceedings 24th ICALP Lecture Notes in Computer Science. 1997.
In Advances in Algorithms. In ACM Toplas 20. and L. Witness-isomorphic reductions and local search. Inc. Buhrman..  M. Sorbi. 9 ..  K.M. Lecture Notes in Logic 12. Apt.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr. Reversible simulation of irreversible computation. Average-case analysis using Kolmogorov complexity. and L. van Emde Boas Chapters  T.M. Partington Alma-0: An Imperative Language that Supports Declarative Programming.B. chapter 7. Vit´ anyi. pages 168–176.  H. Languages. A.  H. Li and P.  M. and Complexity. 1998. 1997. M.V. An introduction to kolmogorov complexity and its applications. Theoretical Computer Science. J. Mass. A. 1998. In J.M. pages 1407–1423. Buhrman. Handbook of logic and language. Springer-Verlag. 1997. Fischer. 1997. pages 331–362. Thierauf. Logic and Recursion Theory. editor.Schaerf and V. 1998 Articles  K. Books  K. and W. Li and P. P. 12:45–78. Torenvliet.  K. 1997. editor. In IEEE Trans. Sorbi. pages 417–473. Li.R. Logic and Recursion Theory. Apt and E. 1997. In Physica D. From Logic Programming to Prolog. Brunekreef. number 44 in 4. P. Prentice Hall. Marcel Dekker. 364 + xviii pages. Fundamenta Informatica 34(3) 295–321. Algebraic translations. Elsevier. van Emde Boas The convenience of tilings. J. Compositionality (with an appendix by B.  P. Hoene. Kadin.R. correctness and algebraic compiler construction.R. and P. robustness and the structure of complete sets. P. Inc. 328 + xviii pages. van Benthem and A. Marcel Dekker. Bennett. pages 157–169.  C. J. G´ acs.  H. number 120. Apt. 1998.. Information distance.M. Vit´ anyi. Complexity. Cambridge. Li. 5 1014–1066.Partee). Janssen. New York. In A.B. ter Meulen. Zurek. 1998. 2(3):637–653. 1997. Vit´ anyi. Apt A proof theoretic view of constraint programming. pages 207–223. Graduate Texts in Computer Science. New York.  M. Veriﬁcation of Sequential and Concurrent Programs. Torenvliet. Olderog. Splittings. Hemaspaandra. editors. Amsterdam and The MIT Press.  T. Complete sets and structure in sub-recursive classes. Kluwer Academic Publishers. Torenvliet. and T.R.B. In A. SpringerVerlag. 31(4):77–92.H. 2:xx + 637 pages. Vit´ anyi. 1998. 1998.-R. Functions computable with nonadaptive queries to NP. L.M. 1998. Complexity. Lecture Notes in Pure and Applied Mathematics.V. 199(1–2):25–56. Janssen. SIAM Journal on Computing. 1997.  S. Information Theory. Theory of Computing Systems. Tromp. Buhrman and L. 1998. Dordrecht. Lecture Notes in Pure and Applied Mathematics.
number 1536 in Lecture Notes in computer Science. 1997. and A. 39th IEEE Symp. Tromp.Langmaack.  W. Springer-Verlag. SOFSEM’98: Theory and Practice in Informatics. editor. R. Arithmetical measure. In Proc.B.  H. Metric indexing to improve distance joins. 1998. M. Randomness is hard. Germany. Proceedings of the fourth annual conference of the Advanced School for Computing. 1998. Wilko Quak. Fortnow. Buhrman. 15th Symposium on Theoretical Aspects of Computer Science (STACS). P. ter Haar. A survey of compositional translations. IEEE Conference on Compression and Complexity of SEQUENCES 1997. van Emde Boas  A. an early experiment in declarativeness. Buhrman. Buhrman and L. Beigel. In Proc. on the Theory of Computing (STOC). and A. Beals. F. 13th IEEE Conference on Computational Complexity (CCC). Papatrintaﬁlou. 39th IEEE Symp. and T. J. Thierauf.  Ghica van Emde Boas & Peter van Emde Boas. Buhrman. In Distributed Computing. Two queries. classical communication and computation. In Proc. Buhrman. Tonino. H.  H. and R. 1998. 10 . P. pages 481–489. Mosca. Panconesi. pages 78–96. Regan. In Branislav Rovan. on Foundations of Computer Science (FOCS). Cleve. Quantum oracle interrogation: getting all information for almost half the price. D. In Proc. Buffalo NY. Soc. Buhrman. pages 113–124. Li. D. and P. pages 203–209. 1998. Mathematical Logic Quarterly. LNCS. and P. number 1521 in Lecture Notes in Computer Science. Compiling Horn-clause rules in IBM’s Business System 12. Buhrman and D. R. and A. Straus. Press. 1998. Bad Malente. and M. Wigderson. Vit´ anyi. pages 352–361. Buhrman. Sivakumar. K.  H.  H. H. Vit´ anyi. Buhrman. 1998. Torenvliet. Symposium .  H. 1998. van Melkbeek. Fortnow. June 1998. and Martin Kersten.M. Pnueli. IEEE Computer Society Press. Mutual search.  R. pages 170–181. van Melkebeek. pages 327–349.V. Kolmogorov random graphs. of the 13th IEEE Conference on Computational Complexity (CCC). Torenvliet.H. Tsigas. van Dam.  H. on the Theory of Computing (STOC) 63–69. J. 1998.  H. Terwijn and L. In Proc. In Proc. pages 161–171. pages 133–139.  S. and L. Int. Hoepman. LNCS. M.M. pages 249–260. with an application.  Niels Nes. editors. Janssen. D. In Proc. Cleve. 1998. Franklin. 1998. COMPOS’97. In Proc. 11. In Proc. on Foundations of Computer Science (FOCS).M. Nonrelativizing separations. 1998. 15th Symposium on Theoretical Aspects of Computer Science (STACS).A.J Epema. IEEE Comput. J. A generalization of resource-bounded measure. In B. Randomized naming using waitfree shared variables. Quantum vs. pages 8–12. In Proc. and P. Springer. Wolters. 1998.H.F. L.  H.  T. 1998. 31th ACM Symp.M. 1998. Fortnow. pages 13–19. 1998. M. 13th IEEE Conference on Computational Complexity (CCC). SpringerVerlag. Vit´ anyi. Burhman and L. Hard sets are hard to ﬁnd. Garay. NP might not be as easy as detecting unique solutions. 44:277– 286. M. pages 362–367. quantum lower bounds by polynomials. H. 9th ACM-SIAM Symposium on Discrete Algorithms. Proceedings  R. Wolf. In W-P de Roever. de. In Proc. 31th ACM Symp. Berlin. pages 68–88.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr. editors. Springer Verlag.
Chinese Science Press. 28(4):1414–1432. Buhrman. DiVincenzo. Unextendible product bases and bound entanglement. Buhrman. 1999. P.. Apt The essence of constraint propagation Theoretical Computer Science 221(1-2):179– 210. Two Queries. Minimum description length induction. 70(5):205–209. Bennett. Smolin. Simulating quantum operations with mixed environments. Proceedings of the 12th Amsterdam Colloquim. Rev. 1999. Li. Tromp. Multiparty Quantum Communication Complexity. J. 1999. I. 1999.B. 1999. J. J. 1999 Articles  K.  H. Proceedings  Pieter Adriaans and Erik de Haas. H .  H. Buhrman. Buhrman L. August 1998. and P. In Paul Dekker. Sub-structural Logic. 11 . Terhal. One-sided Versus Two-sided Randomness. Journal of Modern Optics. T. Fortnow.  B. In Proceedings 16th Symposium on Theoretical Aspects of Computer Science (STACS). 1999. Vit´ anyi.1999. 46(2):517–536.P. Buhrman and R. Tapp. Assoc.B. on Foundations of Computer Science (FOCS). MIT.L. J. Mor. and P.  H. R. Vit´ anyi. Buhrman and L. Optimal Decompositions of Barely Separable States.W. Chuang.A. R. Phys. D. Mutual Search. Buhrman.H. DiVincenzo. J. In IEEE International Symposium on Information Theory. van Emde Boas  P. Smolin. Thapliyal. special issue for the 13th IEEE Conference on Computational Complexity (CCC)  H. M.M. 1999. and J.V. Hoepman.M. (in Chinese). and A. Grassl. Terhal. 1999. Franklin. Cleve. Bounds for small-error and zero-error quantum algorithms. Li and P. and B. J. Hoepman. Comp..  H. Phys. de Wolf. Lett. 1999.  W.  H. Books  M. Description Complexity. Zalka. D. Physical Review A. van Dam and L. A. In Proceedings of 40th IEEE Symp. Bayesianism.H. 1999. Journal of Computer and System Sciences. 82. and Kolmogorov complexity. and Ch. P. Fortnow. Shor. M. Information Processing Letters. P. SIAM Journal on Computing. 59(4):2635–2640.P. a unifying framework for second generation data mining algorithms. editor.M. 1998.  M.M.  H.P.  C. 60(4):2737–2741. pages 358–368. Quantum communication using a non-local Zeno effect. Physical Review A. 60:881. Mach. Terhal D.A.R. de Wolf. Rev. A lower bound for quantum search of an ordered list. Vit´ anyi. Vit´ anyi and M.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr. Garay. 1999. Hardy. DiVincenzo and A. van Dam. Space-efﬁcient routing tables for almost all networks and the incompressibility method. W. 1999.
pages 210–219. Decidability and undecidability of marked PCP. van Emde Boas  H. M. May 1999. Ming Li. University of Amsterdam. Information. Torenvliet. and A. In Michael McAleer Hugo A. in Correct System Design. Buhrman and L. Schaerf “The Alma Project. Ming Li. 29(5):1497–1520. editor. IEEE Computer Society. Cussens. W. Fortnow. Lecture Notes in Computer Science 1644.  V. Lecture Notes in Computer Science 1563. Average case complexity of Shellsort.S. 2000 Articles  H. V. In James L. pages 61–74. Marek. Li and P. and R. P. eds. Tao Jiang. Apt and M. pp. pages pp.). Vit´ anyi. and L. Keuzenkamp and Arnold Zellner. 1999. Lecture Notes in Computer Science 1644. Grammar induction as sub-structural inductive logic programming. Simplicity. L. On the interpretation of if-logic.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr. 1999. In Proceedings of the 14th IEEE Conference on Computational Complexity (CCC). Twelfth Amsterdam Colloquium. 75-107 (1999)  K. Springer-Verlag. Hirvensalo. 1999. B. D. de Wolf. Complicated Complementations. ICALP99. Olderog. Bounded Quantum Query Complexity.V Janssen. (E. In Proceedings of the 14th IEEE Conference on Computational Complexity (CCC). In Proc. New applications of the incompressibility method. 1999. Springer-Verlag  Tao Jiang. Kolmogorov Complexity.R.-R. Ming Li. Chapters  K. Berlin. In Proc. van Melkebeek. and Prediction. In Proceedings of the First NASA International Conference on Quantum Computing and Quantum Communications. Halava. Buhrman. Lecture Notes in Computer Science 1509. 12 . page 453-462. M. 89-113 (1999).) Springer Series in Artiﬁcial Intelligence. 139–144. Dekker. Springer-Verlag.  M. Buhrman and W. pages 220–229.  H.  H. mh  R.Apt and A. In Proceedings of 16th Symposium on Theoretical Aspects of Computer Science (STACS). 1999.  Tao Jiang. LNCS 1710. Proceeding of the Language Learning in Logic Workshop Bled 1999. Buhrman. 14th IEEE Conference on Computational Complexity (CCC). Apt. and Paul Vit´ anyi. 1999.R. Separating complexity classes using autoreducibility. Tapp. Berlin. pages 149–156.R. Nielsen. Cleve. 2000. 1999. editor. and Paul Vit´ anyi. Torenvliet. 1999. ILLC. SIAM Journal on Computing. In Proc. M. Springer. Truszczy´ nski and D. Warren.  Erik de Haas and Pieter Adriaans. and Paul Vit´ anyi. Steffen. van Dam. Cambridge University Press.M. Simplicity. Bezem Formulas as Programs The Logic Programming Paradigm: A 25-Year Perspective (K. ICALP99. Quantum entanglement and the communication complexity of the inner product function. The expected size of Heilbronn’s triangles. pp.M. van Dam. or How First-Order Logic Can Help Us in Imperative Programming”. 1999. Proceedings. In P. pages 227–236. eds.W. pages 105–113.  T. editors.
2000. 2000.B. T. SIAM Journal on Computing. A. Li. 30(5):1485–1501.M.M.. Comp. Kolmogorov random graphs and the incompressibility method.B. van Emde Boas  H.  H.M. Jiang. Buhrman. Fenner. New applications of the incompressibility method: Part II. P. 47(5):905–911. 2000. Minimum Description Length Induction. Vit´ anyi. Are bitvectors optimal? In Proceedings ACM Symp. pages 449–458. A. Florence. Average-case complexity of Stacksort and Queuesort. Physics Today. 2000. SIAM Journal on Computing. Buhrman. M. J. Vit´ anyi. and P. pages 133–144. Italy. Bayesianism. Vit´ anyi. In Proceedings of 41st IEEE Symp.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr.  H. van Dam and S. J. Jiang. Venkatesch. In Proceedings Symposium on Theoretical Aspects of Computer Science (STACS). and L.  T. 241(1-2):3–23.B. pages 44–53.M.  T. Buhrman and L. Springer. IT-46(2):446–464.  M. In Distributed Computing Conference (DISC’00). Radhakrishnan. 29(2):590–599.M. 2000. Physicists triumph at ’Guess My Number’. A discipline of evolutionary programming. Randomness is Hard. L.M.M. Buhrman. 1770. and P. IEEE Trans. M. Gasarch. Quantum Kolmogorov Complexity. J. Buhrman. Mach. 2000.M. de Wolf. 2000.B. Steane and W. New bounds for the language compression problem. and P. S.K. Kalayanasundaram. Berthiaume. W. van Melkebeek. pages 407–418.  H. Optimal Proof Systems and Sparse Sets. M. 235(1):59–70. Vit´ anyi. R. 2000. Artiﬁcial Intelligence. H. Ambainis.M. In Proceedings 15th IEEE Conference on Computational Complexity (CCC).I. M. Li. 2000. 240–249. Vit´ anyi. 53(2):35–39. 2000. Laplante. The communication complexity of enumeration.  H. Laplante. W. Jiang.  H. Theoretical Computer Science. 2000. Silvestri. Li. on Foundations of Computer Science (FOCS).M. Mosca. 2000  A. van Dam. 2000. In Proceedings of 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS’2000). A lower bound on the average-case complexity of Shellsort. and P. Proceedings of the 15th IEEE Conference on Computational Complexity (CCC).M. LNCS. Proceedings  A. 2000.M. Vit´ anyi. Ambainis. Journal of Computer Science and Technology. Tromp and P. Vit´ anyi. Buhrman. 121(1-2):1–29. Li. and Kolmogorov Complexity. B. 2000. M. Assoc. Li and P.  Q. Panconesi.K. and P. on the Theory of Computing (STOC). Inform. Buhrman. Theoretical Computer Science.M.M. Torenvliet. Gao. Theory. P. Ambainis and R. Applying MDL to learning best model granularity. Buhrman. On the importance of having an identity or. In Proceedings of the 15th IEEE Conference on Computational Complexity (CCC). Tapp. Bro Miltersen.B. Bro Miltersen. 2000.M.B. Fortnow.B. 13 . and S. is consensus really universal.  P.  A. elimination and selection. Vit´ anyi.M.M. S. June 2000. de Wolf Average-Case Quantum Query Complexity.  H.B.  A. and P. M.M.  A. Torenvliet. and R. Li. Private quantum channels. Springer Lecture Notes in Computer Science. and D.
Assoc. pages 36–53. Adriaans. editors. In J. Vit´ anyi. 2001. In Proceedings of the fourth Conference on Computational Natural Language Learning and of the Second Language Learning in Logic Workshop. J.  P. W. Buhrman. pages 271–278. de Haas and P. 2000. Northeastern University 2000. J. Tromp. Quantum lower bounds by polynomials. pages 127–142.B. Springer-Verlag. Journal of Computer and System Sciences. Interaction. pages 41–55. V.  T. van Emde Boas. and L. Three Approaches to the Quantitative Deﬁnition of Information in Individual Pure Quantum State. 2001 Articles  A. Grammar induction as sub-structural inductive logic programming. Journal of Physics A: Mathematical and General. de Wolf. elimination and selection. volume 1968 of Lecture Notes in Artiﬁcial Intelligence. Characterization of non-deterministic quantum query and quantum communication complexity. SOFSEM 2000: Theory and Practice of Informatics. Springer-Verlag. In G. Berlin. Torenvliet. Springer Verlag.  E. In Learning Language in Logic pages 127–142. 48(4):778–797. Vit´ anyi. Kilov. The communication complexity of enumeration. D.  P. Dzeroski Cussens.  P. and R. Learning from a sub-structural perspective. G´ acs. a reminder from the 80-ies. In Proc. Jiang. Feffrey and J.B. 2001.M. Mach. The incompressibility method. editor. Mosca. Vervoort Towards high speed grammar induction on large text corpora. In K.M. Lecture Notes in Computer Science 1963. Boston Mass. 2000. de Wolf. Ambainis. Games. 2000. van Emde Boas  P.  E. Beals. R. Chapters  P.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr. Berlin: Springer Verlag. Ninth OOPSLA workshop on Behavioral Semantics. pages 176–183. 14 . H.  M. pages 263–270. Comp. de Haas and P. In Proceedings of 15th IEEE Conference on Computational Complexity (CCC). Lecture Notes in Computer Science 1963. Language Learning in Logic. Berlin. 2001. 34(35):6741-6754.M. de Haas Grammar induction as sub-structural inductive logic programming. Wiedermann. Buhrman. Adriaans and E. Hlavac. Trautwein. M. H. In Proceedings of the 15th IEEE Conference on Computational Complexity (CCC). pages 173–186. B. SOFSEM 2000. Ambainis and R. Towards and algorithmic statistics. Springer Verlag. P. Adriaans. de Wolf.I. and P. 2000. Cleve. Vit´ anyi. editors. P. 2000.M. 2000. and P. Berlin. Kalayanasundaram. volume 2000 of Lecture Notes in Computer Science.  R. Average-case quantum query complexity. Baclawski and H. The quantum computing challenge.M. Objects.B. 2000. Vit´ anyi. 2000.  R. In Proceedings ALT 2000.K. Complexity. Gasarch. M.B. Adriaans and M. 10 Years Ahead. Li. pages 62–66. 63:148-184.  A. volume 1925 of Lecture Notes in AI . Berlin. 2000. In Proceedings Dagstuhl Informatics—10 Years Back.
Fortnow. Vit´ anyi Algorithmic statistics. Pergamon.  M. de Wolf. pages 120-130. . Tromp. Vit´ anyi. Journal of Physics A: Mathematical and General. De Rode Hoed. 2001. Vit´ anyi. 2001. Time and space bounds for reversible simulation.  H. Ch. 2001. 2001.  K. . Inform.  H. 25-26 October 2001. Steward N. Høyer. Randomness is hard. Buhrman. 2001.M. editor. R.  Menno van Zaanen and Pieter Adriaans. S. Santha. Vit´ anyi. Vit´ anyi. Baltes. Magniez. . 2001. Physical Review Letters. Theoretical Computer Science. Vit´ anyi. Buhrman and R de Wolf. Proceedings of the 13th Dutch-Belgian Artiﬁcial Intelligence Conference. In Proceedings of 16th IEEE Conference on Computational Complexity (CCC). Heiligman P. Magniez M.B. M. 2001. 87(16). RANDOM 2001. In N. de Wolf. Fenner.  H.. D¨ urr. . Complexity measures and decision tree complexity: A survey. In Proc. pages 131-137. In Proc. Buhrman and R. Alignment-based learning versus Emile: A comparison. L. Quantum algorithms for element distinctness. J.B. Ch. Halava. Santha H. Buhrman. P. P. de Wolf. 2001. Chapters  M. 2001. 2001. 10:93-116. 2001. Torenvliet. Tromp and P.M. Proceedings  H. J. . On a generalized ruin problem. Hirvensalo. Quantum algorithms for element distinctness. Quantum kolmogorov complexity based on classical descriptions. J. Quantum ﬁngerprinting.  P. and P.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr. In Ben Kr¨ ose. P.  H. and R. 2001. G´ acs. de Wolf. and P.B. and R. pages 131-137. Th. Cleve. Buhrman.  V. Two oracles that force a big crunch. Watanabe. F. M. Amano. Springer Verlag.  N. 2001. Universal generalization and universal inter-item confusability. . In Proceedings of 16th IEEE Conference on Computational Complexity (CCC). International Encyclopedia of the Social & Behavioral Sciences. Li and P. Theoretical Computer Science. 47(6):2464-2479. Inform.Høyer F. 47(6):24432463. 2001. IEEE Trans. . M.  H. pages 315-322. In Proceedings of 16th IEEE Conference on Computational Complexity (CCC). SIAM Journal on Computing. Vit´ anyi. Complexity. 2001. J. Lecture Notes in Computer Science.  P. October 2001. IEEE Trans. Buhrman. P. . . Tromp. and O. van Emde Boas  H.J. Algorithmic complexity. Time and space bounds for reversible simulation. Behavior and Brain Sciences.. 34:6821-6830. de Wolf. editors. D¨ urr and R. Buhrman and L. Torenvliet. Buhrman. 30(5):1485-1501. Heiligman. Amsterdam. Tromp. Communication complexity lower bounds by polynomials. 15 .  H. Springer-Verlag. ICALP 2001. Chater. Buhrman. Marked PCP is decidable. and R. J. . Th. and L. Watrous. Smelser and P. 255:193-204. . Lecture Notes in Computer Science 2076.
The quantum computing challenge. 16 . P. Springer Verlag.University Programme name Research director : : : University of Amsterdam Algorithms and Complexity Dr.M. 10 Years Ahead. In Informatics: 10 Years Back.B. Lecture Notes in Computer Science. . 2001. van Emde Boas  P. Vit´ anyi.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.