default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID35th FSTTCS 2015: Bangalore, India
- Prahladh Harsha, G. Ramalingam:
35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2015, December 16-18, 2015, Bangalore, India. LIPIcs 45, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-97-2 - Front Matter, Table of Contents, Preface, Conference Organization. i-xiv
- Moses Samson Charikar
:
Bypassing Worst Case Analysis: Tensor Decomposition and Clustering (Invited Talk). 1 - Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza:
Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk). 2-4 - James Worrell:
Reachability Problems for Continuous Linear Dynamical Systems (Invited Talk). 5-6 - Boaz Barak:
Convexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk). 7-7 - Ankur Moitra:
Beyond Matrix Completion (Invited Talk). 8-8 - Suresh Jagannathan:
Relational Refinement Types for Higher-Order Shape Transformers (Invited Talk). 9-9 - Keshav Goyal, Tobias Mömke:
Robust Reoptimization of Steiner Trees. 10-24 - Anamitra Roy Choudhury, Syamantak Das, Amit Kumar:
Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model. 25-37 - Hal Daumé III, Samir Khuller, Manish Purohit, Gregory Sanders:
On Correcting Inputs: Inverse Optimization for Online Structured Prediction. 38-51 - Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen:
Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches. 52-68 - Patricia Bouyer, Patrick Gardy, Nicolas Markey:
Weighted Strategy Logic with Boolean Goals Over One-Counter Games. 69-83 - Prateek Karandikar, Philippe Schnoebelen:
Decidability in the Logic of Subsequences and Supersequences. 84-97 - Thomas Colcombet, Amaldev Manuel:
Fragments of Fixpoint Logic on Data Words. 98-111 - Lukas Fleischer, Manfred Kufleitner:
Efficient Algorithms for Morphisms over Omega-Regular Languages. 112-124 - Ashish Chiplunkar, Sundar Vishwanathan:
Approximating the Regular Graphic TSP in Near Linear Time. 125-135 - Arindam Khan, Mohit Singh:
On Weighted Bipartite Edge Coloring. 136-150 - Karthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu:
Deciding Orthogonality in Construction-A Lattices. 151-162 - Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
Ordered Tree-Pushdown Systems. 163-177 - Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
One-way Definability of Sweeping Transducer. 178-191 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Roland Meyer, Mehdi Seyed Salehi:
What's Decidable about Availability Languages?. 192-205 - Sagnik Mukhopadhyay, Swagato Sanyal:
Towards Better Separation between Deterministic and Randomized Query Complexity. 206-220 - Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar:
Dimension, Pseudorandomness and Extraction of Pseudorandomness. 221-235 - John M. Hitchcock, Aduri Pavan:
On the NP-Completeness of the Minimum Circuit Size Problem. 236-245 - Nikhil Balaji, Samir Datta, Venkatesh Ganesan:
Counting Euler Tours in Undirected Bounded Treewidth Graphs. 246-260 - Shibashis Guha, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi:
Revisiting Robustness in Priced Timed Games. 261-277 - Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege:
Simple Priced Timed Games are not That Simple. 278-292 - Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault:
Quantitative Games under Failures. 293-306 - Dietmar Berwanger, Marie van den Bogaard:
Games with Delays - A Frankenstein Approach. 307-319 - Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Forbidden Extension Queries. 320-335 - Arijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, Sandeep Sen:
On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model. 336-349 - Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh:
Clustering on Sliding Windows in Polylogarithmic Space. 350-364 - Guy Avni, Orna Kupferman, Tami Tamir:
Congestion Games with Multisets of Resources and Applications in Synthesis. 365-379 - Shaull Almagor, Denis Kuperberg, Orna Kupferman:
The Sensing Cost of Monitoring and Synthesis. 380-393 - David Cachera, Uli Fahrenberg, Axel Legay:
An omega-Algebra for Real-Time Energy Problems. 394-407 - Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov:
Parameterized Complexity of Secluded Connectivity Problems. 408-419 - Sudeshna Kolay, Fahad Panolan:
Parameterized Algorithms for Deletion to (r, ell)-Graphs. 420-433 - Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh:
Finding Even Subgraphs Even Faster. 434-447 - Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge:
The Parameterized Complexity of the Minimum Shared Edges Problem. 448-462 - Daniel J. Fremont, Alexandre Donzé, Sanjit A. Seshia, David Wessel:
Control Improvisation. 463-474 - Chung-Kil Hur, Aditya V. Nori, Sriram K. Rajamani, Selva Samuel:
A Provably Correct Sampler for Probabilistic Programs. 475-488 - Henryk Michalewski, Matteo Mio:
On the Problem of Computing the Probability of Regular Sets of Trees. 489-502 - Thomas Weidner:
Probabilistic Regular Expressions and MSO Logic on Finite Trees. 503-516 - Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Rumors Across Radio, Wireless, Telephone. 517-528 - Magnús M. Halldórsson, Tigran Tonoyan:
The Price of Local Power Control in Wireless Scheduling. 529-542 - Leonard J. Schulman, Vijay V. Vazirani:
Allocation of Divisible Goods Under Lexicographic Preferences. 543-559 - Romain Demangeon, Nobuko Yoshida:
On the Expressiveness of Multiparty Sessions. 560-574 - Vincent Cheval, Véronique Cortier, Eric le Morvan:
Secure Refinements of Communication Channels. 575-589 - David A. Basin, Felix Klaedtke, Eugen Zalinescu:
Failure-aware Runtime Verification of Distributed Systems. 590-603
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-02-08 00:00 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:
