| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Frédérique Bassino, Julien David, Andrea Sportiello |
Asymptotic enumeration of Minimal Automata.  |
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 | 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 | Yuval Filmus, Justin Ward |
The Power of Local Search: Maximum Coverage over a Matroid. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Katarzyna E. Paluch, Khaled M. Elbassioni, Anke van Zuylen |
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel |
Low Randomness Rumor Spreading via Hashing. |
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 | László Babai, Youming Qiao |
Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers. |
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 | N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh |
LP can be a cure for Parameterized Problems. |
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 | Gerth Stølting Brodal, Casper Kejlberg-Rasmussen |
Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bonsma |
Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces. |
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 | Marcin Kaminski, Dimitrios M. Thilikos |
Contraction checking in graphs on surfaces. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ning Chen |
On Computing Pareto Stable Assignments. |
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 | Kei Kimura, Kazuhisa Makino |
Trichotomy for Integer Linear Systems Based on Their Sign Patterns. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Brázdil, Stefan Kiefer |
Stabilization of Branching Queueing Networks. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | R. Ravi |
Iterative Methods in Combinatorial Optimization (Invited Talk). |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjay Jain, Efim B. Kinber |
Mind Change Speed-up for Learning Languages from Positive Data. |
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 | Shafi Goldwasser |
Pseudo-deterministic Algorithms (Invited Talk). |
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 | Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari |
Improved Bounds for Bipartite Matching on Surfaces. |
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 | Mathieu Hoyrup |
The dimension of ergodic random sequences. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Mucha |
13/9-approximation for Graphic TSP. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Merkle, Jason Teutsch |
Constant compression and random weights. |
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 | Michael Elberfeld, Andreas Jakoby, Till Tantau |
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Finkel |
The Determinacy of Context-Free Games. |
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 | Dieter Mitsche, Guillem Perarnau |
On the treewidth and related parameters of random geometric graphs. |
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 | Andreas Bärtschi, Subhash Suri |
Conflict-free Chromatic Art Gallery Coverage. |
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 | Thomas Colcombet |
Forms of Determinism for Automata (Invited Talk). |
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 | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
Edge-disjoint Odd Cycles in 4-edge-connected Graphs. |
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 | Pawel Parys |
A Pumping Lemma for Pushdown Graphs of Any Level. |
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 | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. |
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 | Pawel Gawrychowski |
Tying up the loose ends in fully LZW-compressed pattern matching. |
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 | Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan |
Preemptive and Non-Preemptive Generalized Min Sum Set Cover. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, André Nies |
The Denjoy alternative for computable functions. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Emil Feldmann, Luca Foschini |
Balanced Partitions of Trees and Applications. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger |
On Randomness in Hash Functions (Invited Talk). |
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 | Marc Thurley |
An Approximation Algorithm for #k-SAT. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hung Q. Ngo, Ely Porat, Atri Rudra |
Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. |
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 | 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 | Benjamin Doerr, Carola Winzen |
Playing Mastermind With Constant-Size Memory. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Szymon Torunczyk |
Weak MSO+U over infinite trees. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoming Sun, Chengu Wang |
Randomized Communication Complexity for Linear Algebra Problems over Finite Fields. |
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 | 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 | Hubert Comon-Lundh, Véronique Cortier |
How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Schwentick, Christoph Dürr |
Frontmatter, Table of Contents, Preface, Conference Organization. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik D. Freydenberger |
Extended Regular Expressions: Succinctness and Decidability. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ganian, Petr Hlinený, Jan Obdrzálek |
Clique-width: When Hard Does Not Mean Impossible. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh |
Hitting forbidden minors: Approximation and Kernelization. |
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 | Liah Kor, Amos Korman, David Peleg |
Tight Bounds For Distributed MST Verification. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Gulan |
Graphs Encoded by Regular Expressions. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex Borello, Gaétan Richard, Véronique Terrier |
A speed-up of oblivious multi-head finite automata by cellular automata. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | George Giakkoupis |
Tight bounds for rumor spreading in graphs of a given conductance. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrey Yu. Rumyantsev |
Everywhere complex sequences and the probabilistic method. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bart M. P. Jansen, Hans L. Bodlaender |
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee |
Scheduling for Weighted Flow Time and Energy with Rejection Penalty. |
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 | Christian Eggermont, Alexander Schrijver, Gerhard J. Woeginger |
Analysis of multi-stage open shop processing systems. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dariusz Dereniowski |
From Pathwidth to Connected Pathwidth. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Bienvenu, Wolfgang Merkle, André Nies |
Solovay functions and K-triviality. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer |
Telling convex from reflex allows to map a polygon. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Knauer, Hans Raj Tiwary, Daniel Werner |
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nazim Fatès |
Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Youming Qiao, Jayalal M. N. Sarma, Bangsheng Tang |
On Isomorphism Testing of Groups with Normal Hall Subgroups. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonios Antoniadis, Falk Hüffner, Pascal Lenzner, Carsten Moldenhauer, Alexander Souza |
Balanced Interval Coloring. |
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 | George B. Mertzios |
The Recognition of Triangle Graphs. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ana Busic, Jean Mairesse, Irene Marcovici |
Probabilistic cellular automata, invariant measures, and perfect sampling. |
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 | Timon Hertli, Robin A. Moser, Dominik Scheder |
Improving PPSZ for 3-SAT using Critical Variables. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Segoufin, Szymon Torunczyk |
Automata based verification over linearly ordered data domains. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Childs, Robin Kothari |
Quantum query complexity of minor-closed graph properties. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler |
Analysis of Agglomerative Clustering. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, David Richerby |
The #CSP Dichotomy is Decidable. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Heng Guo, Sangxia Huang, Pinyan Lu, Mingji Xia |
The Complexity of Weighted Boolean #CSP Modulo k. |
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 | Anna Gál, Andrew Mills |
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Balder ten Cate, Luc Segoufin |
Unary negation. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew McGregor, Atri Rudra, Steve Uurtamo |
Polynomial Fitting of Data Streams with Applications to Codeword Testing. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Christian Scheideler |
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen |
Structural Decomposition Methods and What They are Good For. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")