You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
Biography of Anne Condon, currently Professor at University of British Columbia, previously Faculty Member at University of Wisconsin-Madison.
The authors show that there are underlying mathematical reasons for why games and puzzles are challenging (and perhaps why they are so much fun). They also show that games and puzzles can serve as powerful models of computation-quite different from the usual models of automata and circuits-offering a new way of thinking about computation. The appen
This book constitutes the refereed proceedings of the 29th International Colloquium on Automata, Languages and Programming, ICALP 2002, held in Malaga, Spain, in July 2002.The 83 revised full papers presented together with 7 invited papers were carefully reviewed and selected from a total of 269 submissions. All current aspects of theoretical computer science are addressed and major new results are presented.
Table of contents: Plenary Lectures V.I. Arnold: The Vassiliev Theory of Discriminants and Knots L. Babai: Transparent Proofs and Limits to Approximation C. De Concini: Poisson Algebraic Groups and Representations of Quantum Groups at Roots of 1 S.K. Donaldson: Gauge Theory and Four-Manifold Topology W. Mller: Spectral Theory and Geometry D. Mumford: Pattern Theory: A Unifying Perspective A.-S. Sznitman: Brownian Motion and Obstacles M. Vergne: Geometric Quantization and Equivariant Cohomology Parallel Lectures Z. Adamowicz: The Power of Exponentiation in Arithmetic A. Bjrner: Subspace Arrangements B. Bojanov: Optimal Recovery of Functions and Integrals J.-M. Bony: Existence globale et diffusion pour les modles discrets R.E. Borcherds: Sporadic Groups and String Theory J. Bourgain: A Harmonic Analysis Approach to Problems in Nonlinear Partial Differatial Equations F. Catanese: (Some) Old and New Results on Algebraic Surfaces Ch. Deninger: Evidence for a Cohomological Approach to Analytic Number Theory S. Dostoglou and D.A. Salamon: Cauchy-Riemann Operators, Self-Duality, and the Spectral Flow.
Volume 55 covers some particularly hot topics. Linda Harasim writes about education and the Web in "The Virtual University: A State of the Art." She discusses the issues that will need to be addressed if online education is to live up to expectations. Neville Holmes covers a related subject in his chapter "The Net, the Web, and the Children." He argues that the Web is an evolutionary, rather than revolutionary, development and highlights the division between the rich and the poor within and across nations. Continuing the WWW theme, George Mihaila, Louqa Raschid, and Maria-Esther Vidal look at the problems of using the Web and finding the information you want. Naren Ramakrishnan and Anath Gra...
* Recent papers on computational complexity theory * Contributions by some of the leading experts in the field This book will prove to be of lasting value in this fast-moving field as it provides expositions not found elsewhere. The book touches on some of the major topics in complexity theory and thus sheds light on this burgeoning area of research.
The People’s Property? is the first book-length scholarly examination of how negotiations over the ownership, control, and peopling of public space are central to the development of publicity, citizenship, and democracy in urban areas. The book asks the questions: Why does it matter who owns public property? Who controls it? Who is in it? Donald Mitchell and Lynn A. Staeheli answer the questions by focusing on the interplay between property (in its geographical sense, as a parcel of owned space) and people. Property rights are often defined as the "right to exclude." It is important, therefore, to understand who (what individual and corporate entities, governed by what kinds of regulations...
CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15–20, 2008 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory, or r...
This book constitutes the refereed proceedings of the Third International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'99, held jointly with the Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX'99, in Berkeley, California in August 1999. The volume presents 24 revised full papers selected from 44 submissions and four invited contributions. The papers present a wealth of new results and document the state-of-the-art in the areas covered by the workshop.