Related papers: The Limits of Mathematics
The authors of this white paper met on 16-17 January 2020 at the New Jersey Institute of Technology, Newark, NJ, for a 2-day workshop that brought together a group of heliophysicists, data providers, expert modelers, and computer/data…
Talk given at ICM '98, Berlin, reviewing some of the recent developments in understanding of string theory for a mathematical audience (to appear in Documenta Mathematica).
This volume is the proceedings of the 5th International Symposium on New Frontiers in Human-Robot Interaction, held at the AISB Convention 2016, which took place on the 5th and 6th of April 2016, in Sheffield, U.K. Organised by Maha Salem…
This volume contains the papers presented at Arg-LPNMR 2016: First International Workshop on Argumentation in Logic Programming and Nonmonotonic Reasoning held on July 8-10, 2016 in New York City, NY.
One of the predominant challenges when engineering future quantum information processors is that large quantum systems are notoriously hard to maintain and control accurately. It is therefore of immediate practical relevance to investigate…
Bounds on information combining are a fundamental tool in coding theory, in particular when analyzing polar codes and belief propagation. They usually bound the evolution of random variables with respect to their Shannon entropy. In recent…
I give an introduction to algorithmic uses of the principle of inclusion-exclusion. The presentation is intended to be be concrete and accessible, at the expense of generality and comprehensiveness.
The fourth international workshop on Computational Models for Cell Processes (CompMod 2013) took place on June 11, 2013 at the {\AA}bo Akademi University, Turku, Finland, in conjunction with iFM 2013. The first edition of the workshop…
Chaotic iterations, a tool formerly used in distributed computing, has recently revealed various interesting properties of disorder leading to its use in the computer science security field. In this paper, a comprehensive study of its…
In recent years, randomized algorithms have established themselves as fundamental tools in computational linear algebra, with applications in scientific computing, machine learning, and quantum information science. Many randomized matrix…
Using 1200 CPUs of the National Supercomputer TH-A1 and a parallel integral algorithm based on the 3500th-order Taylor expansion and the 4180-digit multiple precision data, we have done a reliable simulation of chaotic solution of Lorenz…
This textbook compiles the lecture notes from security courses taught at Oxford in the 2000s, at Royal Holloway in the 2010s, and currently in Hawaii. The early chapters are suitable for a first course in security. The middle chapters have…
This book is intended for teaching Signal Analysis methods and Inverse Problems theory. It is completely open access and will remain free. It is currently illustrated with examples that we have actually encountered in geophysics, but will…
These are the expanded and detailed notes of the lectures given by the authors during the school and workshop entitled "Liaison and Related Topics," held at the Politecnico di Torino during the period October 1-5, 2001. In these notes we…
This is an expanded version of the notes for the lectures given by the author at RIMS in the summer of 1999 to give a detailed account of the proof for the (weak) factorization theorem of birational maps by…
This is the 10th and final chapter of my book on Quantum Information, based on the course I have been teaching at Caltech since 1997. An earlier version of this chapter (originally Chapter 5) has been available on the course website since…
Talk given at the XLVIII Rencontres de Moriond, Electroweak Interactions and Unified Theories, La Thuile, Italy, 2-9 March 2013, to appear in the Proceedings.
A workshop sponsored by NSF C-CR and organized by the Center for Discrete Math and Theoretical Computer Science (DIMACS) was held at Elmsford, New York, January 17-18, 2002 where we had several discussions that gave structure to this…
We explore the machine-minimizing job scheduling problem, which has a rich history in the line of research, under an online setting. We consider systems with arbitrary job arrival times, arbitrary job deadlines, and unit job execution time.…
This document presents the contents of three lectures delivered by the author at the Erd\H{o}s Center School ``Optimal Transport on Quantum Structures'', Septemer 19-23, 2022 in Budapest, Hungary. It presents a fairly self contained account…