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

Igor Prívara

dblp:02/1119 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

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

Theory of computation · 4

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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › term rewriting
knuth-bendix completion
0.011986
On Nontermination of Knuth-Bendix Algorithm · ICALP 1986
Logic in computer science
term rewriting
0.011986
On Nontermination of Knuth-Bendix Algorithm · ICALP 1986
Logic in computer science › algebraic logic
equational logic
0.011986
On Nontermination of Knuth-Bendix Algorithm · ICALP 1986
YearPublicationVenuePosition
1993 On Tree Pattern Unification Problems
Peter Ruzicka, Igor Prívara
FCT2
1989 An Almost Linear Robinson Unification Algorithm
Peter Ruzicka, Igor Prívara
Acta Informatica2
1988 An Almost Linear Robinson Unification ALgorithm
Peter Ruzicka, Igor Prívara
MFCS2
1986 On Nontermination of Knuth-Bendix Algorithm
Miki Hermann, Igor Prívara
ICALP2