[ University of Bonn | Department of Computer Science | Chair V | deutsche Version ]


RAND2_logo

Bonn_logo ESPRIT Working Group

"Randomized Algorithms"

RAND2 (No. 21726)

(Bonn Site)


Visits 1997

Carsten Dorgerloh (Bonn):
Fast Randomized and Parallel Algorithms for Finding Simple Cycles in Graphs,
Lund, 02. - 08.03.97.

Faster Finding of Simple Cycles in Planer Graphs on a Randomized EREW-PRAM,
11th International Parallel Processing Symposium,
Genf, 31.03. - 05.04.97.

Christoph Günzel (Bonn):
RAND2 Workshop on Randomized Approximation Algorithm,
Leeds, 19. - 23.09.97.

Marek Karpinski (Bonn):
Randomized Lower Bounds for Algebraic Decision Trees,
Conference on Computational Complexity,
Oberwolfach, 10. - 16.11.96.

Towards Polynomial Bounds for VC Dimension of Pfaffian Formulas and Some Neural Networks Appoications,
Banach Center in Warsaw, 08. -.11.12.96.

Theory Seminar on Randomized Approximation Schemes for Hard Counting Problems,
ICSI Berkeley and UC Berkeley, 4. - 19.03.97.

Research on Randomized Approximation Algorithms,
University of Princeton, 14. - 18.03.97.

Approximation Algorithms for some hard counting problems in finite fields,
Seminar,
Oberwolfach, 19. - 23.01.97.

Workshop in Computer Aided Design and Test: Decision Diagrams-Concept and Applications,
Dagstuhl, 26. - 27.01.97.

Research on Randomized Algorithms,
University of Latvia,
Riga, 18. - 22.05.97.

Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems,
RANDOM'97 / ICALP'97,
Bologna, 09. - 13.07.97.

An Approximation Algorithm for the Bandwidth Problem on Dense Graphs,
Workshop on Approximation Algorithms,
Dagstuhl, 17. - 22.08.97.

Fundamentals of Computation Theory - Conference,
Cracow, 31.08. - 06.09.97.

Research on Randomized Approximation Algorithms,
ICSI Berkeley and UC Berkeley, 07. - 16.09.97.

Approximation Schemes for Some Hard Counting Problems,
RAND2 Workshop on Randomized Approximation Algorithm,
Leeds, 19. - 23.09.97.

Polynomial Time Approximation Schemes for some Dense Instances of NP-Hard Optimization Problems,
Workshop on Random Graphs and Combinatorial Structures,
Oberwolfach, 28.09. - 02.10.97.

- Randomized Complexity of Linear Arrangements,
- Randomized Complexity of Integer Programming and Knapsack,
- Fast Randomized Decision Trees for the MAX Problem,
School and Workshop on Randomized Algorithms in Sequential, Parallel andi Distributed Computing - RALCOM'97,
Santorini, 05. - 10.10.97.

Jürgen Wirtgen (Bonn):
An Approximation Algorithm for the Bandwidth Problem on Dense Graphs,
RAND2 Workshop on Randomized Approximation Algorithm,
Leeds, 19. - 23.09.97.

An Approximation Algorithm for the Bandwidth Problem on Dense Graphs,
Workshop on Randomized Algorithms in Sequential, Parallel and Distributed Computing - RALCOM'97,
Santorini, 05. - 10.10.97.

Faster Finding of Simple Cycles in Planer Graphs on a Randomized EREW-PRAM,
11th International parallel Processing Symposium,
Genf, 31.03. - 05.04.97.

URL of this page: http://theory.cs.uni-bonn.de/info5/projects/RAND2_Bonn_vistits_97.html
Last updated: February 27th, 1998
Maintained by: webmaster@cs.uni-bonn.de