VLDB 2026 Research / reviewers in the wild / expert
Sebastian Bala
dblp:90/1910
· DBLP profile ↗
8ranked-venue papers
8as first author
1since 2021 · last 2025
0000-0002-3722-4505ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 7 · 7 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Ulam's Metric in Higher Dimensions
Sebastian Bala, Andrzej Kozik |
ICTAC | 1 |
| 2017 | Secure integration of multiprotocol instant messengerabstractPidgin communicator is a multiprotocol instant messenger client, developed by open source community. It was originally a third party client of AIM (AOL Instant Messenger) protocol for Linux operating system founded in 1998. At present, its main goal is to provide common interface for every protocol it supports, so the user does not need care about protocol to use or peer's IM identifier, while he just want to talk with a Bob. The work focuses mainly on security and functionality aspects like password storage strategies, integration with plugins which provide privacy of communication. This paper shares experiences has been gained during the process of developing and replacement of existing code for version of Pidgin 3.0.0. The project realizes the list of suggestions, mainly concerning security, which has been created after code review and provide some new technical solutions that can be implemented in the future versions. Sebastian Bala, Tomasz Wasilczyk |
INISTA | 1 |
| 2013 | Limited Non-determinism Hierarchy of Counter Automata
Sebastian Bala, Dariusz Jackowski |
LATA | 1 |
| 2013 | Unambiguous Automata Denoting Finitely Sequential Functions
Sebastian Bala, Artur Koninski |
LATA | 1 |
| 2013 | Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions? - (Extended Abstract)
Sebastian Bala |
MFCS | 1 |
| 2006 | Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms
Sebastian Bala |
Theory Comput. Syst. | 1 |
| 2004 | Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms
Sebastian Bala |
STACS | 1 |
| 2002 | Intersection of Regular Languages and Star Hierarchy
Sebastian Bala |
ICALP | 1 |