default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexei L. Semenov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j8]Alexei L. Semenov
, Sergey Soprunov:
A combinatorial version of the Svenonius theorem on definability. Log. J. IGPL 23(6): 966-975 (2015)- 2014
- [c9]Alexei L. Semenov, Sergey Soprunov, Vladimir A. Uspensky:
The Lattice of Definability. Origins, Recent Developments, and Further Directions. CSR 2014: 23-38
2000 – 2009
- 2009
- [i2]Andrei A. Muchnik, Yuri Pritykin, Alexei L. Semenov:
Sequences close to periodic. CoRR abs/0903.5316 (2009) - 2008
- [e1]Edward A. Hirsch, Alexander A. Razborov, Alexei L. Semenov, Anatol Slissenko:
Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings. Lecture Notes in Computer Science 5010, Springer 2008, ISBN 978-3-540-79708-1 [contents] - 2006
- [j7]Andrej Muchnik, Alexei L. Semenov:
Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets. Ann. Pure Appl. Log. 141(3): 437-441 (2006) - 2003
- [j6]Andrei A. Muchnik, Alexei L. Semenov:
On the Role of the Law of Large Numbers in the Theory of Randomness. Probl. Inf. Transm. 39(1): 119-147 (2003) - [j5]Andrei A. Muchnik, Alexei L. Semenov, Maxim Ushakov:
Almost periodic sequences. Theor. Comput. Sci. 304(1-3): 1-33 (2003) - 2000
- [i1]Andrei A. Muchnik, Alexei L. Semenov:
Multi-conditional Descriptions and Codes in Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [c8]Alexei L. Semenov:
Technology in transforming education. Communications and Networking in Education 1999: 25-38 - 1998
- [j4]Andrei A. Muchnik, Alexei L. Semenov, Vladimir A. Uspensky:
Mathematical Metaphysics of Randomness. Theor. Comput. Sci. 207(2): 263-317 (1998) - [c7]Walter Vogler, Alexei L. Semenov, Alexandre Yakovlev:
Unfolding and Finite Prefix for Nets with Read Arcs. CONCUR 1998: 501-516 - 1997
- [j3]Alexei L. Semenov, Albert Koelmans, Lee Lloyd, Alexandre Yakovlev:
Designing an asynchronous processor using Petri nets. IEEE Micro 17(2): 54-64 (1997) - [c6]Alexei L. Semenov, Alexandre Yakovlev, Enric Pastor, Marco A. Peña, Jordi Cortadella, Luciano Lavagno:
Partial order based approach to synthesis of speed-independent circuits. ASYNC 1997: 254- - [c5]Alexei L. Semenov, Alexandre Yakovlev, Enric Pastor, Marco A. Peña, Jordi Cortadella:
Synthesis of Speed-Independent Circuits from STG-Unfolding Segment. DAC 1997: 16-21 - 1996
- [j2]Alexandre Yakovlev, Albert Koelmans, Alexei L. Semenov, D. J. Kinniment:
Modelling, analysis and synthesis of asynchronous control circuits using Petri nets. Integr. 21(3): 143-170 (1996) - [c4]Alexei L. Semenov, Alexandre Yakovlev:
Verification of asynchronous circuits using Time Petri Net unfolding. DAC 1996: 59-62 - 1995
- [c3]Alexandre Yakovlev, Victor Varshavsky, Vyacheslav Marakhovsky, Alexei L. Semenov:
Designing an asynchronous pipeline token ring interface. ASYNC 1995: 32-
1980 – 1989
- 1988
- [j1]Alexei L. Semenov:
A simple detailed proof for Goedel's incompleteness theorem. Kybernetika 24(6): 447-451 (1988) - 1984
- [c2]Alexei L. Semenov:
Decidability of Monadic Theories. MFCS 1984: 162-175
1970 – 1979
- 1979
- [c1]Vladimir A. Uspensky, Alexei L. Semenov:
What are the gains of the theory of algorithms: Basis developments connected with the concept of algorithm and with its application in mathematics. Algorithms in Modern Mathematics and Computer Science 1979: 100-234
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
