ESPRIT Working Group

"Randomized Algorithms"

RAND2 (No. 21726)

(Bonn Site)

RAND2 is a Working Group funded by the EU ESPRIT BR, with sites in Bonn, Edinburgh, Leeds, Lund, Oxford, Paris, and the Weizmann Institute, Rehovot.

The research within the Working Group RAND2 is concentrated on the following research areas:

Design of efficient (both sequential and parallel) randomized algorithms for selected combinatorial, algebraic, and geometric problems.
Foundations of randomized complexity of computational problems.
Randomized approximation problems.
Computation with limited randomness resources (de-randomization methods).
Error-Resilient ATM Based Transmission.
Computational learning theory, theory of Neural Networks, and Applications.
Quantum Computation.

For a more general overview on RAND's research program see the section "Objectives and Approach" on RAND's homepage.

The active RAND2 members associated with the Bonn site are: Marek Karpinski, Peter Wegner, Christoph Günzel, Yakov Nekritch and Jürgen Wirtgen.

Contact Person:: Marek Karpinski
Postal Address:: Dept. of Computer Science
Friedrich-Ebert-Allee 144
53113 Bonn
Germany
Phone and Fax:: +49 (0)228 734224 (office)
+49 (0)228 734327 (secretary)
+49 (0)228 734440 (fax)
Email:: marek@cs.uni-bonn.de

Date Name Title

07/03/98
14 hct. L.L. Lawrence and W. Bein
(Las Vegas) The Trackless 2-Server Problem

06/29/98
13 hct. C. Smith
(Karlsruhe) Towards a Theory of Discovery

06/26/98
15 hct. S. Jukna
(Trier, Vilnius) Entropic Approach to Proving Lower Bounds for Branching Programs

Date	Name	Title
07/03/98 14 hct.	L.L. Lawrence and W. Bein (Las Vegas)	The Trackless 2-Server Problem
06/29/98 13 hct.	C. Smith (Karlsruhe)	Towards a Theory of Discovery
06/26/98 15 hct.	S. Jukna (Trier, Vilnius)	Entropic Approach to Proving Lower Bounds for Branching Programs

For a complete overview on RAND's research results see the section "Results" on RAND's homepage.