Travelled to:1 × Austria
1 × Denmark
1 × Finland
1 × France
1 × Germany
1 × Greece
1 × Hungary
1 × Iceland
1 × Portugal
1 × Switzerland
2 × Canada
2 × Italy
2 × Japan
2 × Spain
3 × Poland
4 × United Kingdom
8 × USA
Collaborated with:∅ S.Lasota L.Segoufin T.Colcombet T.Place P.Parys B.Klin H.Straubing T.Schwentick S.Torunczyk D.Figueira H.Björklund A.Muscholl C.David F.Murlak A.Witkowski C.Dittmann S.Kreutzer I.Walukiewicz T.Gogacz H.Michalewski M.Skrzypczak L.Braud M.Samuelides
Talks about:tree (15) automata (10) languag (7) logic (7) data (7) two (5) forest (4) bound (4) quantifi (3) regular (3)
Person: Mikolaj Bojanczyk
DBLP: Bojanczyk:Mikolaj
Contributed to:
2015
2015
2015201420142013
20132012
20122011201120102010
2010
200920092009
20082008
200820082008200720072007200620062006
20052004200420022001Wrote 39 papers:
- DLT-2015-Bojanczyk #monad
- Recognisable Languages over Monads (MB), pp. 1–13.
- ICALP-v2-2015-BojanczykMW #bound #clique #datalog #monad #source code
- Containment of Monadic Datalog Programs via Bounded Clique-Width (MB, FM, AW), pp. 427–439.
- LICS-2015-Bojanczyk #game studies
- Star Height via Games (MB), pp. 214–219.
- ICALP-v2-2014-Bojanczyk #transducer
- Transducers with Origin Information (MB), pp. 26–37.
- ICALP-v2-2014-Bojanczyk14a #infinity #quantifier
- Weak MSO+U with Path Quantifiers over Infinite Trees (MB), pp. 38–49.
- ICALP-v2-2014-BojanczykGMS #decidability #infinity #on the
- On the Decidability of MSO+U on Infinite Trees (MB, TG, HM, MS), pp. 50–61.
- LICS-CSL-2014-BojanczykDK #calculus #composition #model checking #theorem #μ-calculus
- Decomposition theorems and model-checking for the modal μ-calculus (MB, CD, SK), p. 10.
- LICS-2013-BojanczykKLT #turing machine
- Turing Machines with Atoms (MB, BK, SL, ST), pp. 183–192.
- PODS-2013-BojanczykST #verification
- Verification of database-driven systems via amalgamation (MB, LS, ST), pp. 63–74.
- ICALP-v2-2012-BojanczykL #independence
- A Machine-Independent Characterization of Timed Languages (MB, SL), pp. 92–103.
- ICALP-v2-2012-BojanczykP #infinity #regular expression #set
- Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (MB, TP), pp. 104–115.
- ICALP-v2-2012-BojanczykP12a #towards
- Toward Model Theory with Data Values (MB, TP), pp. 116–127.
- POPL-2012-BojanczykBKL #towards
- Towards nominal computation (MB, LB, BK, SL), pp. 401–412.
- LICS-2011-BojanczykKL #automaton
- Automata with Group Actions (MB, BK, SL), pp. 355–364.
- PODS-2011-BojanczykF #documentation #evaluation #logic #performance #xml
- Efficient evaluation for a temporal logic on changing XML documents (MB, DF), pp. 259–270.
- ICALP-v1-2010-BojanczykP #automaton #evaluation #nondeterminism #performance #using
- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests (MB, PP), pp. 515–526.
- LICS-2010-BojanczykL #automaton #xpath
- An Extension of Data Automata that Captures XPath (MB, SL), pp. 243–252.
- RTA-2010-Bojanczyk #automaton #word
- Automata for Data Words and Data Trees (MB), pp. 1–4.
- CSL-2009-Bojanczyk #algebra
- Algebra for Tree Languages (MB), p. 1.
- DLT-2009-Bojanczyk
- Factorization Forests (MB), pp. 1–17.
- LICS-2009-BojanczykSW #algebra #logic
- Wreath Products of Forest Algebras, with Applications to Tree Logics (MB, HS, IW), pp. 255–263.
- FoSSaCS-2008-Bojanczyk #ltl
- The Common Fragment of ACTL and LTL (MB), pp. 172–185.
- ICALP-B-2008-BojanczykS #first-order #logic #quantifier
- Tree Languages Defined in First-Order Logic with One Quantifier Alternation (MB, LS), pp. 233–245.
- LATA-2008-Bojanczyk #automaton
- Tree-Walking Automata (MB), pp. 1–2.
- LICS-2008-BojanczykSS
- Piecewise Testable Tree Languages (MB, LS, HS), pp. 442–451.
- PODS-2008-BojanczykP #evaluation #linear #xpath
- XPath evaluation in linear time (MB, PP), pp. 241–250.
- PODS-2008-Bojanzyk #effectiveness #logic
- Effective characterizations of tree logics (MB), pp. 53–66.
- CSL-2007-Bojanczyk
- Forest Expressions (MB), pp. 146–160.
- ICALP-2007-BjorklundB #bound
- Bounded Depth Data Trees (HB, MB), pp. 862–874.
- LICS-2007-Bojanczyk #logic
- Two-way unary temporal logic over trees (MB), pp. 121–130.
- ICALP-v1-2006-BojanczykSSS #automaton #power of
- Expressive Power of Pebble Automata (MB, MS, TS, LS), pp. 157–168.
- LICS-2006-BojanczykC #bound
- Bounds in w-Regularity (MB, TC), pp. 285–296.
- LICS-2006-BojanczykMSSD #logic #word
- Two-Variable Logic on Words with Data (MB, AM, TS, LS, CD), pp. 7–16.
- PODS-2006-BojanczykDMSS #logic #reasoning #xml
- Two-variable logic on data trees and XML reasoning (MB, CD, AM, TS, LS), pp. 10–19.
- STOC-2005-BojanczykC #automaton #regular expression
- Tree-walking automata do not recognize all regular languages (MB, TC), pp. 234–243.
- CSL-2004-Bojanczyk #bound #quantifier
- A Bounding Quantifier (MB), pp. 41–55.
- ICALP-2004-BojanczykC #automaton
- Tree-Walking Automata Cannot Be Determinized (MB, TC), pp. 246–256.
- ICALP-2002-Bojanczyk #automaton #finite #modelling
- Two-Way Alternating Automata and Finite Models (MB), pp. 833–844.
- FoSSaCS-2001-Bojanczyk #automaton #finite #graph #problem
- The Finite Graph Problem for Two-Way Alternating Automata (MB), pp. 88–103.