default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID38th MFCS 2013: Klosterneuburg, Austria
- Krishnendu Chatterjee, Jirí Sgall
:
Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings. Lecture Notes in Computer Science 8087, Springer 2013, ISBN 978-3-642-40312-5 - Sam Buss:
Alternation Trading Proofs and Their Limitations. 1-7 - Leah Epstein:
Bin Packing Games with Selfish Items. 8-21 - Jean Goubault-Larrecq:
A Constructive Proof of the Topological Kruskal Theorem. 22-41 - Martin Grohe:
Logical and Structural Approaches to the Graph Isomorphism Problem. 42 - Elias Koutsoupias:
Prior-Free Auctions of Digital Goods. 43-44 - Nir Piterman:
Synthesis from Temporal Specifications: New Applications in Robotics and Model-Driven Development. 45-49 - Eric Angel, Evripidis Bampis, Alexander V. Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos:
Clustering on k-Edge-Colored Graphs. 50-61 - Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott, José Verschae:
How to Pack Your Items When You Have to Buy Your Knapsack. 62-73 - Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare:
Computing Behavioral Distances, Compositionally. 74-85 - Sebastian Bala:
Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions? - (Extended Abstract). 86-97 - Vince Bárány, Michael Benedikt, Balder ten Cate:
Rewriting Guarded Negation Queries. 98-110 - Arnold Beckmann, Pavel Pudlák, Neil Thapen:
Parity Games and Propositional Proofs. 111-122 - Nicolas Bedon:
Logic and Branching Automata. 123-134 - Marco Bender, Clemens Thielen, Stephan Westphal:
A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items. 135-145 - Michael Benedikt, Joost Engelfriet, Sebastian Maneth:
Determinacy and Rewriting of Top-Down and MSO Tree Transformations. 146-158 - Christoph Berkholz, Oleg Verbitsky:
On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing. 159-170 - Henrik Björklund, Wim Martens, Thomas Schwentick:
Validity of Tree Pattern Queries with Respect to Schema Information. 171-182 - Piero A. Bonatti, Marco Faella, Clemente Galdi, Luigi Sauro:
Auctions for Partial Heterogeneous Preferences. 183-194 - Andreas Brandstädt, Martin Milanic, Ragnar Nevries:
New Polynomial Cases of the Weighted Efficient Domination Problem. 195-206 - Karl Bringmann:
Bringing Order to Special Cases of Klee's Measure Problem. 207-218 - Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems. 219-230 - P. Buckheister, Georg Zetzsche:
Semilinearity and Context-Freeness of Languages Accepted by Valence Automata. 231-242 - Harry Buhrman, Lance Fortnow, John M. Hitchcock, Bruno Loff:
Learning Reductions to Sparse Sets. 243-253 - Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Probabilistic Automata with Isolated Cut-Points. 254-265 - Taolue Chen, Vojtech Forejt, Marta Z. Kwiatkowska, Aistis Simaitis, Clemens Wiltsche:
On Stochastic Games with Multiple Objectives. 266-277 - Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan:
Minimal Indices for Successor Search - (Extended Abstract). 278-289 - Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. 290-301 - Wojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa:
Complexity of Checking Bisimilarity between Sequential and Parallel Processes. 302-313 - Stephane Durocher, Saeed Mehrabi:
Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results. 314-324 - Stephane Durocher, Rahul Shah, Matthew Skala, Sharma V. Thankachan:
Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees. 325-336 - Sebastian Eggert, Henning Schnoor, Thomas Wilke:
Noninterference with Local Policies. 337-348 - Amr Elmasry, Jyrki Katajainen:
In-Place Binary Counters. 349-360 - Leah Epstein, Hanan Zebedat-Haider:
Rent or Buy Problems with a Fixed Time Horizon. 361-372 - Stefan Felsner, George B. Mertzios, Irina Mustata:
On the Recognition of Four-Directional Orthogonal Ray Graphs. 373-384 - Yuan Feng, Nengkun Yu, Mingsheng Ying:
Reachability Analysis of Recursive Quantum Markov Chains. 385-396 - Martin Fink, Sergey Pupyrev:
Ordering Metro Lines by Block Crossings. 397-408 - Alain Finkel, Stefan Göller, Christoph Haase:
Reachability in Register Machines with Polynomial Updates. 409-420 - Fedor V. Fomin, Petr A. Golovach, Janne H. Korhonen:
On the Parameterized Complexity of Cutting a Few Vertices from a Graph. 421-432 - Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos:
On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant. 433-444 - Vincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge:
A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems. 445-456 - Robert Ganian, Friedrich Slivovsky, Stefan Szeider:
Meta-kernelization with Structural Parameters. 457-468 - Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko:
Separating Hierarchical and General Hub Labelings. 469-479 - Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Solving 3-Superstring in 3 n/3 Time. 480-491 - Prachi Goyal, Vikram Kamat, Neeldhara Misra:
On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. 492-503 - Leonid Gurvits:
A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums. 504-515 - Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii:
Polynomial Threshold Functions and Boolean Threshold Circuits. 516-527 - Alexander Heußner, Alexander Kartzow:
Reachability in Higher-Order-Counters. 528-539 - John M. Hitchcock, Aduri Pavan:
Length-Increasing Reductions for PSPACE-Completeness. 540-550 - Shenwei Huang:
Improved Complexity Results on k-Coloring P t -Free Graphs. 551-558 - Martin Huschenbett, Jiamou Liu:
A Polychromatic Ramsey Theory for Ordinals. 559-570 - Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara:
Detecting Regularities on Grammar-Compressed Strings. 571-582 - Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah:
Small Depth Proof Systems. 583-594 - Michal Kunc, Alexander Okhotin:
Reversibility of Computations in Graph-Walking Automata. 595-606 - Orna Kupferman, Jonathan Mosheiff:
Prime Languages. 607-618 - Dietrich Kuske:
Logical Aspects of the Lexicographic Order on 1-Counter Languages. 619-630 - Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky:
Helly Circular-Arc Graph Isomorphism Is in Logspace. 631-642 - Ranko Lazic, Joël Ouaknine, James Worrell:
Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian. 643-654 - Dexter Kozen, Radu Mardare, Prakash Panangaden:
Strong Completeness for Markovian Logics. 655-666 - Stefan Mengel:
Arithmetic Branching Programs with Memory. 667-678 - Neeldhara Misra, Fahad Panolan, Saket Saurabh:
Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule? 679-690 - Anca Muscholl, Sven Schewe:
Unlimited Decidability of Distributed Synthesis with Limited Missing Knowledge. 691-703 - Moritz Müller, Stefan Szeider:
Revisiting Space in Proof Complexity: Treewidth and Pathwidth. 704-716 - Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin:
Space-Efficient Parallel Algorithms for Combinatorial Search Problems. 717-728 - Thomas Place, Lorijn van Rooijen, Marc Zeitoun:
Separating Regular Languages by Piecewise Testable and Unambiguous Languages. 729-740 - Alexander Rabinovich:
An Unusual Temporal Logic. 741-752 - Francesco Ranzato:
A More Efficient Simulation Algorithm on Kripke Structures. 753-764 - Jens M. Schmidt:
A Planarity Test via Construction Sequences. 765-776 - Ariel Germán Fernández, Michael Soltys:
Feasible Combinatorial Matrix Theory. 777-788 - Alexander Souza:
Approximation Algorithms for Generalized Plant Location. 789-800 - Yasuhiro Takahashi, Takeshi Yamazaki, Kazuyuki Tanaka:
Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates. 801-812 - Sébastien Tavenas:
Improved Bounds for Reduction to Depth 4 and Depth 3. 813-824 - Meirav Zehavi:
Parameterized Algorithms for Module Motif. 825-836 - Thomas Zeume, Thomas Schwentick:
On the Quantifier-Free Dynamic Complexity of Reachability. 837-848
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-07-09 01:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
