Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Antoni Kreczmar

dblp:86/4748 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 1984
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 3 first-authorDatabases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › program logic
algorithmic logic
0.011974
Effectivity Problems of Algorithmic Logic · ICALP 1974
YearPublicationVenuePosition
1984 Programmed Deallocation Without Dangling Reference
Gianna Cioni, Antoni Kreczmar
Inf. Process. Lett.2
1978 Dynamic Theories of Real and Complex Numbers
Michal Grabowski, Antoni Kreczmar
MFCS2
1977 On Finite and Infinite Computations
Antoni Kreczmar
FCT1
1976 On Memory Requirements of Strassen's Algorithms
Antoni Kreczmar
MFCS1
1974 Effectivity Problems of Algorithmic Logic
Antoni Kreczmar
ICALP1