default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvan Korec
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c10]Ivan Korec, Jirí Wiedermann
:
Deterministic Verification of Integer Matrix Multiplication in Quadratic Time. SOFSEM 2014: 375-382
2000 – 2009
- 2001
- [j9]Ivan Korec:
A list of arithmetical structures complete with respect to the first-order definability. Theor. Comput. Sci. 257(1-2): 115-151 (2001)
1990 – 1999
- 1998
- [c9]Ivan Korec:
Real-time generation of primes by a one-dimensional cellular automaton with 9-states. MCU (2) 1998: 101-116 - 1997
- [j8]Ivan Korec:
Theories of Generalized Pascal Triangles. Ann. Pure Appl. Log. 89(1): 45-52 (1997) - [c8]Ivan Korec:
Real-Time Generation of Primes by a One-Dimensional Cellular Automaton with 11 States. MFCS 1997: 358-367 - 1996
- [j7]Ivan Korec:
Small Universal Register Machines. Theor. Comput. Sci. 168(2): 267-301 (1996) - 1993
- [j6]Ivan Korec:
Definability of Arithmetic Operations from the Order and a Random Relation. Fundam. Informaticae 18: 287-296 (1993) - [j5]Ivan Korec:
Irrational Speeds of Configurations Growth in Generalized Pascal Triangles. Theor. Comput. Sci. 112(2): 399-412 (1993)
1980 – 1989
- 1989
- [c7]Ivan Korec:
Semilinear Real-Time Systolic Trellis Automata. FCT 1989: 267-276 - 1987
- [j4]Ivan Korec:
Improvement of Mycielski's inequality for non-natural disjoint covering system of Z. Discret. Math. 64(1): 27-38 (1987) - 1986
- [c6]Ivan Korec:
Undecidable Problems Concerning Generalized Pascal Triangles of Commutative Algebras. MFCS 1986: 458-466 - 1984
- [j3]Ivan Korec:
Two kinds of processors are sufficient and large operating alphabets are needed for regular trellis automata languages. Bull. EATCS 23: 35-41 (1984) - 1981
- [c5]Ivan Korec:
Codings of Nonnegative Integers. MFCS 1981: 379-388
1970 – 1979
- 1979
- [c4]Ludmila Gregusová, Ivan Korec:
Small Universal Minsky Machines. MFCS 1979: 308-316 - 1977
- [j2]Ivan Korec, Juraj Procházka:
Real-Time Computability of integer part of (abs(alpha) x) and integer part of xalpha. J. Inf. Process. Cybern. 13(1/2): 13-26 (1977) - [c3]Ivan Korec:
Decidability (Undecidability) of Equivalence of Minsky Machines with Components Consisting of at Most Seven (Eight) Instructions. MFCS 1977: 324-332 - 1975
- [j1]Ivan Korec:
Model-interpretability into trees and applications. Arch. Math. Log. 17(3-4): 97-104 (1975) - [c2]M. Benesová, Ivan Korec:
Non-Linear Speed-Up Theorem for Two Register Minsky Machines. MFCS 1975: 179-185 - 1973
- [c1]Ivan Korec:
Computational Complexity Based on Expectation of the Time of Computation on Minsky Machines. MFCS 1973: 247-250
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
