Workshop on Combinatorics, Random Structures, and Algorithms

Rio de Janeiro, 12 e 13 de março de 2002

Este encontro é uma realização do IMPA e do Instituto do Milênio

Comitê Organizador

Yoshiharu Kohayakawa, USP

Carlos Gustavo Moreira, IMPA

PALESTRANTES

Andrew Thomason, Cambridge, UK
Brendan Nagle, Georgia Tech, USA
Christian Mauduit, Luminy, France
Dwight Duffus, Emory University, USA
Hanno Lefmann, TU Chemnitz, Germany
Jayme Szwarcfiter, UFRJ
Jozef Skokan, Univ. Illinois at Urbana-Champaign, USA
Nicolau Saldanha, PUC/RJ
Pavel Pudlák, Czech Acad. of Sciencies, Czech Republic
Vojtech Rödl, Emory University, USA

Programa

Terça-feira, 12 – Auditório 2

Horário – Manhã	9:00 – 9:45	9:45 – 10:15	10:15 – 11:00	11:00 – 11:45
	Ramsey type theorems for integers V. Rödl	Coffee Break	Hypergraph regularity, algorithms and applications B. Nagle	A generalization of the Helly property J. Szwarcfiter
Horário – Tarde	15:00 – 15:45	15:45 – 16:15	16:15 – 17:00	17:00 – 17:45
	Maximal antichains and fibres in finite ordered sets D. Duffus	Coffee Break	Results on counting of domino tilings N. Saldanha	Sparse parity check matrices H. Lefmann

Quarta-feira, 13 – Auditório 2

Horário – Manhã	9:00 – 9:45	9:45 – 10:30	10:30 – 11:00	11:00 – 11:45	11:45 – 12:30
	Extremal theory for graph minors A. Thomason	Counting small cliques in uniform hypergraphs J. Skokan	Coffee Break	Measures of pseudorandomness for finite sequences C. Mauduit	An application of Hindman’s theorem to a problem on computational complexity P. Pudlák