default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/fsttcs/fsttcs2011.bht:"
download as .bib file
@inproceedings{DBLP:conf/fsttcs/AdigaCM11,
author = {Abhijin Adiga and
L. Sunil Chandran and
Rogers Mathew},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Cubicity, Degeneracy, and Crossing Number},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {176--190},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.176},
doi = {10.4230/LIPICS.FSTTCS.2011.176},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AdigaCM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Albers11,
author = {Susanne Albers},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Energy-Efficient Algorithms (Invited Talk)},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {1--2},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.1},
doi = {10.4230/LIPICS.FSTTCS.2011.1},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Albers11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AnanthNS11,
author = {Prabhanjan Ananth and
Meghana Nasre and
Kanthi K. Sarpatwar},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Rainbow Connectivity: Hardness and Tractability},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {241--251},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.241},
doi = {10.4230/LIPICS.FSTTCS.2011.241},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/AnanthNS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AtigG11,
author = {Mohamed Faouzi Atig and
Pierre Ganty},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Approximating Petri Net Reachability Along Context-free Traces},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {152--163},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.152},
doi = {10.4230/LIPICS.FSTTCS.2011.152},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AtigG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BainMSSZ11,
author = {Alex Bain and
John C. Mitchell and
Rahul Sharma and
Deian Stefan and
Joe Zimmerman},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {A Domain-Specific Language for Computing on Encrypted Data (Invited
Talk)},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {6--24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.6},
doi = {10.4230/LIPICS.FSTTCS.2011.6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BainMSSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BarceloLR11,
author = {Pablo Barcel{\'{o}} and
Leonid Libkin and
Juan L. Reutter},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Parameterized Regular Expressions and Their Languages},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {351--362},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.351},
doi = {10.4230/LIPICS.FSTTCS.2011.351},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BarceloLR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Ben-KikiBBGGW11,
author = {Oren Ben{-}Kiki and
Philip Bille and
Dany Breslauer and
Leszek Gasieniec and
Roberto Grossi and
Oren Weimann},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Optimal Packed String Matching},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {423--432},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.423},
doi = {10.4230/LIPICS.FSTTCS.2011.423},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/Ben-KikiBBGGW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BenabbasCGM11,
author = {Siavosh Benabbas and
Siu On Chan and
Konstantinos Georgiou and
Avner Magen},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Tight Gaps for Vertex Cover in the Sherali-Adams {SDP} Hierarchy},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {41--54},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.41},
doi = {10.4230/LIPICS.FSTTCS.2011.41},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BenabbasCGM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BertrandG11,
author = {Nathalie Bertrand and
Blaise Genest},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Minimal Disclosure in Partially Observable Markov Decision Processes},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {411--422},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.411},
doi = {10.4230/LIPICS.FSTTCS.2011.411},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BertrandG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BerwangerKP11,
author = {Dietmar Berwanger and
Lukasz Kaiser and
Bernd Puchala},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {A Perfect-Information Construction for Coordination in Games},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {387--398},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.387},
doi = {10.4230/LIPICS.FSTTCS.2011.387},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BerwangerKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BouyerBMU11,
author = {Patricia Bouyer and
Romain Brenguier and
Nicolas Markey and
Michael Ummels},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Nash Equilibria in Concurrent Games with B{\"{u}}chi Objectives},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {375--386},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.375},
doi = {10.4230/LIPICS.FSTTCS.2011.375},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BouyerBMU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BrugginkCHK11,
author = {H. J. Sander Bruggink and
Rapha{\"{e}}l Cauderlier and
Mathias H{\"{u}}lsbusch and
Barbara K{\"{o}}nig},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Conditional Reactive Systems},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {191--203},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.191},
doi = {10.4230/LIPICS.FSTTCS.2011.191},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BrugginkCHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CaiZ11,
author = {Yang Cai and
Ting Zhang},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {A Tight Lower Bound for Streett Complementation},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {339--350},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.339},
doi = {10.4230/LIPICS.FSTTCS.2011.339},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/CaiZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CaminitiFFS11,
author = {Saverio Caminiti and
Irene Finocchi and
Emanuele G. Fusco and
Francesco Silvestri},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Dynamic programming in faulty memory hierarchies (cache-obliviously)},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {433--444},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.433},
doi = {10.4230/LIPICS.FSTTCS.2011.433},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/CaminitiFFS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CaucalK11,
author = {Didier Caucal and
Teodor Knapik},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Higher order indexed monadic systems},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {469--480},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.469},
doi = {10.4230/LIPICS.FSTTCS.2011.469},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/CaucalK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ChakrabortyK11,
author = {Supratik Chakraborty and
Amit Kumar},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Frontmatter, Table of Contents, Preface, Conference Organization,
External Reviewers},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.i},
doi = {10.4230/LIPICS.FSTTCS.2011.I},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/ChakrabortyK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ChevalierDK11,
author = {C{\'{e}}line Chevalier and
St{\'{e}}phanie Delaune and
Steve Kremer},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Transforming Password Protocols to Compose},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {204--216},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.204},
doi = {10.4230/LIPICS.FSTTCS.2011.204},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/ChevalierDK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CrowstonFGJRTY11,
author = {Robert Crowston and
Michael R. Fellows and
Gregory Z. Gutin and
Mark Jones and
Frances A. Rosamond and
St{\'{e}}phan Thomass{\'{e}} and
Anders Yeo},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Simultaneously Satisfying Linear Equations Over F{\_}2: MaxLin2 and
Max-r-Lin2 Parameterized Above Average},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {229--240},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.229},
doi = {10.4230/LIPICS.FSTTCS.2011.229},
timestamp = {Thu, 05 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/CrowstonFGJRTY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CyganGLMPS11,
author = {Marek Cygan and
Fabrizio Grandoni and
Stefano Leonardi and
Marcin Mucha and
Marcin Pilipczuk and
Piotr Sankowski},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Approximation Algorithms for Union and Intersection Covering Problems},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {28--40},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.28},
doi = {10.4230/LIPICS.FSTTCS.2011.28},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/CyganGLMPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DarondeauDMM11,
author = {Philippe Darondeau and
St{\'{e}}phane Demri and
Roland Meyer and
Christophe Morvan},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Petri Net Reachability Graphs: Decidability Status of {FO} Properties},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {140--151},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.140},
doi = {10.4230/LIPICS.FSTTCS.2011.140},
timestamp = {Mon, 02 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/DarondeauDMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DuparcFM11,
author = {Jacques Duparc and
Alessandro Facchini and
Filip Murlak},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Definable Operations On Weakly Recognizable Sets of Trees},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {363--374},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.363},
doi = {10.4230/LIPICS.FSTTCS.2011.363},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/DuparcFM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DurandEKV11,
author = {Arnaud Durand and
Johannes Ebbing and
Juha Kontinen and
Heribert Vollmer},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Dependence logic with a majority quantifier},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {252--263},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.252},
doi = {10.4230/LIPICS.FSTTCS.2011.252},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/DurandEKV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FahrenbergLT11,
author = {Uli Fahrenberg and
Axel Legay and
Claus R. Thrane},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {The Quantitative Linear-Time--Branching-Time Spectrum},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {103--114},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.103},
doi = {10.4230/LIPICS.FSTTCS.2011.103},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/FahrenbergLT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FearnleyRSZ11,
author = {John Fearnley and
Markus N. Rabe and
Sven Schewe and
Lijun Zhang},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Efficient Approximation of Optimal Control for Continuous-Time Markov
Games},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {399--410},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.399},
doi = {10.4230/LIPICS.FSTTCS.2011.399},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/FearnleyRSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FelgenhauerZM11,
author = {Bertram Felgenhauer and
Harald Zankl and
Aart Middeldorp},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Layer Systems for Proving Confluence},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {288--299},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.288},
doi = {10.4230/LIPICS.FSTTCS.2011.288},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/FelgenhauerZM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FiliotGRS11,
author = {Emmanuel Filiot and
Olivier Gauwin and
Pierre{-}Alain Reynier and
Fr{\'{e}}d{\'{e}}ric Servais},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Streamability of Nested Word Transductions},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {312--324},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.312},
doi = {10.4230/LIPICS.FSTTCS.2011.312},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/FiliotGRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FominPV11,
author = {Fedor V. Fomin and
Geevarghese Philip and
Yngve Villanger},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Minimum Fill-in of Sparse Graphs: Kernelization and Approximation},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {164--175},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.164},
doi = {10.4230/LIPICS.FSTTCS.2011.164},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/FominPV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FuK11,
author = {Hongfei Fu and
Joost{-}Pieter Katoen},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Deciding Probabilistic Simulation between Probabilistic Pushdown Automata
and Finite-State Systems},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {445--456},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.445},
doi = {10.4230/LIPICS.FSTTCS.2011.445},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/FuK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GlasserRW11,
author = {Christian Gla{\ss}er and
Christian Reitwie{\ss}ner and
Maximilian Witek},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Applications of Discrepancy Theory in Multiobjective Approximation},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {55--65},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.55},
doi = {10.4230/LIPICS.FSTTCS.2011.55},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GlasserRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GollerL11,
author = {Stefan G{\"{o}}ller and
Markus Lohrey},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {The First-Order Theory of Ground Tree Rewrite Graphs},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {276--287},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.276},
doi = {10.4230/LIPICS.FSTTCS.2011.276},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GollerL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GrenetKPS11,
author = {Bruno Grenet and
Pascal Koiran and
Natacha Portier and
Yann Strozecki},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {The Limited Power of Powering: Polynomial Identity Testing and a Depth-four
Lower Bound for the Permanent},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {127--139},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.127},
doi = {10.4230/LIPICS.FSTTCS.2011.127},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/GrenetKPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GuptaSS11,
author = {Manoj Gupta and
Yogish Sabharwal and
Sandeep Sen},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {The update complexity of selection and related problems},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {325--338},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.325},
doi = {10.4230/LIPICS.FSTTCS.2011.325},
timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GuptaSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Hague11,
author = {Matthew Hague},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Parameterised Pushdown Systems with Non-Atomic Writes},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {457--468},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.457},
doi = {10.4230/LIPICS.FSTTCS.2011.457},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Hague11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HeggernesHLP11,
author = {Pinar Heggernes and
Pim van 't Hof and
Daniel Lokshtanov and
Christophe Paul},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Obtaining a Bipartite Graph by Contracting Few Edges},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {217--228},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.217},
doi = {10.4230/LIPICS.FSTTCS.2011.217},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/HeggernesHLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HerbreteauKSW11,
author = {Fr{\'{e}}d{\'{e}}ric Herbreteau and
Dileep Kini and
B. Srivathsan and
Igor Walukiewicz},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Using non-convex approximations for efficient analysis of timed automata},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {78--89},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.78},
doi = {10.4230/LIPICS.FSTTCS.2011.78},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/HerbreteauKSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KieronskiMO11,
author = {Emanuel Kieronski and
Jakub Michaliszyn and
Jan Otop},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Modal Logics Definable by Universal Three-Variable Formulas},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {264--275},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.264},
doi = {10.4230/LIPICS.FSTTCS.2011.264},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/KieronskiMO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Kolaitis11,
author = {Phokion G. Kolaitis},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Schema Mappings and Data Examples: Deriving Syntax from Semantics
(Invited Talk)},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {25--25},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.25},
doi = {10.4230/LIPICS.FSTTCS.2011.25},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Kolaitis11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KuperbergB11,
author = {Denis Kuperberg and
Michael {Vanden Boom}},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Quasi-Weak Cost Automata: {A} New Variant of Weakness},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {66--77},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.66},
doi = {10.4230/LIPICS.FSTTCS.2011.66},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/KuperbergB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MadryP11,
author = {Aleksander Madry and
Debmalya Panigrahi},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {The Semi-stochastic Ski-rental Problem},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {300--311},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.300},
doi = {10.4230/LIPICS.FSTTCS.2011.300},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/MadryP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/RaoS11,
author = {B. V. Raghavendra Rao and
Jayalal Sarma},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Isomorphism testing of read-once functions and polynomials},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {115--126},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.115},
doi = {10.4230/LIPICS.FSTTCS.2011.115},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/RaoS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/SankurBM11,
author = {Ocan Sankur and
Patricia Bouyer and
Nicolas Markey},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Shrinking Timed Automata},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {90--102},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.90},
doi = {10.4230/LIPICS.FSTTCS.2011.90},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/SankurBM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Sudan11,
author = {Madhu Sudan},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Physical limits of Communication (Invited Talk)},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {4--5},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.4},
doi = {10.4230/LIPICS.FSTTCS.2011.4},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Sudan11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Vardi11,
author = {Moshe Y. Vardi},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Constraints, Graphs, Algebra, Logic, and Complexity (Invited Talk)},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {3--3},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.3},
doi = {10.4230/LIPICS.FSTTCS.2011.3},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Vardi11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Vazirani11,
author = {Umesh V. Vazirani},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Quantum State Description Complexity (Invited Talk)},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {26--27},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.26},
doi = {10.4230/LIPICS.FSTTCS.2011.26},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Vazirani11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/X11,
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Author Index},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.xvi},
doi = {10.4230/LIPICS.FSTTCS.2011.XVI},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/X11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2011,
editor = {Supratik Chakraborty and
Amit Kumar},
title = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {http://drops.dagstuhl.de/portals/extern/index.php?semnr=110010},
isbn = {978-3-939897-34-7},
timestamp = {Wed, 21 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-10-02 03:49 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
