pith. sign in

Szabolcs Ivan

Identifiers

  • name variant Szabolcs Ivan 0.60 · backfill

Papers (12)

  1. The order type of scattered context-free orderings of rank one is computable cs.FL · 2019 · author #2
  2. The ordinal generated by an ordinal grammar is computable cs.FL · 2018 · author #2
  3. Maintaning maximal matching with lookahead cs.DS · 2018 · author #2
  4. Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete cs.DS · 2017 · author #2
  5. Recognizing Union-Find trees is NP-complete cs.CC · 2015 · author #2
  6. Algebraic Characterization of Forest Logics cs.FL · 2015 · author #2
  7. On state complexity of unions of binary factor-free languages cs.FL · 2014 · author #1
  8. Complexity of Atoms, Combinatorially cs.FL · 2014 · author #1
  9. On nonpermutational transformation semigroups with an application to syntactic complexity cs.FL · 2014 · author #1
  10. Operational characterization of scattered MCFLs -- Technical Report cs.FL · 2013 · author #2
  11. On the structure and syntactic complexity of generalized definite languages cs.FL · 2013 · author #1
  12. Context-free ordinals cs.FL · 2011 · author #2

Mentions

  • 1510.07462 #2 · backfill · confidence 0.70 Szabolcs Ivan
  • 1506.03843 #2 · backfill · confidence 0.70 Szabolcs Ivan
  • 1405.1107 #1 · backfill · confidence 0.70 Szabolcs Ivan
  • 1404.6632 #1 · backfill · confidence 0.70 Szabolcs Ivan
  • 1402.7289 #1 · backfill · confidence 0.70 Szabolcs Ivan
  • 1304.6388 #2 · backfill · confidence 0.70 Szabolcs Ivan
  • 1304.5714 #1 · backfill · confidence 0.70 Szabolcs Ivan
  • 1103.5421 #2 · backfill · confidence 0.70 Szabolcs Ivan

Frequent Coauthors