Robert Ferens

Orcid: 0000-0002-0079-1936

According to our database1, Robert Ferens authored at least 12 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Completely Reachable Automata: A Polynomial Solution and Quadratic Bounds for the Subset Reachability Problem.
CoRR, 2022

2021
Preimage problems for deterministic finite automata.
J. Comput. Syst. Sci., 2021

Solving One Variable Word Equations in the Free Group in Cubic Time.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Synchronizing Strongly Connected Partial DFAs.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Lower Bounds on Avoiding Thresholds.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Complexity of bifix-free regular languages.
Theor. Comput. Sci., 2019

2018
Complexity of Preimage Problems for Deterministic Finite Automata.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Complexity of regular bifix-free languages.
CoRR, 2017

Extending word problems in deterministic finite automata.
CoRR, 2017

Attainable Values of Reset Thresholds.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017


  Loading...