@incollection{Albers/11,
AUTHOR = {Albers, Susanne},
TITLE = {Energy-efficient algorithms},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {1-2},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3338},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Vardi/11,
AUTHOR = {Vardi, Moshe Y.},
TITLE = {Constraints, graphs, algebra, logic, and complexity},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {3-3},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3358},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Sudan/11,
AUTHOR = {Sudan, Madhu},
TITLE = {Physical limits of communication},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {4-5},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3339},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bain-Mitchell-Sharma-Stefan-Zimmerman/11,
AUTHOR = {Bain, Alex and Mitchell, John and Sharma, Rahul and Stefan, Deian and Zimmerman, Joe},
TITLE = {A domain-specific language for computing on encrypted data},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {6-24},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3360},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kolaitis/11,
AUTHOR = {Kolaitis, Phokion G.},
TITLE = {Schema mappings and data examples: Deriving syntax from semantics},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {25-25},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3359},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Vazirani/11,
AUTHOR = {Vazirani, Umesh V.},
TITLE = {Quantum state description complexity},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {26-27},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3340},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Cygan-Grandoni-Leonardi-Mucha-Pilipczuk-Sankowski/11,
AUTHOR = {Cygan, Marek and Grandoni, Fabrizio and Leonardi, Stefano and Mucha, Marcin and Pilipczuk, Marcin and Sankowski, Piotr},
TITLE = {Approximation algorithms for union and intersection covering problems},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {28-40},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3321},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Benabbas-Chan-Georgiou-Magen/11,
AUTHOR = {Benabbas, Siavosh and Chan, Siu On and Georgiou, Konstantinos and Magen, Avner},
TITLE = {Tight gaps for vertex cover in the Sherali-Adams SDP hierarchy},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {41-54},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3329},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Glasser-Reitwiessner-Witek/11,
AUTHOR = {Gla{\ss}er, Christian and Reitwie{\ss}ner, Christian and Witek, Maximilian},
TITLE = {Applications of discrepancy theory in multiobjective approximation},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {55-65},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3323},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kuperberg-Vanden_Boom/11,
AUTHOR = {Kuperberg, Denis and Vanden Boom, Michael},
TITLE = {Quasi-weak cost automata: A new variant of weakness},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {66-77},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3351},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Herbreteau-Kini-Srivathsan-Walukiewicz/11,
AUTHOR = {Herbreteau, Fr{\'e}d{\'e}ric and Kini, Dileep and Srivathsan, B. and Walukiewicz, Igor},
TITLE = {Using non-convex approximations for efficient analysis of timed automata},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {78-89},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3361},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Sankur-Bouyer-Markey/11,
AUTHOR = {Sankur, Ocan and Bouyer, Patricia and Markey, Nicolas},
TITLE = {Shrinking timed automata},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {90-102},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3362},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Fahrenberg-Legay-Thrane/11,
AUTHOR = {Fahrenberg, Uli and Legay, Axel and Thrane, Claus},
TITLE = {The quantitative linear-time-branching-time spectrum},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {103-114},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3332},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Rao-Sarma/11,
AUTHOR = {Rao, B.V. Raghavendra and Sarma, Jayalal M.N.},
TITLE = {Isomorphism testing of read-once functions and polynomials},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {115-126},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3320},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Grenet-Koiran-Portier-Strozecki/11,
AUTHOR = {Grenet, Bruno and Koiran, Pascal and Portier, Natacha and Strozecki, Yann},
TITLE = {The limited power of powering: Polynomial identity testing and a depth-four lower bound for the permanent},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {127-139},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3350},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Darondeau-Demri-Meyer-Morvan/11,
AUTHOR = {Darondeau, Philippe and Demri, St{\'e}phane and Meyer, Roland and Morvan, Christophe},
TITLE = {Petri net reachability graphs: Decidability status of FO properties},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {140-151},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3356},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Atig-Ganty/11,
AUTHOR = {Atig, Mohamed Faouzi and Ganty, Pierre},
TITLE = {Approximating Petri net reachability along context-free traces},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {152-163},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3344},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Fomin-Philip-Villanger/11,
AUTHOR = {Fomin, Fedor V. and Philip, Geevarghese and Villanger, Yngve},
TITLE = {Minimum fill-in of sparse graphs: Kernelization and approximation},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {164-175},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3345},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Adiga-Chandran-Mathew/11,
AUTHOR = {Adiga, Abhijin and Chandran, L. Sunil and Mathew, Rogers},
TITLE = {Cubicity, degeneracy, and crossing number},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {176-190},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3342},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bruggink-Cauderlier-Hulsbusch-Konig/11,
AUTHOR = {Bruggink, H.J. Sander and Cauderlier, Rapha{\"e}l and H{\"u}lsbusch, Mathias and K{\"o}nig, Barbara},
TITLE = {Conditional reactive systems},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {191-203},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3325},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Chevalier-Delaune-Kremer/11,
AUTHOR = {Chevalier, C{\'e}line and Delaune, St{\'e}phanie and Kremer, Steve},
TITLE = {Transforming password protocols to compose},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {204-216},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3327},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Heggernes-van_t_Hof-Lokshtanov-Paul/11,
AUTHOR = {Heggernes, Pinar and van 't Hof, Pim and Lokshtanov, Daniel and Paul, Christophe},
TITLE = {Obtaining a bipartite graph by contracting few edges},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {217-228},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3357},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Crowston-Fellows-Gutin-Jones-Rosamond-Thomasse-Yeo/11,
AUTHOR = {Crowston, Robert and Fellows, Michael and Gutin, Gregory and Jones, Mark and Rosamond, Frances and Thomass{\'e}, St{\'e}phan and Yeo, Anders},
TITLE = {Simultaneously satisfying linear equations over $\mathbb F_2$: MaxLin2 and Max-$r$-lin2 parameterized above average},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {229-240},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3341},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ananth-Nasre-Sarpatwar/11,
AUTHOR = {Ananth, Prabhanjan and Nasre, Meghana and Sarpatwar, Kanthi K.},
TITLE = {Rainbow connectivity: Hardness and tractability},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {241-251},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3353},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Durand-Ebbing-Kontinen-Vollmer/11,
AUTHOR = {Durand, Arnaud and Ebbing, Johannes and Kontinen, Juha and Vollmer, Heribert},
TITLE = {Dependence logic with a majority quantifier},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {252-263},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3346},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Kieronski-Michaliszyn-Otop/11,
AUTHOR = {Kiero{\'n}ski, Emanuel and Michaliszyn, Jakub and Otop, Jan},
TITLE = {Modal logics definable by universal three-variable formulas},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {264-275},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3349},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Goller-Lohrey/11,
AUTHOR = {G{\"o}ller, Stefan and Lohrey, Markus},
TITLE = {The first-order theory of ground tree rewrite graphs},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {276-287},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3322},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Felgenhauer-Zankl-Middeldorp/11,
AUTHOR = {Felgenhauer, Bertram and Zankl, Harald and Middeldorp, Aart},
TITLE = {Layer systems for proving confluence},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {288-299},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3326},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Madry-Panigrahi/11,
AUTHOR = {M{\c{a}}dry, Aleksander and Panigrahi, Debmalya},
TITLE = {The semi-stochastic ski-rental problem},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {300-311},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3330},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Filiot-Gauwin-Reynier-Servais/11,
AUTHOR = {Filiot, Emmanuel and Gauwin, Olivier and Reynier, Pierre-Alain and Servais, Fr{\'e}d{\'e}ric},
TITLE = {Streamability of nested word transductions},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {312-324},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3352},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Gupta-Sabharwal-Sen/11,
AUTHOR = {Gupta, Manoj and Sabharwal, Yogish and Sen, Sandeep},
TITLE = {The update complexity of selection and related problems},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {325-338},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3331},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Cai-Zhang/11,
AUTHOR = {Cai, Yang and Zhang, Ting},
TITLE = {A tight lower bound for Streett complementation},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {339-350},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3347},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Barcelo-Libkin-Reutter/11,
AUTHOR = {Barcel{\'o}, Pablo and Libkin, Leonid and Reutter, Juan L.},
TITLE = {Parameterized regular expressions and their languages},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {351-362},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3333},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Duparc-Facchini-Murlak/11,
AUTHOR = {Duparc, Jacques and Facchini, Alessandro and Murlak, Filip},
TITLE = {Definable operations on weakly recognizable sets of trees},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {363-374},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3336},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bouyer-Brenguier-Markey-Ummels/11,
AUTHOR = {Bouyer, Patricia and Brenguier, Romain and Markey, Nicolas and Ummels, Michael},
TITLE = {Nash equilibria in concurrent games with B{\"{u}}chi objectives},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {375-386},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3334},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Berwanger-Kaiser-Puchala/11,
AUTHOR = {Berwanger, Dietmar and Kaiser, {\L}ukasz and Puchala, Bernd},
TITLE = {A perfect-information construction for coordination in games},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {387-398},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3335},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Fearnley-Rabe-Schewe-Zhang/11,
AUTHOR = {Fearnley, John and Rabe, Markus and Schewe, Sven and Zhang, Lijun},
TITLE = {Efficient approximation of optimal control for continuous-time Markov games},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {399-410},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3354},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Bertrand-Genest/11,
AUTHOR = {Bertrand, Nathalie and Genest, Blaise},
TITLE = {Minimal disclosure in partially observable Markov decision processes},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {411-422},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3328},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Ben-Kiki-Bille-Breslauer-Gasieniec-Grossi-Weimann/11,
AUTHOR = {Ben-Kiki, Oren and Bille, Philip and Breslauer, Dany and G{\c{a}}sieniec, Leszek and Grossi, Roberto and Weimann, Oren},
TITLE = {Optimal packed string matching},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {423-432},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3355},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Caminiti-Finocchi-Fusco-Silvestri/11,
AUTHOR = {Caminiti, Saverio and Finocchi, Irene and Fusco, Emanuele G. and Silvestri, Francesco},
TITLE = {Dynamic programming in faulty memory hierarchies (cache-obliviously)},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {433-444},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3324},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Fu-Katoen/11,
AUTHOR = {Fu, Hongfei and Katoen, Joost-Pieter},
TITLE = {Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {445-456},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3343},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Hague/11,
AUTHOR = {Hague, Matthew},
TITLE = {Parameterised pushdown systems with non-atomic writes},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {457-468},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3348},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}
@incollection{Caucal-Knapik/11,
AUTHOR = {Caucal, Didier and Knapik, Teodor},
TITLE = {Higher order indexed monadic systems},
BOOKTITLE = {Proceedings of the 31st IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'2011 (Mumbai, India, December 12-14, 2011)},
SERIES = {Leibniz International Proceedings in Informatics (LIPIcs)},
VOLUME = {13},
PAGES = {469-480},
YEAR = {2011},
EDITOR = {Chakraborty, Supratik and Kumar, Amit},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3337},
PUBLISHER = {Dagstuhl Publishing, Saarbr{\"u}cken/Wadern},
}