Search results for "STACS"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Amir M. Ben-Amram	Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract).	STACS	2013	DBLP DOI BibTeX RDF
1	Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane	Space-Time Trade-offs for Stack-Based Algorithms.	STACS	2013	DBLP DOI BibTeX RDF
1	Mark Braverman, Gal Oshri	Search using queries on indistinguishable items.	STACS	2013	DBLP DOI BibTeX RDF
1	Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann	Improved Bounds for Online Preemptive Matching.	STACS	2013	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Yngve Villanger	Searching for better fill-in.	STACS	2013	DBLP DOI BibTeX RDF
1	Natacha Portier, Thomas Wilke	Frontmatter, Table of Contents, Preface, Workshop Organization.	STACS	2013	DBLP DOI BibTeX RDF
1	Andris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf	Optimal quantum query bounds for almost all Boolean functions.	STACS	2013	DBLP DOI BibTeX RDF
1	Andreas Björklund, Petteri Kaski, Lukasz Kowalik	Probably Optimal Graph Motifs.	STACS	2013	DBLP DOI BibTeX RDF
1	Loïck Magnin, Jérémie Roland	Explicit relation between all lower bound techniques for quantum query complexity.	STACS	2013	DBLP DOI BibTeX RDF
1	Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen	Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs.	STACS	2013	DBLP DOI BibTeX RDF
1	Thomas Watson 0001	Advice Lower Bounds for the Dense Model Theorem.	STACS	2013	DBLP DOI BibTeX RDF
1	Wieslaw Szwast, Lidia Tendera	FO^2 with one transitive relation is decidable.	STACS	2013	DBLP DOI BibTeX RDF
1	Konstantin Kutzkov	Deterministic algorithms for skewed matrix products.	STACS	2013	DBLP DOI BibTeX RDF
1	Thomas Colcombet, Laure Daviaud	Approximate comparison of distance automata.	STACS	2013	DBLP DOI BibTeX RDF
1	Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan 0001, Saket Saurabh 0001, Stefan Szeider	Backdoors to q-Horn.	STACS	2013	DBLP DOI BibTeX RDF
1	Tengyu Ma 0001, Bo Tang 0003, Yajun Wang 0001	The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems.	STACS	2013	DBLP DOI BibTeX RDF
1	Kousha Etessami	The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk).	STACS	2013	DBLP DOI BibTeX RDF
1	Natacha Portier, Thomas Wilke	Author Index.	STACS	2013	DBLP DOI BibTeX RDF
1	Hartmut Klauck, Ronald de Wolf	Fooling One-Sided Quantum Protocols.	STACS	2013	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos	Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs.	STACS	2013	DBLP DOI BibTeX RDF
1	György Dósa, Jirí Sgall	First Fit bin packing: A tight analysis.	STACS	2013	DBLP DOI BibTeX RDF
1	Nathanaël François, Frédéric Magniez	Streaming Complexity of Checking Priority Queues.	STACS	2013	DBLP DOI BibTeX RDF
1	Ines Klimann	The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable.	STACS	2013	DBLP DOI BibTeX RDF
1	Kurt Mehlhorn	Physarum Computations (Invited talk).	STACS	2013	DBLP DOI BibTeX RDF
1	Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz 0001, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow	Algorithms for Designing Pop-Up Cards.	STACS	2013	DBLP DOI BibTeX RDF
1	Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider	Model Counting for CNF Formulas of Bounded Modular Treewidth.	STACS	2013	DBLP DOI BibTeX RDF
1	László Babai, Youming Qiao	Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers.	STACS	2012	DBLP DOI BibTeX RDF
1	Frederik Harwath, Nicole Schweikardt	Regular tree languages, cardinality predicates, and addition-invariant FO.	STACS	2012	DBLP DOI BibTeX RDF
1	Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan	Preemptive and Non-Preemptive Generalized Min Sum Set Cover.	STACS	2012	DBLP DOI BibTeX RDF
1	Marc Thurley	An Approximation Algorithm for #k-SAT.	STACS	2012	DBLP DOI BibTeX RDF
1	Christoph Dürr, Thomas Wilke	Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents.	STACS	2012	DBLP DOI BibTeX RDF
1	Frédérique Bassino, Julien David, Andrea Sportiello	Asymptotic enumeration of Minimal Automata.	STACS	2012	DBLP DOI BibTeX RDF
1	Ning Chen	On Computing Pareto Stable Assignments.	STACS	2012	DBLP DOI BibTeX RDF
1	Xiaoming Sun 0001, Chengu Wang	Randomized Communication Complexity for Linear Algebra Problems over Finite Fields.	STACS	2012	DBLP DOI BibTeX RDF
1	Martin Dietzfelbinger	On Randomness in Hash Functions (Invited Talk).	STACS	2012	DBLP DOI BibTeX RDF
1	Arnaud Carayol, Cyril Nicaud	Distribution of the number of accessible states in a random deterministic automaton.	STACS	2012	DBLP DOI BibTeX RDF
1	Maurice J. Jansen, Rahul Santhanam	Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes.	STACS	2012	DBLP DOI BibTeX RDF
1	Andreas Emil Feldmann, Luca Foschini 0002	Balanced Partitions of Trees and Applications.	STACS	2012	DBLP DOI BibTeX RDF
1	Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari	Improved Bounds for Bipartite Matching on Surfaces.	STACS	2012	DBLP DOI BibTeX RDF
1	Dieter Mitsche, Guillem Perarnau	On the treewidth and related parameters of random geometric graphs.	STACS	2012	DBLP DOI BibTeX RDF
1	R. Ravi 0001	Iterative Methods in Combinatorial Optimization (Invited Talk).	STACS	2012	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Casper Kejlberg-Rasmussen	Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property.	STACS	2012	DBLP DOI BibTeX RDF
1	Andris Ambainis	Variable time amplitude amplification and quantum algorithms for linear algebra problems.	STACS	2012	DBLP DOI BibTeX RDF
1	Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001	Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid.	STACS	2012	DBLP DOI BibTeX RDF
1	Stefan Göller, Anthony Widjaja Lin	Concurrency Makes Simple Theories Hard.	STACS	2012	DBLP DOI BibTeX RDF
1	Christopher H. Broadbent	The Limits of Decidability for First Order Logic on CPDA Graphs.	STACS	2012	DBLP DOI BibTeX RDF
1	Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum	Log-supermodular functions, functional clones and counting CSPs.	STACS	2012	DBLP DOI BibTeX RDF
1	Marcin Mucha	13/9-approximation for Graphic TSP.	STACS	2012	DBLP DOI BibTeX RDF
1	Marcin Kaminski 0001, Dimitrios M. Thilikos	Contraction checking in graphs on surfaces.	STACS	2012	DBLP DOI BibTeX RDF
1	Artur Jez	Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P).	STACS	2012	DBLP DOI BibTeX RDF
1	George Giakkoupis, Thomas Sauerwald, He Sun 0001, Philipp Woelfel	Low Randomness Rumor Spreading via Hashing.	STACS	2012	DBLP DOI BibTeX RDF
1	Katarzyna E. Paluch 0001, Khaled M. Elbassioni, Anke van Zuylen	Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem.	STACS	2012	DBLP DOI BibTeX RDF
1	Kai-Min Chung, Henry Lam, Zhenming Liu, Michael Mitzenmacher	Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified.	STACS	2012	DBLP DOI BibTeX RDF
1	Carsten Witt	Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation.	STACS	2012	DBLP DOI BibTeX RDF
1	Faried Abu Zaid, Erich Grädel, Lukasz Kaiser	The Field of Reals is not omega-Automatic.	STACS	2012	DBLP DOI BibTeX RDF
1	Robert Ganian, Petr Hlinený, Alexander Langer, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar	Lower Bounds on the Complexity of MSO_1 Model-Checking.	STACS	2012	DBLP DOI BibTeX RDF
1	Pawel Gawrychowski	Tying up the loose ends in fully LZW-compressed pattern matching.	STACS	2012	DBLP DOI BibTeX RDF
1	Hervé Fournier, Guillaume Malod, Stefan Mengel	Monomials in arithmetic circuits: Complete problems in the counting hierarchy.	STACS	2012	DBLP DOI BibTeX RDF
1	Wolfgang Merkle, Jason Teutsch	Constant compression and random weights.	STACS	2012	DBLP DOI BibTeX RDF
1	Olivier Finkel	The Determinacy of Context-Free Games.	STACS	2012	DBLP DOI BibTeX RDF
1	Pawel Parys	A Pumping Lemma for Pushdown Graphs of Any Level.	STACS	2012	DBLP DOI BibTeX RDF
1	Shafi Goldwasser	Pseudo-deterministic Algorithms (Invited Talk).	STACS	2012	DBLP DOI BibTeX RDF
1	Yuval Filmus, Justin Ward	The Power of Local Search: Maximum Coverage over a Matroid.	STACS	2012	DBLP DOI BibTeX RDF
1	Hung Q. Ngo 0001, Ely Porat, Atri Rudra	Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion.	STACS	2012	DBLP DOI BibTeX RDF
1	N. S. Narayanaswamy, Venkatesh Raman 0001, M. S. Ramanujan 0001, Saket Saurabh 0001	LP can be a cure for Parameterized Problems.	STACS	2012	DBLP DOI BibTeX RDF
1	Christian Eggermont, Gerhard J. Woeginger	Motion planning with pulley, rope, and baskets.	STACS	2012	DBLP DOI BibTeX RDF
1	Thomas Colcombet	Forms of Determinism for Automata (Invited Talk).	STACS	2012	DBLP DOI BibTeX RDF
1	Mathieu Hoyrup	The dimension of ergodic random sequences.	STACS	2012	DBLP DOI BibTeX RDF
1	Ioannis Koutis, Alex Levin, Richard Peng	Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices.	STACS	2012	DBLP DOI BibTeX RDF
1	Volker Diekert, Jürn Laun, Alexander Ushakov	Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P.	STACS	2012	DBLP DOI BibTeX RDF
1	Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson	Linear-Space Data Structures for Range Mode Query in Arrays.	STACS	2012	DBLP DOI BibTeX RDF
1	André Arnold, Henryk Michalewski, Damian Niwinski	On the separation question for tree languages.	STACS	2012	DBLP DOI BibTeX RDF
1	Mikolaj Bojanczyk, Szymon Torunczyk	Weak MSO+U over infinite trees.	STACS	2012	DBLP DOI BibTeX RDF
1	Benjamin Doerr, Carola Winzen	Playing Mastermind With Constant-Size Memory.	STACS	2012	DBLP DOI BibTeX RDF
1	Christoph Dürr, Thomas Wilke (eds.)	29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France	STACS	2012	DBLP BibTeX RDF
1	Tomás Brázdil, Stefan Kiefer	Stabilization of Branching Queueing Networks.	STACS	2012	DBLP DOI BibTeX RDF
1	Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001	Edge-disjoint Odd Cycles in 4-edge-connected Graphs.	STACS	2012	DBLP DOI BibTeX RDF
1	Michael Elberfeld, Andreas Jakoby, Till Tantau	Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth.	STACS	2012	DBLP DOI BibTeX RDF
1	Sanjay Jain 0001, Efim B. Kinber	Mind Change Speed-up for Learning Languages from Positive Data.	STACS	2012	DBLP DOI BibTeX RDF
1	Justin Ward	A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems.	STACS	2012	DBLP DOI BibTeX RDF
1	Laurent Bienvenu, Rupert Hölzl 0001, Joseph S. Miller, André Nies	The Denjoy alternative for computable functions.	STACS	2012	DBLP DOI BibTeX RDF
1	Antoine Durand-Gasselin, Peter Habermehl	Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree.	STACS	2012	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach	Parameterized Complexity of Connected Even/Odd Subgraph Problems.	STACS	2012	DBLP DOI BibTeX RDF
1	Kei Kimura, Kazuhisa Makino	Trichotomy for Integer Linear Systems Based on Their Sign Patterns.	STACS	2012	DBLP DOI BibTeX RDF
1	Paul S. Bonsma	Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces.	STACS	2012	DBLP DOI BibTeX RDF
1	Andreas Bärtschi, Subhash Suri	Conflict-free Chromatic Art Gallery Coverage.	STACS	2012	DBLP DOI BibTeX RDF
1	Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani	On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data.	STACS	2011	DBLP DOI BibTeX RDF
1	Jonathan A. Kelner, Alex Levin	Spectral Sparsification in the Semi-Streaming Setting.	STACS	2011	DBLP DOI BibTeX RDF
1	Thomas Schwentick, Christoph Dürr (eds.)	28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany	STACS	2011	DBLP BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh 0001	Hitting forbidden minors: Approximation and Kernelization.	STACS	2011	DBLP DOI BibTeX RDF
1	Jiun-Jie Wang, Xin He	Compact Visibility Representation of Plane Graphs.	STACS	2011	DBLP DOI BibTeX RDF
1	Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons 0001, Evgenij Thorstensen	Structural Decomposition Methods and What They are Good For.	STACS	2011	DBLP DOI BibTeX RDF
1	Pawel Parys	Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata.	STACS	2011	DBLP DOI BibTeX RDF
1	Francine Blanchet-Sadri, John Lensmire	On Minimal Sturmian Partial Words.	STACS	2011	DBLP DOI BibTeX RDF
1	Jakub Kallas, Manfred Kufleitner, Alexander Lauser	First-order Fragments with Successor over Infinite Words.	STACS	2011	DBLP DOI BibTeX RDF
1	Timon Hertli, Robin A. Moser, Dominik Scheder	Improving PPSZ for 3-SAT using Critical Variables.	STACS	2011	DBLP DOI BibTeX RDF
1	Maxim A. Babenko, Alexey Gusakov	New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs.	STACS	2011	DBLP DOI BibTeX RDF
1	Martin Mundhenk, Felix Weiß	The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete.	STACS	2011	DBLP DOI BibTeX RDF
1	Haim Kaplan, Yahav Nussbaum	Minimum s-t cut in undirected planar graphs when the source and the sink are close.	STACS	2011	DBLP DOI BibTeX RDF
1	Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger	Analysis of multi-stage open shop processing systems.	STACS	2011	DBLP DOI BibTeX RDF

Publications at "STACS"( http://dblp.L3S.de/Venues/STACS )