default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID37th FSTTCS 2017: Kanpur, India
- Satya V. Lokam, R. Ramanujam:
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India. LIPIcs 93, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-055-2 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:x
- Edith Elkind:
Justified Representation in Multiwinner Voting: Axioms and Algorithms. 1:1-1:10 - Prateek Jain, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, Venkata Krishna Pillutla, Aaron Sidford:
A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares). 2:1-2:10 - Anca Muscholl:
Automated Synthesis: a Distributed Viewpoint. 3:1-3:5 - Devavrat Shah:
Matrix Estimation, Latent Variable Model and Collaborative Filtering. 4:1-4:8 - Vinod Vaikuntanathan:
Some Open Problems in Information-Theoretic Cryptography. 5:1-5:7 - Thomas Wilke:
Backward Deterministic Büchi Automata on Infinite Words. 6:6-6:9 - Luca Aceto, Antonis Achilleos
, Adrian Francalanza, Anna Ingólfsdóttir:
Monitoring for Silent Actions. 7:1-7:14 - Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath:
Maintaining Reeb Graphs of Triangulated 2-Manifolds. 8:1-8:14 - Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan:
On the Parameterized Complexity of Simultaneous Deletion Problems. 9:1-9:14 - Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. 10:1-10:13 - Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
Verification of Asynchronous Programs with Nested Locks. 11:1-11:14 - Bartosz Bednarczyk, Witold Charatonik:
Modulo Counting on Words and Trees. 12:1-12:16 - Béatrice Bérard, Serge Haddad, Engel Lefaucheux:
Probabilistic Disclosure: Maximisation vs. Minimisation. 13:1-13:14 - Olaf Beyersdorff, Luke Hinde, Ján Pich:
Reasons for Hardness in QBF Proof Systems. 14:1-14:15 - Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari:
An Improved Dictatorship Test with Perfect Completeness. 15:1-15:23 - Michael Blondin, Alain Finkel, Jean Goubault-Larrecq:
Forward Analysis for WSTS, Part III: Karp-Miller Trees. 16:1-16:15 - Udi Boker:
Rabin vs. Streett Automata. 17:1-17:15 - Udi Boker, Orna Kupferman, Michal Skrzypczak:
How Deterministic are Good-For-Games Automata?. 18:1-18:14 - Florian Brandl, Telikepalli Kavitha:
Popular Matchings with Multiple Partners. 19:1-19:15 - Joseph Boninger, Joshua Brody, Owen Kephart:
Non-Adaptive Data Structure Bounds for Dynamic Predecessor. 20:1-20:12 - Onur Cagirici, Petr Hlinený, Bodhayan Roy:
On Colourability of Polygon Visibility Graphs. 21:1-21:14 - Yixin Cao, Yuping Ke, Yota Otachi, Jie You:
Vertex Deletion Problems on Chordal Graphs. 22:1-22:14 - Arkadev Chattopadhyay, Nikhil S. Mande:
A Lifting Theorem with Applications to Symmetric Functions. 23:1-23:14 - Joel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka:
Local Patterns. 24:1-24:14 - Stéphane Demri, Étienne Lozes, Denis Lugiez:
On Symbolic Heaps Modulo Permission Theories. 25:1-25:14 - Rüdiger Ehlers, Bernd Finkbeiner:
Symmetric Synthesis. 26:1-26:13 - Alina Ene, Viswanath Nagarajan, Rishi Saket:
Approximation Algorithms for Stochastic k-TSP. 27:27-27:14 - Bernd Finkbeiner, Paul Gölz:
Synthesis in Distributed Environments. 28:1-28:14 - Apoorv Garg, Abhiram G. Ranade:
Train Scheduling on a Unidirectional Path. 29:1-29:14 - Hugo Gimbert:
On the Control of Asynchronous Automata. 30:1-30:15 - Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Streaming for Aibohphobes: Longest Palindrome with Mismatches. 31:1-31:13 - Guru Guruganesh, Euiwoong Lee:
Understanding the Correlation Gap For Matchings. 32:1-32:15 - Venkatesan Guruswami, Rishi Saket:
Hardness of Rainbow Coloring Hypergraphs. 33:33-33:15 - Yi Huang, Mano Vikash Janardhanan, Lev Reyzin:
Network Construction with Ordered Constraints. 34:34-34:13 - Dileep Kini, Mahesh Viswanathan:
Complexity of Model Checking MDPs against LTL Specifications. 35:1-35:13 - Andreas Krebs, Nutan Limaye, Michael Ludwig:
A Unified Method for Placing Problems in Polylogarithmic Depth. 36:36-36:15 - Akash Kumar, Anand Louis, Madhur Tulsiani:
Finding Pseudorandom Colorings of Pseudorandom Graphs. 37:1-37:12 - Orna Kupferman, Gal Vardi, Moshe Y. Vardi:
Flow Games. 38:38-38:16 - Victor Lagerkvist, Biman Roy:
A Dichotomy Theorem for the Inverse Satisfiability Problem. 39:39-39:14 - Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Balanced Judicious Bipartition is Fixed-Parameter Tractable. 40:40-40:15 - Kuldeep S. Meel, Aditya A. Shrotri, Moshe Y. Vardi:
On Hashing-Based Approaches to Approximate DNF-Counting. 41:1-41:14 - Jakub Michaliszyn, Jan Otop:
Average Stack Cost of Büchi Pushdown Automata. 42:1-42:13 - Jakub Michaliszyn, Jan Otop, Piotr Wieczorek:
Querying Best Paths in Graph Databases. 43:1-43:15 - Meghana Nasre, Prajakta Nimbhorkar:
Popular Matchings with Lower Quotas. 44:1-44:15 - Pawel Parys:
The Complexity of the Diagonal Problem for Recursion Schemes. 45:1-45:14 - Bharatram Rangarajan:
A Combinatorial Proof of Ihara-Bass's Formula for the Zeta Function of Regular Graphs. 46:46-46:13 - Alexander Weinert:
VLDL Satisfiability and Model Checking via Tree Automata. 47:47-47:13
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.
last updated on 2025-10-31 21:53 CET 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:
