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
1Chris Köcher Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan 0001 Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rolf Niedermeier, Brigitte Vallée (eds.) 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France Search on Bibsonomy STACS The full citation details ... 2018 DBLP  BibTeX  RDF
1Gökalp Demirci, Henry Hoffmann, David H. K. Kim Approximation Algorithms for Scheduling with Resource and Precedence Constraints. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Shenwei Huang, Daniël Paulusma Colouring Square-Free Graphs without Long Induced Paths. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dmitry Kosolobov Relations Between Greedy and Bit-Optimal LZ77 Encodings. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, Sebastian Ordyniak Small Resolution Proofs for QBF using Dependency Treewidth. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Patrick Gardy, Patricia Bouyer, Nicolas Markey Dependences in Strategy Logic. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marco Bressan 0002, Enoch Peserico, Luca Pretto On Approximating the Stationary Distribution of Time-reversible Markov Chains. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Luttenberger, Raphaela Palenta, Helmut Seidl Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Gerhard J. Woeginger The Open Shop Scheduling Problem. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Ganian, Fabian Klute, Sebastian Ordyniak On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Roei Tell Lower Bounds on Black-Box Reductions of Hitting to Density Estimation. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1John M. Hitchcock, Hadi Shafei Nonuniform Reductions and NP-Completeness. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christoph Berkholz The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya Upper and Lower Bounds for Dynamic Data Structures on Strings. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benoît Larose, Barnaby Martin, Daniël Paulusma Surjective H-Colouring over Reflexive Digraphs. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bruno Salvy Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aayush Rajasekaran, Jeffrey O. Shallit, Tim Smith Sums of Palindromes: an Approach via Automata. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1László Egri, Dániel Marx, Pawel Rzazewski Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Debarati Das 0001, Michal Koucký 0001, Michael E. Saks Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs All Classical Adversary Methods are Equivalent for Total Functions. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Filip Mazowiecki, Cristian Riveros Pumping Lemmas for Weighted Automata. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sven Jäger 0001, Martin Skutella Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stanislav Böhm, Stefan Göller, Simon Halfon, Piotr Hofman On Büchi One-Counter Automata. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell 0001 Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal 0001, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Split Contraction: The Untold Story. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jack H. Lutz, Neil Lutz Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dmitry Chistikov 0001, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit Fractional Coverings, Greedy Coverings, and Rectifier Networks. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Suman K. Bera 0001, Amit Chakrabarti Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dusan Knop, Martin Koutecký, Matthias Mnich Voting and Bribing in Single-Exponential Time. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan 0001 On Polynomial Approximations Over Z/2^kZ*. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Antoine Joux Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk). Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marianne Akian, Stéphane Gaubert, Julien Grand-Clément, Jérémie Guillaud The Operator Approach to Entropy Games. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald Multiple Random Walks on Paths and Grids. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota 0001, Charles Paperman Separability of Reachability Sets of Vector Addition Systems. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Aleksi Saarela Word Equations Where a Power Equals a Product of Powers. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mohit Garg 0003, Jaikumar Radhakrishnan Set Membership with Non-Adaptive Bit Probes. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Stephan Kreutzer, Roman Rabinovich 0001, Sebastian Siebertz, Grischa Weberstädt Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh 0001, Meirav Zehavi Matrix Rigidity from the Viewpoint of Parameterized Complexity. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán Parameterized Complexity of Small Weight Automorphisms. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marius Zimand List Approximation for Increasing Kolmogorov Complexity. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Piotr Sankowski, Karol Wegrzycki Improved Distance Queries and Cycle Counting by Frobenius Normal Form. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Stéphane Le Roux 0001, Arno Pauly, Jean-François Raskin Minkowski Games. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Qian Li 0012, Xiaoming Sun 0001 On the Sensitivity Complexity of k-Uniform Hypergraph Properties. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Juha Kontinen Computational Aspects of Logics in Team Semantics (Tutorial). Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Mikolaj Bojanczyk, Michal Pilipczuk Optimizing Tree Decompositions in MSO. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Heribert Vollmer, Brigitte Vallée (eds.) 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany Search on Bibsonomy STACS The full citation details ... 2017 DBLP  BibTeX  RDF
1Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bernd Finkbeiner, Martin Zimmermann 0002 The First-Order Logic of Hyperproperties. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Radu Curticapean, Holger Dell, Marc Roth Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti What Can Be Verified Locally?. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Maciej Skorski Lower Bounds on Key Derivation for Square-Friendly Applications. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Till Tantau Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk). Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov 0001 On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký 0001, Bruno Loff, Sagnik Mukhopadhyay Lower Bounds for Elimination via Weak Regularity. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Lin Chen 0009, Dániel Marx, Deshi Ye, Guochuan Zhang Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dominik D. Freydenberger, Markus L. Schmid Deterministic Regular Expressions with Back-References. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Petr Gregor, Torsten Mütze Trimming and Gluing Gray Codes. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Peter Høyer, Mojtaba Komeili Efficient Quantum Walk on the Grid with Multiple Marked Elements. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorák 0001, Daniel Král, Bojan Mohar Graphic TSP in Cubic Graphs. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andreas Bärtschi, Jérémie Chalopin, Shantanu Das 0001, Yann Disser, Daniel Graf 0001, Jan Hackfeld, Paolo Penna Energy-Efficient Delivery by Heterogeneous Mobile Agents. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Samuel Jacob van Gool, Benjamin Steinberg Pro-Aperiodic Monoids via Saturated Models. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Vasco Brattka, Rupert Hölzl 0001, Rutger Kuyper Monte Carlo Computability. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Titouan Carette, Mathieu Laurière, Frédéric Magniez Extended Learning Graphs for Triangle Finding. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Zdenek Dvorák 0001, Bernard Lidický Independent Sets near the Lower Bound in Bounded Degree Graphs. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Kompatscher, Van Trung Pham A Complexity Dichotomy for Poset Constraint Satisfaction. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Artur Jez Recompression: New Approach to Word Equations and Context Unification (Invited Talk). Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski Complexity of Token Swapping and its Variants. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Arnaud Carayol, Stefan Göller On Long Words Avoiding Zimin Patterns. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Gaétan Richard On the Synchronisation Problem over Cellular Automata. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein Improved Time-Space Trade-Offs for Computing Voronoi Diagrams. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alexander S. Kulikov, Vladimir V. Podolskii Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé On the Complexity of Partial Derivatives. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Marios Mavronicolas Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Paul Gallot, Anca Muscholl, Gabriele Puppis, Sylvain Salvati On the Decomposition of Finite-Valued Streaming String Transducers. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yann Disser, Stefan Kratsch Robust and Adaptive Search. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Eldar Fischer, Oded Lachish, Yadu Vasudev Improving and Extending the Testing of Distributions for Shape-Restricted Properties. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Robert Ganian, M. S. Ramanujan 0001, Stefan Szeider Combining Treewidth and Backdoors for CSP. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey Circuit Evaluation for Finite Semirings. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Shahrzad Haddadan, Peter Winkler 0001 Mixing of Permutations by Biased Transposition. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur On the Size of Lempel-Ziv and Lyndon Factorizations. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Markus Lohrey, Georg Zetzsche The Complexity of Knapsack in Graph Groups. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Virginia Vassilevska Williams Fine-Grained Algorithms and Complexity (Invited Talk). Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Laure Daviaud, Denis Kuperberg, Jean-Éric Pin Varieties of Cost Functions. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Christoph Haase, Piotr Hofman Tightening the Complexity of Equivalence Problems for Commutative Grammars. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1S. Akshay 0001, Blaise Genest, Bruno Karelovic, Nikhil Vyas 0001 On Regularity of Unary Probabilistic Automata. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Marios Mavronicolas A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Peter Jonsson, Van Trung Pham The Complexity of Phylogeny Constraint Satisfaction. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang 0001 Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Gerth Stølting Brodal External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea Efficiently Finding All Maximal alpha-gapped Repeats. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Arnaud Mary, Yann Strozecki Efficient Enumeration of Solutions Produced by Closure Operations. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick Bottleneck Paths and Trees and Deterministic Graphical Games. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos Time-Approximation Trade-offs for Inapproximable Problems. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Achim Blumensath, Thomas Colcombet, Pawel Parys On a Fragment of AMSO and Tiling Systems. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michal Pilipczuk, Marcin Wrochna On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Timo Kötzing, Martin Schirneck Towards an Atlas of Computational Learning Theory. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh 0001 Editing to Connected f-Degree Graph. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
Displaying result #401 - #500 of 2265 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][>>]
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