Kitti Gelle

18 papers B 1Journal 13Unranked 4
YearRankTypeTitle / Venue / Authors
2022 J jnl
Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata.
Int. J. Found. Comput. Sci.
Kitti Gelle, Szabolcs Iván
2020 J jnl
Scattered one-counter languges have rank less than ω
CoRR
Kitti Gelle, Szabolcs Iván
2020 B conf
The Order Type of Scattered Context-Free Orderings of Rank One Is Computable.
SOFSEM
Kitti Gelle, Szabolcs Iván
2019 — conf
On the Order Type of Scattered Context-Free Orderings.
GandALF
Kitti Gelle, Szabolcs Iván
2019 J jnl
Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info.
Int. J. Found. Comput. Sci.
Kitti Gelle, Szabolcs Iván
2019 — conf
The Syntactic Complexity of Semi-flower Languages.
DCFS
Kitti Gelle, Szabolcs Iván
2019 J jnl
The order type of scattered context-free orderings of rank one is computable.
CoRR
Kitti Gelle, Szabolcs Iván
2019 J jnl
The ordinal generated by an ordinal grammar is computable.
Theor. Comput. Sci.
Kitti Gelle, Szabolcs Iván
2018 J jnl
DFS is Unsparsable and Lookahead Can Help in Maximal Matching.
Acta Cybern.
Kitti Gelle, Szabolcs Iván
2018 J jnl
Maintaning maximal matching with lookahead.
CoRR
Kitti Gelle, Szabolcs Iván
2018 J jnl
Recognizing Union-Find trees is NP-complete.
Inf. Process. Lett.
Kitti Gelle, Szabolcs Iván
2018 J jnl
The ordinal generated by an ordinal grammar is computable.
CoRR
Kitti Gelle, Szabolcs Iván
2017 J jnl
Basin Hopping Networks of continuous global optimization problems.
Central Eur. J. Oper. Res.
Tamás Vinkó, Kitti Gelle
2017 — conf
Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete.
DCFS
Kitti Gelle, Szabolcs Iván
2017 J jnl
Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete.
CoRR
Kitti Gelle, Szabolcs Iván
2017 J jnl
Regular Expressions for Muller Context-Free Languages.
Acta Cybern.
Kitti Gelle, Szabolcs Iván
2017 — conf
Reversible languages having finitely many reduced automata.
AFL
Kitti Gelle, Szabolcs Iván
2015 J jnl
Recognizing Union-Find trees is NP-complete.
CoRR
Kitti Gelle, Szabolcs Iván