Остановите войну!
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 47 matches
- 2016
- Rajeev Alur, Dana Fisman:
Colored Nested Words. LATA 2016: 143-155 - Kazuyuki Amano:
On XOR Lemma for Polynomial Threshold Weight and Length. LATA 2016: 259-269 - Holger Bock Axelsen, Markus Holzer, Martin Kutrib, Andreas Malcher:
Reversible Shrinking Two-Pushdown Automata. LATA 2016: 579-591 - Franz Baader, Andreas Ecke:
Reasoning with Prototypes in the Description Logic ALC ALC Using Weighted Tree Automata. LATA 2016: 63-75 - Parvaneh Babari, Nicole Schweikardt:
+\omega + ω -Picture Languages Recognizable by Büchi-Tiling Systems. LATA 2016: 76-88 - Paul C. Bell, Shang Chen, Lisa M. Jackson:
Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages. LATA 2016: 493-505 - Sebastian Berndt, Rüdiger Reischuk:
Steganography Based on Pattern Languages. LATA 2016: 387-399 - Nathalie Bertrand, Serge Haddad, Engel Lefaucheux:
Accurate Approximate Diagnosability of Stochastic Systems. LATA 2016: 549-561 - Devendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade, Ashutosh Trivedi:
A Logical Characterization for Dense-Time Visibly Pushdown Automata. LATA 2016: 89-101 - Henrik Björklund, Frank Drewes, Petter Ericson:
Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars. LATA 2016: 521-532 - Johannes Blum, Frank Drewes:
Properties of Regular DAG Languages. LATA 2016: 427-438 - Adrien Boiret:
Normal Form on Linear Tree-to-Word Transducers. LATA 2016: 439-451 - Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas:
Non-Zero Sum Games for Reactive Synthesis. LATA 2016: 3-23 - Yu Chen, Xiaotie Deng, Ziwei Ji, Chao Liao:
The Beachcombers' Problem: Walking and Searching from an Inner Point of a Line. LATA 2016: 270-282 - Stefano Crespi-Reghizzi, Pierluigi San Pietro:
The Missing Case in Chomsky-Schützenberger Theorem. LATA 2016: 345-358 - Maxime Crochemore, Roman Kolpakov, Gregory Kucherov:
Optimal Bounds for Computing \alpha α -gapped Repeats. LATA 2016: 245-255 - Silke Czarnetzki, Andreas Krebs:
Using Duality in Circuit Complexity. LATA 2016: 283-294 - Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Reachability in Resource-Bounded Reaction Systems. LATA 2016: 592-602 - Isabela Dramnesc, Tudor Jebelean, Sorin Stratulat:
Proof-Based Synthesis of Sorting Algorithms for Trees. LATA 2016: 562-575 - Manfred Droste, Zoltán Fülöp, Doreen Götze:
A Kleene Theorem for Weighted Tree Automata over Tree Valuation Monoids. LATA 2016: 452-463 - Dana Fisman:
A Complexity Measure on Büchi Automata. LATA 2016: 102-113 - Séverine Fratani, El Makki Voundy:
Homomorphic Characterizations of Indexed Languages. LATA 2016: 359-370 - Martin Grohe:
Tangles and Connectivity in Graphs. LATA 2016: 24-41 - Vahid Hashemi, Holger Hermanns, Lei Song, K. Subramani, Andrea Turrini, Piotr Wojciechowski:
Compositional Bisimulation Minimization for Interval Markov Decision Processes. LATA 2016: 114-126 - Gabriel Istrate, Cosmin Bonchis, Liviu P. Dinu:
The Minimum Entropy Submodular Set Cover Problem. LATA 2016: 295-306 - Tatiana Baginová Jajcayová:
The Word Problem for HNN-extensions of Free Inverse Semigroups. LATA 2016: 506-517 - Makoto Kanazawa:
Ogden's Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy. LATA 2016: 371-383 - Guen-Hae Kim, Sang-Ki Ko, Yo-Sub Han:
Inferring a Relax NG Schema from XML Documents. LATA 2016: 400-411 - Hans-Jörg Kreowski, Sabine Kuske, Aaron Lye:
Canonical Multi-target Toffoli Circuits. LATA 2016: 603-616 - Orna Kupferman, Sarai Sheinvald:
On the Capacity of Capacitated Automata. LATA 2016: 307-319
skipping 17 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-27 17:30 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