Ivan M. Havel – författare

This volume contains 10 invited papers and 40 shortcommunications contributed for presentation at the 17thSymposium on Mathematical Foundations of Computer Science,held in Prague, Czechoslovakia, August 24-28, 1992.The series of MFCS symposia, organized alternately in Polandand Czechoslovakia since 1972, has a long and wellestablished tradition. The purpose of the series is toencourage high-quality research in all branches oftheoretical computer science and to bring togetherspecialists working actively in the area.Numerous topics are covered in this volume. The invitedpapers cover: range searching with semialgebraic sets, graphlayout problems, parallel recognition and ranking ofcontext-free languages, expansion of combinatorialpolytopes, neural networks and complexity theory, theory ofcomputation over stream algebras, methods in parallelalgorithms, the complexity of small descriptions, weakparallel machines, and the complexity of graph connectivity.