default search action
Juraj Síc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Cooking String-Integer Conversions with Noodles. SAT 2024: 14:1-14:19 - [c8]Yu-Fang Chen
, David Chocholatý
Z3-Noodler: An Automata-based String Solver. TACAS (1) 2024: 24-33 - [c7]David Chocholatý
Mata: A Fast and Simple Finite Automata Library. TACAS (2) 2024: 130-151 - 2023
- [j2]Yu-Fang Chen
Solving String Constraints with Lengths by Stabilization. Proc. ACM Program. Lang. 7(OOPSLA2): 2112-2141 (2023) - [c6]Tomás Fiedor, Lukás Holík, Martin Hruska, Adam Rogalewicz, Juraj Síc
Reasoning About Regular Properties: A Comparative Study. CADE 2023: 286-306 - [c5]Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý
Word Equations in Synergy with Regular Constraints. FM 2023: 403-423 - [c4]Lukás Holík
Fast Matching of Regular Patterns with Synchronizing Counting. FoSSaCS 2023: 392-412 - [i6]Lukás Holík, Juraj Síc, Lenka Turonová, Tomás Vojnar:
Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report). CoRR abs/2301.12851 (2023) - [i5]Tomás Fiedor, Lukás Holík, Martin Hruska, Adam Rogalewicz, Juraj Síc, Pavol Vargovcík:
Reasoning about Regular Properties: A Comparative Study. CoRR abs/2304.05064 (2023) - [i4]Yu-Fang Chen, David Chocholatý
Z3-Noodler: An Automata-based String Solver (Technical Report). CoRR abs/2310.08327 (2023) - [i3]David Chocholatý
Mata, a Fast and Simple Finite Automata Library (Technical Report). CoRR abs/2310.10136 (2023) - 2022
- [j1]Aile Ge-Ernst, Christoph Scholl, Juraj Síc
Solving dependency quantified Boolean formulas using quantifier localization. Theor. Comput. Sci. 925: 1-24 (2022) - [c3]Michal Horký, Juraj Síc, Lenka Turonová:
Automata with Bounded Repetition in RE2. EUROCAST 2022: 232-239 - [i2]Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Word Equations in Synergy with Regular Constraints (Technical Report). CoRR abs/2212.02317 (2022) - 2021
- [c2]Juraj Síc
DQBDD: An Efficient BDD-Based DQBF Solver. SAT 2021: 535-544
2010 – 2019
- 2018
- [c1]Lukás Holík
Simulation Algorithms for Symbolic Automata. ATVA 2018: 109-125 - [i1]Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar:
Simulation Algorithms for Symbolic Automata (Technical Report). CoRR abs/1807.08487 (2018)
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-08-22 20:48 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: