The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

URL (DBLP): http://dblp.uni-trier.de/db/conf/stacs

Publication years (Num. hits)
1984 (31) 1985 (37) 1986 (31) 1987 (48) 1988 (44) 1989 (52) 1990 (27) 1991 (52) 1992 (57) 1993 (72) 1994 (64) 1995 (57) 1996 (55) 1997 (50) 1998 (55) 1999 (55) 2000 (55) 2001 (50) 2002 (54) 2003 (61) 2004 (58) 2005 (58) 2006 (58) 2007 (60) 2008 (60) 2009 (59) 2010 (60) 2011 (59) 2012 (60) 2013 (61) 2014 (59) 2015 (62) 2016 (60) 2017 (60) 2018 (60) 2019 (61) 2020 (62) 2021 (61) 2022 (62) 2023 (57) 2024 (61)
Publication types (Num. hits)
inproceedings(2225) proceedings(40)
Venues (Conferences, Journals, ...)
STACS(2265)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 336 occurrences of 235 keywords

Results
Found 2265 publication records. Showing 2265 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Michael Kowalczyk, Jin-yi Cai Holant Problems for Regular Graphs with Complex Edge Functions. Search on Bibsonomy STACS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Angelo Montanari, Gabriele Puppis, Pietro Sala, Guido Sciavicco Decidability of the Interval Temporal Logic ABB over the Natural Numbers. Search on Bibsonomy STACS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jean-Yves Marion, Thomas Schwentick (eds.) 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France Search on Bibsonomy STACS The full citation details ... 2010 DBLP  BibTeX  RDF
1Fedor V. Fomin, Yngve Villanger Finding Induced Subgraphs via Minimal Triangulations. Search on Bibsonomy STACS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Lance Fortnow, Jack H. Lutz, Elvira Mayordomo Inseparability and Strong Hypotheses for Disjoint NP Pairs. Search on Bibsonomy STACS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Fabian Kuhn Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam The Price of Anarchy in Cooperative Network Creation Games. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Nathalie Aubrun, Mathieu Sablik An Order on Sets of Tilings Corresponding to an Order on Languages. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Partha Mukhopadhyay Quantum Query Complexity of Multilinear Identity Testing. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Babak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy Computing Graph Roots Without Short Cycles. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Susanne Albers, Jean-Yves Marion Preface - 26th International Symposium on Theoretical Aspects of Computer Science. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx Enumerating Homomorphisms. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mikolaj Bojanczyk Weak MSO with the Unbounding Quantifier. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Stefan Kratsch Polynomial Kernelizations for MIN F+Pi1 and MAX NP. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mustaq Ahmed, Anna Lubiw Shortest Paths Avoiding Forbidden Subpaths. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Manfred Kufleitner Fragments of First-Order Logic over Infinite Words. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Václav Brozek, Antonín Kucera 0001, Jan Obdrzálek Qualitative Reachability in Stochastic BPA Games. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sven Schewe Büchi Complementation Made Tight. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1François Le Gall Efficient Isomorphism Testing for a Class of Group Extensions. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos Approximating Acyclicity Parameters of Sparse Hypergraphs. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mahdi Cheraghchi, Amin Shokrollahi Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo A Polynomial Kernel for Multicut in Trees. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ho-Leung Chan, Jeff Edmonds, Tak Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, Kirk Pruhs Nonclairvoyant Speed Scaling for Flow and Energy. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Daniel Kirsten, Sylvain Lombardy Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Bodo Manthey On Approximating Multi-Criteria TSP. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jean-Eric Pin Profinite Methods in Automata Theory. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Glencora Borradaile, Erik D. Demaine, Siamak Tazari Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Joël Alwen, Chris Peikert Generating Shorter Bases for Hard Random Lattices. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Florian Horn 0001 Random Fruits on the Zielonka Tree. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Wouter Gelade, Marcel Marquardt, Thomas Schwentick The Dynamic Complexity of Formal Languages. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Victor Chepoi, Morgan Seston An Approximation Algorithm for linfinity Fitting Robinson Structures to Distances. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Gianni Franceschini, Roberto Grossi, S. Muthukrishnan 0001 Optimal Cache-Aware Suffix Selection. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dániel Marx Tractable Structures for Constraint Satisfaction with Truth Tables. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sourav Chakraborty 0001, Eldar Fischer, Arie Matsliah, Raphael Yuster Hardness and Algorithms for Rainbow Connectivity. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Juraj Hromkovic, Georg Schnitger Ambiguity and Communication. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Gad M. Landau, Shir Landau, Oren Weimann A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Laurent Bienvenu, Rod Downey Kolmogorov Complexity and Solovay Functions. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Susanne Albers, Jean-Yves Marion (eds.) 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings Search on Bibsonomy STACS The full citation details ... 2009 DBLP  BibTeX  RDF
1Eda Baykan, Monika Henzinger, Stefan F. Keller, Sebastian De Castelberg, Markus Kinzler A Comparison of Techniques for Sampling Web Pages. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Leslie Ann Goldberg, Martin Grohe, Mark Jerrum, Marc Thurley A Complexity Dichotomy for Partition Functions with Mixed Signs. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible 0001, Saket Saurabh 0001, Yngve Villanger Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Julien Clément 0001, Maxime Crochemore, Giuseppina Rindone Reverse Engineering Prefix Tables. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Nicole Schweikardt Lower Bounds for Multi-Pass Processing of Multiple Data Streams. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Szczepan Hummel, Henryk Michalewski, Damian Niwinski On the Borel Inseparability of Game Tree Languages. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao 0001 More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Alain Finkel, Jean Goubault-Larrecq Forward Analysis for WSTS, Part I: Completions. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ronald de Wolf Error-Correcting Data Structures. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Pietro di Lena, Luciano Margara Undecidable Properties of Limit Set Dynamics of Cellular Automata. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Artur Jez, Alexander Okhotin Equations over Sets of Natural Numbers with Addition Only. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija Improved Approximations for Guarding 1.5-Dimensional Terrains. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Robert Elsässer, Thomas Sauerwald Cover Time and Broadcast Time. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jérémy Barbay, Gonzalo Navarro 0001 Compressed Representations of Permutations, and Applications. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1André Gronemeier Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jop Briët, Ronald de Wolf Locally Decodable Quantum Codes. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tomás Ebenlendr, Jirí Sgall Semi-Online Preemptive Scheduling: One Algorithm for All Variants. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Frédérique Bassino, Julien David, Cyril Nicaud On the Average Complexity of Moore's State Minimization Algorithm. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier A Generalization of Nemhauser and Trotter's Local Optimization Theorem. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Lutz Schröder, Dirk Pattinson Strong Completeness of Coalgebraic Modal Logics. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Kenya Ueno A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Arnab Bhattacharyya 0001, Victor Chen, Madhu Sudan 0001, Ning Xie 0002 Testing Linear-Invariant Non-Linear Properties. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Péter Gács, Mathieu Hoyrup, Cristobal Rojas Randomness on Computable Probability Spaces - A Dynamical Point of View. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Marius Zimand Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Matthias Englert, Heiko Röglin, Jacob Spönemann, Berthold Vöcking Economical Caching. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Laurent Boyer 0001, Guillaume Theyssier On Local Symmetries and Universality in Cellular Automata. Search on Bibsonomy STACS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff 0001 Trimming of Graphs, with Application to Point Labeling. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Javier Esparza, Stefan Kiefer, Michael Luttenberger Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, Marcus Schaefer 0001 On the Induced Matching Problem. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Filip Murlak Weak index versus Borel rank. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Chao Chen 0012, Daniel Freedman Quantifying Homology Classes. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Chandan Saha 0001 Factoring Polynomials over Finite Fields using Balance Test. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Thomas Thierauf, Fabian Wagner The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Wouter Gelade, Frank Neven Succinctness of the Complement and Intersection of Regular Expressions. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Sambuddha Roy Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Iyad A. Kanj, Ljubomir Perkovic On Geometric Spanners of Euclidean and Unit Disk Graphs. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Venkatesan T. Chakaravarthy, Sambuddha Roy Finding Irrefutable Certificates for S2p via Arthur and Merlin. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jean-Eric Pin, Pedro V. Silva A Mahler's theorem for functions from words to integers. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jacques Sakarovitch, Rodrigo de Souza On the decomposition of k-valued rational relations. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Johan M. M. van Rooij, Hans L. Bodlaender Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Patrick Briest, Martin Hoefer 0001, Piotr Krysta Stackelberg Network Pricing Games. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Susanne Albers, Pascal Weil Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Sören Laue Geometric Set Cover and Hitting Sets for Polytopes in R3. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jui-Yi Kao, Jeffrey O. Shallit, Zhi Xu 0002 The Frobenius Problem in a Free Monoid. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Dietrich Kuske Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie Minimizing Flow Time in the Wireless Gathering Problem. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Pinyan Lu, Changyuan Yu An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Alexander Okhotin, Artur Jez Complexity of solutions of equations over sets of natural numbers. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christian Glaßer, Heinz Schmitz, Victor L. Selivanov Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Markus Bläser, Christian Hoffmann 0001 On the Complexity of the Interlace Polynomial. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Angsheng Li, Mingji Xia A Theory for Valiant's Matchcircuits (Extended Abstract). Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Shachar Lovett Lower bounds for adaptive linearity tests. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Susanne Albers, Pascal Weil (eds.) STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings Search on Bibsonomy STACS The full citation details ... 2008 DBLP  BibTeX  RDF
1Thomas Schwentick A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract). Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Mirela Damian, Robin Y. Flatland, Joseph O'Rourke, Suneeta Ramaswami Connecting Polygonizations via Stretches and Twangs. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Diana Fischer, Erich Grädel, Lukasz Kaiser Model Checking Games for the Quantitative µ-Calculus. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Maxime Crochemore, Lucian Ilie Understanding Maximal Repetitions in Strings. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto Trimmed Moebius Inversion and Graphs of Bounded Degree. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Ulrich Meyer 0001 On Dynamic Breadth-First Search in External-Memory. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Susanne Albers, Pascal Weil Preface - 25th International Symposium on Theoretical Aspects of Computer Science. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Mariano Zelke Weighted Matching in the Semi-Streaming Model. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Edith Hemaspaandra, Henning Schnoor On the Complexity of Elementary Modal Logics. Search on Bibsonomy STACS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
Displaying result #901 - #1000 of 2265 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license