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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Karianto Wong

dblp:73/1210 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2009
—ORCID · none

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

Theory of computation · 4 · 3 first-author

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
2 papers
Automata and formal languages · 54% Algorithms and data structures · 23% Computational complexity · 23%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages
logic and automata		 0.112007
Unranked Tree Automata with Sibling Equalities and Disequalities · ICALP 2007
Automata and formal languages
tree automata		 0.112007
Unranked Tree Automata with Sibling Equalities and Disequalities · ICALP 2007
Computational complexity
decision problems		 0.112006
On Intersection Problems for Polynomially Generated Sets · ICALP (2) 2006
Algorithms and data structures › combinatorial algorithms
intersection problems		 0.112006
On Intersection Problems for Polynomially Generated Sets · ICALP (2) 2006
YearPublicationVenuePosition
2009 On Nondeterministic Unranked Tree Automata with Sibling Constraints
abstract
We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness problem for the nondeterministic automata is decidable. In addition, we show that the universality problem, in contrast, is undecidable.
Christof Löding, Karianto Wong
 FSTTCS2
2007 Unranked Tree Automata with Sibling Equalities and Disequalities
Karianto Wong, Christof Löding
 ICALP1
2006 On Intersection Problems for Polynomially Generated Sets
Karianto Wong, Aloys Krieg, Wolfgang Thomas
 ICALP (2)1
2005 Adding Monotonic Counters to Automata and Transition Graphs
Karianto Wong
 Developments in Language Theory1