Subscribe
Issue No.03 - July-September (1999 vol.21)
pp: 38-48
ABSTRACT
<p>The history of computer developments in Czechoslovakia spans the period from the end of World War II until recent times, when the country split into two: the Czech Republic and Slovakia. This is an account of those developments. When the area was one country, the story includes information about the entire national picture, but we have, in this article, put particular emphasis on those events occurring in Slovakia.</p>
CITATION
Jozef Dujnic, Norbert Fristacký, Ludovít Molnár, Ivan Plander, Branislav Rovan, "On the History of Computer Science, Computer Engineering, and Computer Technology Development in Slovakia", IEEE Annals of the History of Computing, vol.21, no. 3, pp. 38-48, July-September 1999, doi:10.1109/85.778981
REFERENCES
 1. T. ${\bf Barto}\breve{\bf s}$ and N. ${\bf Fri}\breve{\bf s}{\bf tack}\!\acute{\bf y}$, "Verifying Timing Consistency in Formal Specifications," IEEE Design and Test of Computers, vol. 13, no. 1, pp. 8-15, 1996. 2. A. Blaho, I. ${\bf Kala}\!\breve{\bf s}$, and P. Tomcsányi, "Comenius LOGO: Environment for Teachers and Environment for Learners," Proc. Fourth EuroLogo Conf., Supplement pp. 1-11,Athens, 1993. 3. A. $\breve {\bf C}{\bf ern}\acute {\bf y}$ and J. Gruska, "Modular Trellises," G. Rozenberg and A. Salomaa, eds., The Book of L. Springer Verlag, 1986, pp. 45-60. 4. P. $\breve {\bf D}\!{\bf uri}\!\breve {\bf s}$, Z. Galil, and G. Schnitger, "Lower Bounds on Communication Complexity," Information and Computation, vol. 73, pp. 1-22, 1987. 5. P. $\breve {\bf D}\!{\bf uri}\!\breve {\bf s}$ and Z. Galil, "Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two-Way Machines," Theoretical Computer Science, vol. 21, pp. 39-53, 1982. 6. K. Diks, H.N. Djidjev, O. Sýkora, and I. Vrto, "Edge Separators of Planar Graphs With Applications," J. Algorithms, vol. 14, pp. 258-279, 1993. 7. P. $\breve {\bf D}\!{\bf uri}\!\breve {\bf s}$, O. Sýkora, C.D. Thompson, and I. Vrto, "A Minimum-Area Circuit for L-Selection," Algorithmica, vol. 2, no. 2, pp. 251-265, 1987. 8. N. ${\bf Fri}\breve{\bf s}{\bf tack}\!\acute{\bf y}$, "To the Question of Signal Transmission in Logic Circuits Containing Some Types of Magnetic Logic Gates," Avtomatika i telemechnika (USSR), vol. 26, no. 1, pp. 149-161, 1965 (in Russian). 9. N. ${\bf Fri}\breve{\bf s}{\bf tack}\!\acute{\bf y}$, "On Essential Hazards in Relay Sequential Circuits," Information Processing Machines, no. 18, Academia Praha (Prague), pp. 7-15, 1975. 10. N. ${\bf Fri}\breve{\bf s}{\bf tack}\!\acute{\bf y}$ and J. Hlavatý, "Synthesis of Delayed Boolean Function Circuit Realization," Proc. Fourth IFAC Symp. Discrete Systems, pp. 288-297,Riga, 1974. 11. N. ${\bf Fri}\breve{\bf s}{\bf tack}\!\acute{\bf y}$, J. ${\bf Ha}\!\breve{\bf s}{\bf kovec}$, P. Popov, M. Vandrovec, and M. Kolesár, Logic Processors.Prague: SNTL-ALFA, 1981 (in Czech). 12. N. ${\bf Fri}\breve{\bf s}{\bf tack}\!\acute{\bf y}$ and M. ${\bf Koto}\breve{\bf c}{\bf ov}\!\acute{\bf a}$, "A Contribution to Microprogram Control Unit Design," 27th Int'l Wiss. Koloquium T. Ilmenau. Vortragsreihe "Entwurf, Analyse und Einsatz von informationsverarbeitung Geräten und Systemen," pp. 43-47, 1982. 13. N. ${\bf Fri}\breve{\bf s}{\bf tack}\!\acute{\bf y}$ and P. Sabo, "Updated Theory of Microprogram Control and Microparallelism for Microprogram Compaction," Computers and Artificial Intelligence, vol. 3, pp. 445-467, 1984. 14. N. ${\bf Fri}\breve{\bf s}{\bf tack}\!\acute{\bf y}$ and P. Sabo, "Interpretation and Compaction of Program on SIPO Systems With Operational Parallelism," Computers and Artificial Intelligence, vol. 6, no. 6, pp. 553-572, 1987. 15. N. ${\bf Fri}\breve{\bf s}{\bf tack}\!\acute{\bf y}$, L. Gvozdjak, and $\breve {\bf S}\,.$ Neuschl, "Twenty Years of Education in Computer Engineering and Science at Electrical Engineering Faculty of STU," Computers '84 Conf. Proc., pp. 3-14,Bratislava, 1984 (in Slovak). 16. N. ${\bf Fri}\breve{\bf s}{\bf tack}\!\acute{\bf y}$, Logic Circuits I. Publishing Center of Slovak Technical Univ., 1967. 17. V. Geffert, "Normal Forms for Phrase Structure Grammars," RAIRO—Theoretical Informatics and Applications, vol. 25, pp. 473-496, 1991. 18. V. Geffert, "Nondeterministic Computations in Sublogarithmic Space and Space Constructibility," SIAM J. Computers, vol. 20, pp. 484-498, 1991. 19. V. Geffert, "Bridging Across the Log(n) Space Frontier" (invited lecture), Proc. Mathematical Foundations of Computer Science 95, Lecture Notes in Computer Science 969, Springer Verlag, 1995, pp. 50-65. 20. D.P. Gruska and A. Maggiolo-Schettini, "Process Communication Environment," S. Purushothaman and A. Zwarico, eds., NAPAW 93.Berlin: Springer Verlag, 1993. 21. J. Gruska, "Some Classifications of Context-Free Languages," Information and Control, vol. 14, pp. 152-173, 1969. 22. T. Hegedüs, "Generalized Teaching Dimensions and the Query Complexity of Learning," Proc. Eighth Annual Conf. Computational Learning Theory (COLT 95). New York: ACM Press, 1995, pp. 108-117. 23. R. ${\bf Hon}\breve{\bf c}{\bf ariv}$ and $\breve {\bf S}\,.$ Hudák, "Ein Kleinkomputer fur den Unterricht der Grundlagen der Vererbungslehre," Proc. Int'l Conf. New Trends in Pedagogical Technology,Knotke, Belgium, 1971. 24. J. ${\bf Hromkovi}\!\breve{\bf c}$, "Tradeoffs for Language Recognition on Alternating Machines," Theoretical Computer Science, vol. 63, pp. 203-221, 1989. 25. J. ${\bf Hromkovi}\!\breve{\bf c}$, "Lower Bound Techniques for VLSI Algorithms," Trends, Techniques, and Problems in Theoretical Computer Science, Lecture Notes in Computer Science 281, Springer Verlag, 1987, pp. 2-25. 26. J. ${\bf Hromkovi}\!\breve{\bf c}$, J. Karhumäki, B. Rovan, and A. Slobodová, "On the Power of Synchronization in Parallel Computations," Discrete Applied Math., vol. 32, pp. 155-182, 1991. 27. J. ${\bf Hromkovi}\!\breve{\bf c}$, J. Kari, L. Kari, and D. Pardubská, "Two Lower Bounds on Distributive Generation of Languages," Proc. Mathematical Foundations of Computer Science 94, Lecture Notes in Computer Science 841, Springer Verlag, 1994, pp. 423-432. 28. J. ${\bf Hromkovi}\!\breve{\bf c}$, R. Klasing, W. Unger, H. Wagener, and D. Pardubská, "The Complexity of Systolic Dissemination of Information in Interconnection Networks," RAIRO—Theoretical Informatics and Applications, vol. 28, pp. 303-342, 1994. 29. $\breve {\bf S}\,.$ Hudák, "On the Reachability Problem for VAS," Proc. Second European Workshop Application and Theory of Petri Nets,Bad Honnef, Germany, Sept. 1981. 30. L. Hudec, P.D. Stigal, and R.E. Ziemer, "Performance Study of 16-Bit Microcomputer Implemented FFT Algorithms," IEEE Micro, vol. 2, no. 4, pp. 61-67, 1982. 31. K. Jelemenská and L. Hudec, "The Quadruple Approach in Fault-Tolerant Transputer System Design," R. Miles and A. Chalmers, eds., Progress in Computer and OCCAM Research.Amsterdam: IOS Press, 1994, pp. 155-163. 32. M. ${\bf Jel}\!\breve{\bf s}{\bf ina}$, "Two-Level Control of Hybrid Modeling of Extrapolators," Proc. Seventh AICA Congress, pp. 86-89,Prague, 1973 (in Russian). 33. M. ${\bf Jel}\!\breve{\bf s}{\bf ina}$, "Multiprocessor Robot Control System Using Microprogramming," N.K. Sinha, ed., Microprocessor Based Control Systems. D. Reidel Pub. Co., 1986. 34. M. ${\bf Jel}\!\breve{\bf s}{\bf ina}$ and J. Kollár, "The Dataflow Implementation Environment for a Functional Language," Proc. Japan-Central Europe Joint Workshop Advanced Computer Engineering, p. 6,Warsaw, 1994. 35. M. ${\bf Jel}\!\breve{\bf s}{\bf ina}$ and M. ${\bf Kov}\!\!\acute{\bf a}\breve {\bf c}$, "Microprocessor System With Parallel Architecture for Control of Robots," Proc. Ninth Congress of IFAC, vol. 2, pp. 241-246,Budapest, 1984. 36. J. Kelemen, "Syntactical Models of Distributed Cooperative Systems," J. Exp. T. Artificial Intelligence, vol. 3, pp. 1-10, 1991. 37. A. Kelemenová, "Complexity of Normal Form Grammars," Theoretical Computer Science, vol. 28, pp. 299-314, 1984. 38. I. Korec, "Undecidable Problems Concerning Generalized Pascal Triangles of Commutative Algebras," Proc. 12th Mathematical Foundations of Computer Science 86, Lecture Notes in Computer Science 233, Springer Verlag, 1986, pp. 458-466. 39. M. ${\bf Koto}\breve{\bf c}{\bf ov}\!\acute{\bf a}$, "Design of Totally Self-Checking Check Circuits for Some 1-out-of-n Codes," Proc. FTSD 81, pp. 241-245,Ceske Budejovice, Czech Republic, 1981. 40. J. ${\bf Miklo}\breve{\bf s}{\bf ko}$, R. Klette, M. ${\bf Vajter}\!\breve{\bf s}{\bf ic}$, and I. Vrto, Fast Algorithms and Their Implementation on Specialized Parallel Computers.Amsterdam: Elsevier, 1989. 41. P. Návrat, "AI in Slovakia," Informatica, vol. 20, pp. 249-253, 1996. 42. I. Plander, J. Sedlák, and J. Semidubsky, "SAV Electronic Analog Computer," Automatizace, no. 5, pp. 124-125, 1963 (in Slovak). 43. I. Plander, Mathematical Methods and Programming for Analog Computers.Bratislava: VEDA, 1968 (in Slovak). 44. I. Plander, ed., Artificial Intelligence and Control Systems of Robots.Singapore: World Scientific, 1994. 45. M. Popper and J. Stanek, "Medical Knowledge Representation—a Non-Uniform Approach," R. Salamon and B. Blum, eds., Proc. MEDINFO '86, vol. 1, pp. 56-60,Amsterdam, 1986. 46. M. Popper, "CODEX: An Expert System for Medical Applications," $\breve {C}asopis\ L \acute {e}ka \breve {r}u\ \breve {C} esk \acute {y} ch\,,$ vol. 125, pp. 40-44, 1986 (in Slovak). 47. A. Raspaud, O. Sýkora, and I. Vrto, "Cutwidth of the de Bruijn Graph," RAIRO—Informatique Théorique et Applications (Theoretical Informatics and Applications), vol. 26, pp. 509-514, 1996. 48. B. Rovan, "A Framework for Studying Grammars," Proc. Mathematical Foundations of Computer Science 81, Lecture Notes in Computer Science 118, Springer Verlag, 1981, pp. 473-482. 49. P. ${\bf Ru}\!\breve{\bf z}{\bf i}\breve {\bf c}{\bf ka}$, "On Efficiency of Interval Routing Algorithms," Proc. Mathematical Foundations of Computer Science 88, Lecture Notes in Computer Science 324, Springer Verlag, 1988, pp. 492-500. 50. P. ${\bf Ru}\!\breve{\bf z}{\bf i}\breve {\bf c}{\bf ka}$, "Validity Test for Floyd Operator-Precedence Algorithms Is Polynomial in Time," Kybernetika, vol. 17, pp. 368-379, 1981. 51. P. ${\bf Ru}\!\breve{\bf z}{\bf i}\breve {\bf c}{\bf ka}$ and I. Prívara, "An Almost Linear Robinson Unification Algorithm," Acta Informatica, vol. 27, pp. 61-71, 1989. 52. P. ${\bf Ru}\!\breve{\bf z}{\bf i}\breve {\bf c}{\bf ka}$ and J. Wiedermann, On the Lower Bound for Minimum Comparison Selection. Lecture Notes in Computer Science 45, Springer-Verlag, 1976, pp. 495-502. 53. R. Szelepcsényi, "A Method of Forced Enumeration for Nondeterministic Automata," Acta Informatica, vol. 26, pp. 279-284, 1988. 54. M. $\breve {\bf S}{\bf perka}$, "The Origins of Computer Graphics in the Czech and Slovak Republics," Leonardo, vol. 27, pp. 45-50, 1994. 55. O. Sýkora, "VLSI Systems for Some Problems of Computational Geometry," Parallel Computing, vol. 1, pp. 337-342, 1984. 56. P.J. Voda, "Subrecursion as a Basis for a Feasible Programming Language," Proc. CSL'94, Lecture Notes in Computer Science 933, Springer-Verlag, 1994, pp. 324-338. 57. "The Development of the Research Institute of Mathematical Machines in Prague," Information Processing Machines, vol. 10, pp. 15-24, 1964 (in Czech). 58. A. Svoboda, "The Construction of a Linear Analyser in Czechoslovakia," Czechoslovak J. Physics, vol. 1, pp. 10-18, 1952 (n Czech). 59. L. Molnár, V. Sirotová, V. Vojtek, and P. ${\bf Kupkovi}\!\breve{\bf c}$, "Fortran Precompiler for SM-3-20," Proc. Fourth Seminar on the Use of Mini and Micro Computers SMEP, VysokéTatry, Czechoslovakia, ${\bf EF\ SV}\breve{\bf S}{\bf T}$-Datasystém-SVTS, pp. 126-135, 1982 (in Slovak). 60. L. Molnár, P. Návrat, and V. Vojtek, "Automatic Program Synthesis Using Heuristics and Interaction," Computers and Artificial Intelligence, vol. 5, no. 5, pp. 429-442, 1986.