Ivan Korec

According to our database1, Ivan Korec authored at least 19 papers between 1973 and 2014.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Deterministic Verification of Integer Matrix Multiplication in Quadratic Time.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

2001
A list of arithmetical structures complete with respect to the first-order definability.
Theor. Comput. Sci., 2001

1998
Real-time generation of primes by a one-dimensional cellular automaton with 9-states.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

1997
Theories of Generalized Pascal Triangles.
Ann. Pure Appl. Log., 1997

Real-Time Generation of Primes by a One-Dimensional Cellular Automaton with 11 States.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996
Small Universal Register Machines.
Theor. Comput. Sci., 1996

1993
Irrational Speeds of Configurations Growth in Generalized Pascal Triangles.
Theor. Comput. Sci., 1993

Definability of Arithmetic Operations from the Order and a Random Relation.
Fundam. Informaticae, 1993

1989
Semilinear Real-Time Systolic Trellis Automata.
Proceedings of the Fundamentals of Computation Theory, 1989

1987
Improvement of Mycielski's inequality for non-natural disjoint covering system of Z.
Discret. Math., 1987

1986
Undecidable Problems Concerning Generalized Pascal Triangles of Commutative Algebras.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1984
Two kinds of processors are sufficient and large operating alphabets are needed for regular trellis automata languages.
Bull. EATCS, 1984

1981
Codings of Nonnegative Integers.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1979
Small Universal Minsky Machines.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1977
Real-Time Computability of integer part of (abs(alpha) x) and integer part of x<sup>alpha</sup>.
J. Inf. Process. Cybern., 1977

Decidability (Undecidability) of Equivalence of Minsky Machines with Components Consisting of at Most Seven (Eight) Instructions.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1975
Model-interpretability into trees and applications.
Arch. Math. Log., 1975

Non-Linear Speed-Up Theorem for Two Register Minsky Machines.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

1973
Computational Complexity Based on Expectation of the Time of Computation on Minsky Machines.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973


  Loading...