Ştefan Andrei

From MaRDI portal
(Redirected from Ştefan Andrei)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Processor bounding for an efficient non-preemptive task scheduling algorithm
Mathematics in Computer Science
2019-11-27Paper
Efficient Verification and Optimization of Real-Time Logic-Specified Systems
IEEE Transactions on Computers
2017-08-08Paper
Co-determinism and unambiguity of automata accepting finite or infinite words2016-09-02Paper
scientific article; zbMATH DE number 6117305 (Why is no real title available?)2012-12-19Paper
A rigorous methodology for specification and verification of business processes
Formal Aspects of Computing
2009-11-13Paper
On the complexity of propositional calculus formulae2008-04-14Paper
A tutorial on a monadic approach for exppressions evaluation2008-04-14Paper
Solving a class of higher-order equations over a group structure
Journal of Symbolic Computation
2007-08-24Paper
Programming Languages and Systems
Lecture Notes in Computer Science
2006-10-20Paper
Counting for satisfiability by inverting resolution
Artificial Intelligence Review
2005-08-22Paper
Self-embedded context-free grammars with regular counterparts
Acta Informatica
2004-12-09Paper
A new algorithm for regularizing one-letter context-free grammars.
Theoretical Computer Science
2004-03-14Paper
Bidirectional parsing for linear languages2002-11-04Paper
Morphological grammars
Analele Științifice ale Universității Al. I. Cuza din Iași. Serie Nouă. Informatică
2001-08-13Paper
Some results on the Collatz problem
Acta Informatica
2000-12-07Paper
About the Collatz conjecture
Acta Informatica
1998-08-10Paper
scientific article; zbMATH DE number 915917 (Why is no real title available?)1996-08-12Paper


Research outcomes over time


This page was built for person: Ştefan Andrei