Václav Koubek – författare
Visar alla böcker från författaren Václav Koubek. Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
Mathematical Foundations of Computer Science 2004
29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings
Häftad, Engelska, 2004
1 100 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic in August 2004. The 60 revised full papers presented together with full papers or abstracts of 10 invited talks were carefully reviewed and selected from 167 submissions. The papers are organised in topical sections on graph algorithms, approximation, graphs and complexity, circuits, general complexity, automata, parameterized and kolmogrov complexity, semantics, scheduling, algebraic theory of languages, games, languages, geometry, languages and complexity, quantum computing, and XML.
Mathematical Foundations of Computer Science 1988
13th Symposium Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Proceedings
Häftad, Engelska, 1988
1 100 kr
Skickas inom 10-15 vardagar
This volume contains 11 invited lectures and 42 communications presented at the 13th Conference on Mathematical Foundations of Computer Science, MFCS '88, held at Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Most of the papers present material from the following four fields: - complexity theory, in particular structural complexity, - concurrency and parellelism, - formal language theory, - semantics. Other areas treated in the proceedings include functional programming, inductive syntactical synthesis, unification algorithms, relational databases and incremental attribute evaluation.
Mathematical Foundations of Computer Science 1992
17th International Symposium, Prague, Czechoslovakia, August 24-28, 1992. Proceedings
Häftad, Engelska, 1992
554 kr
Skickas inom 10-15 vardagar
This volume contains 10 invited papers and 40 short communications contributed for presentation at the 17th Symposium on Mathematical Foundations of Computer Science, held in Prague, Czechoslovakia, August 24-28, 1992. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Numerous topics are covered in this volume. The invited papers cover: range searching with semialgebraic sets, graph layout problems, parallel recognition and ranking of context-free languages, expansion of combinatorial polytopes, neural networks and complexity theory, theory of computation over stream algebras, methods in parallel algorithms, the complexity of small descriptions, weak parallel machines, and the complexity of graph connectivity.