default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBartek Klin
Person information
- affiliation: University of Oxford, UK
- affiliation (former): University of Warsaw, Poland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Mikolaj Bojanczyk
, Bartek Klin:
Polyregular Functions on Unordered Trees of Bounded Height. Proc. ACM Program. Lang. 8(POPL): 1326-1351 (2024)- [j16]Mikolaj Bojanczyk, Joanna Fijalkow, Bartek Klin, Joshua Moerman:
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. TheoretiCS 3 (2024) - 2023
- [e5]Bartek Klin, Elaine Pimentel:
31st EACSL Annual Conference on Computer Science Logic, CSL 2023, February 13-16, 2023, Warsaw, Poland. LIPIcs 252, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-264-8 [contents] - [i10]Mikolaj Bojanczyk, Bartek Klin:
Polyregular functions on unordered trees of bounded height. CoRR abs/2311.04180 (2023) - 2022
- [j15]Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Samuel Humeau, Clovis Eberhart, Ichiro Hasuo:
Codensity Games for Bisimilarity. New Gener. Comput. 40(2): 403-465 (2022) - [c35]Jedrzej Kolodziejski, Bartek Klin:
Countdown μ-Calculus. MFCS 2022: 64:1-64:14 - [e4]Bartek Klin, Slawomir Lasota, Anca Muscholl:
33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland. LIPIcs 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-246-4 [contents] - [i9]Mikolaj Bojanczyk, Bartek Klin, Julian Salamanca:
Monadic Monadic Second Order Logic. CoRR abs/2201.09969 (2022) - [i8]Jedrzej Kolodziejski, Bartek Klin:
Countdown μ-calculus. CoRR abs/2208.00536 (2022) - 2021
- [c34]Bartek Klin:
μ-Calculi with Atoms (Invited Talk). CSL 2021: 1:1-1:1 - [c33]Bartek Klin, Slawomir Lasota, Szymon Torunczyk:
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages. FoSSaCS 2021: 365-384 - [c32]Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman:
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. LICS 2021: 1-13 - [i7]Mikolaj Bojanczyk, Bartek Klin, Joshua Moerman:
Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata. CoRR abs/2104.02438 (2021)
2010 – 2019
- 2019
- [j14]Florence Clerc, Nathanaël Fijalkow, Bartek Klin, Prakash Panangaden:
Expressiveness of probabilistic modal logics: A gradual approach. Inf. Comput. 267: 145-163 (2019) - [j13]Mikolaj Bojanczyk, Bartek Klin:
A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra. Log. Methods Comput. Sci. 15(4) (2019) - [j12]Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Definable isomorphism problem. Log. Methods Comput. Sci. 15(4) (2019) - [j11]Bartek Klin, Mateusz Lelyk:
Scalar and Vectorial mu-calculus with Atoms. Log. Methods Comput. Sci. 15(4) (2019) - [c31]Clovis Eberhart, Bartek Klin:
History-Dependent Nominal μ-Calculus. LICS 2019: 1-13 - [c30]Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Ichiro Hasuo:
Codensity Games for Bisimilarity. LICS 2019: 1-13 - [i6]Yuichi Komorida, Shin-ya Katsumata, Nick Hu, Bartek Klin, Ichiro Hasuo:
Codensity Games for Bisimilarity. CoRR abs/1907.09634 (2019) - 2018
- [c29]Bartek Klin, Julian Salamanca:
Iterated Covariant Powerset is not a Monad. MFPS 2018: 261-276 - [i5]Khadijeh Keshvardoost, Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Definable isomorphism problem. CoRR abs/1802.08500 (2018) - [i4]Bartek Klin, Mateusz Lelyk:
Scalar and Vectorial mu-calculus with Atoms. CoRR abs/1803.06752 (2018) - [i3]Mikolaj Bojanczyk, Bartek Klin:
A non-regular language of infinite trees that is recognizable by a finite algebra. CoRR abs/1804.06667 (2018) - 2017
- [j10]Bartek Klin, Beata Nachyla:
Some undecidable properties of SOS specifications. J. Log. Algebraic Methods Program. 87: 94-109 (2017) - [c28]Bartek Klin, Mateusz Lelyk:
Modal mu-Calculus with Atoms. CSL 2017: 30:1-30:21 - [c27]Nathanaël Fijalkow, Bartek Klin, Prakash Panangaden:
Expressiveness of Probabilistic Modal Logics, Revisited. ICALP 2017: 105:1-105:12 - [c26]Joshua Moerman, Matteo Sammartino, Alexandra Silva, Bartek Klin, Michal Szynwelski:
Learning nominal automata. POPL 2017: 613-625 - 2016
- [j9]Bartek Klin, Jurriaan Rot:
Coalgebraic trace semantics via forgetful logics. Log. Methods Comput. Sci. 12(4) (2016) - [c25]Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Homomorphism Problems for First-Order Definable Structures. FSTTCS 2016: 14:1-14:15 - [c24]Bartek Klin, Michal Szynwelski:
SMT Solving for Functional Programming over Infinite Structures. MSFP 2016: 57-75 - [i2]Joshua Moerman, Matteo Sammartino, Alexandra Silva, Bartek Klin, Michal Szynwelski:
Learning Nominal Automata. CoRR abs/1607.06268 (2016) - 2015
- [c23]Bartek Klin, Beata Nachyla:
Presenting Morphisms of Distributive Laws. CALCO 2015: 190-204 - [c22]Bartek Klin, Jurriaan Rot:
Coalgebraic Trace Semantics via Forgetful Logics. FoSSaCS 2015: 151-166 - [c21]Bartek Klin, Eryk Kopczynski, Joanna Ochremiak, Szymon Torunczyk:
Locally Finite Constraint Satisfaction Problems. LICS 2015: 475-486 - 2014
- [j8]Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota:
Automata theory in nominal sets. Log. Methods Comput. Sci. 10(3) (2014) - [c20]Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. CSL-LICS 2014: 58:1-58:10 - [c19]Bartek Klin, Beata Nachyla:
Distributive Laws and Decidable Properties of SOS Specifications. EXPRESS/SOS 2014: 79-93 - 2013
- [j7]Bartek Klin, Vladimiro Sassone:
Structural operational semantics for stochastic and weighted transition systems. Inf. Comput. 227: 58-83 (2013) - [c18]Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota, Szymon Torunczyk:
Turing Machines with Atoms. LICS 2013: 183-192 - [i1]Mikolaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts:
Nominal Computation Theory (Dagstuhl Seminar 13422). Dagstuhl Reports 3(10): 58-71 (2013) - 2012
- [j6]Filippo Bonchi, Sibylle B. Fröschle, Daniele Gorla, Bartek Klin:
Preface to special issue: EXPRESS, ICE and SOS 2009. Math. Struct. Comput. Sci. 22(2): 123-124 (2012) - [c17]Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, Slawomir Lasota:
Towards nominal computation. POPL 2012: 401-412 - 2011
- [j5]Helle Hvid Hansen, Bartek Klin:
Pointwise extensions of GSOS-defined operations. Math. Struct. Comput. Sci. 21(2): 321-361 (2011) - [j4]Bartek Klin:
Bialgebras for structural operational semantics: An introduction. Theor. Comput. Sci. 412(38): 5043-5069 (2011) - [c16]Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota:
Automata with Group Actions. LICS 2011: 355-364 - [e3]Andrea Corradini, Bartek Klin, Corina Cîrstea:
Algebra and Coalgebra in Computer Science - 4th International Conference, CALCO 2011, Winchester, UK, August 30 - September 2, 2011. Proceedings. Lecture Notes in Computer Science 6859, Springer 2011, ISBN 978-3-642-22943-5 [contents] - 2010
- [c15]Bartek Klin:
Structural Operational Semantics and Modal Logic, Revisited. CMCS@ETAPS 2010: 155-175
2000 – 2009
- 2009
- [j3]Bartek Klin:
Bialgebraic methods and modal logic in structural operational semantics. Inf. Comput. 207(2): 237-257 (2009) - [c14]Bartek Klin:
Structural Operational Semantics for Weighted Transition Systems. Semantics and Algebraic Specification 2009: 121-139 - [e2]Matthew Hennessy, Bartek Klin:
Proceedings of the Fifth Workshop on Structural Operational Semantics, SOS@ICALP 2008, Reykjavik, Iceland, July 6, 2008. Electronic Notes in Theoretical Computer Science 229(4), Elsevier 2009 [contents] - [e1]Bartek Klin, Pawel Sobocinski:
Proceedings Sixth Workshop on Structural Operational Semantics, SOS 2009, Bologna, Italy, August 31, 2009. EPTCS 18, 2009 [contents] - 2008
- [c13]Bartek Klin, Vladimiro Sassone:
Structural Operational Semantics for Stochastic Process Calculi. FoSSaCS 2008: 428-442 - [c12]Matthew Hennessy, Bartek Klin:
Preface. SOS@ICALP 2008: 1-2 - 2007
- [c11]Bartek Klin:
Bialgebraic Operational Semantics and Modal Logic. LICS 2007: 336-345 - [c10]Bartek Klin:
Coalgebraic Modal Logic Beyond Sets. MFPS 2007: 177-201 - 2006
- [c9]Bartek Klin:
Bialgebraic Methods in Structural Operational Semantics: Invited Talk. SOS@CONCUR 2006: 33-43 - 2005
- [j2]Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin, Piotr Hoffman:
Amalgamation in the semantics of CASL. Theor. Comput. Sci. 331(1): 215-247 (2005) - [c8]Bartek Klin, Vladimiro Sassone, Pawel Sobocinski:
Labels from Reductions: Towards a General Theory. CALCO 2005: 30-50 - [c7]Bartek Klin:
The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic. CALCO 2005: 247-262 - 2004
- [j1]Bartek Klin:
Adding recursive constructs to bialgebraic semantics. J. Log. Algebraic Methods Program. 60-61: 259-286 (2004) - [c6]Bartek Klin:
From Bialgebraic Semantics to Congruence Formats. SOS@CONCUR 2004: 3-37 - [c5]Bartek Klin:
A Coalgebraic Approach to Process Equivalence and a Coinduction Principle for Traces. CMCS 2004: 201-218 - 2003
- [c4]Bartek Klin, Pawel Sobocinski:
Syntactic Formats for Free. CONCUR 2003: 72-86 - 2001
- [c3]Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin, Piotr Hoffman:
Semantics of Architectural Specifications in CASL. FASE 2001: 253-268 - [c2]Bartek Klin, Piotr Hoffman, Andrzej Tarlecki, Lutz Schröder, Till Mossakowski:
Checking Amalgamability Conditions for C ASL Architectural Specifications. MFCS 2001: 451-463 - [c1]Till Mossakowski, Bartek Klin:
Institution Independent Static Analysis for CASL. WADT 2001: 221-237
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
