Search results for "STACS"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Jan Hazla, Thomas Holenstein	Upper Tail Estimates with Combinatorial Proofs.	STACS	2015	DBLP DOI BibTeX RDF
1	Alejandro López-Ortiz, Marc P. Renault, Adi Rosén	Paid Exchanges are Worth the Price.	STACS	2015	DBLP DOI BibTeX RDF
1	Takuro Fukunaga	Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow Relaxation.	STACS	2015	DBLP DOI BibTeX RDF
1	Mathieu Hoyrup, Cristobal Rojas	On the Information Carried by Programs about the Objects They Compute.	STACS	2015	DBLP DOI BibTeX RDF
1	Paul W. Goldberg	Algorithmic Game Theory (Tutorial).	STACS	2015	DBLP DOI BibTeX RDF
1	Martin Delacourt, Benjamin Hellouin de Menibus	Construction of mu-Limit Sets of Two-dimensional Cellular Automata.	STACS	2015	DBLP DOI BibTeX RDF
1	Antonios Antoniadis 0001, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato	Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules.	STACS	2014	DBLP DOI BibTeX RDF
1	Diego Figueira, Leonid Libkin	Synchronizing Relations on Words.	STACS	2014	DBLP DOI BibTeX RDF
1	Suryajith Chillara, Partha Mukhopadhyay	Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach.	STACS	2014	DBLP DOI BibTeX RDF
1	Nicolas Bacquey	Complexity classes on spatially periodic Cellular Automata.	STACS	2014	DBLP DOI BibTeX RDF
1	Artur Jez, Markus Lohrey	Approximation of smallest linear tree grammar.	STACS	2014	DBLP DOI BibTeX RDF
1	Marek Cygan, Tomasz Kociumaka	Constant Factor Approximation for Capacitated k-Center with Outliers.	STACS	2014	DBLP DOI BibTeX RDF
1	Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski	Bounds on the Cover Time of Parallel Rotor Walks.	STACS	2014	DBLP DOI BibTeX RDF
1	Emmanuel Jeandel	Computability of the entropy of one-tape Turing machines.	STACS	2014	DBLP DOI BibTeX RDF
1	Nabil H. Mustafa, Saurabh Ray	Near-Optimal Generalisations of a Theorem of Macbeath.	STACS	2014	DBLP DOI BibTeX RDF
1	Tomohiro I, Juha Kärkkäinen, Dominik Kempa	Faster Sparse Suffix Sorting.	STACS	2014	DBLP DOI BibTeX RDF
1	Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda	Faster Compact On-Line Lempel-Ziv Factorization.	STACS	2014	DBLP DOI BibTeX RDF
1	Dániel Marx, Michal Pilipczuk	Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).	STACS	2014	DBLP DOI BibTeX RDF
1	Timo Kötzing	A Solution to Wiehagen's Thesis.	STACS	2014	DBLP DOI BibTeX RDF
1	Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha	Generalized Wong sequences and their applications to Edmonds' problems.	STACS	2014	DBLP DOI BibTeX RDF
1	Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger	Exploring Subexponential Parameterized Complexity of Completion Problems.	STACS	2014	DBLP DOI BibTeX RDF
1	Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer	Palindrome Recognition In The Streaming Model.	STACS	2014	DBLP DOI BibTeX RDF
1	Kazuo Iwama, Atsuki Nagao	Read-Once Branching Programs for Tree Evaluation Problems.	STACS	2014	DBLP DOI BibTeX RDF
1	Benoit Monin	Higher randomness and forcing with closed sets.	STACS	2014	DBLP DOI BibTeX RDF
1	Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter	Space-Efficient String Indexing for Wildcard Pattern Matching.	STACS	2014	DBLP DOI BibTeX RDF
1	Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun 0001	Balls into bins via local search: cover time and maximum load.	STACS	2014	DBLP DOI BibTeX RDF
1	Markus Lohrey, Georg Zetzsche	On Boolean closed full trios and rational Kripke frames.	STACS	2014	DBLP DOI BibTeX RDF
1	Javier Esparza	Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).	STACS	2014	DBLP DOI BibTeX RDF
1	Dmitry Gavinsky, Pavel Pudlák	Partition Expanders.	STACS	2014	DBLP DOI BibTeX RDF
1	Adeline Pierrot, Dominique Rossin	2-Stack Sorting is polynomial.	STACS	2014	DBLP DOI BibTeX RDF
1	Peter Bro Miltersen	Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk).	STACS	2014	DBLP DOI BibTeX RDF
1	Tomas Jelinek, Marcus Klaas, Guido Schäfer	Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players.	STACS	2014	DBLP DOI BibTeX RDF
1	Haris Aziz 0001, Bart de Keijzer	Shapley meets Shapley.	STACS	2014	DBLP DOI BibTeX RDF
1	André Nies	Differentiability of polynomial time computable functions.	STACS	2014	DBLP DOI BibTeX RDF
1	Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals	From Small Space to Small Width in Resolution.	STACS	2014	DBLP DOI BibTeX RDF
1	Pawel Gawrychowski, Florin Manea, Dirk Nowotka	Testing Generalised Freeness of Words.	STACS	2014	DBLP DOI BibTeX RDF
1	Martin Huschenbett, Manfred Kufleitner	Ehrenfeucht-Fraïssé Games on Omega-Terms.	STACS	2014	DBLP DOI BibTeX RDF
1	Hannes Uppman	Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains.	STACS	2014	DBLP DOI BibTeX RDF
1	Eric Angel, Evripidis Bampis, Vincent Chau	Throughput Maximization in the Speed-Scaling Setting.	STACS	2014	DBLP DOI BibTeX RDF
1	Neeraj Kayal	Arithmetic Circuit Complexity (Tutorial).	STACS	2014	DBLP DOI BibTeX RDF
1	Luc Segoufin	A glimpse on constant delay enumeration (Invited Talk).	STACS	2014	DBLP DOI BibTeX RDF
1	Júlio Araújo 0001, Nicolas Nisse, Stéphane Pérennes	Weighted Coloring in Trees.	STACS	2014	DBLP DOI BibTeX RDF
1	Bruno Bauwens	Asymmetry of the Kolmogorov complexity of online predicting odd and even bits.	STACS	2014	DBLP DOI BibTeX RDF
1	Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou	Two-Page Book Embeddings of 4-Planar Graphs.	STACS	2014	DBLP DOI BibTeX RDF
1	Francine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle	New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings.	STACS	2014	DBLP DOI BibTeX RDF
1		Frontmatter, Table of Contents, Preface, Conference Organization.	STACS	2014	DBLP DOI BibTeX RDF
1	Mathieu Hoyrup	Irreversible computable functions.	STACS	2014	DBLP DOI BibTeX RDF
1	Matthew Anderson, Anuj Dawar	On Symmetric Circuits and Fixed-Point Logics.	STACS	2014	DBLP DOI BibTeX RDF
1	Robin Kothari	An optimal quantum algorithm for the oracle identification problem.	STACS	2014	DBLP DOI BibTeX RDF
1	John C. Mitchell, Joe Zimmerman	Data-Oblivious Data Structures.	STACS	2014	DBLP DOI BibTeX RDF
1	Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin	Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games.	STACS	2014	DBLP DOI BibTeX RDF
1	Michele Scquizzato, Francesco Silvestri 0001	Communication Lower Bounds for Distributed-Memory Computations.	STACS	2014	DBLP DOI BibTeX RDF
1	Andreas Göbel 0001, Leslie Ann Goldberg, David Richerby	Counting Homomorphisms to Cactus Graphs Modulo 2.	STACS	2014	DBLP DOI BibTeX RDF
1	Yixin Cao 0001, Dániel Marx	Chordal Editing is Fixed-Parameter Tractable.	STACS	2014	DBLP DOI BibTeX RDF
1	Martin Skutella, Maxim Sviridenko, Marc Uetz	Stochastic Scheduling on Unrelated Machines.	STACS	2014	DBLP DOI BibTeX RDF
1	Yossi Azar, Matthias Englert, Iftah Gamzu, Eytan Kidron	Generalized Reordering Buffer Management.	STACS	2014	DBLP DOI BibTeX RDF
1	Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke	Randomized Online Algorithms with High Probability Guarantees.	STACS	2014	DBLP DOI BibTeX RDF
1	Ken-ichi Kawarabayashi, Mikkel Thorup	Coloring 3-colorable graphs with o(n^{1/5}) colors.	STACS	2014	DBLP DOI BibTeX RDF
1	Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller	Packing a Knapsack of Unknown Capacity.	STACS	2014	DBLP DOI BibTeX RDF
1	Marek Adamczyk, Maxim Sviridenko, Justin Ward	Submodular Stochastic Probing on Matroids.	STACS	2014	DBLP DOI BibTeX RDF
1	Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz	Online Bin Packing with Advice.	STACS	2014	DBLP DOI BibTeX RDF
1	Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner	Online Dynamic Power Management with Hard Real-Time Guarantees.	STACS	2014	DBLP DOI BibTeX RDF
1	Dung T. Nguyen, Alan L. Selman	Non-autoreducible Sets for NEXP.	STACS	2014	DBLP DOI BibTeX RDF
1	Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos	Explicit Linear Kernels via Dynamic Programming.	STACS	2014	DBLP DOI BibTeX RDF
1	Thomas Watson 0001	The Complexity of Deciding Statistical Properties of Samplable Distributions.	STACS	2014	DBLP DOI BibTeX RDF
1	Manfred Kufleitner, Alexander Lauser	Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable.	STACS	2013	DBLP DOI BibTeX RDF
1	Artur Jez	Recompression: a simple and powerful technique for word equations.	STACS	2013	DBLP DOI BibTeX RDF
1	Julien Clément 0001, Thu Hien Nguyen Thi, Brigitte Vallée	A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms.	STACS	2013	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger	Tight bounds for Parameterized Complexity of Cluster Editing.	STACS	2013	DBLP DOI BibTeX RDF
1	Luc Dartois, Charles Paperman	Two-variable first order logic with modular predicates over words.	STACS	2013	DBLP DOI BibTeX RDF
1	Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, Catalin Tiseanu	Finding Pseudo-repetitions.	STACS	2013	DBLP DOI BibTeX RDF
1	Adam Case, Jack H. Lutz	Mutual Dimension.	STACS	2013	DBLP DOI BibTeX RDF
1	Martin Huschenbett	The Rank of Tree-Automatic Linear Orderings.	STACS	2013	DBLP DOI BibTeX RDF
1	Edith Hemaspaandra, Lane A. Hemaspaandra, Curtis Menton	Search versus Decision for Election Manipulation Problems.	STACS	2013	DBLP DOI BibTeX RDF
1	Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby	The complexity of approximating conservative counting CSPs.	STACS	2013	DBLP DOI BibTeX RDF
1	Stefan Kratsch	On Polynomial Kernels for Sparse Integer Linear Programs.	STACS	2013	DBLP DOI BibTeX RDF
1	Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé	Graph coloring, communication complexity and the stubborn problem (Invited talk).	STACS	2013	DBLP DOI BibTeX RDF
1	Jisu Jeong, O-joung Kwon, Sang-il Oum	Excluded vertex-minors for graphs of linear rank-width at most k.	STACS	2013	DBLP DOI BibTeX RDF
1	Dániel Marx	Algorithmic Graph Structure Theory (Tutorial).	STACS	2013	DBLP DOI BibTeX RDF
1	Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter	Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries.	STACS	2013	DBLP DOI BibTeX RDF
1	Yonatan Bilu, Amit Daniely, Nati Linial, Michael E. Saks	On the practically interesting instances of MAXCUT.	STACS	2013	DBLP DOI BibTeX RDF
1	Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow	Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM.	STACS	2013	DBLP DOI BibTeX RDF
1	Emmanuel Jeandel, Pascal Vanier	Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type.	STACS	2013	DBLP DOI BibTeX RDF
1	Amin Karbasi, Morteza Zadimoghaddam	Constrained Binary Identification Problem.	STACS	2013	DBLP DOI BibTeX RDF
1	Meghana Nasre	Popular Matchings: Structure and Cheating Strategies.	STACS	2013	DBLP DOI BibTeX RDF
1	Marek Cygan, Fabrizio Grandoni 0001, Telikepalli Kavitha	On Pairwise Spanners.	STACS	2013	DBLP DOI BibTeX RDF
1	Florent Capelli, Arnaud Durand 0001, Stefan Mengel	The arithmetic complexity of tensor contractions.	STACS	2013	DBLP DOI BibTeX RDF
1	Magnus Wahlström	Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem.	STACS	2013	DBLP DOI BibTeX RDF
1	Yuval Ishai, Eyal Kushilevitz, Omer Strulovich	Lossy Chains and Fractional Secret Sharing.	STACS	2013	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Haitao Wang 0001	L_1 Shortest Path Queries among Polygonal Obstacles in the Plane.	STACS	2013	DBLP DOI BibTeX RDF
1	Balagopal Komarath, Jayalal Sarma	Pebbling, Entropy and Branching Program Size Lower Bounds.	STACS	2013	DBLP DOI BibTeX RDF
1	Markus Jalsenius, Benny Porat, Benjamin Sach	Parameterized Matching in the Streaming Model.	STACS	2013	DBLP DOI BibTeX RDF
1	Mikolaj Bojanczyk, Tomasz Idziaszek, Michal Skrzypczak	Regular languages of thin trees.	STACS	2013	DBLP DOI BibTeX RDF
1	Natacha Portier, Thomas Wilke (eds.)	30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany	STACS	2013	DBLP BibTeX RDF
1	Yoichi Iwata, Yuichi Yoshida	Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra.	STACS	2013	DBLP DOI BibTeX RDF
1	Albert Atserias, Sergi Oliva	Bounded-width QBF is PSPACE-complete.	STACS	2013	DBLP DOI BibTeX RDF
1	Konstantin Makarychev	Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs.	STACS	2013	DBLP DOI BibTeX RDF
1	Martijn Baartse, Klaus Meer	The PCP theorem for NP over the reals.	STACS	2013	DBLP DOI BibTeX RDF
1	Malte Darnstädt, Hans Ulrich Simon, Balázs Szörényi	Unlabeled Data Does Provably Help.	STACS	2013	DBLP DOI BibTeX RDF
1	Michal Pilipczuk	Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings.	STACS	2013	DBLP DOI BibTeX RDF

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