###
*INVITED* *TALKS*

, 2013

"... Since January 2007, Levison has given 19 invited talks at international workshops and meetings, 13 colloquia at major astronomical institutions, and 7 E/PO presentations. A complete list can be found at ..."

Abstract
- Add to MetaCart

Since January 2007, Levison has given 19

*invited**talks*at international workshops and meetings, 13 colloquia at major astronomical institutions, and 7 E/PO presentations. A complete list can be found at###
*Invited* *Talks*

"... The plenary talk for division DY by Prof. Chan takes place Monday, 8:30, HSZ 01. The title of the talk is “Superfluidity in solid helium and solid hydrogen”. See the plenary section for the abstract. Prize Talk The prize talk (Max-Planck-Medaille) by Prof. Götze takes place Tuesday, 13:15, HSZ 04. T ..."

Abstract
- Add to MetaCart

The plenary

*talk*for division DY by Prof. Chan takes place Monday, 8:30, HSZ 01. The title of the*talk*is “Superfluidity in solid helium and solid hydrogen”. See the plenary section for the abstract. Prize*Talk*The prize*talk*(Max-Planck-Medaille) by Prof. Götze takes place Tuesday, 13:15, HSZ 04###
*Invited* *Talks*

"... to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. The editor wishes to thank the authors that primarily contributed with their ideas and work to the success of the workshop. He would also like to thank the the exter ..."

Abstract
- Add to MetaCart

to present their results to those members of the computer science and logic communities who study or apply the theory of fixed points. The editor wishes to thank the authors that primarily contributed with their ideas and work to the success of the workshop. He would also like to thank the the external reviewers, Dietmar Berwanger,

###
*Invited* *Talks*

"... An extremal problem for zeros of orthogonal polynomials Francisco Marcellán (U Madrid, Spain): Asymptotic properties of matrix orthogonal polynomials Giuseppe Mastroianni (U Potenza, Italy): Polynomial approximation on the real axis Lothar Reichel (U Kent, U.S.A.): Orthogonal polynomials, quadrature ..."

Abstract
- Add to MetaCart

An extremal problem for zeros of orthogonal polynomials Francisco Marcellán (U Madrid, Spain): Asymptotic properties of matrix orthogonal polynomials Giuseppe Mastroianni (U Potenza, Italy): Polynomial approximation on the real axis Lothar Reichel (U Kent, U.S.A.): Orthogonal polynomials, quadrature and matrix functionals

###
*Invited* *Talk*

"... We present an overview of recent work in which eye movements are monitored as people follow spoken instructions to move objects or pictures in a visual workspace. Subjects naturally make saccadic eye-movements to objects that are closely time-locked to relevant information in the instruction. Thus t ..."

Abstract
- Add to MetaCart

We present an overview of recent work in which eye movements are monitored as people follow spoken instructions to move objects or pictures in a visual workspace. Subjects naturally make saccadic eye-movements to objects that are closely time-locked to relevant information in the instruction. Thus the eye-movements provide a window into the rapid mental processes that underlie spoken language comprehension. We review studies of reference resolution, word recognition, and pragmatic effects on syntactic ambiguity resolution. Our studies show that people seek to establish reference with respect to their behavioral goals during the earliest moments of linguistic processing. Moreover, referentially relevant non-linguistic information immediately affects how the linguistic input is initially structured.

###
*Invited* *Talks*

"... DY 14.1 Tue 14:00–14:30 MA 004 When it helps to be purely Hamiltonian: Acceleration of rare events, enhanced particle and energy transport — •Dirk Hennig, Lutz Schimansky-Geier, Peter Hänggi ..."

Abstract
- Add to MetaCart

DY 14.1 Tue 14:00–14:30 MA 004 When it helps to be purely Hamiltonian: Acceleration of rare events, enhanced particle and energy transport — •Dirk Hennig, Lutz Schimansky-Geier, Peter Hänggi

###
*Invited* *Talks*

, 2001

"... One of the most challenging questions of today, in the overlap of computer science, mathematics, and physics, is the exploration of potential capabilities of quantum computers. Milestones which intensified and enlarged research considerably were the algorithm of Shor [1], who showed that quantum com ..."

Abstract
- Add to MetaCart

One of the most challenging questions of today, in the overlap of computer science, mathematics, and physics, is the exploration of potential capabilities of quantum computers. Milestones which intensified and enlarged research considerably were the algorithm of Shor [1], who showed that quantum computers could factor large integers e#ciently (which is widely believed to be infeasible on classical computers) and the quantum search algorithm of Grover [2], which provides a quadratic speedup over deterministic and randomized classical algorithms of searching a database. So far research was mainly concentrated on discrete problems like the above and many others one encounters in computer science. Much less is known about computational problems of analysis, including such typical field of application of Monte Carlo methods as high dimensional integration. We seek to understand how well these problems can be solved in the quantum model of computation (that is, on a -- hypothetical -- quantum computer) and how the outcome compares to the e#ciency of deterministic or Monte Carlo algorithms on a classical (i. e. non-quantum) computer. First steps were made by Novak [3], who considered integration of functions from Holder spaces. This line of research was continued by the author [4], where quantum algorithms for the integration of L p -functions and, as a key prerequisite, for the computation of the mean of p-summable sequences were constructed. In [4] a rigorous model of quantum computation for numerical problems was developed, as well. The case of integration of functions from Sobolev spaces is considered in [5], and more on the computation of the mean will be presented in [6]. These papers also established matching lower bounds. A short survey of first results can be found ...

###
(*Invited* *Talk*)

"... scalable and flexible overlay framework for simulation and real network applications ..."

Abstract
- Add to MetaCart

scalable and flexible overlay framework for simulation and real network applications