Mikolaj Bojanczyk

	2009
33		Mikolaj Bojanczyk, Tomasz Idziaszek: Algebra for Infinite Forests with an Application to the Temporal Logic EF. CONCUR 2009: 131-145
32		Mikolaj Bojanczyk: Algebra for Tree Languages. CSL 2009: 1
31		Mikolaj Bojanczyk: Factorization Forests. Developments in Language Theory 2009: 1-17
30		Mikolaj Bojanczyk: Weak MSO with the Unbounding Quantifier. STACS 2009: 159-170
29		Mikolaj Bojanczyk: Weak Mso with the Unbounding Quantifier CoRR abs/0902.1042: (2009)
28		Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data trees and XML reasoning. J. ACM 56(3): (2009)
27		Mikolaj Bojanczyk: Two-Way Unary Temporal Logic over Trees Logical Methods in Computer Science 5(3): (2009)
	2008
26		Mikolaj Bojanczyk: The Common Fragment of ACTL and LTL. FoSSaCS 2008: 172-185
25		Mikolaj Bojanczyk, Luc Segoufin: Tree Languages Defined in First-Order Logic with One Quantifier Alternation. ICALP (2) 2008: 233-245
24		Mikolaj Bojanczyk: Tree-Walking Automata. LATA 2008: 1-2
23		Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing: Piecewise Testable Tree Languages. LICS 2008: 442-451
22		Mikolaj Bojanczyk, Pawel Parys: XPath evaluation in linear time. PODS 2008: 241-250
21		Mikolaj Bojanczyk, Thomas Colcombet: Tree-Walking Automata Do Not Recognize All Regular Languages. SIAM J. Comput. 38(2): 658-701 (2008)
	2007
20		Mikolaj Bojanczyk: Forest Expressions. CSL 2007: 146-160
19		Henrik Björklund, Mikolaj Bojanczyk: Bounded Depth Data Trees. ICALP 2007: 862-874
18		Mikolaj Bojanczyk: Two-way unary temporal logic over trees. LICS 2007: 121-130
17		Henrik Björklund, Mikolaj Bojanczyk: Shuffle Expressions and Words with Nested Data. MFCS 2007: 750-761
16		Mikolaj Bojanczyk, Piotr Hoffman: Reachability in Unions of Commutative Rewriting Systems Is Decidable. STACS 2007: 622-633
15		Mikolaj Bojanczyk: A new algorithm for testing if a regular language is locally threshold testable. Inf. Process. Lett. 104(3): 91-94 (2007)
	2006
14		Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin: Expressive Power of Pebble Automata. ICALP (1) 2006: 157-168
13		Mikolaj Bojanczyk, Thomas Colcombet: Bounds in w-Regularity. LICS 2006: 285-296
12		Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin, Claire David: Two-Variable Logic on Words with Data. LICS 2006: 7-16
11		Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin: Two-variable logic on data trees and XML reasoning. PODS 2006: 10-19
10		Mikolaj Bojanczyk, Thomas Colcombet: Tree-walking automata cannot be determinized. Theor. Comput. Sci. 350(2-3): 164-173 (2006)
9		Mikolaj Bojanczyk, Igor Walukiewicz: Characterizing EF and EX tree logics. Theor. Comput. Sci. 358(2-3): 255-272 (2006)
	2005
8		Mikolaj Bojanczyk, Thomas Colcombet: Tree-walking automata do not recognize all regular languages. STOC 2005: 234-243
	2004
7		Mikolaj Bojanczyk, Igor Walukiewicz: Characterizing EF and EX Tree Logics. CONCUR 2004: 131-145
6		Mikolaj Bojanczyk: A Bounding Quantifier. CSL 2004: 41-55
5		Mikolaj Bojanczyk, Thomas Colcombet: Tree-Walking Automata Cannot Be Determinized. ICALP 2004: 246-256
	2003
4		Mikolaj Bojanczyk: 1-Bounded TWA Cannot Be Determinized. FSTTCS 2003: 62-73
3		Mikolaj Bojanczyk: The finite graph problem for two-way alternating automata. Theor. Comput. Sci. 3(298): 511-528 (2003)
	2002
2		Mikolaj Bojanczyk: Two-Way Alternating Automata and Finite Models. ICALP 2002: 833-844
	2001
1		Mikolaj Bojanczyk: The Finite Graph Problem for Two-Way Alternating Automata. FoSSaCS 2001: 88-103

Coauthor Index

1	Henrik Björklund	[17] [19]
2	Thomas Colcombet	[5] [8] [10] [13] [21]
3	Claire David	[11] [12]
4	Piotr Hoffman	[16]
5	Tomasz Idziaszek	[33]
6	Anca Muscholl	[11] [12] [28]
7	Pawel Parys	[22]
8	Mathias Samuelides	[14]
9	Thomas Schwentick	[11] [12] [14] [28]
10	Luc Segoufin	[11] [12] [14] [23] [25] [28]
11	Howard Straubing	[23]
12	Igor Walukiewicz	[7] [9]

Colors in the list of coauthors