Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Boja{\'n}czyk, Miko{\l}aj"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the decidability of MSO+U on infinite trees
Mikoƚaj Bojańczyk
,
Tomasz Gogacz
,
Henryk Michalewski
,
Michaƚ Skrzypczak
Lecture Notes in Computer Science
8573
, 2014, pp. 50-61
Transducers with origin information
Mikoƚaj Bojańczyk
Lecture Notes in Computer Science
8573
, 2014, pp. 26-37
Weak MSO+U with path quantifiers over infinite trees
Mikoƚaj Bojańczyk
Lecture Notes in Computer Science
8573
, 2014, pp. 38-49
Solutions in XML data exchange
Mikoƚaj Bojańczyk
,
Leszek A. Koƚodziejczyk
,
Filip Murlak
Journal of Computer and System Sciences
79
(6), 2013, pp. 785-815
Nominal monoids
Mikoƚaj Bojańczyk
Theory of Computing Systems
53
(2), 2013, pp. 194-222
Finite satisfiability for guarded fixpoint logic
Vince Bárány
,
Mikoƚaj Bojańczyk
Information Processing Letters
112
(10), 2012, pp. 371-375
A machine-independent characterization of timed languages
Mikoƚaj Bojańczyk
,
Sƚawomir Lasota
Lecture Notes in Computer Science
7392
, 2012, pp. 92-103
Regular languages of infinite trees that are Boolean combinations of open sets
Mikoƚaj Bojańczyk
,
Thomas Place
Lecture Notes in Computer Science
7392
, 2012, pp. 104-115
Toward model theory with data values
Mikoƚaj Bojańczyk
,
Thomas Place
Lecture Notes in Computer Science
7392
, 2012, pp. 116-127
Weak MSO+U over infinite trees
Mikoƚaj Bojańczyk
,
Szymon Toruńczyk
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 648-660
Infinite sets that are finite up to permutations
Mikoƚaj Bojańczyk
Lecture Notes in Computer Science
7353
, 2012, pp. XV-XVI
XPath evaluation in linear time
Mikoƚaj Bojańczyk
,
Paweƚ Parys
Journal of the ACM
58
(4), 2011, pp. 17: 1-33
Weak MSO with the unbounding quantifier
Mikoƚaj Bojańczyk
Theory of Computing Systems
48
(3), 2011, pp. 554-576
Efficient evaluation of nondeterministic automata using factorization forests
Mikoƚaj Bojańczyk
,
Paweƚ Parys
Lecture Notes in Computer Science
6198
, 2010, pp. 515-526
Beyond
\omega
-regular languages
Mikoƚaj Bojańczyk
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 11-16
Deterministic automata and extensions of weak MSO
Mikoƚaj Bojańczyk
,
Szymon Toruńczyk
Leibniz International Proceedings in Informatics (LIPIcs)
4
, 2009, pp. 73-84
Weak MSO with the unbounding quantifier
Mikoƚaj Bojańczyk
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 159-170
Tree-walking automata do not recognize all regular languages
Mikoƚaj Bojańczyk
,
Thomas Colcombet
SIAM Journal on Computing
38
(2), 2008, pp. 658-701
Tree languages defined in first-order logic with one quantifier alternation
Mikoƚaj Bojańczyk
,
Luc Segoufin
Lecture Notes in Computer Science
5126
, 2008, pp. 233-245
Bounded depth data trees
Henrik Björklund
,
Mikoƚaj Bojańczyk
Lecture Notes in Computer Science
4596
, 2007, pp. 862-874
Shuffle expressions and words with nested data
Henrik Björklund
,
Mikoƚaj Bojańczyk
Lecture Notes in Computer Science
4708
, 2007, pp. 750-761
Reachability in unions of commutative rewriting systems is decidable
Mikoƚaj Bojańczyk
,
Piotr Hoffman
Lecture Notes in Computer Science
4393
, 2007, pp. 622-633
A new algorithm for testing if a regular language is locally threshold testable
Mikoƚaj Bojańczyk
Information Processing Letters
104
(3), 2007, pp. 91-94
Tree-walking automata cannot be determinized
Mikoƚaj Bojańczyk
,
Thomas Colcombet
Theoretical Computer Science
350
(2-3), 2006, pp. 164-173
Expressive power of pebble automata
Mikoƚaj Bojańczyk
,
Mathias Samuelides
,
Thomas Schwentick
,
Luc Segoufin
Lecture Notes in Computer Science
4051
, 2006, pp. 157-168
Seiten 1
2
>