| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Barna Saha |
Sublinear Algorithms for Edit Distance (Invited Talk).  |
MFCS  |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Ferens, Marek Szykula, Vojtech Vorel |
Lower Bounds on Avoiding Thresholds. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Ugo Dal Lago, Reinhard Kahle, Isabel Oitavem |
A Recursion-Theoretic Characterization of the Probabilistic Class PP. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Linker, Fabio Papacchini, Michele Sevegnani |
Finite Models for a Spatial Logic with Discrete and Topological Path Operators. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahmoud Abo Khamis, Ryan R. Curtin, Sungjin Im, Benjamin Moseley, Hung Q. Ngo 0001, Kirk Pruhs, Alireza Samadian |
An Approximation Algorithm for the Matrix Tree Multiplication Problem. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Gawrychowski, Florin Manea, Stefan Siemer |
Matching Patterns with Variables Under Hamming Distance. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Fu Li, Xiong Zheng |
Maximum Votes Pareto-Efficient Allocations via Swaps on a Social Network. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy, David Peleg, R. Vijayaragunathan |
Budgeted Dominating Sets in Uncertain Graphs. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoan Géran, Bastien Laboureix, Corto Mascle, Valentin D. Richard |
Keyboards as a New Model of Computation. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay |
Equivalence Testing of Weighted Automata over Partially Commutative Monoids. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine |
Holonomic Techniques, Periods, and Decision Problems (Invited Talk). |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe |
A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk). |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Klauck, Debbie Lim |
The Power of One Clean Qubit in Communication Complexity. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Amina Doumane |
Graph Characterization of the Universal Theory of Relations. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, Philipp Zschoche |
The Complexity of Transitively Orienting Temporal Graphs. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | León Bohn, Christof Löding |
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu |
Connecting Constructive Notions of Ordinals in Homotopy Type Theory. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, Sadegh Soudjani, James Worrell 0001 |
The Pseudo-Skolem Problem is Decidable. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Grosshans |
A Note on the Join of Varieties of Monoids with LI. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddhesh Chaubal, Anna Gál |
Diameter Versus Certificate Complexity of Boolean Functions. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Ducoffe |
On Computing the Average Distance for Some Chordal-Like Graphs. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Reijo Jaakkola |
Ordered Fragments of First-Order Logic. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Keisuke Nakano 0001 |
Idempotent Turing Machines. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Achim Blumensath, Jakub Lédl |
ω-Forest Algebras and Temporal Logics. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckmann, Jérôme Urhausen, Kevin Verbeek |
Obstructing Classification via Projection. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Brianski, Stefan Felsner, Jedrzej Hodor, Piotr Micek |
Reconfiguring Independent Sets on Interval Graphs. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf 0002 |
Order Reconfiguration Under Width Constraints. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul C. Bell, Pavel Semukhin |
Decision Questions for Probabilistic Automata on Small Alphabets. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriel L. Duarte, Mateus de Oliveira Oliveira, Uéverton S. Souza |
Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk 0001 |
On the Hardness of Compressing Weights. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert S. R. Myers, Henning Urbat |
Syntactic Minimization Of Nondeterministic Finite Automata. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuichi Hirahara, François Le Gall |
Test of Quantumness with Small-Depth Quantum Circuits. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | David Auger, Xavier Badin de Montjoye, Yann Strozecki |
A Generic Strategy Improvement Method for Simple Stochastic Games. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pablo Arrighi, Marin Costes, Nathanaël Eon |
Universal Gauge-Invariant Cellular Automata. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Mirai Ikebuchi |
A Homological Condition on Equational Unifiability. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikolas Mählmann, Sebastian Siebertz, Alexandre Vigny |
Recursive Backdoors for SAT. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Arpitha P. Bharathi, Monaldo Mastrolilli |
Ideal Membership Problem for Boolean Minority and Dual Discriminator. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hubácek, Jan Václavek |
On Search Complexity of Discrete Logarithm. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kostia Chardonnet, Benoît Valiron, Renaud Vilmart |
Geometry of Interaction for ZX-Diagrams. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hellis Tamm |
Boolean Automata and Atoms of Regular Languages. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Trotta, Matteo Spadetto, Valeria de Paiva |
The Gödel Fibration. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Filippo Bonchi, Simon J. Puglisi (eds.) |
46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia. |
MFCS |
2021 |
DBLP BibTeX RDF |
|
| 1 | George Kenison, Oleksiy Klurman, Engel Lefaucheux, Florian Luca, Pieter Moree, Joël Ouaknine, Markus A. Whiteland, James Worrell 0001 |
On Positivity and Minimality for Second-Order Holonomic Sequences. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Norbert Peyerimhoff, Marc Roth, Johannes Schmitt 0002, Jakob Stix, Alina Vdovina |
Parameterized (Modular) Counting and Cayley Graph Expanders. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Maël Dumas, Anthony Perez 0001, Ioan Todinca |
A Cubic Vertex-Kernel for Trivially Perfect Editing. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Winter |
Decision Problems for Origin-Close Top-Down Tree Transducers. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Archit Chauhan, Samir Datta |
Depth-First Search in Directed Planar Graphs, Revisited. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hendrik Molter, Malte Renken, Philipp Zschoche |
Temporal Reachability Minimization: Delaying vs. Deleting. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Bok, Jirí Fiala 0001, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl |
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Baldan, Alberto Carraro, Tommaso Padoan |
(Un)Decidability for History Preserving True Concurrent Logics. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Bruse, Marco Sälzer, Martin Lange |
Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Bohdan Kivva |
Improved Upper Bounds for the Rigidity of Kronecker Products. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Gaëtan Douéneau-Tabot |
Pebble Transducers with Unary Output. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál András Papp, Roger Wattenhofer |
Stabilization Bounds for Influence Propagation from a Random Initial State. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Sarel Cohen, Tobias Friedrich 0001, Martin Schirneck |
Space-Efficient Fault-Tolerant Diameter Oracles. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Glos, Martins Kokainis, Ryuhei Mori, Jevgenijs Vihrovs |
Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Damian Niwinski, Michal Skrzypczak |
On Guidable Index of Tree Automata. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristina Asimi, Libor Barto |
Finitely Tractable Promise Constraint Satisfaction Problems. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Cyril Branciard, Alexandre Clément, Mehdi Mhalla, Simon Perdrix |
Coherent Control and Distinguishability of Quantum Channels via PBS-Diagrams. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Amina Doumane |
Non-Axiomatizability of the Equational Theories of Positive Relation Algebras (Invited Talk). |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaldo Cesco, Roberto Gorrieri |
A Decidable Equivalence for a Turing-Complete, Distributed Model of Computation. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Z. Gutin, Anders Yeo |
Perfect Forests in Graphs and Their Extensions. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Vít Jelínek, Michal Opler, Jakub Pekárek |
Griddings of Permutations and Hardness of Pattern Matching. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov |
Parameterized Complexity of Feature Selection for Categorical Data Clustering. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Brynmor Chapman, R. Ryan Williams |
Black-Box Hypotheses and Lower Bounds. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Hovhannes A. Harutyunyan, Denis Pankratov, Jesse Racicot |
Online Domination: The Value of Getting to Know All Your Neighbors. |
MFCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kristoffer Arnsfelt Hansen, Steffan Christ Sølvsten |
∃ℝ-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Vít Jelínek, Michal Opler, Jakub Pekárek |
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeyu Guo 0001 |
Factoring Polynomials over Finite Fields with Linear Galois Groups: An Additive Combinatorics Approach. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Kuperberg, Jan Martens 0001 |
Regular Resynchronizability of Origin Transducers Is Undecidable. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand 0001 |
Concurrent Games with Arbitrarily Many Players (Invited Talk). |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani |
Classically Simulating Quantum Circuits with Local Depolarizing Noise. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitsunori Ogihara, Kei Uchizawa |
Synchronous Boolean Finite Dynamical Systems on Directed Graphs over XOR Functions. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Janaky Murthy, Vineet Nair, Chandan Saha 0001 |
Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková |
List Homomorphism Problems for Signed Graphs. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Tomás Masarík, Jana Novotná 0001 |
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Toghrul Karimov, Joël Ouaknine, James Worrell 0001 |
On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Vladimir Lysikov |
Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nai-Hui Chia, Tongyang Li, Han-Hsuan Lin, Chunhao Wang |
Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergio Cabello |
Some Open Problems in Computational Geometry (Invited Talk). |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda |
Simplified Game of Life: Algorithms and Complexity. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Caterina Viola, Stanislav Zivný |
The Combined Basic LP and Affine IP Relaxation for Promise VCSPs on Infinite Domains. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Galanis, Leslie Ann Goldberg, James Stewart 0001 |
Fast Algorithms for General Spin Systems on Bipartite Expanders. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jarkko Peltomäki, Markus A. Whiteland |
All Growth Rates of Abelian Exponents Are Attained by Infinite Binary Words. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Saeed Akhoondian Amiri, Alexandru Popa 0001, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi 0001 |
Complexity of Computing the Anti-Ramsey Numbers for Paths. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Raul Lopes 0001, Ignasi Sau |
A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nils Morawietz, Carolin Rehs, Mathias Weller |
A Timecop's Work Is Harder Than You Think. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Danil Sagunov, Kirill Simonov |
Building Large k-Cores from Sparse Graphs. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Paloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza |
Reducing Graph Transversals via Edge Contractions. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Svein Høgemo, Christophe Paul, Jan Arne Telle |
Hierarchical Clusterings of Unweighted Graphs. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ismaël Jecker, Orna Kupferman, Nicolas Mazzocchi |
Unary Prime Languages. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sophie Laplante, Reza Naserasr, Anupa Sunny |
Sensitivity Lower Bounds from Linear Dependencies. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Janusz Schmude |
Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon |
Fractional Covers of Hypergraphs with Bounded Multi-Intersection. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Jaax, Stefan Kiefer |
On Affine Reachability Problems. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Kawalek, Jacek Krzaczkowski |
Even Faster Algorithms for CSAT Over supernilpotent Algebras. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gallot, Aurélien Lemay, Sylvain Salvati |
Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Arpitha P. Bharathi, Monaldo Mastrolilli |
Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny |
Elimination Distance to Bounded Degree on Planar Graphs. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license