Alexei L. Semenov

Orcid: 0000-0002-1785-2387

According to our database1, Alexei L. Semenov authored at least 19 papers between 1979 and 2015.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
A combinatorial version of the Svenonius theorem on definability.
Log. J. IGPL, 2015

2014
The Lattice of Definability. Origins, Recent Developments, and Further Directions.
Proceedings of the Computer Science - Theory and Applications, 2014

2009
Sequences close to periodic
CoRR, 2009

2006
Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets.
Ann. Pure Appl. Log., 2006

2003
Almost periodic sequences.
Theor. Comput. Sci., 2003

On the Role of the Law of Large Numbers in the Theory of Randomness.
Probl. Inf. Transm., 2003

2000
Multi-conditional Descriptions and Codes in Kolmogorov Complexity
Electron. Colloquium Comput. Complex., 2000

1999
Technology in transforming education.
Proceedings of the Communications and Networking in Education: Learning in a Networked Society, 1999

1998
Mathematical Metaphysics of Randomness.
Theor. Comput. Sci., 1998

Unfolding and Finite Prefix for Nets with Read Arcs.
Proceedings of the CONCUR '98: Concurrency Theory, 1998

1997
Designing an asynchronous processor using Petri nets.
IEEE Micro, 1997

Synthesis of Speed-Independent Circuits from STG-Unfolding Segment.
Proceedings of the 34st Conference on Design Automation, 1997

Partial order based approach to synthesis of speed-independent circuits.
Proceedings of the 3rd International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97), 1997

1996
Modelling, analysis and synthesis of asynchronous control circuits using Petri nets.
Integr., 1996

Verification of asynchronous circuits using Time Petri Net unfolding.
Proceedings of the 33st Conference on Design Automation, 1996

1995
Designing an asynchronous pipeline token ring interface.
Proceedings of the Second Working Conference on Asynchronous Design Methodologies, 1995

1988
A simple detailed proof for Goedel's incompleteness theorem.
Kybernetika, 1988

1984
Decidability of Monadic Theories.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1979
What are the gains of the theory of algorithms: Basis developments connected with the concept of algorithm and with its application in mathematics.
Proceedings of the Algorithms in Modern Mathematics and Computer Science, 1979


  Loading...