@incollection{Ambainis/10,
AUTHOR = {Ambainis, Andris},
TITLE = {New developments in quantum algorithms},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {1-11},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/y0j14j2742244r77/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bendich-Edelsbrunner-Kerber-Patel/10,
AUTHOR = {Bendich, Paul and Edelsbrunner, Herbert and Kerber, Michael and Patel, Amit},
TITLE = {Persistent homology under non-uniform error},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {12-23},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/p339818g78168573/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hromkovic-Kralovic-Kralovic/10,
AUTHOR = {Hromkovi{\v{c}}, Juraj and Kr{\'a}lovi{\v{c}}, Rastislav and Kr{\'a}lovi{\v{c}}, Richard},
TITLE = {Information complexity of online problems},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {24-36},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/5821r668k51m403g/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Lokshtanov/10,
AUTHOR = {Lokshtanov, Daniel},
TITLE = {Algorithmic lower bounds for problems on decomposable graphs},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {37-37},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/1n34550432474537/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Mohar/10,
AUTHOR = {Mohar, Bojan},
TITLE = {Do we really understand the crossing numbers?},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {38-41},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/8254198n21r50624/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Akatov-Gottlob/10,
AUTHOR = {Akatov, Dmitri and Gottlob, Georg},
TITLE = {Balanced queries: Divide and conquer},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {42-54},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/r4410516716865rw/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ananichev-Gusev-Volkov/10,
AUTHOR = {Ananichev, Dmitry and Gusev, Vladimir and Volkov, Mikhail},
TITLE = {Slowly synchronizing automata and digraphs},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {55-65},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/a13831257120l5h5/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Babai-Hansen-Podolskii-Sun/10,
AUTHOR = {Babai, L{\'a}szl{\'o} and Hansen, Kristoffer Arnsfelt and Podolskii, Vladimir V. and Sun, Xiaoming},
TITLE = {Weights of exact threshold functions},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {66-77},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/34276g322322124k/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bachrach-Zuckerman-Wooldridge-Rosenschein/10,
AUTHOR = {Bachrach, Yoram and Zuckerman, Michael and Wooldridge, Michael and Rosenschein, Jeffrey S.},
TITLE = {Proof systems and transformation games},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {78-89},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/vgt7j570g0248206/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Baruah-Bonifaci-DAngelo-Li-Marchetti-Spaccamela-Megow-Stougie/10,
AUTHOR = {Baruah, Sanjoy K. and Bonifaci, Vincenzo and D'Angelo, Gianlorenzo and Li, Haohan and Marchetti-Spaccamela, Alberto and Megow, Nicole and Stougie, Leen},
TITLE = {Scheduling real-time mixed-criticality jobs},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {90-101},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/d26262r1l1232078/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Baskar-Ramanujam-Suresh/10,
AUTHOR = {Baskar, A. and Ramanujam, R. and Suresh, S.P.},
TITLE = {A {\sc dexptime}-complete Dolev-Yao theory with distributive encryption},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {102-113},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/6p32w3427j18208q/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Betzler/10,
AUTHOR = {Betzler, Nadja},
TITLE = {On problem kernels for possible winner determination under the $k$-approval protocol},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {114-125},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/60765t126r80j063/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bezakova-Friedlander/10,
AUTHOR = {Bez{\'a}kov{\'a}, Ivona and Friedlander, Adam J.},
TITLE = {Counting minimum $(s, t)$-cuts in weighted planar graphs in polynomial time},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {126-137},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/7xq5w804u544g268/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bilo-Guala-Proietti/10,
AUTHOR = {Bil{\`o}, Davide and Gual{\`a}, Luciano and Proietti, Guido},
TITLE = {Finding best swap edges minimizing the routing cost of a spanning tree},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {138-149},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/h104704m8w778541/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bilo-Guala-Proietti/10a,
AUTHOR = {Bil{\`o}, Davide and Gual{\`a}, Luciano and Proietti, Guido},
TITLE = {Improved approximability and non-approximability results for graph diameter decreasing problems},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {150-161},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/31521823185k1656/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bodirsky-Dalmau-Martin-Pinsker/10,
AUTHOR = {Bodirsky, Manuel and Dalmau, Victor and Martin, Barnaby and Pinsker, Michael},
TITLE = {Distance constraint satisfaction problems},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {162-173},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/u186326t04k1555q/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bodlaender-van_Leeuwen-van_Rooij-Vatshelle/10,
AUTHOR = {Bodlaender, Hans L. and van Leeuwen, Erik Jan and van Rooij, Johan M.M. and Vatshelle, Martin},
TITLE = {Faster algorithms on branch and clique decompositions},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {174-185},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/k320596742178x25/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bollig/10b,
AUTHOR = {Bollig, Beate},
TITLE = {Exponential space complexity for symbolic maximum flow algorithms in 0-1 networks},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {186-197},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/7j3r5671v2736708/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bournez-Graca-Hainry/10,
AUTHOR = {Bournez, Olivier and Gra{\c{c}}a, Daniel S. and Hainry, Emmanuel},
TITLE = {Robust computations with dynamical systems},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {198-208},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/pux2120952u4207t/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Boyer-Theyssier/10,
AUTHOR = {Boyer, Laurent and Theyssier, Guillaume},
TITLE = {On factor universality in symbolic spaces},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {209-220},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/g216p401n30772x6/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bshouty-Mazzawi/10,
AUTHOR = {Bshouty, Nader H. and Mazzawi, Hanna},
TITLE = {Toward a deterministic polynomial time algorithm with optimal additive query complexity},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {221-232},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/qm1404133042r08g/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Carraro-Ehrhard-Salibra/10,
AUTHOR = {Carraro, Alberto and Ehrhard, Thomas and Salibra, Antonino},
TITLE = {Resource combinatory algebras},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {233-245},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/1l8xp8168375356t/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chatterjee-Doyen-Gimbert-Henzinger/10,
AUTHOR = {Chatterjee, Krishnendu and Doyen, Laurent and Gimbert, Hugo and Henzinger, Thomas A.},
TITLE = {Randomness for free},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {246-257},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/r1527q80503uu825/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chatterjee-Doyen-Henzinger/10,
AUTHOR = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A.},
TITLE = {Qualitative analysis of partially-observable Markov decision processes},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {258-269},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/lj60355253280733/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Chatzigiannakis-Michail-Nikolaou-Pavlogiannis-Spirakis/10,
AUTHOR = {Chatzigiannakis, Ioannis and Michail, Othon and Nikolaou, Stavros and Pavlogiannis, Andreas and Spirakis, Paul G.},
TITLE = {All symmetric predicates in $NSPACE(n^2)$ are stably computable by the mediated population protocol model},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {270-281},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/v884330571301300/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Csirik-Epstein-Imreh-Levin/10,
AUTHOR = {Csirik, J{\'a}nos and Epstein, Leah and Imreh, Csan{\'a}d and Levin, Asaf},
TITLE = {Online clustering with variable sized clusters},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {282-293},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/v2083g4k625226n5/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Czyzowicz-Kosowski-Pelc/10,
AUTHOR = {Czyzowicz, Jurek and Kosowski, Adrian and Pelc, Andrzej},
TITLE = {Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {294-305},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/m53468lv674105h4/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Datta-Mahajan-Raghavendra_Rao-Thomas-Vollmer/10,
AUTHOR = {Datta, Samir and Mahajan, Meena and Raghavendra Rao, B.V. and Thomas, Michael and Vollmer, Heribert},
TITLE = {Counting classes and the fine structure between NC$^1$ and L},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {306-317},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/etq4181243g2278w/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{David/10,
AUTHOR = {David, Julien},
TITLE = {The average complexity of Moore's state minimization algorithm is $\mathcal {O} (n\log\log n)$},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {318-329},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/7677w2227nr4w736/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Dereniowski/10,
AUTHOR = {Dereniowski, Dariusz},
TITLE = {Connected searching of weighted trees},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {330-341},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/y6jl4773930pn040/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Filiot-Le_Gall-Raskin/10,
AUTHOR = {Filiot, Emmanuel and Le Gall, Tristan and Raskin, Jean-Fran{\c{c}}ois},
TITLE = {Iterated regret minimization in game graphs},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {342-354},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/873137l04xl02506/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Filiot-Raskin-Reynier-Servais-Talbot/10,
AUTHOR = {Filiot, Emmanuel and Raskin, Jean-Fran{\c{c}}ois and Reynier, Pierre-Alain and Servais, Fr{\'e}d{\'e}ric and Talbot, Jean-Marc},
TITLE = {Properties of visibly pushdown transducers},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {355-367},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/g242512028j1n335/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fiore-Mahmoud/10,
AUTHOR = {Fiore, Marcelo and Mahmoud, Ola},
TITLE = {Second-order algebraic theories},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {368-380},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/rkt0340462757771/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
PCOMMENT = {extended abstract},
}
@incollection{Fontaine-Place/10,
AUTHOR = {Fontaine, Ga{\"e}lle and Place, Thomas},
TITLE = {Frame definability for classes of trees in the $\mu$-calculus},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {381-392},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/1866k80338553m75/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Greiner-Jacob/10a,
AUTHOR = {Greiner, Gero and Jacob, Riko},
TITLE = {Evaluating non-square sparse bilinear forms on multiple vector pairs in the I/O-model},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {393-404},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/a463034k744uj628/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Guillemot-Sikora/10,
AUTHOR = {Guillemot, Sylvain and Sikora, Florian},
TITLE = {Finding and counting vertex-colored subtrees},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {405-416},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/t264xm03w3072411/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{He-Liang-Sarma/10,
AUTHOR = {He, Jing and Liang, Hongyu and Sarma, Jayalal M.N.},
TITLE = {Limiting negations in bounded treewidth and upward planar circuits},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {417-428},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/k780t6l4lx622036/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hummel-Skrzypczak-Torunczyk/10,
AUTHOR = {Hummel, Szczepan and Skrzypczak, Micha{\l} and Toru{\'n}czyk, Szymon},
TITLE = {On the topological complexity of MSO+U and related automata models},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {429-440},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/u5500q617787340m/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Jez-Okhotin/10,
AUTHOR = {Je{\.z}, Artur and Okhotin, Alexander},
TITLE = {Least and greatest solutions of equations over sets of integers},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {441-452},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/40pn542132157149/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kalyanasundaram-Lipton-Regan-Shokrieh/10,
AUTHOR = {Kalyanasundaram, Subrahmanyam and Lipton, Richard J. and Regan, Kenneth W. and Shokrieh, Farbod},
TITLE = {Improved simulation of nondeterministic Turing machines},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {453-464},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/ww14l478816p1752/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kamiyama/10,
AUTHOR = {Kamiyama, Naoyuki},
TITLE = {The prize-collecting edge dominating set problem in trees},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {465-476},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/k43860267p75721t/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Grenet-Koiran-Portier/10,
AUTHOR = {Grenet, Bruno and Koiran, Pascal and Portier, Natacha},
TITLE = {The multivariate resultant is $NP$-hard in any characteristic},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {477-488},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/n2665168431437l6/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kratsch-Marx-Wahlstrom/10,
AUTHOR = {Kratsch, Stefan and Marx, D{\'a}niel and Wahlstr{\"o}m, Magnus},
TITLE = {Parameterized complexity and kernelizability of Max Ones and Exact Ones problems},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {489-500},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/u107q31275181530/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Manabe-Okamoto/10,
AUTHOR = {Manabe, Yoshifumi and Okamoto, Tatsuaki},
TITLE = {Meta-envy-free cake-cutting protocols},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {501-512},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/p26w511604p01173/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Manuel/10,
AUTHOR = {Manuel, Amaldev},
TITLE = {Two variables and two successors},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {513-524},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/y844736537413886/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Manzonetto-Tranquilli/10,
AUTHOR = {Manzonetto, Giulio and Tranquilli, Paolo},
TITLE = {Harnessing ML$^{\mbox{\scriptsize {F}}}$ with the power of system F},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {525-536},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/01h835tk6x776pjm/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Droste-Meinecke/10,
AUTHOR = {Droste, Manfred and Meinecke, Ingmar},
TITLE = {Describing average- and longtime-behavior by weighted MSO logics},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {537-548},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/5003873ww0636024/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Misra-Narayanaswamy-Raman-Shankar/10,
AUTHOR = {Misra, Neeldhara and Narayanaswamy, N.S. and Raman, Venkatesh and Shankar, Bal Sri},
TITLE = {Solving {\sc minones}-2-{\sc sat} as fast as {\sc vertex cover}},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {549-555},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/g3v58211v4268138/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Okhotin/10a,
AUTHOR = {Okhotin, Alexander},
TITLE = {Unambiguous finite automata over a unary alphabet},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {556-567},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/c55674v677835711/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Olschewski-Ummels/10,
AUTHOR = {Olschewski, J{\"o}rg and Ummels, Michael},
TITLE = {The complexity of finding reset words in finite automata},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {568-579},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/h6078777q077x775/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Praveen/10,
AUTHOR = {Praveen, M.},
TITLE = {Does treewidth help in modal satisfiability?},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {580-591},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/a0858n4qm8202w46/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
PCOMMENT = {extended abstract},
}
@incollection{Puchala/10,
AUTHOR = {Puchala, Bernd},
TITLE = {Asynchronous omega-regular games with partial information},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {592-603},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/tn9460077220pj06/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Puchala-Rabinovich/10,
AUTHOR = {Puchala, Bernd and Rabinovich, Roman},
TITLE = {Parity games with partial information played on graphs of bounded complexity},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {604-615},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/k483858321ml1143/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Schnoebelen/10,
AUTHOR = {Schnoebelen, Philippe},
TITLE = {Revisiting Ackermann-hardness for lossy counter machines and Reset Petri nets},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {616-628},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/u4x7462k811u533x/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Strozecki/10,
AUTHOR = {Strozecki, Yann},
TITLE = {Enumeration of the monomials of a polynomial and related complexity classes},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {629-640},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/l70674h277411gwh/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Tazari/10,
AUTHOR = {Tazari, Siamak},
TITLE = {Faster approximation schemes and parameterized algorithms on $H$-minor-free and odd-minor-free graphs},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {641-652},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/p064m01002062350/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Badban-Torabi_Dashti/10,
AUTHOR = {Badban, Bahareh and Torabi Dashti, Mohammad},
TITLE = {Semi-linear Parikh images of regular expressions via reduction},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {653-664},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/y5300w5454654567/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ueno/10,
AUTHOR = {Ueno, Kenya},
TITLE = {Breaking the rectangle bound barrier against formula size lower bounds},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {665-676},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/q088r69j0hu55q33/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Cheng-Yan/10,
AUTHOR = {Cheng, Ho-Lun and Yan, Ke},
TITLE = {Mesh deformation of dynamic smooth manifolds with surface correspondences},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {677-688},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/d535wn72551012h2/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Zimand/10,
AUTHOR = {Zimand, Marius},
TITLE = {Counting dependent and independent strings},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {689-700},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/1246558566718x21/fulltext.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Zimand/10a,
AUTHOR = {Zimand, Marius},
TITLE = {Impossibility of independence amplification in Kolmogorov complexity theory},
BOOKTITLE = {Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS'2010 (Brno, Czech Republic, August 23-27, 2010)},
SERIES = {LNCS},
VOLUME = {6281},
PAGES = {701-712},
YEAR = {2010},
EDITOR = {Hlin{\v{e}}n{\'y}, Petr and Ku{\v{c}}era, Anton{\'{i}}n},
URL = {http://springerlink.metapress.com/content/v4574k17121t25tq/fulltext.pdf" title="Download PDF (212.7 KB)"><span>Download PDF (212.7 KB)</span></a></li> 	</ul></li><li class="primitive primitiveResource Backmatter"><p class="title">Back matter</p><ul class="resources fulltextResources" data-ftxUrl="/content/978-3-642-15154-5/#section=754802"> 		<li><a class="sprite pdf-resource-spritehttp://springerlink.metapress.com/content/978-3-642-15154-5/back-matter.pdf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}