Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/fsttcs/fsttcs2017.bht:"
download as .bib file
@proceedings{DBLP:conf/fsttcs/2017,
editor = {Satya V. Lokam and
R. Ramanujam},
title = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-055-2},
isbn = {978-3-95977-055-2},
timestamp = {Fri, 03 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AcetoAFI17,
author = {Luca Aceto and
Antonis Achilleos and
Adrian Francalanza and
Anna Ing{\'{o}}lfsd{\'{o}}ttir},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Monitoring for Silent Actions},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {7:1--7:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.7},
doi = {10.4230/LIPICS.FSTTCS.2017.7},
timestamp = {Fri, 03 Sep 2021 15:00:19 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AcetoAFI17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AgarwalFN17,
author = {Pankaj K. Agarwal and
Kyle Fox and
Abhinandan Nath},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Maintaining Reeb Graphs of Triangulated 2-Manifolds},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {8:1--8:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.8},
doi = {10.4230/LIPICS.FSTTCS.2017.8},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AgarwalFN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AgrawalKLMR17,
author = {Akanksha Agrawal and
R. Krithika and
Daniel Lokshtanov and
Amer E. Mouawad and
M. S. Ramanujan},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {On the Parameterized Complexity of Simultaneous Deletion Problems},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.9},
doi = {10.4230/LIPICS.FSTTCS.2017.9},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/AgrawalKLMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AnshuGJKLMSS17,
author = {Anurag Anshu and
Dmitry Gavinsky and
Rahul Jain and
Srijita Kundu and
Troy Lee and
Priyanka Mukhopadhyay and
Miklos Santha and
Swagato Sanyal},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {A Composition Theorem for Randomized Query Complexity},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {10:1--10:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.10},
doi = {10.4230/LIPICS.FSTTCS.2017.10},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/AnshuGJKLMSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AtigBKS17,
author = {Mohamed Faouzi Atig and
Ahmed Bouajjani and
K. Narayan Kumar and
Prakash Saivasan},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Verification of Asynchronous Programs with Nested Locks},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {11:1--11:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.11},
doi = {10.4230/LIPICS.FSTTCS.2017.11},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AtigBKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BednarczykC17,
author = {Bartosz Bednarczyk and
Witold Charatonik},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Modulo Counting on Words and Trees},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {12:1--12:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.12},
doi = {10.4230/LIPICS.FSTTCS.2017.12},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BednarczykC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BerardHL17,
author = {B{\'{e}}atrice B{\'{e}}rard and
Serge Haddad and
Engel Lefaucheux},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Probabilistic Disclosure: Maximisation vs. Minimisation},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {13:1--13:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.13},
doi = {10.4230/LIPICS.FSTTCS.2017.13},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BerardHL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BeyersdorffHP17,
author = {Olaf Beyersdorff and
Luke Hinde and
J{\'{a}}n Pich},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Reasons for Hardness in {QBF} Proof Systems},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {14:1--14:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.14},
doi = {10.4230/LIPICS.FSTTCS.2017.14},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BeyersdorffHP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BhangaleKT17,
author = {Amey Bhangale and
Subhash Khot and
Devanathan Thiruvenkatachari},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {An Improved Dictatorship Test with Perfect Completeness},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {15:1--15:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.15},
doi = {10.4230/LIPICS.FSTTCS.2017.15},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BhangaleKT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BlondinFG17,
author = {Michael Blondin and
Alain Finkel and
Jean Goubault{-}Larrecq},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Forward Analysis for WSTS, Part {III:} Karp-Miller Trees},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {16:1--16:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.16},
doi = {10.4230/LIPICS.FSTTCS.2017.16},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BlondinFG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Boker17,
author = {Udi Boker},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Rabin vs. Streett Automata},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {17:1--17:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.17},
doi = {10.4230/LIPICS.FSTTCS.2017.17},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Boker17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BokerKS17,
author = {Udi Boker and
Orna Kupferman and
Michal Skrzypczak},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {How Deterministic are Good-For-Games Automata?},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {18:1--18:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.18},
doi = {10.4230/LIPICS.FSTTCS.2017.18},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BokerKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BoningerBK17,
author = {Joseph Boninger and
Joshua Brody and
Owen Kephart},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Non-Adaptive Data Structure Bounds for Dynamic Predecessor},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {20:1--20:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.20},
doi = {10.4230/LIPICS.FSTTCS.2017.20},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BoningerBK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BrandlK17,
author = {Florian Brandl and
Telikepalli Kavitha},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Popular Matchings with Multiple Partners},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {19:1--19:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.19},
doi = {10.4230/LIPICS.FSTTCS.2017.19},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BrandlK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CagiriciHR17,
author = {Onur Cagirici and
Petr Hlinen{\'{y}} and
Bodhayan Roy},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {On Colourability of Polygon Visibility Graphs},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {21:1--21:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.21},
doi = {10.4230/LIPICS.FSTTCS.2017.21},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/CagiriciHR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CaoKOY17,
author = {Yixin Cao and
Yuping Ke and
Yota Otachi and
Jie You},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Vertex Deletion Problems on Chordal Graphs},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.22},
doi = {10.4230/LIPICS.FSTTCS.2017.22},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/CaoKOY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ChattopadhyayM17,
author = {Arkadev Chattopadhyay and
Nikhil S. Mande},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {A Lifting Theorem with Applications to Symmetric Functions},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {23:1--23:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.23},
doi = {10.4230/LIPICS.FSTTCS.2017.23},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/ChattopadhyayM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DayFMN17,
author = {Joel D. Day and
Pamela Fleischmann and
Florin Manea and
Dirk Nowotka},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Local Patterns},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {24:1--24:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.24},
doi = {10.4230/LIPICS.FSTTCS.2017.24},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/DayFMN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DemriLL17,
author = {St{\'{e}}phane Demri and
{\'{E}}tienne Lozes and
Denis Lugiez},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {On Symbolic Heaps Modulo Permission Theories},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {25:1--25:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.25},
doi = {10.4230/LIPICS.FSTTCS.2017.25},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/DemriLL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/EhlersF17,
author = {R{\"{u}}diger Ehlers and
Bernd Finkbeiner},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Symmetric Synthesis},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {26:1--26:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.26},
doi = {10.4230/LIPICS.FSTTCS.2017.26},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/EhlersF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Elkind17,
author = {Edith Elkind},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Justified Representation in Multiwinner Voting: Axioms and Algorithms},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {1:1--1:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.1},
doi = {10.4230/LIPICS.FSTTCS.2017.1},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Elkind17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/EneNS17,
author = {Alina Ene and
Viswanath Nagarajan and
Rishi Saket},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Approximation Algorithms for Stochastic k-TSP},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {27:27--27:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.27},
doi = {10.4230/LIPICS.FSTTCS.2017.27},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/EneNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FinkbeinerG17,
author = {Bernd Finkbeiner and
Paul G{\"{o}}lz},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Synthesis in Distributed Environments},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {28:1--28:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.28},
doi = {10.4230/LIPICS.FSTTCS.2017.28},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/FinkbeinerG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GargR17,
author = {Apoorv Garg and
Abhiram G. Ranade},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Train Scheduling on a Unidirectional Path},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {29:1--29:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.29},
doi = {10.4230/LIPICS.FSTTCS.2017.29},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/GargR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Gimbert17,
author = {Hugo Gimbert},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {On the Control of Asynchronous Automata},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {30:1--30:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.30},
doi = {10.4230/LIPICS.FSTTCS.2017.30},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Gimbert17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GrigorescuAZ17,
author = {Elena Grigorescu and
Erfan Sadeqi Azer and
Samson Zhou},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Streaming for Aibohphobes: Longest Palindrome with Mismatches},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {31:1--31:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.31},
doi = {10.4230/LIPICS.FSTTCS.2017.31},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GrigorescuAZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GuruganeshL17,
author = {Guru Guruganesh and
Euiwoong Lee},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Understanding the Correlation Gap For Matchings},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {32:1--32:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.32},
doi = {10.4230/LIPICS.FSTTCS.2017.32},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GuruganeshL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GuruswamiS17,
author = {Venkatesan Guruswami and
Rishi Saket},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Hardness of Rainbow Coloring Hypergraphs},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {33:33--33:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.33},
doi = {10.4230/LIPICS.FSTTCS.2017.33},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GuruswamiS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HuangJR17,
author = {Yi Huang and
Mano Vikash Janardhanan and
Lev Reyzin},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Network Construction with Ordered Constraints},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {34:34--34:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.34},
doi = {10.4230/LIPICS.FSTTCS.2017.34},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/HuangJR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/JainKKNPS17,
author = {Prateek Jain and
Sham M. Kakade and
Rahul Kidambi and
Praneeth Netrapalli and
Venkata Krishna Pillutla and
Aaron Sidford},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {A Markov Chain Theory Approach to Characterizing the Minimax Optimality
of Stochastic Gradient Descent (for Least Squares)},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {2:1--2:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.2},
doi = {10.4230/LIPICS.FSTTCS.2017.2},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/JainKKNPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KiniV17,
author = {Dileep Kini and
Mahesh Viswanathan},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Complexity of Model Checking MDPs against {LTL} Specifications},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {35:1--35:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.35},
doi = {10.4230/LIPICS.FSTTCS.2017.35},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/KiniV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KrebsLL17,
author = {Andreas Krebs and
Nutan Limaye and
Michael Ludwig},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {A Unified Method for Placing Problems in Polylogarithmic Depth},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {36:36--36:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.36},
doi = {10.4230/LIPICS.FSTTCS.2017.36},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/KrebsLL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KumarLT17,
author = {Akash Kumar and
Anand Louis and
Madhur Tulsiani},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Finding Pseudorandom Colorings of Pseudorandom Graphs},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {37:1--37:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.37},
doi = {10.4230/LIPICS.FSTTCS.2017.37},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/KumarLT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KupfermanVV17,
author = {Orna Kupferman and
Gal Vardi and
Moshe Y. Vardi},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Flow Games},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {38:38--38:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.38},
doi = {10.4230/LIPICS.FSTTCS.2017.38},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/KupfermanVV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/LagerkvistR17,
author = {Victor Lagerkvist and
Biman Roy},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {A Dichotomy Theorem for the Inverse Satisfiability Problem},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {39:39--39:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.39},
doi = {10.4230/LIPICS.FSTTCS.2017.39},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/LagerkvistR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/LokshtanovSSZ17,
author = {Daniel Lokshtanov and
Saket Saurabh and
Roohani Sharma and
Meirav Zehavi},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Balanced Judicious Bipartition is Fixed-Parameter Tractable},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {40:40--40:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.40},
doi = {10.4230/LIPICS.FSTTCS.2017.40},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/LokshtanovSSZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MeelSV17,
author = {Kuldeep S. Meel and
Aditya A. Shrotri and
Moshe Y. Vardi},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {On Hashing-Based Approaches to Approximate DNF-Counting},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {41:1--41:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.41},
doi = {10.4230/LIPICS.FSTTCS.2017.41},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/MeelSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MichaliszynO17,
author = {Jakub Michaliszyn and
Jan Otop},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Average Stack Cost of B{\"{u}}chi Pushdown Automata},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {42:1--42:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.42},
doi = {10.4230/LIPICS.FSTTCS.2017.42},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/MichaliszynO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MichaliszynOW17,
author = {Jakub Michaliszyn and
Jan Otop and
Piotr Wieczorek},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Querying Best Paths in Graph Databases},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {43:1--43:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.43},
doi = {10.4230/LIPICS.FSTTCS.2017.43},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/MichaliszynOW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Muscholl17,
author = {Anca Muscholl},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Automated Synthesis: a Distributed Viewpoint},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {3:1--3:5},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.3},
doi = {10.4230/LIPICS.FSTTCS.2017.3},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Muscholl17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/NasreN17,
author = {Meghana Nasre and
Prajakta Nimbhorkar},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Popular Matchings with Lower Quotas},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {44:1--44:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.44},
doi = {10.4230/LIPICS.FSTTCS.2017.44},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/NasreN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Parys17,
author = {Pawel Parys},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {The Complexity of the Diagonal Problem for Recursion Schemes},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {45:1--45:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.45},
doi = {10.4230/LIPICS.FSTTCS.2017.45},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Parys17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Rangarajan17,
author = {Bharatram Rangarajan},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {A Combinatorial Proof of Ihara-Bass's Formula for the Zeta Function
of Regular Graphs},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {46:46--46:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.46},
doi = {10.4230/LIPICS.FSTTCS.2017.46},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Rangarajan17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Shah17,
author = {Devavrat Shah},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Matrix Estimation, Latent Variable Model and Collaborative Filtering},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {4:1--4:8},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.4},
doi = {10.4230/LIPICS.FSTTCS.2017.4},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Shah17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Vaikuntanathan17,
author = {Vinod Vaikuntanathan},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Some Open Problems in Information-Theoretic Cryptography},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {5:1--5:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.5},
doi = {10.4230/LIPICS.FSTTCS.2017.5},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Vaikuntanathan17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Weinert17,
author = {Alexander Weinert},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {{VLDL} Satisfiability and Model Checking via Tree Automata},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {47:47--47:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.47},
doi = {10.4230/LIPICS.FSTTCS.2017.47},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Weinert17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Wilke17,
author = {Thomas Wilke},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Backward Deterministic B{\"{u}}chi Automata on Infinite Words},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {6:6--6:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.6},
doi = {10.4230/LIPICS.FSTTCS.2017.6},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Wilke17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/X17,
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {0:i--0:x},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.0},
doi = {10.4230/LIPICS.FSTTCS.2017.0},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/X17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-06-11 03:45 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:
