Остановите войну!
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 52 matches
- 2010
- Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier:
Complexity of the Satisfiability Problem for a Class of Propositional Schemata. LATA 2010: 58-69 - Pablo Arrighi, Jonathan Grattage:
A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton. LATA 2010: 70-81 - Abdullah N. Arslan:
A Fast Longest Common Subsequence Algorithm for Similar Strings. LATA 2010: 82-93 - Sakthi Balan Muthiah, Parameswaran Seshan:
Incremental Building in Peptide Computing to Solve Hamiltonian Path Problem. LATA 2010: 549-560 - Francine Blanchet-Sadri, Jane I. Kim, Robert Mercas, William Severa, Sean Simmons:
Abelian Square-Free Partial Words. LATA 2010: 94-105 - Francine Blanchet-Sadri, Robert Mercas, Sean Simmons, Eric Weissenstein:
Avoidable Binary Patterns in Partial Words. LATA 2010: 106-117 - Nicolas Bousquet, Christof Löding:
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. LATA 2010: 118-129 - Janusz A. Brzozowski:
Complexity in Convex Languages. LATA 2010: 1-15 - Wojciech Buszkowski, Zhe Lin:
Pregroup Grammars with Letter Promotions. LATA 2010: 130-141 - Jérémie Cabessa, Alessandro E. P. Villa:
A Hierarchical Classification of First-Order Recurrent Neural Networks. LATA 2010: 142-153 - Rafael Carrascosa, François Coste, Matthias Gallé, Gabriel G. Infante López:
Choosing Word Occurrences for the Smallest Grammar Problem. LATA 2010: 154-165 - Claudia Casadio:
Agreement and Cliticization in Italian: A Pregroup Analysis. LATA 2010: 166-177 - Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne:
Geometricity of Binary Regular Languages. LATA 2010: 178-189 - Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
On the Expressive Power of FO[ + ]. LATA 2010: 190-201 - Alexander Clark:
Three Learnable Models for the Description of Language. LATA 2010: 16-31 - Stefano Crespi-Reghizzi, Dino Mandrioli:
Operator Precedence and the Visibly Pushdown Property. LATA 2010: 214-226 - Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
On the Maximal Number of Cubic Runs in a String. LATA 2010: 227-238 - William Cruz-Santos, Guillermo Morales-Luna:
On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT. LATA 2010: 239-248 - Rüdiger Ehlers:
Short Witnesses and Accepting Lassos in omega-Automata. LATA 2010: 261-272 - Christophe Costa Florêncio, Henning Fernau:
Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach. LATA 2010: 202-213 - Travis Gagie, Pawel Gawrychowski:
Grammar-Based Compression in a Streaming Model. LATA 2010: 273-284 - Barbara Di Giampaolo, Salvatore La Torre, Margherita Napoli:
Parametric Metric Interval Temporal Logic. LATA 2010: 249-260 - Hermann Gruber, Stefan Gulan:
Simplifying Regular Expressions. LATA 2010: 285-296 - Orna Grumberg, Orna Kupferman, Sarai Sheinvald:
Variable Automata over Infinite Alphabets. LATA 2010: 561-572 - Reinhard Hemmerling, Katarína Smolenová, Winfried Kurth:
A Programming Language Tailored to the Specification and Solution of Differential Equations Describing Processes on Networks. LATA 2010: 297-308 - Dag Hovland:
The Inclusion Problem for Regular Expressions. LATA 2010: 309-320 - Sanjay Jain, Qinglong Luo, Frank Stephan:
Learnability of Automatic Classes. LATA 2010: 321-332 - Charles Jordan, Thomas Zeugmann:
Untestable Properties Expressible with Four First-Order Quantifiers. LATA 2010: 333-343 - Makoto Kanazawa, Sylvain Salvati:
The Copying Power of Well-Nested Multiple Context-Free Grammars. LATA 2010: 344-355 - Anna Kasprzik, Timo Kötzing:
String Extension Learning Using Lattices. LATA 2010: 380-391
skipping 22 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 08:45 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