| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 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 |
|
| 1 | Salvatore La Torre, Gennaro Parlato |
Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width. |
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 | |
Frontmatter, Table of Contents, Preface, Conference Organization. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Santosh Vempala |
Randomly-oriented k-d Trees Adapt to Intrinsic Dimension. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anthony Widjaja Lin |
Accelerating tree-automatic relations. |
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 | Patrice Godefroid |
Test Generation Using Symbolic Execution. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal |
Density Functions subject to a Co-Matroid Constraint. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Themis Gouleakis |
Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion . |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bonsma |
Rerouting shortest paths in planar graphs. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Laura Bozzelli, César Sánchez |
Visibly Rational Expressions. |
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 | Holger Hermanns, Andrea Turrini |
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kishore Kothapalli, Sriram V. Pemmaraju |
Super-Fast 3-Ruling Sets. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell |
Bisimilarity of Probabilistic Pushdown Automata. |
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 | Kasturi Varadarajan, Xin Xiao |
On the Sensitivity of Shape Fitting Problems. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Manas Joglekar, Nisarg Shah |
Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal |
Scheduling Resources for Executing a Partial Set of Jobs. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Kumar, Preeti Ranjan Panda, Smruti R. Sarangi |
Efficient on-line algorithm for maintaining k-cover of sparse bit-strings. |
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 | Parthasarathy Madhusudan |
Automated Reasoning and Natural Proofs for Programs Manipulating Data Structures. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Khaled M. Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula, Arindam Pal |
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. |
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 | Navin Goyal, Luis Rademacher |
Lower Bounds for the Average and Smoothed Number of Pareto Optima. |
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 | Udi Boker, Thomas A. Henzinger |
Approximate Determinization of Quantitative Automata. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Crowston, Gregory Gutin, Mark Jones |
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound. |
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 | 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 | Yuval Rabani |
Learning Mixtures of Distributions over Large Discrete Domains. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen |
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý |
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. |
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 | Minati De, Subhas C. Nandy, Sasanka Roy |
Minimum Enclosing Circle with Few Extra Variables. |
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 | Rohit Khandekar, Kirsten Hildrum, Deepak Rajan, Joel L. Wolf |
Scheduling with Setup Costs and Monotone Penalties. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Danos, Jérôme Feret, Walter Fontana, Russell Harmer, Jonathan Hayman, Jean Krivine, Christopher D. Thompson-Walsh, Glynn Winskel |
Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Swastik Kopparty, Srikanth Srinivasan |
Certifying polynomials for AC^0(parity) circuits, with applications. |
FSTTCS |
2012 |
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 | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg |
Timed Lossy Channel Systems. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Varun Rajan |
Space Efficient Edge-Fault Tolerant Routing. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky |
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Szymon Torunczyk |
Imperative Programming in Sets with Atoms. |
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 | Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys |
Decidable classes of documents for XPath. |
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 | Nathanaël Fijalkow, Martin Zimmermann 0002 |
Cost-Parity and Cost-Streett Games. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Saket Saurabh, Magnus Wahlström |
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs. |
FSTTCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Christian Reitwießner, Maximilian Witek |
Applications of Discrepancy Theory in Multiobjective Approximation. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan |
Petri Net Reachability Graphs: Decidability Status of FO Properties. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietmar Berwanger, Lukasz Kaiser, Bernd Puchala |
A Perfect-Information Construction for Coordination in Games. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | B. V. Raghavendra Rao, Jayalal M. N. Sarma |
Isomorphism testing of read-once functions and polynomials. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey |
The First-Order Theory of Ground Tree Rewrite Graphs. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksander Madry, Debmalya Panigrahi |
The Semi-stochastic Ski-rental Problem. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Supratik Chakraborty, Amit Kumar |
Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacques Duparc, Alessandro Facchini, Filip Murlak |
Definable Operations On Weakly Recognizable Sets of Trees. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Siavosh Benabbas, Siu On Chan, Konstantinos Georgiou, Avner Magen |
Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais |
Streamability of Nested Word Transductions. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | John Fearnley, Markus Rabe 0002, Sven Schewe, Lijun Zhang 0001 |
Efficient Approximation of Optimal Control for Continuous-Time Markov Games. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand, Blaise Genest |
Minimal Disclosure in Partially Observable Markov Decision Processes. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ocan Sankur, Patricia Bouyer, Nicolas Markey |
Shrinking Timed Automata. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer |
Dependence logic with a majority quantifier. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels |
Nash Equilibria in Concurrent Games with Büchi Objectives. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Harrie Jan Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, Barbara König |
Conditional Reactive Systems. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Hague |
Parameterised Pushdown Systems with Non-Atomic Writes. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Céline Chevalier, Stéphanie Delaune, Steve Kremer |
Transforming Password Protocols to Compose. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Supratik Chakraborty, Amit Kumar (eds.) |
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India |
FSTTCS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hongfei Fu, Joost-Pieter Katoen |
Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Geevarghese Philip, Yngve Villanger |
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz |
Using non-convex approximations for efficient analysis of timed automata. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri |
Dynamic programming in faulty memory hierarchies (cache-obliviously). |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Y. Vardi |
Constraints, Graphs, Algebra, Logic, and Complexity (Invited Talk). |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Faouzi Atig, Pierre Ganty |
Approximating Petri Net Reachability Along Context-free Traces. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Madhu Sudan |
Physical limits of Communication (Invited Talk). |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Uli Fahrenberg, Axel Legay, Claus R. Thrane |
The Quantitative Linear-Time--Branching-Time Spectrum. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar |
Rainbow Connectivity: Hardness and Tractability. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex Bain, John C. Mitchell, Rahul Sharma 0001, Deian Stefan, Joe Zimmerman |
A Domain-Specific Language for Computing on Encrypted Data (Invited Talk). |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manoj Gupta, Yogish Sabharwal, Sandeep Sen |
The update complexity of selection and related problems. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuel Kieronski, Jakub Michaliszyn, Jan Otop |
Modal Logics Definable by Universal Three-Variable Formulas. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bertram Felgenhauer, Harald Zankl, Aart Middeldorp |
Layer Systems for Proving Confluence. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Didier Caucal, Teodor Knapik |
Higher order indexed monadic systems. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann |
Optimal Packed String Matching. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo |
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhijin Adiga, L. Sunil Chandran, Rogers Mathew |
Cubicity, Degeneracy, and Crossing Number. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yang Cai, Ting Zhang |
A Tight Lower Bound for Streett Complementation. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki |
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pablo Barceló, Leonid Libkin, Juan L. Reutter |
Parameterized Regular Expressions and Their Languages. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Umesh V. Vazirani |
Quantum State Description Complexity (Invited Talk). |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski |
Approximation Algorithms for Union and Intersection Covering Problems. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Author Index. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Kuperberg, Michael Vanden Boom |
Quasi-Weak Cost Automata: A New Variant of Weakness. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Phokion G. Kolaitis |
Schema Mappings and Data Examples: Deriving Syntax from Semantics (Invited Talk). |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul |
Obtaining a Bipartite Graph by Contracting Few Edges. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanne Albers |
Energy-Efficient Algorithms (Invited Talk). |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Pudlák |
On extracting computations from propositional proofs (a survey). |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Udi Boker, Orna Kupferman, Avital Steinitz |
Parityizing Rabin and Streett. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
Model checking time-constrained scenario-based specifications. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Backes, Matteo Maffei, Esfandiar Mohammadi |
Computationally Sound Abstraction and Verification of Secure Multi-Party Computations. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")