DMTCS'96

Speaker Programme

0930-1030	Invited speaker Ron Graham Recent random Ramsey results
1100-1230	Complexity Stephen Bloch, Jonathan Buss, and Judy Goldsmith Sharply bounded alternation within P Neal Brand and Margaret Morton A note on the growth rate of planar graphs Ghulam Rasool Chaudhry and Jennie Seberry Secret sharing schemes based on room squares
1400-1530	Logic Giulia Galbiati, Angelo Morzenti, and Francesco Maffioli On the logical definability of some maximum leaves problems Hans W. Guesgen A formalization of anytime constraint satisfaction Padmanabhan Krishnan and Jane Hopkins A process algebraic view of linear logic
1600-1630	Serafino Cicerone and Gabriele Di Stefano Graph Classes between Parity and Distance-Hereditary Graphs
1630-1730	Invited speaker Jeffrey Dinitz 200 years of MOLS: The making of the new MOLS table
1800-1900	Posters

0900-1000	Invited speaker Piergiorgio Odifreddi Indiscrete applications of discrete mathematics
1000-1030	Mathematics Robert Goldblatt The functional lambda abstraction algebras for a variety
1100-1230	Combinatorics Charles H. C. Little and Bruce van-Brunt A condition for a normal semicycle to separate an orientable 3-graph Charles Semple k-regular matroids Marston D. E. Conder and Cameron G. Walker Sierpinski's gasket, 2-groups and graph symmetries
1400-1530	Constructivity Peter Hertling Effectivity and effective continuity of functions between computable metric spaces Takakazu Mori, Yoshiki Tsujii, and Mariko Yasugi Computability structures on metric spaces Dieter Spreen Representations versus numberings: On the two computability notions
1600-1630	I. Antoniou, A. Yafyasov, and Boris Pavlov Quantum electronic devices based on metal-dielectric transition low-dimensional quantum structures
1630-1730	Invited speaker Susumu Hayashi Constructive programming: A personal view

0900-1000

Invited speaker

Grzegorz Rozenberg
Forbiding and enforcing

0900-1000	Invited speaker Gregory Chaitin An Invitation to algorithmic information
1000-1030	Theory Rod G. Downey, Udayan Taylor, and Michael R. Fellows The parameterized complexity of relational database queries and an improved characterization of W[1]
1100-1230	Logic Bakhadyr Khoussainov and Richard A. Shore Categoricity and Scott families Satoshi Matsuoka A new proof search method for linear logic Mouw-ching Tjiok The role of Kripke semantics in reasoning of knowledge and time
1400-1530	Computability Chrystopher Nehaniv, Masami Ito, Pal Domosi, and Masashi Katsura A new pumping lemma for context-free languange Klaus-Jorn Lange and Klaus Reinhardt Set Automata Ryu Hasegawa The generating functions of lambda terms
1600-1630	Masami Ito, B. Imreh, and Masashi Katsura On shuffle closures of commutative regular languages
1630-1730	Invited speaker Fan Chung Discrete isoperimetric inequalities
1800-1900	Posters

0900-1000

Invited speaker

Klaus Weihrauch
A Foundation for computable analysis

1000-1030

Kai Salomaa and Sheng Yu
EDT0L structual equivalence is decidable

1100-1230

Combinatorics

Richard. P. Anstee and Lou Caccetta
Recognizing diameter critical graphs

Paul Bonnington, Jozef Siran, Dan Archdeacon, and John Pearson
Hadwiger number for products of cycles

Claudia Bertram-Kretzberg, Hanno Lefmann, Vojtech Rodl, and Beata Wysocka
Proper bounded edge-colorings