| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | John Fearnley, Oded Lachish |
Parity Games on Graphs with Medium Tree-Width.  |
MFCS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jianxin Wang 0001, Yongjie Yang 0001, Jiong Guo, Jianer Chen |
Linear Problem Kernels for Planar Graph Problems with Small Distance Property. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Kirsten |
Some Variants of the Star Height Problem. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Puchala, Roman Rabinovich 0001 |
Parity Games with Partial Information Played on Graphs of Bounded Complexity. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Puchala |
Asynchronous Omega-Regular Games with Partial Information. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle |
Faster Algorithms on Branch and Clique Decompositions. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Boyer 0001, Guillaume Theyssier |
On Factor Universality in Symbolic Spaces. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Carraro, Thomas Ehrhard, Antonino Salibra |
Resource Combinatory Algebras. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Szczepan Hummel, Michal Skrzypczak, Szymon Torunczyk |
On the Topological Complexity of MSO+U and Related Automata Models. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Ingmar Meinecke |
Describing Average- and Longtime-Behavior by Weighted MSO Logics. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshifumi Manabe, Tatsuaki Okamoto |
Meta-Envy-Free Cake-Cutting Protocols. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ho-Lun Cheng, Ke Yan 0001 |
Mesh Deformation of Dynamic Smooth Manifolds with Surface Correspondences. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
Least and Greatest Solutions of Equations over Sets of Integers. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Olschewski, Michael Ummels |
The Complexity of Finding Reset Words in Finite Automata. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Laurent Doyen 0001, Thomas A. Henzinger |
Qualitative Analysis of Partially-Observable Markov Decision Processes. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Schnoebelen |
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Chatzigiannakis, Othon Michail, Stavros Nikolaou, Andreas Pavlogiannis, Paul G. Spirakis |
All Symmetric Predicates in NSPACE(n2) Are Stably Computable by the Mediated Population Protocol Model. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulio Manzonetto, Paolo Tranquilli |
Harnessing MLF with the Power of System F. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yann Strozecki |
Enumeration of the Monomials of a Polynomial and Related Complexity Classes. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien David |
The Average Complexity of Moore's State Minimization Algorithm Is O(n log log n). |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gaëlle Fontaine, Thomas Place |
Frame Definability for Classes of Trees in the µ-calculus. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Praveen |
Does Treewidth Help in Modal Satisfiability? - (Extended Abstract). |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Luciano Gualà, Guido Proietti |
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo P. Fiore, Ola Mahmoud |
Second-Order Algebraic Theories - (Extended Abstract). |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman 0001, Bal Sri Shankar |
Solving minones-2-sat as Fast as vertex cover. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadja Betzler |
On Problem Kernels for Possible Winner Determination under the k-Approval Protocol. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Rastislav Královic, Richard Královic |
Information Complexity of Online Problems. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jurek Czyzowicz, Adrian Kosowski, Andrzej Pelc |
Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, Adam J. Friedlander |
Counting Minimum (s, t)-Cuts in Weighted Planar Graphs in Polynomial Time. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Grenet, Pascal Koiran, Natacha Portier |
The Multivariate Resultant Is NP-hard in Any Characteristic. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Guillemot, Florian Sikora |
Finding and Counting Vertex-Colored Subtrees. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot |
Properties of Visibly Pushdown Transducers. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin |
Online Clustering with Variable Sized Clusters. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenya Ueno |
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Unambiguous Finite Automata over a Unary Alphabet. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gero Greiner, Riko Jacob |
Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov 0001 |
Slowly Synchronizing Automata and Digraphs. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker |
Distance Constraint Satisfaction Problems. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Siamak Tazari |
Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Luciano Gualà, Guido Proietti |
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bahareh Badban, Mohammad Torabi Dashti |
Semi-linear Parikh Images of Regular Expressions via Reduction. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bojan Mohar |
Do We Really Understand the Crossing Numbers? |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | László Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun 0001 |
Weights of Exact Threshold Functions. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
New Developments in Quantum Algorithms. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Bendich, Herbert Edelsbrunner, Michael Kerber, Amit K. Patel |
Persistent Homology under Non-uniform Error. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov |
Algorithmic Lower Bounds for Problems on Decomposable Graphs. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Beate Bollig |
Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jing He 0009, Hongyu Liang, Jayalal Sarma |
Limiting Negations in Bounded Treewidth and Upward Planar Circuits. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amaldev Manuel |
Two Variables and Two Successors. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Bournez, Daniel Silva Graça, Emmanuel Hainry |
Robust Computations with Dynamical Systems. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Counting Dependent and Independent Strings. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Subrahmanyam Kalyanasundaram, Richard J. Lipton, Kenneth W. Regan, Farbod Shokrieh |
Improved Simulation of Nondeterministic Turing Machines. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Laurent Doyen 0001, Hugo Gimbert, Thomas A. Henzinger |
Randomness for Free. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Naoyuki Kamiyama |
The Prize-Collecting Edge Dominating Set Problem in Trees. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marius Zimand |
Impossibility of Independence Amplification in Kolmogorov Complexity Theory. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dariusz Dereniowski |
Connected Searching of Weighted Trees. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitri Akatov, Georg Gottlob |
Balanced Queries: Divide and Conquer. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh |
A dexptime-Complete Dolev-Yao Theory with Distributive Encryption. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Hanna Mazzawi |
Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin |
Iterated Regret Minimization in Game Graphs. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie |
Scheduling Real-Time Mixed-Criticality Jobs. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas 0001, Heribert Vollmer |
Counting Classes and the Fine Structure between NC1 and L. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoram Bachrach, Michael Zuckerman, Michael J. Wooldridge, Jeffrey S. Rosenschein |
Proof Systems and Transformation Games. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Antonín Kucera 0001 (eds.) |
Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kratsch, Dániel Marx, Magnus Wahlström |
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Chatzigiannakis, Othon Michail, Paul G. Spirakis |
Recent Advances in Population Protocols. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai Plociennik |
A Probabilistic PTAS for Shortest Common Superstring. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Francisco Claude, Gonzalo Navarro 0001 |
Self-indexed Text Compression Using Straight-Line Programs. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | P. Madhusudan, Mahesh Viswanathan 0001 |
Query Automata for Nested Words. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Widmayer |
How to Sort a Train. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Gaboardi, Luca Roversi, Luca Vercelli |
A By-Level Analysis of Multiplicative Exponential Linear Logic. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alessandro Bianco, Marco Faella, Fabio Mogavero, Aniello Murano |
Balanced Paths in Colored Graphs. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Diego Figueira, Luc Segoufin |
Future-Looking Logics on Data Words and Trees. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivona Bezáková, William A. Rummler |
Sampling Edge Covers in 3-Regular Graphs. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Pinar Heggernes |
Choosability of P5-Free Graphs. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sagarmoy Dutta, Piyush P. Kurur |
Representing Groups on Graphs. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Yang Xiang |
How to Use Spanning Trees to Navigate in Graphs. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas 0001, Volker Weber, Felix Weiss |
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
Post’s lattice, complexity, satisfiability, decidability, hybrid logic |
| 1 | Marco Faella |
Admissible Strategies in Infinite Games over Graphs. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Delia Kesner, Fabien Renaud |
The Prismoid of Resources. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn 0001 |
Stochastic Games with Finitary Objectives. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Schewe |
From Parity and Payoff Games to Linear Programming. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Sebastian Kuhnert |
The Isomorphism Problem for k-Trees Is Complete for Logspace. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
graph canonization, logspace completeness, graph isomorphism, space complexity, k-trees |
| 1 | Albert Atserias |
Four Subareas of the Theory of Constraints, and Their Links. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou |
Energy-Efficient Communication in Multi-interface Wireless Networks. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Giulio Manzonetto |
A General Class of Models of H*. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
?-theories, non-well-pointed categories, cpo-enriched categories, relational semantics, Approximation Theorem, ?-calculus |
| 1 | Ezra Resnick, Yoram Bachrach, Reshef Meir, Jeffrey S. Rosenschein |
The Cost of Stability in Network Flow Games. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Kufleitner, Pascal Weil |
On FO2 Quantifier Alternation over Words. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jarkko Kari, Pascal Vanier, Thomas Zeume |
Bounds on Non-surjective Cellular Automata. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Rettinger, Xizhong Zheng |
Points on Computable Curves of Computable Lengths. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Pushkar S. Joglekar |
Arithmetic Circuits, Monomial Algebras and Finite Automata. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wouter Gelade, Marc Gyssens, Wim Martens |
Regular Expressions with Counting: Weak versus Strong Determinism. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Kosowski, Alfredo Navarra |
Graph Decomposition for Improving Memoryless Periodic Exploration. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rastislav Královic, Damian Niwinski (eds.) |
Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca |
Constructing Brambles. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kohtaro Tadaki |
Partial Randomness and Dimension of Recursively Enumerable Reals. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
recursively enumerable real, partial randomness, Chaitin ? number, program-size complexity, universal probability, dimension, algorithmic randomness |
| 1 | Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland |
The Communication Complexity of Non-signaling Distributions. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Kirsten |
An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Rötteler |
Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Borchert, Pierre McKenzie, Klaus Reinhardt |
Few Product Gates But Many Zeros. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license