Jean-Paul Allouche (CNRS), \(q\)-Regular Sequences and other Generalizations of \(q\)-Automatic Sequences Manuel Blum (U. California, Berkeley), Universal Statistical Tests Kosaburo Hashiguchi (Toyohashi U. of Technology), The Double Reconstruction Conjectures about Colored Hypergraphs and Colored Directed Graphs Erich Kaltofen (Rensselaer Polytechnic Institute), Polynomial Factorization 1987-1991 Arjen K. Lenstra (Bellcore), Massively Parallel Computing and Factoring Gene Myers (U. of Arizona), Approxiamte Matching of Network Expressions with Spacers Jean-Eric Pin (Bull), On Reversible Automata Vaughan Pratt (Standford U.), Arithmetic + Logic + Geometry = Concurrency Daniel D. Sleator (Carnegie Mellon U.), Data Structures and Terminating Petri Nets Michel Cosnard (Ecole Normale Supérieure de Lyon), Complexity Issues in Neural Network Computations

[Home] [All Inv. Speakers] [LATIN 1992]