|
List of accepted papers
-
Rohit Khandekar, Guy Kortsarz and Zeev Nutov.
Approximating Fault-Tolerant Group-Steiner Problems
-
Chandan Saha, Ramprasad Saptharishi and Nitin Saxena.
The Power of Depth 2 Circuits over Algebras.
-
Stéphane Bessy, Fedor Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh and Stéphan Thomassé
Kernels for Feedback Arc Set In Tournaments
-
Vikraman Arvind, Pushkar Joglekar and Srikanth Srinivasan.
Arithmetic Circuits and the Hadamard Product of Polynomials
-
Laurent Braud.
Covering of ordinals
-
Laura Bozzelli, Axel Legay and Sophie Pinchinat.
On Timed Alternating Simulation for Concurrent Timed Games
-
Mathieu Tracol, Marcus Groesser and Christel Baier.
Recurrence and Transience for Probabilistic Automata
-
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Jay Sethuraman and Joel Wolf.
Bounded Size Graph Clustering with Applications to Stream Processing
-
Mark Braverman, Stephen Cook, Pierre McKenzie, Rahul Santhanam and Dustin Wehr.
Fractional Pebbling and Thrifty Branching Programs
-
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante and Jérémie Rolan
Non-Local Box Complexity and Secure Function Evaluation
-
Alexander Rabinovich.
Synthesis of Finite-state and DefinableWinning Strategies
-
Julien Cristau.
Automata and temporal logic over arbitrary linear time
-
Tomas Brazdil, Vojtech Forejt, Jan Krcal, Jan Kretinsky and Antonin Kucera.
Continuous-Time Stochastic Games with Time-Bounded Reachability
-
Fedor Fomin, Daniel Lokshtanov, Venkatesh Raman and Saket Saurabh.
Subexponential Algorithms for Partial Cover Problems
-
Jeremie Cabessa, Jacques Duparc, Alessandro Facchini and Filip Murlak.
The Wadge Hierarchy of Max-Regular Languages
-
Chien-Chung Huang and Zoya Svitkina.
Donation Center Location Problem
-
M. Praveen and Kamal Lodaya.
Modelchecking counting properties of 1-safe nets communicating through buffers in fixed parameter Pspace
-
Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf and Fabian Wagner.
Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space
-
Mostafa Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram and Richard J. Lipton.
Algorithms for Message Ferrying on Mobile ad hoc Networks
-
Konstantinos Georgiou, Avner Magen and Iannis Tourlakis.
On the Tightening of the Standard SDP for Vertex Cover with $\ell_1$ Inequalities
-
Christof Loeding and Karianto Wong.
On Nondeterministic Unranked Tree Automata with Sibling Constraints
-
Stephanie Delaune, Steve Kremer and Olivier Pereira.
Simulation based security in the applied pi calculus
-
Mikołaj Bojańczyk and Szymon Toruńczyk.
Deterministic Automata and Extensions of Weak MSO
-
Parosh Abdulla, Yu-Fang Chen, Lukas Holik and Tomas Vojnar.
Mediating for Reduction (on Minimizing Alternating Buchi Automata)
-
Mark Kattenbelt and Michael Huth.
Verification and refutation of probabilistic specifications via games
-
Ankur Taly and Ashish Tiwari.
Deductive Verification of Continuous Dynamical Systems
-
Abhinav Kumar, Satyanarayana Lokam, Vijay M. Patankar and Jayalal M.N. Sarma.
Using Elimination Theory to construct Rigid Matrices
-
Andre Madeira and S. Muthukrishnan.
Functionally Private Approximations of Negligibly-Biased Estimators
-
John Hitchcock, A Pavan and N. V Vinodchandran.
Randomness extraction is equivalent to Kolmogorov extraction
-
Soumya Paul and Sunil Easaw Simon.
Nash Equilibrium in Generalised Muller Games
-
Joachim Kneis, Alexander Langer and Peter Rossmanith.
A Fine-grained Analysis of a Simple Independent Set Algorithm
-
Tomas Brazdil, Javier Esparza and Stefan Kiefer.
On the Memory Consumption of Probabilistic Pushdown Automata
-
Anuj Dawar and Stephan Kreutzer.
Domination Problems in Nowhere-Dense Classes of Graphs
-
Stephane Demri, Marcin Jurdzinski, Oded Lachish and Ranko Lazic.
The covering and boundedness problems for branching vector addition systems
|