MFCS
MFCS 2000
25th International Symposium on
Mathematical Foundations of Computer Science
August 28 - September 1, 2000
Bratislava, Slovak Republic, Europe

Invited Talks

Region Analysis and a $\pi$-Calculus with Groups
by Silvano Dal Zilio, Andrew D. Gordon
Abstract Data Types in Computer Algebra
by James H. Davenport
What Do We Learn from Experimental Algorithmics?
by Camil Demetrescu, Giuseppe F. Italiano
And/Or Hierarchies and Round Abstraction
by Radu Grosu
Computational Politics: Electoral Systems
by Edith Hemaspaandra, Lane A. Hemaspaandra
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey
by Phokion Kolaitis, Moshe Y. Vardi
On Algorithms and Interaction
by Jan van Leeuwen, Jiri Wiedermann
On the Use of Duality and Geometry in Layouts for ATM Networks
by Shmuel Zaks

Back to MFCS 2000 Home Page


Department of Computer Science, Faculty of Mathematics and Physics, Comenius University, Bratislava
All rights reserved. © 2000
Last modified: June 27, 2000