Остановите войну!
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 59 matches
- 2015
- Eric Allender, Ian Mertz:
Complexity of Regular Functions. LATA 2015: 449-460 - Kazuyuki Amano, Atsushi Saito:
A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP. LATA 2015: 461-472 - Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Structure and Measure of a Decidable Class of Two-dimensional Codes. LATA 2015: 315-327 - Marco Autili, Paola Inverardi, Filippo Mignosi, Romina Spalazzese, Massimo Tivoli:
Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications. LATA 2015: 3-24 - Parvaneh Babari, Manfred Droste:
A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic. LATA 2015: 703-715 - Georg Bachmeier, Michael Luttenberger, Maximilian Schlund:
Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity. LATA 2015: 473-485 - Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták:
On the Number of Closed Factors in a Word. LATA 2015: 381-390 - Raphaël Bailly, François Denis, Guillaume Rabusseau:
Recognizable Series on Hypergraphs. LATA 2015: 639-651 - Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Average-Case Optimal Approximate Circular String Matching. LATA 2015: 85-96 - Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah:
A Game Characterisation of Tree-like Q-resolution Size. LATA 2015: 486-498 - Philip Bille, Inge Li Gørtz, Søren Vind:
Compressed Data Structures for Range Searching. LATA 2015: 577-586 - Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Recurrence Relations, Succession Rules, and the Positivity Problem. LATA 2015: 499-510 - Johanna Björklund, Frank Drewes, Niklas Zechner:
An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring. LATA 2015: 97-108 - Luc Boasson, Olivier Carton:
Rational Selecting Relations and Selectors. LATA 2015: 716-726 - Yohan Boichut, Jacques Chabin, Pierre Réty:
Towards More Precise Rewriting Approximations. LATA 2015: 652-663 - Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Logics for Unordered Trees with Data Constraints on Siblings. LATA 2015: 175-187 - Davide Bresolin, Dario Della Monica, Angelo Montanari, Pietro Sala, Guido Sciavicco:
On the Complexity of Fragments of the Modal Logic of Allen's Relations over Dense Structures. LATA 2015: 511-523 - Bastien Cazaux, Thierry Lecroq, Eric Rivals:
Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree. LATA 2015: 109-120 - Da-Jung Cho, Yo-Sub Han, Hwee Kim:
Frequent Pattern Mining with Non-overlapping Inversions. LATA 2015: 121-132 - Michael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp:
Sorting Networks: The End Game. LATA 2015: 664-675 - Conrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong:
Weak and Nested Class Memory Automata. LATA 2015: 188-199 - Nadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer:
Parameterized Enumeration for Modification Problems. LATA 2015: 524-536 - Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding Clique-Width via Perfect Graphs. LATA 2015: 676-688 - H. K. Dai, Zhu Wang:
A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk. LATA 2015: 133-144 - Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca:
Preimage Problems for Reaction Systems. LATA 2015: 537-548 - Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Insertion Operations on Deterministic Reversal-Bounded Counter Machines. LATA 2015: 200-211 - Azadeh Farzan, Matthias Heizmann, Jochen Hoenicke, Zachary Kincaid, Andreas Podelski:
Automated Program Verification. LATA 2015: 25-46 - Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Online Computation of Abelian Runs. LATA 2015: 391-401 - Guilhem Gamard, Gwénaël Richomme:
Coverability in Two Dimensions. LATA 2015: 402-413 - Thibault Godin, Ines Klimann, Matthieu Picantin:
On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata. LATA 2015: 328-339
skipping 29 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-06-03 15:29 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