See veebileht kasutab küpsiseid kasutaja sessiooni andmete hoidmiseks. Veebilehe kasutamisega nõustute ETISe kasutustingimustega. Loe rohkem
Olen nõus

Mati Tombak

https://www.etis.ee/CV/Mati_Tombak/est
25.01.1942
6202340
+3725136456
mati.tombak@ut.ee

Teenistuskäik

Töökohad ja ametid
2007–...   
Tartu Ülikool, Matemaatika-informaatikateaduskond, Arvutiteaduse instituut, Teoreetilise informaatika õppetool, Emeriitprofessor (1,00)
01.09.2013–31.12.2016   
Tallinna Tehnikaülikool, Infotehnoloogia teaduskond, Informaatikainstituut, Informaatika aluste õppetool, Vanemteadur (0,50)
2007–2013   
Tallinna Tehnikaülikool, Infotehnoloogia teaduskond, Informaatikainstituut, Informaatika aluste õppetool, Vanemteadur (0,50)
1997–2007   
Tartu Ülikool, Matemaatika-informaatikateaduskond, Arvutiteaduse instituut, Teoreetilise informaatika õppetool, Professor (1,00)
1984–1997   
Tartu Ülikool, Matemaatika-informaatikateaduskond, Dotsent (1,00)
1978–1984   
Tartu Ülikool, Matemaatika-informaatikateaduskond, Vanemõpetaja (1,00)
1975–1978   
Tartu Ülikool, Matemaatika-informaatikateaduskond, Vanemteadur (1,00)

Kvalifikatsioon

Teaduskraadid
Mati Tombak, doktorikraad, 1981, (juh) Ülo Kaasik, O metode predsestvovanija v sintaksiceskom analize (Eelnevusmeetodist süntaksi analüüsis), Leningradi Riiklik Ülikool.
 
 
Teadustöö põhisuunad
ETIS KLASSIFIKAATOR: 4. Loodusteadused ja tehnika; 4.6. Arvutiteadused; TÄPSUSTUS: Programmeerimiskeelte süntaks ja semantika, Keerukusteooria Boole'i funktsioonid

Juhendamisel väitekirjad

Juhendatud väitekirjad

Publikatsioonid

Klass
Aasta
Publikatsioon
 
5.2.
2013
Tombak, Mati; Loorits, Neeme; Peder, Ahti; Vohandu, Leo (2013). Pattern Matching for Superpositional Graphs and Separable Permutations. In: (64−66).Eleventh International Conference Permutation Patterns 2013 Paris, France. July 1-5, 2013. Paris, France.
3.1.
2012
Võhandu, L.; Peder, A.; Tombak, M. (2012). Permutations and Bijections. In: Jaak Henno, Yasushi Kiyoki, Takehiro Tokuda, Hannu Jaakola, Naofumi Yoshida (_EditorsAbbr). Information Modelling and Knowledge Bases XXIII (419−437).. IOS Press. (Frontiers in Artificial Intelligence and Applications; 237).
3.1.
2012
Karputkin, A.; Ubar, R.; Tombak, M.; Raik, J. (2012). Automated Correction of Design Errors by Edge Redirection on High-Level Decision Diagrams. 13th International Symposium on Quality Electronic Design (ISQED), 2012: International Symposium on Quality Electronic Design (ISQED), Santa Clara, CA, USA, 19-21.03.2012. IEEE, 686−693. DOI: 10.1109/ISQED.2012.6187566.
1.2.
2011
Peder, A.; Nestra, H.; Raik, J.; Tombak, M.; Ubar, R. (2011). Linear algorithms for recognizing and parsing superpositional graphs. Facta Universitatis Series Mathematics and Informatics, 24 (3), 325−339.
3.1.
2011
Karputkin, A.; Ubar, R.; Tombak, M.; Raik, J. (2011). Interactive Presentation Abstract: Automated Correction of Design Errors by Edge Redirection on High-Level Decision Diagrams. Conference Proceedings: IEEE International High Level Design Validation and Test Workshop, Napa Valley, Nov. 9-11, 2011. IEEE Computer Society, 83. DOI: 10.1109/HLDVT.2011.6113980.
3.1.
2011
Karputkin, Anton; Ubar, Raimund; Tombak, Mati; Raik, Jaan (2011). Probabilistic Equivalence Checking Based on High-Level Decision Diagrams. 14th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems, April 13-15, 2011, Cottbus, Germany. IEEE Computer Society Press, 423−428.
3.1.
2011
Peder, A.; Tombak, M. (2011). Finding the description of structure by counting method: a case study. SOFSEM 2011: Theory and Practice of Computer Science, 6543: 37th International Conference on Current Trends in Theory and Practice of Computer Science, Novy Smokovec, 22-28 January 2011. _EditorsAbbr Cerná, I.; Gyimóthy, T.; Hromkovic, J.; Jeffery, K.; Královic, R.; Vukolic, M.; Wolf, S. London: Springer-Verlag, 455−466. (Lecture Notes in Computer Science).
3.4.
2011
Peder, A.; Nestra, H.; Raik, J.; Tombak, M.; Ubar, R. (2011). Linear algorithms for testing superpositional graphs. Proceedings Reed-Muller 2011 Workshop: !0th Reed-Muller Workshop, Tuusula (Finland), May 25-26, 2011. Ed. Dubrova, E. Tampere: Tampere University of Technology, 111−118.
6.2.
2011
Tombak, Mati (2011). Where the Theorems are Coming From. Series Electronic publications of CIITLab, Univ. Niš.
6.6.
2011
Tombak, M. (2011). Koolimatemaatikaga ülikoolimatemaatikasse. .
1.2.
2010
Karputkin, A.; Ubar, R.; Raik, J.; Tombak, M. (2010). Canonical Representation of High Level Decision Diagrams. Estonian Journal of Engineering, 16 (1), 39−55.
1.2.
2009
Peder, A.; Tombak, M. (2009). Superpositional graphs. Acta et Commentationes Universitatis Tartuensis de Mathematica, 13, 51−64.
3.1.
2009
Ubar, R.; Raik, J.; Karputkin, A.; Tombak, M. (2009). Synthesis of High-level Decision Diagrams for Functional Test Pattern Generation. Proceedings of the 16th International Conference Mixed Design of Integrated Circuits and Systems MIXDES 2009 : Lodz, Poland 25 - 27 June, 2009. Ed. Andrzej Napieralski. Lodz: IEEE, 519−524.
6.3.
2009
Tombak, M. (2009). Binaarsed relatsioonid. A & A : Arvutustehnika ja Andmetöötlus, 5, 5−11.
6.2.
2007
Tombak, M. (2007). Keerukusteooria. Tartu: Tartu Ülikooli Kirjastus.
3.1.
2004
Ubar, R.; Vassiljeva, T.; Raik, J.; Jutman, A.; Tombak, M.; Peder, A. (2004). Optimization of Structurally Synthesized BDDs. Proc of 4th IASTED Int. Conf. on Modeling, Simulation, and Optimization: MSO'04, Kauai, Hawaii, USA, August 17-19, 2004. , 234−240.
3.2.
2004
"Jutman, Artur;Peder, A.;Raik, Jaan;Tombak, M.;Ubar, Raimund-Johannes" (2004). Structurally synthesized binary decision diagrams. In: 6th International Workshop on Boolean Problems, (271−278). . Freiberg: Freiberg University.
3.4.
2003
Tombak, M. (2003). Logical method in Combinatorial counting. Proc. IPSI-2003,: International Conference on Advances in the Internet, Processing, Systems, and Interdisciplinary Research. Sveti Stefan, Montenegro, Oct. 4-11, 2003.. 4p−x.
3.1.
2001
Tombak, M.; Isotamm, A.; Tamme, T. (2001). On logical method for counting Dedekind numbers. In: Proceedings of the 13th International Symposium on Fundamentals of Computation Theory (424−427).. London: Springer. (Lecture Notes in Computer Science; 2138).
3.4.
2001
Peder, A.; Isotamm, A.; Tombak, M. (2001). A Meta-compilerfor propositional Formulae. Proc. of Seventh Symposium on Programming Languages and Software Tools: Seventh Symposium on Programming Languages and Software Tools, Szeged, Hungary, 2001. Szeged, 250−261.
3.5.
2000
Tombak, M. (2000). Eesti Matemaatika Seltsi õppekavade alternatiivkomisjoni arvamus. konverentsi ""Reaalained ja uus õppekava"" materjalid (158−159).. Tartu: Tartu Ülikool.
1.1.
1998
Sillitoe, IPW.; Tombak, M. (1998). A compact look-up table structure for low-level binary image processing. Real-Time Imaging, 4 (3), 203−210.
1.2.
1998
Tombak, M.; Sillitoe, I. (1998). On the superposition of Boolean functions.- Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica. Tomus XVII. (381−389)..
3.4.
1997
Tombak, M.; Isotamm, A.; Sillitoe, I. (1997). On the representation of Boolean functions using compact look-up tables via parallel and variable overlapping schemes. Proceedings of the Fifth Symposium on Programming Languages and Software Tools, Jyväskylä, Finland, 1997. 96−105.
1.2.
1995
Pöial, Jaanus; Tombak, Mati; Soo, Viljo (1995). A Forth-Oriented Compiler Compiler and its Applications. Forth Dimensions, Vol XVI, 21−22.
3.4.
1995
Tombak, M.; Sillitoe, I. (1995). On the Superposition of Boolean Functions. Proc. of the Fourth Symposium on Programming Languages and Software Tools, Visegrad, Hungary, 1995. 288−295.
6.6.
1994
Isotamm, A.; Jagomägi, J.; Tombak, M.; Türnpu, H. (1994). Software package CHCOORD for mathematical transforming of geodetic data (in Estonian). Kaardikoja Teataja, 1, 11−14.
3.4.
1993
Tombak, M. (1993). One more exponential algorithm for establishing satisfiability of propositional formula. Proc. of the Third Symposium on Programming Languages and Software Tools, Tartu, 1993. 142−146.
5.2.
1991
Tombak, M. (1991). An experience of implementing MODULA-2 compiler via FORTH. FORML Conference Proceedings, Forth Interest Group, Oackland, USA, 1991. 353.
5.2.
1990
Pöial, J.; Soo, V.; Tombak, M. (1990). A Forth-oriented Compiler Compiler. Informatics'89, Proc. Soviet-French symposium, 2: Informatics'89, Tallinn, May 29 - June 2, 1989. Tallinn: Eesti NSV Teaduste Akadeemia, 60−62.
5.2.
1990
Tombak, M.; Soo, V.; Pöial, J. (1990). A Forth-oriented Compiler Compiler and its applications. FORML Conference Proceedings, EuroFORML'90, Ampfield, UK: EuroFORML'90, Ampfield, UK, Oct. 12 - 14, 1990. , 4.
3.3.
1989
Tombak, M.; Väinaste, R.; Soo, V.; Pöial, J.; Juurik, A. (1989). Compiler FORTH-83/32. Final Report for the contract. . Tartu.
1.3.
1985
Pöial, J.; Soo, V.; Tombak, M. (1985). The extensible language as a tool for compiler writing system. Proc. Comp. Cent. of Tartu Univ (39−54). . Tartu University.
5.2.
1985
Tombak, M. (1985). On the description of semantics of programming languages, using extensible language. Proc. of conference "Theoretical and Applied Mathematics", Tartu 1985. 149−150.
3.3.
1984
Tombak, M.; Juurik, A.; Pöial, J.; Soo, V.; Toom, O.; Väinaste, R. (1984). On the implementation of extensible languages. Final Report for the contract (63). . Tartu.
5.2.
1984
Pöial, J.; Soo, V.; Tombak, M. (1984). Translator writing system for microcomputers. Proc. of the Conference "Single-User Dialog Systems for microcomputers". Leningrad, 1984: DIALOG-84-MICRO, Nov. 19 - 22, 1984. Leningrad: Nauka, 102−104.
1.2.
1982
Pöial, J.; Soo, V.; Tombak, M. (1982). Data output language. Proc. Comp. Cent. of Tartu Univ. (42−61). . Tartu University.
3.2.
1982
Kaasik, Ü.; Tombak, M. (1982). Shared data access in system PAMA. Proc. Comp. Cent. of Tartu Univ. (3−11). . Tartu University.
6.7.
1981
Tombak, M. (1981). On the precedence method in syntactical analysis. Tartu University.
3.2.
1980
Tombak, M. (1980). Binary relation method for computing (1,1)-context for context-free grammars. Proc. Comp. Cent. of Tartu Univ. (105−111). . Tartu University.
5.2.
1980
Kütt, J.; Nigul, A.; Tombak, M. (1980). On the context sensitive parsing, using declarations. Proc. of the First Conference of Authomatical Compiler Construction, Tallinn, 1980.
3.2.
1978
Kaasik, Ü.; Tombak, M. (1978). Database system PAMA. Proc. Comp. Cent. of Tartu Univ. (3−6). . Tartu University.
3.2.
1978
Isotamm, A.; Kaasik, Ü.; Tombak, M. (1978). Record description language. Proc. Comp. Cent. of Tartu Univ. (7−64). . Tartu University.
3.2.
1977
Malling, A.; Nigul, A.; Tombak, M. (1977). Data output language of the system VILLIS. Proc. Comp. Cent. of Tartu Univ. (79−111). . Tartu University.
1.3.
1976
Vooglaid, A.; Tombak, M. (1976). The system for generating effective multipass compilers with LR(k) semantics. Programmirovanije, 5, 28−38.
3.2.
1976
Tombak, M. (1976). On the ellimination of precedence conflicts. Proc. Comp. Cent. of Tartu Univ. (60−91). . Tartu University.
3.2.
1975
Mikli, T.; Tombak, M. (1975). On an augmented report generator for the computer Minsk-32, which allows to operate with PL/1-like structures. Proc. of Tallinn Technical University, 386, 11−16.
3.2.
1975
Vooglaid, A.; Tombak, M. (1975). On the reduction problems in precedence grammars. Proc. of Tallinn Technical University, 386, 23−38.
3.2.
1974
Tombak, M.; Mikli, T.; Allik, K. (1974). On the subordination relation. Proc. Comp. Cent. of Tartu Univ. (8−22).. Tartu University.
3.2.
1974
Aus, T.; Räbovõitra, M.; Tombak, M. (1974). The matrix report generator. Proc. Comp. Cent. of Tartu Univ. (23−29). . Tartu University.
3.2.
1974
Villems, A.; Isotamm, A.; Tombak, M. (1974). Superrecord - the method for the implementation complex data. Proc. Comp. Cent. of Tartu Univ (30−48). . Tartu University.
3.2.
1974
Villems, A.; Isotamm, A.; Tombak, M. (1974). The report generator VILLIS. In: Proceedings of the Comput Center of the University of Tartu (49−66). . Tartu University.
3.2.
1971
Mikli, T.; Tombak, M. (1971). The principles of representation of large data files in SODI. Proc. of Tallinn Technical University, 313, 21−30.
1.2.
1969
Kull, I.; Tombak, M. (1969). Some properties of inductive definitions and associated generative tools. Acta et commentationes Universitatis Tartuensis, 226, 41−62.
30.06.2018

Mati Tombak

https://www.etis.ee/CV/Mati_Tombak/eng
25.01.1942
6202340
+3725136456
mati.tombak@ut.ee

Career

Institutions and positions
2007–...   
University of Tartu, Faculty of Mathematics and Computer Science, Institute of Computer Science, Chair of Theoretical Computer Science, Professor emeritus (1,00)
01.09.2013–31.12.2016   
Tallinn University of Technology , School of Information Technologies, Department of Informatics, Chair of Foundations of Informatics, Senior Researcher (0,50)
2007–2013   
Tallinn University of Technology , School of Information Technologies, Department of Informatics, Chair of Foundations of Informatics, Senior Researcher (0,50)
1997–2007   
University of Tartu, Faculty of Mathematics and Computer Science, Institute of Computer Science, Chair of Theoretical Computer Science, Professor (1,00)
1984–1997   
University of Tartu, Faculty of Mathematics and Computer Science, Associate Professor (1,00)
1978–1984   
University of Tartu, Faculty of Mathematics and Computer Science, Senior Teacher (1,00)
1975–1978   
University of Tartu, Faculty of Mathematics and Computer Science, Senior Researcher (1,00)

Qualifications

Academic degrees
Mati Tombak, Doctor's Degree, 1981, (sup) Ülo Kaasik, O metode predsestvovanija v sintaksiceskom analize (On the precedence method in syntactical analysis), Leningrad State University.
 
 
Fields of research
ETIS CLASSIFICATION: 4. Natural Sciences and Engineering; 4.6. Computer Sciences; SPECIFICATION: Syntaxis and semantics of programming languages Complexity theory Boolean functions
 
 

Dissertations under supervision

Supervised dissertations

Publications

Category
Year
Publication
 
5.2.
2013
Tombak, Mati; Loorits, Neeme; Peder, Ahti; Vohandu, Leo (2013). Pattern Matching for Superpositional Graphs and Separable Permutations. In: (64−66).Eleventh International Conference Permutation Patterns 2013 Paris, France. July 1-5, 2013. Paris, France.
3.1.
2012
Võhandu, L.; Peder, A.; Tombak, M. (2012). Permutations and Bijections. In: Jaak Henno, Yasushi Kiyoki, Takehiro Tokuda, Hannu Jaakola, Naofumi Yoshida (_EditorsAbbr). Information Modelling and Knowledge Bases XXIII (419−437).. IOS Press. (Frontiers in Artificial Intelligence and Applications; 237).
3.1.
2012
Karputkin, A.; Ubar, R.; Tombak, M.; Raik, J. (2012). Automated Correction of Design Errors by Edge Redirection on High-Level Decision Diagrams. 13th International Symposium on Quality Electronic Design (ISQED), 2012: International Symposium on Quality Electronic Design (ISQED), Santa Clara, CA, USA, 19-21.03.2012. IEEE, 686−693. DOI: 10.1109/ISQED.2012.6187566.
1.2.
2011
Peder, A.; Nestra, H.; Raik, J.; Tombak, M.; Ubar, R. (2011). Linear algorithms for recognizing and parsing superpositional graphs. Facta Universitatis Series Mathematics and Informatics, 24 (3), 325−339.
3.1.
2011
Karputkin, A.; Ubar, R.; Tombak, M.; Raik, J. (2011). Interactive Presentation Abstract: Automated Correction of Design Errors by Edge Redirection on High-Level Decision Diagrams. Conference Proceedings: IEEE International High Level Design Validation and Test Workshop, Napa Valley, Nov. 9-11, 2011. IEEE Computer Society, 83. DOI: 10.1109/HLDVT.2011.6113980.
3.1.
2011
Karputkin, Anton; Ubar, Raimund; Tombak, Mati; Raik, Jaan (2011). Probabilistic Equivalence Checking Based on High-Level Decision Diagrams. 14th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems, April 13-15, 2011, Cottbus, Germany. IEEE Computer Society Press, 423−428.
3.1.
2011
Peder, A.; Tombak, M. (2011). Finding the description of structure by counting method: a case study. SOFSEM 2011: Theory and Practice of Computer Science, 6543: 37th International Conference on Current Trends in Theory and Practice of Computer Science, Novy Smokovec, 22-28 January 2011. _EditorsAbbr Cerná, I.; Gyimóthy, T.; Hromkovic, J.; Jeffery, K.; Královic, R.; Vukolic, M.; Wolf, S. London: Springer-Verlag, 455−466. (Lecture Notes in Computer Science).
3.4.
2011
Peder, A.; Nestra, H.; Raik, J.; Tombak, M.; Ubar, R. (2011). Linear algorithms for testing superpositional graphs. Proceedings Reed-Muller 2011 Workshop: !0th Reed-Muller Workshop, Tuusula (Finland), May 25-26, 2011. Ed. Dubrova, E. Tampere: Tampere University of Technology, 111−118.
6.2.
2011
Tombak, Mati (2011). Where the Theorems are Coming From. Series Electronic publications of CIITLab, Univ. Niš.
6.6.
2011
Tombak, M. (2011). Koolimatemaatikaga ülikoolimatemaatikasse. .
1.2.
2010
Karputkin, A.; Ubar, R.; Raik, J.; Tombak, M. (2010). Canonical Representation of High Level Decision Diagrams. Estonian Journal of Engineering, 16 (1), 39−55.
1.2.
2009
Peder, A.; Tombak, M. (2009). Superpositional graphs. Acta et Commentationes Universitatis Tartuensis de Mathematica, 13, 51−64.
3.1.
2009
Ubar, R.; Raik, J.; Karputkin, A.; Tombak, M. (2009). Synthesis of High-level Decision Diagrams for Functional Test Pattern Generation. Proceedings of the 16th International Conference Mixed Design of Integrated Circuits and Systems MIXDES 2009 : Lodz, Poland 25 - 27 June, 2009. Ed. Andrzej Napieralski. Lodz: IEEE, 519−524.
6.3.
2009
Tombak, M. (2009). Binaarsed relatsioonid [Binary relations]. A & A : Arvutustehnika ja Andmetöötlus, 5, 5−11.
6.2.
2007
Tombak, M. (2007). Keerukusteooria. Tartu: Tartu Ülikooli Kirjastus.
3.1.
2004
Ubar, R.; Vassiljeva, T.; Raik, J.; Jutman, A.; Tombak, M.; Peder, A. (2004). Optimization of Structurally Synthesized BDDs. Proc of 4th IASTED Int. Conf. on Modeling, Simulation, and Optimization: MSO'04, Kauai, Hawaii, USA, August 17-19, 2004. , 234−240.
3.2.
2004
"Jutman, Artur;Peder, A.;Raik, Jaan;Tombak, M.;Ubar, Raimund-Johannes" (2004). Structurally synthesized binary decision diagrams. In: 6th International Workshop on Boolean Problems, (271−278). . Freiberg: Freiberg University.
3.4.
2003
Tombak, M. (2003). Logical method in Combinatorial counting. Proc. IPSI-2003,: International Conference on Advances in the Internet, Processing, Systems, and Interdisciplinary Research. Sveti Stefan, Montenegro, Oct. 4-11, 2003.. 4p−x.
3.1.
2001
Tombak, M.; Isotamm, A.; Tamme, T. (2001). On logical method for counting Dedekind numbers. In: Proceedings of the 13th International Symposium on Fundamentals of Computation Theory (424−427).. London: Springer. (Lecture Notes in Computer Science; 2138).
3.4.
2001
Peder, A.; Isotamm, A.; Tombak, M. (2001). A Meta-compilerfor propositional Formulae. Proc. of Seventh Symposium on Programming Languages and Software Tools: Seventh Symposium on Programming Languages and Software Tools, Szeged, Hungary, 2001. Szeged, 250−261.
3.5.
2000
Tombak, M. (2000). Eesti Matemaatika Seltsi õppekavade alternatiivkomisjoni arvamus. konverentsi ""Reaalained ja uus õppekava"" materjalid (158−159).. Tartu: Tartu Ülikool.
1.1.
1998
Sillitoe, IPW.; Tombak, M. (1998). A compact look-up table structure for low-level binary image processing. Real-Time Imaging, 4 (3), 203−210.
1.2.
1998
Tombak, M.; Sillitoe, I. (1998). On the superposition of Boolean functions.- Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Computatorica. Tomus XVII. (381−389)..
3.4.
1997
Tombak, M.; Isotamm, A.; Sillitoe, I. (1997). On the representation of Boolean functions using compact look-up tables via parallel and variable overlapping schemes. Proceedings of the Fifth Symposium on Programming Languages and Software Tools, Jyväskylä, Finland, 1997. 96−105.
1.2.
1995
Pöial, Jaanus; Tombak, Mati; Soo, Viljo (1995). A Forth-Oriented Compiler Compiler and its Applications. Forth Dimensions, Vol XVI, 21−22.
3.4.
1995
Tombak, M.; Sillitoe, I. (1995). On the Superposition of Boolean Functions. Proc. of the Fourth Symposium on Programming Languages and Software Tools, Visegrad, Hungary, 1995. 288−295.
6.6.
1994
Isotamm, A.; Jagomägi, J.; Tombak, M.; Türnpu, H. (1994). Software package CHCOORD for mathematical transforming of geodetic data (in Estonian). Kaardikoja Teataja, 1, 11−14.
3.4.
1993
Tombak, M. (1993). One more exponential algorithm for establishing satisfiability of propositional formula. Proc. of the Third Symposium on Programming Languages and Software Tools, Tartu, 1993. 142−146.
5.2.
1991
Tombak, M. (1991). An experience of implementing MODULA-2 compiler via FORTH. FORML Conference Proceedings, Forth Interest Group, Oackland, USA, 1991. 353.
5.2.
1990
Pöial, J.; Soo, V.; Tombak, M. (1990). A Forth-oriented Compiler Compiler. Informatics'89, Proc. Soviet-French symposium, 2: Informatics'89, Tallinn, May 29 - June 2, 1989. Tallinn: Eesti NSV Teaduste Akadeemia, 60−62.
5.2.
1990
Tombak, M.; Soo, V.; Pöial, J. (1990). A Forth-oriented Compiler Compiler and its applications. FORML Conference Proceedings, EuroFORML'90, Ampfield, UK: EuroFORML'90, Ampfield, UK, Oct. 12 - 14, 1990. , 4.
3.3.
1989
Tombak, M.; Väinaste, R.; Soo, V.; Pöial, J.; Juurik, A. (1989). Compiler FORTH-83/32. Final Report for the contract. . Tartu.
1.3.
1985
Pöial, J.; Soo, V.; Tombak, M. (1985). The extensible language as a tool for compiler writing system. Proc. Comp. Cent. of Tartu Univ (39−54). . Tartu University.
5.2.
1985
Tombak, M. (1985). On the description of semantics of programming languages, using extensible language. Proc. of conference "Theoretical and Applied Mathematics", Tartu 1985. 149−150.
3.3.
1984
Tombak, M.; Juurik, A.; Pöial, J.; Soo, V.; Toom, O.; Väinaste, R. (1984). On the implementation of extensible languages. Final Report for the contract (63). . Tartu.
5.2.
1984
Pöial, J.; Soo, V.; Tombak, M. (1984). Translator writing system for microcomputers. Proc. of the Conference "Single-User Dialog Systems for microcomputers". Leningrad, 1984: DIALOG-84-MICRO, Nov. 19 - 22, 1984. Leningrad: Nauka, 102−104.
1.2.
1982
Pöial, J.; Soo, V.; Tombak, M. (1982). Data output language. Proc. Comp. Cent. of Tartu Univ. (42−61). . Tartu University.
3.2.
1982
Kaasik, Ü.; Tombak, M. (1982). Shared data access in system PAMA. Proc. Comp. Cent. of Tartu Univ. (3−11). . Tartu University.
6.7.
1981
Tombak, M. (1981). On the precedence method in syntactical analysis. Tartu University.
3.2.
1980
Tombak, M. (1980). Binary relation method for computing (1,1)-context for context-free grammars. Proc. Comp. Cent. of Tartu Univ. (105−111). . Tartu University.
5.2.
1980
Kütt, J.; Nigul, A.; Tombak, M. (1980). On the context sensitive parsing, using declarations. Proc. of the First Conference of Authomatical Compiler Construction, Tallinn, 1980.
3.2.
1978
Kaasik, Ü.; Tombak, M. (1978). Database system PAMA. Proc. Comp. Cent. of Tartu Univ. (3−6). . Tartu University.
3.2.
1978
Isotamm, A.; Kaasik, Ü.; Tombak, M. (1978). Record description language. Proc. Comp. Cent. of Tartu Univ. (7−64). . Tartu University.
3.2.
1977
Malling, A.; Nigul, A.; Tombak, M. (1977). Data output language of the system VILLIS. Proc. Comp. Cent. of Tartu Univ. (79−111). . Tartu University.
1.3.
1976
Vooglaid, A.; Tombak, M. (1976). The system for generating effective multipass compilers with LR(k) semantics. Programmirovanije, 5, 28−38.
3.2.
1976
Tombak, M. (1976). On the ellimination of precedence conflicts. Proc. Comp. Cent. of Tartu Univ. (60−91). . Tartu University.
3.2.
1975
Mikli, T.; Tombak, M. (1975). On an augmented report generator for the computer Minsk-32, which allows to operate with PL/1-like structures. Proc. of Tallinn Technical University, 386, 11−16.
3.2.
1975
Vooglaid, A.; Tombak, M. (1975). On the reduction problems in precedence grammars. Proc. of Tallinn Technical University, 386, 23−38.
3.2.
1974
Tombak, M.; Mikli, T.; Allik, K. (1974). On the subordination relation. Proc. Comp. Cent. of Tartu Univ. (8−22).. Tartu University.
3.2.
1974
Aus, T.; Räbovõitra, M.; Tombak, M. (1974). The matrix report generator. Proc. Comp. Cent. of Tartu Univ. (23−29). . Tartu University.
3.2.
1974
Villems, A.; Isotamm, A.; Tombak, M. (1974). Superrecord - the method for the implementation complex data. Proc. Comp. Cent. of Tartu Univ (30−48). . Tartu University.
3.2.
1974
Villems, A.; Isotamm, A.; Tombak, M. (1974). The report generator VILLIS. In: Proceedings of the Comput Center of the University of Tartu (49−66). . Tartu University.
3.2.
1971
Mikli, T.; Tombak, M. (1971). The principles of representation of large data files in SODI. Proc. of Tallinn Technical University, 313, 21−30.
1.2.
1969
Kull, I.; Tombak, M. (1969). Some properties of inductive definitions and associated generative tools. Acta et commentationes Universitatis Tartuensis, 226, 41−62.
30.06.2018

Otsi projekti

  • {{item.Name}}
Asutus on projekti finantseerija   Asutus on projekti teostaja  
  • {{searchListItem.Name}}
Kõik   Tavaprojektid   Ülemprojektid   Alamprojektid  
Uus Frascati (2015)
Uus ja vana Frascati (otsing uue järgi väljastab ka seotud vanad)
Kõik
Käimasolevad
Lõppenud
Algus
Hajus
Täpne
Uus otsing (Beetaversioon) Lihtotsing Tühjenda
  • Leitud 3 kirjet
ProgrammLiikNumberNimiProjekti algusProjekti lõppVastutav täitjaAsutusFinantseerijapoolne rahastamine
SFSF0140013s10Evolutsioneeruvate infosüsteemide mudelipõhine loomine ja haldamine01.01.201031.12.2014Kuldar TaveterTallinna Tehnikaülikool, Infotehnoloogia teaduskond436 366,29 EUR
MUUSMTAT07104Õppevahend "Keerukusteooria"01.05.200731.12.2007Mati TombakTartu Ülikool734,98 EUR
MUUSMTAT03043/62Õppevahend "Keerukusteooria".01.12.200631.01.2007Mati TombakTartu Ülikool734,98 EUR