default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarek Szykula
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c31]Michal Maras, Michal Kepa, Jakub Kowalski, Marek Szykula:
Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract). AAAI 2024: 23576-23578- 2023
- [c30]Robert Ferens
, Marek Szykula:
Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds. ICALP 2023: 59:1-59:17 - [i38]Igor Rystsov, Marek Szykula:
Primitive Automata that are Synchronizing. CoRR abs/2307.01302 (2023) - [i37]Igor Rystsov, Marek Szykula:
Reset thresholds of transformation monoids. CoRR abs/2309.08321 (2023) - [i36]Michal Maras, Michal Kepa, Jakub Kowalski, Marek Szykula:
Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract). CoRR abs/2312.14121 (2023) - 2022
- [c29]Jakub Kowalski, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz, Marek Szykula, Mark H. M. Winands:
Split Moves for Monte-Carlo Tree Search. AAAI 2022: 10247-10255 - [c28]Marek Szykula, Adam Zyzik:
An Improved Algorithm for Finding the Shortest Synchronizing Words. ESA 2022: 85:1-85:15 - [i35]Marek Szykula, Adam Zyzik:
An Improved Algorithm for Finding the Shortest Synchronizing Words. CoRR abs/2207.05495 (2022) - [i34]Robert Ferens, Marek Szykula:
Completely Reachable Automata: A Polynomial Solution and Quadratic Bounds for the Subset Reachability Problem. CoRR abs/2208.05956 (2022) - 2021
- [j14]Maksymilian Mika, Marek Szykula:
The Frobenius and Factor Universality Problems of the Kleene Star of a Finite Set of Words. J. ACM 68(3): 18:1-18:22 (2021) - [j13]Mikhail V. Berlinkov, Robert Ferens, Marek Szykula:
Preimage problems for deterministic finite automata. J. Comput. Syst. Sci. 115: 214-234 (2021) - [c27]Robert Ferens, Marek Szykula, Vojtech Vorel:
Lower Bounds on Avoiding Thresholds. MFCS 2021: 46:1-46:14 - [c26]Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula:
Synchronizing Strongly Connected Partial DFAs. STACS 2021: 12:1-12:16 - [i33]Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula:
Synchronizing Strongly Connected Partial DFAs. CoRR abs/2101.05057 (2021) - [i32]Jakub Kowalski, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz, Marek Szykula, Mark H. M. Winands:
Split Moves for Monte-Carlo Tree Search. CoRR abs/2112.07761 (2021) - 2020
- [j12]Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula:
State Complexity of Overlap Assembly. Int. J. Found. Comput. Sci. 31(8): 1113-1132 (2020) - [c25]Jakub Kowalski, Radoslaw Miernik, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz, Marek Szykula, Andrzej Tkaczyk:
Efficient Reasoning in Regular Boardgames. CoG 2020: 455-462 - [c24]Pawel Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula:
Existential Length Universality. STACS 2020: 16:1-16:14 - [i31]Jakub Kowalski, Marek Szykula:
Experimental Studies in General Game Playing: An Experience Report. CoRR abs/2003.03410 (2020) - [i30]Jakub Kowalski, Radoslaw Miernik, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz, Marek Szykula, Andrzej Tkaczyk:
Efficient Reasoning in Regular Boardgames. CoRR abs/2006.08295 (2020)
2010 – 2019
- 2019
- [j11]Robert Ferens, Marek Szykula:
Complexity of bifix-free regular languages. Theor. Comput. Sci. 787: 14-27 (2019) - [j10]Marek Szykula, John Wittnebel:
Syntactic complexity of bifix-free regular languages. Theor. Comput. Sci. 787: 45-76 (2019) - [c23]Jakub Kowalski, Maksymilian Mika, Jakub Sutowicz, Marek Szykula:
Regular Boardgames. AAAI 2019: 1699-1706 - [i29]Maksymilian Mika, Marek Szykula:
Complexity of the Frobenius monoid problem for a finite language. CoRR abs/1902.06702 (2019) - [i28]Jakub Kowalski, Maksymilian Mika, Jakub Sutowicz, Marek Szykula:
A note on the empirical comparison of RBG and Ludii. CoRR abs/1910.00309 (2019) - 2018
- [j9]Igor T. Podolak, Adam Roman, Marek Szykula, Bartosz Zielinski:
A machine learning approach to synchronization of automata. Expert Syst. Appl. 97: 357-371 (2018) - [j8]Janusz A. Brzozowski, Marek Szykula:
Syntactic complexity of suffix-free languages. Inf. Comput. 259(2): 174-190 (2018) - [j7]Janusz A. Brzozowski, Marek Szykula, Yuli Ye:
Syntactic Complexity of Regular Ideals. Theory Comput. Syst. 62(5): 1175-1202 (2018) - [c22]Andrew Ryzhikov, Marek Szykula:
Finding Short Synchronizing Words for Prefix Codes. MFCS 2018: 21:1-21:14 - [c21]Mikhail V. Berlinkov, Robert Ferens, Marek Szykula:
Complexity of Preimage Problems for Deterministic Finite Automata. MFCS 2018: 32:1-32:14 - [c20]Marek Szykula:
Improving the Upper Bound on the Length of the Shortest Reset Word. STACS 2018: 56:1-56:13 - [c19]Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula:
State Complexity of Overlap Assembly. CIAA 2018: 109-120 - [i27]Andrew Ryzhikov, Marek Szykula:
Finding Short Synchronizing Words for Prefix Codes. CoRR abs/1806.06299 (2018) - 2017
- [j6]Janusz A. Brzozowski, Marek Szykula:
Complexity of suffix-free regular languages. J. Comput. Syst. Sci. 89: 270-287 (2017) - [c18]Michalina Dzyga, Robert Ferens, Vladimir V. Gusev, Marek Szykula:
Attainable Values of Reset Thresholds. MFCS 2017: 40:1-40:14 - [c17]Robert Ferens, Marek Szykula:
Complexity of Bifix-Free Regular Languages. CIAA 2017: 76-88 - [c16]Marek Szykula, John Wittnebel:
Syntactic Complexity of Bifix-Free Languages. CIAA 2017: 201-212 - [i26]Robert Ferens, Marek Szykula:
Complexity of regular bifix-free languages. CoRR abs/1701.03768 (2017) - [i25]Pawel Gawrychowski, Narad Rampersad, Jeffrey O. Shallit, Marek Szykula:
Existential length universality. CoRR abs/1702.03961 (2017) - [i24]Marek Szykula:
Improving the upper bound the length of the shortest reset words. CoRR abs/1702.05455 (2017) - [i23]Mikhail V. Berlinkov, Robert Ferens, Marek Szykula:
Extending word problems in deterministic finite automata. CoRR abs/1704.08233 (2017) - [i22]Jakub Kowalski, Jakub Sutowicz, Marek Szykula:
Regular Boardgames. CoRR abs/1706.02462 (2017) - [i21]Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula:
State Complexity of Overlap Assembly. CoRR abs/1710.06000 (2017) - 2016
- [j5]Mikhail V. Berlinkov, Marek Szykula:
Algebraic synchronization criterion and computing reset words. Inf. Sci. 369: 718-730 (2016) - [c15]Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula:
On the State Complexity of the Shuffle of Regular Languages. DCFS 2016: 73-86 - [c14]Marek Szykula, Vojtech Vorel:
An Extremal Series of Eulerian Synchronizing Automata. DLT 2016: 380-392 - [c13]Jakub Kowalski, Marek Szykula:
Evolving Chess-like Games Using Relative Algorithm Performance Profiles. EvoApplications (1) 2016: 574-589 - [c12]Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula:
Experiments with Synchronizing Automata. CIAA 2016: 176-188 - [i20]Vojtech Vorel, Marek Szykula:
An Extremal Series of Eulerian Synchronizing Automata. CoRR abs/1604.02879 (2016) - [i19]Marek Szykula, John Wittnebel:
Syntactic complexity of bifix-free languages. CoRR abs/1604.06936 (2016) - [i18]Jakub Kowalski, Jakub Sutowicz, Marek Szykula:
Simplified Boardgames. CoRR abs/1606.02645 (2016) - [i17]Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula:
Experiments with Synchronizing Automata. CoRR abs/1607.04025 (2016) - [i16]Andrzej Kisielewicz, Marek Szykula:
Synchronizing Automata with Extremal Properties. CoRR abs/1608.01268 (2016) - 2015
- [j4]Adam Roman, Marek Szykula:
Forward and backward synchronizing algorithms. Expert Syst. Appl. 42(24): 9512-9527 (2015) - [j3]Janusz A. Brzozowski, Marek Szykula:
Large Aperiodic Semigroups. Int. J. Found. Comput. Sci. 26(7): 913-932 (2015) - [j2]Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula:
Computing the shortest reset words of synchronizing automata. J. Comb. Optim. 29(1): 88-124 (2015) - [c11]Janusz A. Brzozowski, Marek Szykula:
Upper Bound on Syntactic Complexity of Suffix-Free Languages. DCFS 2015: 33-45 - [c10]Janusz A. Brzozowski, Marek Szykula:
Complexity of Suffix-Free Regular Languages. FCT 2015: 146-159 - [c9]Mikhail V. Berlinkov, Marek Szykula:
Algebraic Synchronization Criterion and Computing Reset Words. MFCS (1) 2015: 103-115 - [c8]Andrzej Kisielewicz, Marek Szykula:
Synchronizing Automata with Extremal Properties. MFCS (1) 2015: 331-343 - [c7]Vladimir V. Gusev, Marek Szykula:
On the Number of Synchronizing Colorings of Digraphs. CIAA 2015: 127-139 - [c6]Marek Szykula:
Checking Whether an Automaton Is Monotonic Is NP-complete. CIAA 2015: 279-291 - [i15]Janusz A. Brzozowski, Marek Szykula:
Complexity of Suffix-Free Regular Languages. CoRR abs/1504.05159 (2015) - [i14]Jakub Kowalski, Marek Szykula:
Procedural Content Generation for GDL Descriptions of Simplified Boardgames. CoRR abs/1508.00212 (2015) - [i13]Vladimir V. Gusev, Marek Szykula:
On the Number of Synchronizing Colorings of Digraphs. CoRR abs/1508.02133 (2015) - [i12]Janusz A. Brzozowski, Marek Szykula, Yuli Ye:
Syntactic Complexity of Regular Ideals. CoRR abs/1509.06032 (2015) - [i11]Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula:
On the State Complexity of the Shuffle of Regular Languages. CoRR abs/1512.01187 (2015) - 2014
- [c5]Janusz A. Brzozowski, Marek Szykula:
Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals. Developments in Language Theory 2014: 13-24 - [c4]Janusz A. Brzozowski, Marek Szykula:
Large Aperiodic Semigroups. CIAA 2014: 124-135 - [i10]Janusz A. Brzozowski, Marek Szykula:
Large Aperiodic Semigroups. CoRR abs/1401.0157 (2014) - [i9]Janusz A. Brzozowski, Marek Szykula:
Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals. CoRR abs/1403.2090 (2014) - [i8]Andrzej Kisielewicz, Marek Szykula:
Synchronizing Automata with Large Reset Lengths. CoRR abs/1404.3311 (2014) - [i7]Marek Szykula:
Checking if an Automaton is Monotonic is NP-complete. CoRR abs/1407.5068 (2014) - [i6]Janusz A. Brzozowski, Marek Szykula:
Upper Bound on Syntactic Complexity of Suffix-Free Languages. CoRR abs/1412.2281 (2014) - [i5]Mikhail V. Berlinkov, Marek Szykula:
Computing Reset Words for Prefix Codes and Various Classes of Synchronizing Automata. CoRR abs/1412.8363 (2014) - 2013
- [c3]Jakub Kowalski, Marek Szykula:
Game Description Language Compiler Construction. Australasian Conference on Artificial Intelligence 2013: 234-245 - [c2]Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula:
A Fast Algorithm Finding the Shortest Reset Words. COCOON 2013: 182-196 - [c1]Andrzej Kisielewicz, Marek Szykula:
Generating Small Automata and the Černý Conjecture. CIAA 2013: 340-348 - [i4]Jakub Kowalski, Marek Szykula:
The Černý conjecture for small automata: experimental report. CoRR abs/1301.2092 (2013) - [i3]Jakub Kowalski, Marek Szykula:
A New Heuristic Synchronizing Algorithm. CoRR abs/1308.1978 (2013) - 2012
- [i2]Marek Szykula, Andrzej Kisielewicz:
Rainbow Induced Subgraphs in Replication Graphs. CoRR abs/1201.5340 (2012) - [i1]Andrzej Kisielewicz, Jakub Kowalski, Marek Szykula:
Fast algorithm finding the shortest reset words. CoRR abs/1203.2822 (2012) - 2011
- [j1]Andrzej Kisielewicz, Marek Szykula:
Rainbow Induced Subgraphs in Proper Vertex Colorings. Fundam. Informaticae 111(4): 437-451 (2011)
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:24 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:
