Intersection of Regular Languages and Star Hierarchy. - Sebastian Bala (ICALP, 2002)

Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms. - Sebastian Bala (STACS, 2004)

Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms. - Sebastian Bala (Theory Comput. Syst., 2006)

Limited Non-determinism Hierarchy of Counter Automata. - Sebastian Bala; Dariusz Jackowski (LATA, 2013)

Unambiguous Automata Denoting Finitely Sequential Functions. - Sebastian Bala; Artur Koninski (LATA, 2013)

Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions? - (Extended Abstract). - Sebastian Bala (MFCS, 2013)

Secure integration of multiprotocol instant messenger. - Sebastian Bala; Tomasz Wasilczyk (INISTA, 2017)

On Tractability of Ulams Metric in Highier Dimensions and Dually Related Hierarchies of Problems. - Sebastian Bala; Andrzej Kozik (CoRR, 2020)