Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, pp. 276-288, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-47-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Kasturi R. Varadarajan, Xin Xiao |
On the Sensitivity of Shape Fitting Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, pp. 486-497, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-47-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Dimitris Achlioptas, Themis Gouleakis |
Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion . ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, pp. 16-23, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-47-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Varun Rajan |
Space Efficient Edge-Fault Tolerant Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, pp. 350-361, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-47-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Robert Crowston, Gregory Z. Gutin, Mark Jones 0001 |
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, pp. 400-411, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-47-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Santosh S. Vempala |
Randomly-oriented k-d Trees Adapt to Intrinsic Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, pp. 48-57, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-47-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Vojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell 0001 |
Bisimilarity of Probabilistic Pushdown Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, pp. 448-460, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-47-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Amit Kumar 0001, Preeti Ranjan Panda, Smruti R. Sarangi |
Efficient on-line algorithm for maintaining k-cover of sparse bit-strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, pp. 249-256, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-47-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, pp. 236-248, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-47-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Paul S. Bonsma |
Rerouting shortest paths in planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, pp. 337-349, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-47-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Navin Goyal, Luis Rademacher |
Lower Bounds for the Average and Smoothed Number of Pareto Optima. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, pp. 58-69, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-47-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Geevarghese Philip, Yngve Villanger |
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 164-175, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais |
Streamability of Nested Word Transductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 312-324, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Phokion G. Kolaitis |
Schema Mappings and Data Examples: Deriving Syntax from Semantics (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 25-25, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7 The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
1 | Mohamed Faouzi Atig, Pierre Ganty |
Approximating Petri Net Reachability Along Context-free Traces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 152-163, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Pablo Barceló, Leonid Libkin, Juan L. Reutter |
Parameterized Regular Expressions and Their Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 351-362, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar |
Rainbow Connectivity: Hardness and Tractability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 241-251, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Nathalie Bertrand 0001, Blaise Genest |
Minimal Disclosure in Partially Observable Markov Decision Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 411-422, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul |
Obtaining a Bipartite Graph by Contracting Few Edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 217-228, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Moshe Y. Vardi |
Constraints, Graphs, Algebra, Logic, and Complexity (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 3-3, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Didier Caucal, Teodor Knapik |
Higher order indexed monadic systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 469-480, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | H. J. Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, Barbara König 0001 |
Conditional Reactive Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 191-203, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | |
Author Index. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Dietmar Berwanger, Lukasz Kaiser, Bernd Puchala |
A Perfect-Information Construction for Coordination in Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 387-398, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers |
Energy-Efficient Algorithms (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 1-2, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Christian Glaßer, Christian Reitwießner, Maximilian Witek |
Applications of Discrepancy Theory in Multiobjective Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 55-65, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 41-54, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 78-89, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Philippe Darondeau, Stéphane Demri, Roland Meyer 0001, Christophe Morvan |
Petri Net Reachability Graphs: Decidability Status of FO Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 140-151, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Denis Kuperberg, Michael Vanden Boom |
Quasi-Weak Cost Automata: A New Variant of Weakness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 66-77, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Ocan Sankur, Patricia Bouyer, Nicolas Markey |
Shrinking Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 90-102, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Emanuel Kieronski, Jakub Michaliszyn, Jan Otop |
Modal Logics Definable by Universal Three-Variable Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 264-275, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Aleksander Madry, Debmalya Panigrahi |
The Semi-stochastic Ski-rental Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 300-311, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Bertram Felgenhauer, Harald Zankl, Aart Middeldorp |
Layer Systems for Proving Confluence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 288-299, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Hongfei Fu 0001, Joost-Pieter Katoen |
Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 445-456, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 6-24, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Yang Cai 0001, Ting Zhang |
A Tight Lower Bound for Streett Complementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 339-350, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Uli Fahrenberg, Axel Legay, Claus R. Thrane |
The Quantitative Linear-Time--Branching-Time Spectrum. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 103-114, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Marek Cygan, Fabrizio Grandoni 0001, Stefano Leonardi 0001, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski |
Approximation Algorithms for Union and Intersection Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 28-40, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann |
Optimal Packed String Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 423-432, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Supratik Chakraborty, Amit Kumar |
Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones 0001, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo |
Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 229-240, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 127-139, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels |
Nash Equilibria in Concurrent Games with Büchi Objectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 375-386, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Umesh V. Vazirani |
Quantum State Description Complexity (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 26-27, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Jacques Duparc, Alessandro Facchini, Filip Murlak |
Definable Operations On Weakly Recognizable Sets of Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 363-374, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Céline Chevalier, Stéphanie Delaune, Steve Kremer |
Transforming Password Protocols to Compose. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 204-216, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | John Fearnley, Markus N. Rabe, Sven Schewe, Lijun Zhang 0001 |
Efficient Approximation of Optimal Control for Continuous-Time Markov Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 399-410, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | B. V. Raghavendra Rao, Jayalal Sarma |
Isomorphism testing of read-once functions and polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 115-126, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Göller, Markus Lohrey |
The First-Order Theory of Ground Tree Rewrite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 276-287, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Madhu Sudan 0001 |
Physical limits of Communication (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 4-5, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Manoj Gupta 0002, Yogish Sabharwal, Sandeep Sen |
The update complexity of selection and related problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 325-338, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Abhijin Adiga, L. Sunil Chandran, Rogers Mathew |
Cubicity, Degeneracy, and Crossing Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 176-190, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Arnaud Durand 0001, Johannes Ebbing, Juha Kontinen, Heribert Vollmer |
Dependence logic with a majority quantifier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 252-263, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Matthew Hague |
Parameterised Pushdown Systems with Non-Atomic Writes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 457-468, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri 0001 |
Dynamic programming in faulty memory hierarchies (cache-obliviously). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, pp. 433-444, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-34-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
1 | Wieslaw Zielonka |
Playing in stochastic environment: from multi-armed bandits to two-player games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 65-72, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh 0001 |
Determining the Winner of a Dodgson Election is Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 459-468, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman 0001, Saket Saurabh 0001 |
The effect of girth on the kernelization complexity of Connected Dominating Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 96-107, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Sven Schewe |
Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 400-411, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Qi Ge, Daniel Stefankovic |
A graph polynomial for independent sets of bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 240-250, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Udi Boker, Orna Kupferman, Avital Steinitz |
Parityizing Rabin and Streett. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 412-423, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey |
ATL with Strategy Contexts: Expressiveness and Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 120-132, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider |
Satisfiability of Acyclic and Almost Acyclic CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 84-95, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Piotr Berman, Sofya Raskhodnikova, Ge Ruan |
Finding Sparser Directed Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 424-435, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell 0001 |
Computing Rational Radical Sums in Uniform TC^0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 308-316, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | S. Akshay 0001, Paul Gastin, Madhavan Mukund, K. Narayan Kumar |
Model checking time-constrained scenario-based specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 204-215, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Tomás Brázdil, Václav Brozek, Kousha Etessami |
One-Counter Stochastic Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 108-119, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda |
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 327-337, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Pavel Pudlák |
On extracting computations from propositional proofs (a survey). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 30-41, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Krishnendu Chatterjee, Laurent Doyen 0001, Thomas A. Henzinger, Jean-François Raskin |
Generalized Mean-payoff and Energy Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 505-516, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner |
Graph Isomorphism is not AC^0 reducible to Group Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 317-326, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Wojciech Czerwinski, Slawomir Lasota 0001 |
Fast equivalence-checking for normed context-free processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 260-271, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Sara Capecchi, Elena Giachino, Nobuko Yoshida |
Global Escape in Multiparty Sessions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 338-351, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Nicholas R. Radcliffe, Rakesh M. Verma |
Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 284-295, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Bruno Courcelle |
Special tree-width and the verification of monadic second-order graph pr operties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 13-29, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Rajeev Alur, Pavol Cerný |
Expressiveness of streaming string transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 1-12, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Matthew Hague, Anthony Widjaja To |
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 228-239, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Gagan Goel, Pushkar Tripathi, Lei Wang 0010 |
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 436-446, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir |
Minimizing Busy Time in Multiple Machine Real-time Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 169-180, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal |
Finding Independent Sets in Unions of Perfect Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 251-259, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan 0001 |
Model Checking Concurrent Programs with Nondeterminism and Randomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 364-375, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 73-83, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Sourav Chakraborty 0001, Eldar Fischer, Arie Matsliah, Ronald de Wolf |
New Results on Quantum Property Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 145-156, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Stefan Schulz 0002 |
First-Order Logic with Reachability Predicates on Infinite Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 493-504, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal |
A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 181-191, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Mohamed Faouzi Atig |
Global Model Checking of Ordered Multi-Pushdown Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 216-227, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun |
Place-Boundedness for Vector Addition Systems with one zero-test. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 192-203, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | André Chailloux, Iordanis Kerenidis, Jamie Sikora |
Lower bounds for Quantum Oblivious Transfer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 157-168, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Cyril Nicaud, Carine Pivoteau, Benoît Razet |
Average Analysis of Glushkov Automata under a BST-Like Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 388-399, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Rishi Saket |
Quasi-Random PCP and Hardness of 2-Catalog Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 447-458, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Ahmet Kara 0002, Thomas Schwentick, Thomas Zeume |
Temporal Logics on Words with Multiple Data Values. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 481-492, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Alexandra Silva 0001, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten |
Generalizing the powerset construction, coalgebraically. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 272-283, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Kamal Lodaya, Meena Mahajan |
Frontmatter, Table of Contents, Preface, Conference Organization, Author Index. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Maurice J. Jansen, Youming Qiao, Jayalal Sarma |
Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 296-307, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Eugene Asarin, Aldric Degorre |
Two Size Measures for Timed Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 376-387, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Blaise Genest, Anca Muscholl, Zhilin Wu |
Verifying Recursive Active Documents with Positive Data Tree Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 469-480, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Fabio Mogavero, Aniello Murano, Moshe Y. Vardi |
Reasoning About Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 133-144, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
1 | Santosh S. Vempala |
Recent Progress and Open Problems in Algorithmic Convex Geometry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 42-64, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|