default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd FSTTCS 2013: Guwahati, India
- Anil Seth, Nisheeth K. Vishnoi:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, Guwahati, India, December 12-14, 2013. LIPIcs 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-64-4 - Frontmatter, Table of Contents, Preface, Conference Organization.
- Venkatesan Guruswami:
Polar Codes: Reliable Communication with Complexity Polynomial in the Gap to Shannon Capacity (Invited Talk). 1-1 - Martin Hofmann, Ramyaa:
Computing With a Fixed Number of Pointers (Invited Talk). 3-18 - Subhash Khot:
On Approximation Resistance of Predicates (Invited Talk). 19-19 - Martin Grohe
, Stephan Kreutzer, Sebastian Siebertz:
Characterisations of Nowhere Dense Graphs (Invited Talk). 21-40 - Kazushige Terui:
Intersection Types for Normalization and Verification (Invited Talk). 41-42 - Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, Saket Saurabh:
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound. 43-54 - Henning Fernau, Markus L. Schmid, Yngve Villanger:
On the Parameterised Complexity of String Morphism Problems. 55-66 - Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, Saket Saurabh:
Partially Polynomial Kernels for Set Cover and Test Cover. 67-78 - Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach:
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. 79-90 - Pierre Clairambault, Andrzej S. Murawski:
Böhm Trees as Higher-Order Recursive Schemes. 91-102 - Sylvain Salvati, Igor Walukiewicz:
Evaluation is MSOL-compatible. 103-114 - Axel Haddad:
Model Checking and Functional Program Transformations. 115-126 - Georgel Calin, Egor Derevenetc, Rupak Majumdar, Roland Meyer:
A Theory of Partitioned Global Address Spaces. 127-139 - Prahladh Harsha, Rahul Jain:
A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound. 141-152 - L. Sunil Chandran, Deepak Rajendraprasad:
Inapproximability of Rainbow Colouring. 153-162 - Anguraj Baskar, Prasad Naldurg, K. R. Raghavendra, S. P. Suresh:
Primal Infon Logic: Derivability in Polynomial Time. 163-174 - Igor Potapov:
Composition Problems for Braids. 175-187 - Andreas Krebs, Nutan Limaye:
DLOGTIME Proof Systems. 189-200 - Srikanth Srinivasan:
On Improved Degree Lower Bounds for Polynomial Approximation. 201-212 - S. Akshay, Ionut Dinca, Blaise Genest, Alin Stefanescu:
Implementing Realistic Asynchronous Automata. 213-224 - Javier Esparza, Loïg Jezequel, Stefan Schwoon:
Computation of Summaries Using Net Unfoldings. 225-236 - Prachi Goyal, Neeldhara Misra, Fahad Panolan:
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets. 237-248 - Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal:
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers. 249-261 - Sonika Arora, Venkatesan T. Chakaravarthy, Neelima Gupta, Koyel Mukherjee, Yogish Sabharwal:
Replica Placement via Capacitated Vertex Cover. 263-274 - Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sivaramakrishnan R. Natarajan, Sambuddha Roy:
Knapsack Cover Subject to a Matroid Constraint. 275-286 - Bastien Maubert, Sophie Pinchinat:
Jumping Automata for Uniform Strategies. 287-298 - Nathanaël Fijalkow, Sophie Pinchinat, Olivier Serre:
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. 299-311 - Matthew Hague:
Saturation of Concurrent Collapsible Pushdown Systems. 313-325 - Christof Löding, Stefan Repke:
Decidability Results on the Existence of Lookahead Delegators for NFA. 327-338 - Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
Fair Matchings and Related Problems. 339-350 - Jian Li, Zeyu Zhang:
Ranking with Diverse Intents and Correlated Contents. 351-362 - Thomas Place, Lorijn van Rooijen, Marc Zeitoun:
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. 363-375 - Andreas Holzer, Christian Schallhart, Michael Tautschnig, Helmut Veith:
On the Structure and Complexity of Rational Sets of Regular Languages. 377-388 - Mario E. Consuegra, Giri Narasimhan:
Geometric Avatar Problems. 389-400 - Parinya Chalermsook, Suresh Venkatasubramanian:
Clustering With Center Constraints. 401-412 - Tim Smith:
On Infinite Words Determined by Stack Automata. 413-424 - Olivier Bodini, Antoine Genitrini, Frédéric Peschanski:
The Combinatorics of Non-determinism. 425-436 - Barna Saha:
Renting a Cloud. 437-448 - Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy Efficient Scheduling and Routing via Randomized Rounding. 449-460 - Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, Georgios Stamoulis:
PTAS for Ordered Instances of Resource Allocation Problems. 461-473 - Florin Manea, Mike Müller, Dirk Nowotka:
On the Pseudoperiodic Extension of u^l = v^m w^n. 475-486 - Tomás Brázdil, Taolue Chen, Vojtech Forejt, Petr Novotný, Aistis Simaitis:
Solvency Markov Decision Processes with Interest. 487-499 - Nathalie Bertrand, Paulin Fournier:
Parameterized Verification of Many Identical Probabilistic Timed Processes. 501-513 - Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke:
Simulation Over One-counter Nets is PSPACE-Complete. 515-526 - Stefan Haar, Serge Haddad, Tarek Melliti, Stefan Schwoon:
Optimal Constructions for Active Diagnosis. 527-539
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-11-26 07:54 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:
