Stasys Jukna

List of some older papers

Papers:
• Succinct data representations and the complexity of computations
  In: Colloquia Mathematica Societatis Janos Bolyai 44, (North-Holland, Amsterdam, 1985) pp. 271-282.
  
  
• Convolutional characterization of computability and complexity
  In: Colloquia Mathematica Societatis Janos Bolyai 44, (North-Holland, Amsterdam, 1985) pp. 251-270
  
  
• On logics of programs
  with R. Pliuskevicius, A. Pliuskeviciene and J. Sakalauskaite
  Kibernetika, 2 (Kiev, 1979), pp. 12-19 (in Russian)
  
  

Short Communications:

• On reliability and stability of abstract algebras
  Lithuanian Math. Journal, 21:3 (1981), pp.137-140.
  
  
• On one decidability criterion for recursively axiomatizable Hoare theories
  In: Semiotics and Informatics,12, (Nauka, Moscow, 1979), pp. 98-102 (in Russian)
  
  
• Decidability of the equivalence problem in one algebra of computable functions
  Lithuanian Math. Journal, 19:3 (1979), pp. 133-136 (in Russian)
  
  
• A solution of completeness problem for Hoare's systems via $\omega$-rule
  Lithuanian Math. Journal,19:3 (1978), pp. 176-178 (in Russian)
  
  
• On the decision problem for Hoare's system
  In: Abstracts of Colloq. on Math. Logic in Programming, (Sagotarjan, Hungary, 1978), p. 44
  
  
• Towards elimination of the cut rule in program calculuses
  Lithuanian Math. Journal, 17:3 (1977), pp. 152-154 (in Russian)
  
  
• On the normalizability of derivations in calculuses of programs
  In: Proc. of 7th All-Union Symp. on Logics and Methodology of Sciences (Kiev, 1976), pp. 131-133 (in Russian)

Texhnical Reports in Institute Series:

• Computations in lattices of partitions
  In: Math. Logics and its Applications, 5, (Inst. of Mathematics, Vilnius, 1987), pp. 17-21
  
  
• Graph convolutions and the complexity of boolean functions
  In: Math. Logics and its Applications,4, (Inst. of Mathematics, Vilnius, 1985), pp. 100-113
  
  
• Arithmetical representations of machine complexity classes
  In: Math. Logics and its Applications,2, (Inst. of Mathematics, Vilnius, 1982), pp.97-107
  
  
• On one principle for obtaining lower bounds on the arithmetical complexity
  In: Math. Logics and its Applications,2 (Inst. of Mathematics, Vilnius, 1982), pp. 108-112
  
  
• Self-correction in universal algebras
  In: Math. Logics and its Applications,1, (Inst. of Mathematics,Vilnius, 1981), pp. 133-154
  
  
• On the characterization problem for partial correctness theory of programs
  In: Computer Programming,1 (Inst. of Mathematics, Vilnius, 1979), pp. 97-125 (in Russian)
  
  

---