| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sonika Arora, Venkatesan T. Chakaravarthy, Kanika Gupta, Neelima Gupta, Yogish Sabharwal |
Replica Placement on Directed Acyclic Graphs.  |
FSTTCS  |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Nirman Kumar |
Robust Proximity Search for Balls Using Sublinear Space. |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Erick Chastain, Adi Livnat, Christos H. Papadimitriou, Umesh V. Vazirani |
Algorithms, Games, and Evolution (Invited Talk). |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoj Gupta 0002 |
Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time. |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Bock, Yuri Faenza, Carsten Moldenhauer, Andres J. Ruiz-Vargas |
Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number. |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand 0001, Serge Haddad, Engel Lefaucheux |
Foundation of Diagnosis and Predictability in Probabilistic Systems. |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantinos Georgiou, Edward Lee |
Lift & Project Systems Performing on the Partial Vertex Cover Polytope. |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Efraim Gelman, Amnon Ta-Shma |
The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent. |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Orna Kupferman, Tami Tamir |
Properties and Utilization of Capacitated Automata (Invited Talk). |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani, Søren Vind |
Output-Sensitive Pattern Extraction in Sequences. |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Keil 0002, Peter Thiemann 0001 |
Symbolic Solving of Extended Regular Expression Inequalities. |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Baldan, Filippo Bonchi, Henning Kerstan, Barbara König 0001 |
Behavioral Metrics via Functor Lifting. |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Colcombet, Nathanaël Fijalkow, Florian Horn 0001 |
Playing Safe. |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Flávio L. C. de Moura, Delia Kesner, Mauricio Ayala-Rincón |
Metaconfluence of Calculi with Explicit Substitutions at a Distance. |
FSTTCS |
2014 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Bodini, Antoine Genitrini, Frédéric Peschanski |
The Combinatorics of Non-determinism. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Christof Löding, Stefan Repke |
Decidability Results on the Existence of Lookahead Delegators for NFA. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Barna Saha |
Renting a Cloud. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Clairambault, Andrzej S. Murawski |
Böhm Trees as Higher-Order Recursive Schemes. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sambuddha Roy, Yogish Sabharwal |
Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Salvati, Igor Walukiewicz |
Evaluation is MSOL-compatible. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Smith |
On Infinite Words Determined by Stack Automata. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Parinya Chalermsook, Suresh Venkatasubramanian |
Clustering With Center Constraints. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko |
Energy Efficient Scheduling and Routing via Randomized Rounding. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazushige Terui |
Intersection Types for Normalization and Verification (Invited Talk). |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Holzer, Christian Schallhart, Michael Tautschnig, Helmut Veith |
On the Structure and Complexity of Rational Sets of Regular Languages. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Axel Haddad |
Model Checking and Functional Program Transformations. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Hague |
Saturation of Concurrent Collapsible Pushdown Systems. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Jian Li 0015, Zeyu Zhang |
Ranking with Diverse Intents and Correlated Contents. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Georgel Calin, Egor Derevenetc, Rupak Majumdar, Roland Meyer 0001 |
A Theory of Partitioned Global Address Spaces. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Place, Lorijn van Rooijen, Marc Zeitoun |
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Potapov |
Composition Problems for Braids. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Bastien Maubert, Sophie Pinchinat |
Jumping Automata for Uniform Strategies. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Subhash Khot |
On Approximation Resistance of Predicates (Invited Talk). |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Hofman, Slawomir Lasota 0001, Richard Mayr, Patrick Totzke |
Simulation Over One-counter Nets is PSPACE-Complete. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Akshay 0001, Ionut Dinca, Blaise Genest, Alin Stefanescu |
Implementing Realistic Asynchronous Automata. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Prahladh Harsha, Rahul Jain 0001 |
A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathanaël Fijalkow, Sophie Pinchinat, Olivier Serre |
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Anil Seth, Nisheeth K. Vishnoi (eds.) |
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India |
FSTTCS |
2013 |
DBLP BibTeX RDF |
|
| 1 | Stefan Haar, Serge Haddad, Tarek Melliti, Stefan Schwoon |
Optimal Constructions for Active Diagnosis. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Srikanth Srinivasan 0001 |
On Improved Degree Lower Bounds for Polynomial Approximation. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Hofmann 0001, Ramyaa |
Computing With a Fixed Number of Pointers (Invited Talk). |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan 0001, Saket Saurabh 0001 |
Partially Polynomial Kernels for Set Cover and Test Cover. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, Georgios Stamoulis |
PTAS for Ordered Instances of Resource Allocation Problems. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Sunil Chandran, Deepak Rajendraprasad |
Inapproximability of Rainbow Colouring. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Florin Manea, Mike Müller, Dirk Nowotka |
On the Pseudoperiodic Extension of u^l = v^m w^n. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Markus L. Schmid, Yngve Villanger |
On the Parameterised Complexity of String Morphism Problems. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Stephan Kreutzer, Sebastian Siebertz |
Characterisations of Nowhere Dense Graphs (Invited Talk). |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Mario E. Consuegra, Giri Narasimhan |
Geometric Avatar Problems. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Prachi Goyal, Neeldhara Misra, Fahad Panolan |
Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Frontmatter, Table of Contents, Preface, Conference Organization. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Krebs, Nutan Limaye |
DLOGTIME Proof Systems. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach |
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Sivaramakrishnan R. Natarajan, Sambuddha Roy |
Knapsack Cover Subject to a Matroid Constraint. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Crowston, Mark Jones 0001, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai 0001, Saket Saurabh 0001 |
Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami |
Polar Codes: Reliable Communication with Complexity Polynomial in the Gap to Shannon Capacity (Invited Talk). |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Javier Esparza, Loïg Jezequel, Stefan Schwoon |
Computation of Summaries Using Net Unfoldings. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand 0001, Paulin Fournier |
Parameterized Verification of Many Identical Probabilistic Timed Processes. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Brázdil, Taolue Chen, Vojtech Forejt, Petr Novotný 0001, Aistis Simaitis |
Solvency Markov Decision Processes with Interest. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail 0001 |
Fair Matchings and Related Problems. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Sonika Arora, Venkatesan T. Chakaravarthy, Neelima Gupta, Koyel Mukherjee, Yogish Sabharwal |
Replica Placement via Capacitated Vertex Cover. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Anguraj Baskar, Prasad Naldurg, K. R. Raghavendra, S. P. Suresh |
Primal Infon Logic: Derivability in Polynomial Time. |
FSTTCS |
2013 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Chadha, Michael Ummels |
The Complexity of Quantitative Information Flow in Recursive Programs. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys |
Decidable classes of documents for XPath. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Khaled M. Elbassioni, Naveen Garg 0001, Divya Gupta 0001, Amit Kumar 0001, Vishal Narula, Arindam Pal 0001 |
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Udi Boker, Thomas A. Henzinger |
Approximate Determinization of Quantitative Automata. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathanaël Fijalkow, Martin Zimmermann 0002 |
Cost-Parity and Cost-Streett Games. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Binay K. Bhattacharya, Yuzhuang Hu |
k-delivery traveling salesman problem on tree networks. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kishore Kothapalli, Sriram V. Pemmaraju |
Super-Fast 3-Ruling Sets. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher H. Broadbent, Stefan Göller |
On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Manas Joglekar, Nisarg Shah 0001 |
Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Minati De, Subhas C. Nandy, Sasanka Roy |
Minimum Enclosing Circle with Few Extra Variables. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anthony Widjaja Lin |
Accelerating tree-automatic relations. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Arindam Pal 0001, Sambuddha Roy, Yogish Sabharwal |
Scheduling Resources for Executing a Partial Set of Jobs. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Krebs, Howard Straubing |
An effective characterization of the alternation hierarchy in two-variable logic. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Frontmatter, Table of Contents, Preface, Conference Organization. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Rabani |
Learning Mixtures of Distributions over Large Discrete Domains. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon |
Overlap of Convex Polytopes under Rigid Motion. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg |
Timed Lossy Channel Systems. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Brázdil, Holger Hermanns, Jan Krcál, Jan Kretínský, Vojtech Rehák |
Verification of Open Interactive Markov Chains. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Saket Saurabh 0001, Magnus Wahlström |
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrice Godefroid |
Test Generation Using Symbolic Execution. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Swastik Kopparty, Srikanth Srinivasan 0001 |
Certifying polynomials for AC^0(parity) circuits, with applications. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Parthasarathy Madhusudan |
Automated Reasoning and Natural Proofs for Programs Manipulating Data Structures. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Mnich, Geevarghese Philip, Saket Saurabh 0001, Ondrej Suchý |
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranavadatta Devaki, Aditya Kanade |
Static Analysis for Checking Data Format Compatibility of Programs. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Khandekar, Kirsten Hildrum, Deepak Rajan, Joel L. Wolf |
Scheduling with Setup Costs and Monotone Penalties. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Feigenblat, Ely Porat, Ariel Shiftan |
Exponential Space Improvement for minwise Based Algorithms. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémi Bonnet, Alain Finkel, M. Praveen |
Extending the Rackoff technique to Affine nets. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Salvatore La Torre, Gennaro Parlato |
Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky 0001 |
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jakub Gajarský, Petr Hlinený |
Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhash Anand, Surender Baswana, Manoj Gupta 0002, Sandeep Sen |
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso, Gianluigi Zavattaro |
On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gergei Bana, Pedro Adão, Hideki Sakurada |
Computationally Complete Symbolic Attacker in Action. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Hermanns, Andrea Turrini |
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Heußner, Tristan Le Gall, Grégoire Sutre |
Safety Verification of Communicating One-Counter Machines. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Laura Bozzelli, César Sánchez 0001 |
Visibly Rational Expressions. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf |
New bounds on the classical and quantum communication complexity of some graph properties. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Szymon Torunczyk |
Imperative Programming in Sets with Atoms. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Deepak D'Souza, Telikepalli Kavitha, Jaikumar Radhakrishnan (eds.) |
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India |
FSTTCS |
2012 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license