default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Ryzhikov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Andrei Draghici
, Christoph Haase, Andrew Ryzhikov:
Reachability in Fixed VASS: Expressiveness and Lower Bounds. FoSSaCS (2) 2024: 185-205- [c11]Andrew Ryzhikov, Petra Wolf:
Monoids of Upper Triangular Matrices over the Boolean Semiring. MFCS 2024: 81:1-81:18 - [c10]Andrew Ryzhikov:
On Shortest Products for Nonnegative Matrix Mortality. RP 2024: 104-119 - [i13]Andrew Ryzhikov:
On shortest products for nonnegative matrix mortality. CoRR abs/2405.19622 (2024) - [i12]Stefan Kiefer, Andrew Ryzhikov:
The complexity of computing the period and the exponent of a digraph. CoRR abs/2408.05762 (2024) - 2023
- [c9]Nadine El-Naggar, Andrew Ryzhikov, Laure Daviaud, Pranava Madhyastha, Tillman Weyde:
Formal and Empirical Studies of Counting Behaviour in ReLU RNNs. ICGI 2023: 199-222 - [c8]Laure Daviaud, Andrew Ryzhikov:
Universality and Forall-Exactness of Cost Register Automata with Few Registers. MFCS 2023: 40:1-40:15 - [i11]Andrei Draghici, Christoph Haase, Andrew Ryzhikov:
Reachability in Fixed VASS: Expressiveness and Lower Bounds. CoRR abs/2310.16740 (2023) - [i10]Andrew Ryzhikov, Petra Wolf:
Traversing automata with current state uncertainty under LTLf constraints. CoRR abs/2311.17849 (2023) - 2021
- [j7]Ilia Fridman, Mikhail Y. Kovalyov, Erwin Pesch, Andrew Ryzhikov:
Fixed interval scheduling with third-party machines. Networks 77(3): 361-371 (2021) - [c7]Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula:
Synchronizing Strongly Connected Partial DFAs. STACS 2021: 12:1-12:16 - [i9]Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula:
Synchronizing Strongly Connected Partial DFAs. CoRR abs/2101.05057 (2021) - [i8]Dominique Perrin, Andrew Ryzhikov:
Finitely generated submonoids. CoRR abs/2106.14471 (2021) - 2020
- [b1]Andrew Ryzhikov:
Synchronizing automata and coding theory. (Automates synchronisant et théorie du codage). University of Paris-Est, France, 2020 - [c6]Dominique Perrin, Andrew Ryzhikov:
The Degree of a Finite Set of Words. FSTTCS 2020: 54:1-54:16
2010 – 2019
- 2019
- [j6]Andrew Ryzhikov:
On automata recognizing birecurrent sets. Theor. Comput. Sci. 753: 76-79 (2019) - [j5]Andrew Ryzhikov:
Synchronization problems in automata without non-trivial cycles. Theor. Comput. Sci. 787: 77-88 (2019) - [c5]Andrew Ryzhikov:
Mortality and Synchronization of Unambiguous Finite Automata. WORDS 2019: 299-311 - [c4]Jarkko Kari, Andrew Ryzhikov, Anton Varonka:
Words of Minimum Rank in Deterministic Finite Automata. DLT 2019: 74-87 - [c3]Clemens Müllner, Andrew Ryzhikov:
Palindromic Subsequences in Finite Words. LATA 2019: 460-468 - [i7]Clemens Müllner, Andrew Ryzhikov:
Palindromic Subsequences in Finite Words. CoRR abs/1901.07502 (2019) - 2018
- [j4]Yury Kartynnik, Andrew Ryzhikov:
On Minimum Maximal Distance-k Matchings. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j3]Andrew Ryzhikov, Anton Shemyakov:
Subset Synchronization in Monotonic Automata. Fundam. Informaticae 162(2-3): 205-221 (2018) - [j2]Mikhail Y. Kovalyov, Erwin Pesch, Andrew Ryzhikov:
A note on scheduling container storage operations of two non-passing stacking cranes. Networks 71(3): 271-280 (2018) - [c2]Andrew Ryzhikov, Marek Szykula:
Finding Short Synchronizing Words for Prefix Codes. MFCS 2018: 21:1-21:14 - [i6]Andrew Ryzhikov, Marek Szykula:
Finding Short Synchronizing Words for Prefix Codes. CoRR abs/1806.06299 (2018) - 2017
- [c1]Andrew Ryzhikov:
Synchronization Problems in Automata Without Non-trivial Cycles. CIAA 2017: 188-200 - [i5]Andrew Ryzhikov:
Synchronization Problems in Automata without Non-trivial Cycles. CoRR abs/1702.08144 (2017) - [i4]Andrew Ryzhikov, Anton Shemyakov:
Subset Synchronization in Monotonic Automata. CoRR abs/1703.06356 (2017) - [i3]Andrew Ryzhikov:
On Automata Recognizing Birecurrent Sets. CoRR abs/1711.01061 (2017) - 2016
- [j1]Yury Kartynnik, Andrew Ryzhikov:
On Minimum Maximal Distance-k Matchings. Electron. Notes Discret. Math. 56: 71-76 (2016) - [i2]Yury Kartynnik, Andrew Ryzhikov:
On Minimum Maximal Distance-k Matchings. CoRR abs/1602.04581 (2016) - [i1]Andrew Ryzhikov:
Approximating the Maximum Number of Synchronizing States in Automata. CoRR abs/1608.00889 (2016)
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 2025-01-21 00:12 CET 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:
