default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36th FSTTCS 2016: Chennai, India
- Akash Lal, S. Akshay, Saket Saurabh, Sandeep Sen:
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, Chennai, India, December 13-15, 2016. LIPIcs 65, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-027-9 - Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers. 0:i-0:xiv
- Mikkel Thorup
:
Fast and Powerful Hashing Using Tabulation (Invited Talk). 1:1-1:2 - Mooly Sagiv:
Simple Invariants for Proving the Safety of Distributed Protocols (Invited Talk). 2:1-2:1 - Holger Hermanns:
My O Is Bigger Than Yours (Invited Talk). 3:1-3:2 - Aleksander Madry:
Continuous Optimization: The "Right" Language for Graph Algorithms? (Invited Talk). 4:1-4:2 - Fedor V. Fomin:
Graph Decompositions and Algorithms (Invited Talk). 5:1-5:1 - Tevfik Bultan:
Side Channel Analysis Using a Model Counting Constraint Solver and Symbolic Execution (Invited Talk). 6:1-6:2 - Sanjoy K. Baruah, Arvind Easwaran, Zhishan Guo:
Mixed-Criticality Scheduling to Minimize Makespan. 7:1-7:13 - Aounon Kumar:
Capacitated k-Center Problem with Vertex Weights. 8:1-8:14 - Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan:
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. 9:1-9:14 - Amit Deshpande, Prahladh Harsha, Rakesh Venkat:
Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1. 10:1-10:13 - Anindya Banerjee, David A. Naumann, Mohammad Nikouei:
Relational Logic with Framing and Hypotheses. 11:1-11:16 - Vrunda Dave, Shankara Narayanan Krishna, Ashutosh Trivedi:
FO-Definable Transformations of Infinite Strings. 12:1-12:14 - Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
Aperiodicity of Rational Functions Is PSPACE-Complete. 13:1-13:15 - Bartek Klin, Slawomir Lasota, Joanna Ochremiak, Szymon Torunczyk:
Homomorphism Problems for First-Order Definable Structures. 14:1-14:15 - Karthik C. S., Sébastien Tavenas:
On the Sensitivity Conjecture for Disjunctive Normal Forms. 15:1-15:15 - Jaikumar Radhakrishnan, Swagato Sanyal:
The Zero-Error Randomized Query Complexity of the Pointer Function. 16:1-16:13 - Prahladh Harsha, Srikanth Srinivasan:
Robust Multiplication-Based Tests for Reed-Muller Codes. 17:1-17:14 - Moses Ganardi, Danny Hucke, Markus Lohrey:
Querying Regular Languages over Sliding Windows. 18:1-18:14 - Xuan Bach Le, Aquinas Hobor, Anthony W. Lin:
Decidability and Complexity of Tree Share Formulas. 19:1-19:14 - Benedikt Bollig:
One-Counter Automata with Counter Observability. 20:1-20:14 - Ashutosh Rai, M. S. Ramanujan:
Strong Parameterized Deletion: Bipartite Graphs. 21:1-21:14 - Fahad Panolan, Meirav Zehavi:
Parameterized Algorithms for List K-Cycle. 22:1-22:15 - R. Krithika, Pranabendu Misra, Ashutosh Rai, Prafullkumar Tale:
Lossy Kernels for Graph Contraction Problems. 23:1-23:14 - Mithilesh Kumar, Daniel Lokshtanov:
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments. 24:1-24:15 - Kim G. Larsen, Radu Mardare, Bingtian Xue:
Probabilistic Mu-Calculus: Decidability and Complete Axiomatization. 25:1-25:18 - Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison. 26:1-26:14 - Javier Esparza, Pierre Ganty, Jérôme Leroux, Rupak Majumdar:
Model Checking Population Protocols. 27:1-27:14 - Alexander Weinert, Martin Zimmermann:
Visibly Linear Dynamic Logic. 28:1-28:14 - Sushmita Gupta, Sanjukta Roy:
Stable Matching Games: Manipulation via Subgraph Isomorphism. 29:1-29:14 - Umang Bhaskar, Ajil Jalal, Rahul Vaze:
The Adwords Problem with Strict Capacity Constraints. 30:1-30:14 - Nirman Kumar, Benjamin Raichel, Subhash Suri, Kevin Verbeek:
Most Likely Voronoi Diagrams in Higher Dimensions. 31:1-31:14 - Aritra Banik, Fahad Panolan, Venkatesh Raman, Vibha Sahlot:
Fréchet Distance Between a Line and Avatar Point Set. 32:1-32:14 - Ankit Chauhan, Tobias Friedrich, Ralf Rothenberger:
Greed is Good for Deterministic Scale-Free Networks. 33:1-33:15 - Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee:
Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. 34:1-34:15 - Pawel Gawrychowski, Artur Jez:
LZ77 Factorisation of Trees. 35:1-35:15 - Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz:
Finger Search in Grammar-Compressed Strings. 36:1-36:16 - Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension. 37:1-37:14 - Mrinal Kumar, Ramprasad Saptharishi:
Finer Separations Between Shallow Arithmetic Circuits. 38:1-38:12 - Ramya C., B. V. Raghavendra Rao:
Sum of Products of Read-Once Formulas. 39:1-39:15 - Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Understanding Cutting Planes for QBFs. 40:1-40:15 - Lukás Holík, Roland Meyer, Sebastian Muskalla:
Summaries for Context-Free Games. 41:1-41:16 - Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur:
Admissibility in Quantitative Graph Games. 42:1-42:14 - Felix Klein, Martin Zimmermann:
Prompt Delay. 43:1-43:14 - Shibashis Guha, Marcin Jurdzinski, Shankara Narayanan Krishna, Ashutosh Trivedi:
Mean-Payoff Games on Timed Automata. 44:1-44:14 - Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
The Power and Limitations of Uniform Samples in Testing Properties of Figures. 45:1-45:14 - Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu:
Local Testing for Membership in Lattices. 46:1-46:14 - Sriram V. Pemmaraju, Vivek B. Sardeshmukh:
Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages. 47:1-47:15 - Frédéric Herbreteau, B. Srivathsan, Thanh-Tung Tran, Igor Walukiewicz:
Why Liveness for Timed Automata Is Hard, and What We Can Do About It. 48:1-48:14 - Maximilian P. L. Haslbeck, Tobias Nipkow:
Verified Analysis of List Update Algorithms. 49:1-49:15 - Jaroslav Bendík, Nikola Benes, Ivana Cerná, Jiri Barnat:
Tunable Online MUS/MSS Enumeration. 50:1-50: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 2026-03-20 23:52 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:
