Kitti Gelle

Publication Activity (10 Years)

Years Active: 2015-2022
Publications (10 Years): 17

Top Topics

Polynomially Solvable

Global Optimization Problems

Top Venues

Int. J. Found. Comput. Sci.

Publications

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