Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 2020
- Eric Allender:
The New Complexity Landscape Around Circuit Minimization. LATA 2020: 3-16 - Kazuyuki Amano:
On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function. LATA 2020: 235-247 - Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
On the Weisfeiler-Leman Dimension of Fractional Packing. LATA 2020: 357-368 - Dmitry Berdinsky, Prohrak Kruengthomya:
Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the Circle. LATA 2020: 115-127 - Alexis Bès, Christian Choffrut:
$\langle \mathbb {R}, +, <, 1 \rangle $ Is Decidable in $\langle \mathbb {R}, +, < , \mathbb {Z}\rangle $. LATA 2020: 128-140 - Siddharth Bhaskar, Jane Chandlee, Adam Jardine, Christopher Oakden:
Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions. LATA 2020: 157-169 - Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino, Rosalba Zizza:
Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words. LATA 2020: 385-396 - Laure Daviaud:
Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases. LATA 2020: 17-32 - Jeffery Dick, Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach:
Reducing the Ambiguity of Parikh Matrices. LATA 2020: 397-411 - Susanna Donatelli, Serge Haddad:
Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models. LATA 2020: 170-183 - Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
Complexity Issues of String to Graph Approximate Matching. LATA 2020: 248-259 - Olivier Finkel:
The Automatic Baire Property and an Effective Property of ømega-Rational Functions. LATA 2020: 303-314 - Pamela Fleischmann, Mitja Kulczynski, Dirk Nowotka, Danny Bøgsted Poulsen:
On Collapsing Prefix Normal Words. LATA 2020: 412-424 - Ziyuan Gao, Sanjay Jain, Ji Qi, Philipp Schlicht, Frank Stephan, Jacob Tarr:
Ordered Semiautomatic Rings with Applications to Geometry. LATA 2020: 141-153 - Mehmet Utkan Gezer:
Windable Heads and Recognizing NL with Constant Randomness. LATA 2020: 184-195 - Nathan Grosshans:
The Power of Programs over Monoids in [inline-graphic not available: see fulltext]. LATA 2020: 315-327 - Christoph Haase:
Approaching Arithmetic Theories with Finite-State Automata. LATA 2020: 33-43 - Artur Jez:
Recompression: Technique for Word Equations and Compressed Data. LATA 2020: 44-67 - Jing Ji, Jeffrey Heinz:
Input Strictly Local Tree Transducers. LATA 2020: 369-381 - Chris Keeler, Kai Salomaa:
Alternating Finite Automata with Limited Universal Branching. LATA 2020: 196-207 - Ondrej Klíma, Peter Kostolányi:
Geometrically Closed Positive Varieties of Star-Free Languages. LATA 2020: 328-340 - Nadia Labai, Tomer Kotek, Magdalena Ortiz, Helmut Veith:
Pebble-Intervals Automata and FO2 with Two Orders. LATA 2020: 208-221 - Aaron Lye:
Context-Sensitive Fusion Grammars Are Universal. LATA 2020: 275-286 - Aaron Moss:
Simplified Parsing Expression Derivatives. LATA 2020: 425-436 - Jean Néraud:
Complete Variable-Length Codes: An Excursion into Word Edit Operations. LATA 2020: 437-448 - Alexander Okhotin, Alexey Sorokin:
Cyclic Shift on Multi-component Grammars. LATA 2020: 287-299 - Jean-Éric Pin:
How to Prove that a Language Is Regular or Star-Free? LATA 2020: 68-88 - Thomas Place:
Deciding Classes of Regular Languages: The Covering Approach. LATA 2020: 89-112 - Ahmet Bilal Uçan:
Limited Two-Way Deterministic Finite Automata with Advice. LATA 2020: 222-232 - Tomoyuki Yamakami:
Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas. LATA 2020: 341-353
skipping 2 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-29 23:23 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint