default search action
32nd FSTTCS 2012: Hyderabad, India
- Deepak D'Souza, Telikepalli Kavitha, Jaikumar Radhakrishnan:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India. LIPIcs 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2012, ISBN 978-3-939897-47-7 - Frontmatter, Table of Contents, Preface, Conference Organization.
- Yuval Rabani:
Learning Mixtures of Distributions over Large Discrete Domains. 1-3 - Mikolaj Bojanczyk, Szymon Torunczyk
:
Imperative Programming in Sets with Atoms. 4-15 - Dimitris Achlioptas, Themis Gouleakis:
Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion . 16-23 - Patrice Godefroid:
Test Generation Using Symbolic Execution. 24-33 - Parthasarathy Madhusudan:
Automated Reasoning and Natural Proofs for Programs Manipulating Data Structures. 34-35 - Swastik Kopparty, Srikanth Srinivasan
Certifying polynomials for AC^0(parity) circuits, with applications. 36-47 - Santosh S. Vempala:
Randomly-oriented k-d Trees Adapt to Intrinsic Dimension. 48-57 - Navin Goyal, Luis Rademacher
Lower Bounds for the Average and Smoothed Number of Pareto Optima. 58-69 - Guy Feigenblat, Ely Porat, Ariel Shiftan:
Exponential Space Improvement for minwise Based Algorithms. 70-85 - Andreas Krebs, Howard Straubing:
An effective characterization of the alternation hierarchy in two-variable logic. 86-98 - Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys:
Decidable classes of documents for XPath. 99-111 - Jakub Gajarský, Petr Hlinený
Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences. 112-123 - Nathanaël Fijalkow
Cost-Parity and Cost-Streett Games. 124-135 - Kishore Kothapalli, Sriram V. Pemmaraju:
Super-Fast 3-Ruling Sets. 136-147 - Gábor Ivanyos
New bounds on the classical and quantum communication complexity of some graph properties. 148-159 - Christopher H. Broadbent, Stefan Göller:
On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two. 160-172 - Salvatore La Torre, Gennaro Parlato
Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width. 173-184 - Rohit Khandekar, Kirsten Hildrum, Deepak Rajan, Joel L. Wolf:
Scheduling with Setup Costs and Monotone Penalties. 185-198 - Venkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal:
Scheduling Resources for Executing a Partial Set of Jobs. 199-210 - Laura Bozzelli, César Sánchez
Visibly Rational Expressions. 211-223 - Alexander Heußner, Tristan Le Gall, Grégoire Sutre:
Safety Verification of Communicating One-Counter Machines. 224-235 - Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal:
Density Functions subject to a Co-Matroid Constraint. 236-248 - Amit Kumar
Efficient on-line algorithm for maintaining k-cover of sparse bit-strings. 249-256 - Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen:
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. 257-266 - Khaled M. Elbassioni
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. 267-275 - 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. 276-288 - Giorgio Delzanno, Arnaud Sangnier
On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. 289-300 - Rémi Bonnet, Alain Finkel, M. Praveen:
Extending the Rackoff technique to Affine nets. 301-312 - Anthony Widjaja Lin
Accelerating tree-automatic relations. 313-324 - Binay K. Bhattacharya, Yuzhuang Hu:
k-delivery traveling salesman problem on tree networks. 325-336 - Paul S. Bonsma:
Rerouting shortest paths in planar graphs. 337-349 - Varun Rajan:
Space Efficient Edge-Fault Tolerant Routing. 350-361 - Udi Boker, Thomas A. Henzinger:
Approximate Determinization of Quantitative Automata. 362-373 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg:
Timed Lossy Channel Systems. 374-386 - Johannes Köbler, Sebastian Kuhnert
Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace. 387-399 - Robert Crowston, Gregory Z. Gutin, Mark Jones:
Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound. 400-411 - Matthias Mnich
Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound. 412-423 - Daniel Lokshtanov, Saket Saurabh, Magnus Wahlström
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs. 424-434 - Holger Hermanns
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time. 435-447 - Vojtech Forejt, Petr Jancar
Bisimilarity of Probabilistic Pushdown Automata. 448-460 - Krishnendu Chatterjee, Manas Joglekar, Nisarg Shah:
Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives. 461-473 - Tomás Brázdil, Holger Hermanns
Verification of Open Interactive Markov Chains. 474-485 - Kasturi R. Varadarajan, Xin Xiao:
On the Sensitivity of Shape Fitting Problems. 486-497 - Hee-Kap Ahn
Overlap of Convex Polytopes under Rigid Motion. 498-509 - Minati De
Minimum Enclosing Circle with Few Extra Variables. 510-521 - Pranavadatta Devaki, Aditya Kanade:
Static Analysis for Checking Data Format Compatibility of Programs. 522-533 - Rohit Chadha, Michael Ummels:
The Complexity of Quantitative Information Flow in Recursive Programs. 534-545 - Gergei Bana, Pedro Adão
Computationally Complete Symbolic Attacker in Action. 546-560
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 2024-12-15 01:33 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: