Остановите войну!
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 84 matches
- 2011
- Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin:
A classification of the expressive power of well-structured transition systems. Inf. Comput. 209(3): 248-279 (2011) - Diego Arroyuelo, Gonzalo Navarro:
Space-efficient construction of Lempel-Ziv compressed text indexes. Inf. Comput. 209(7): 1070-1102 (2011) - Albert Atserias, Elitza N. Maneva:
Mean-payoff games and propositional proofs. Inf. Comput. 209(4): 664-691 (2011) - Paul C. Attie, Rachid Guerraoui, Petr Kuznetsov, Nancy A. Lynch, Sergio Rajsbaum:
The impossibility of boosting distributed service resilience. Inf. Comput. 209(6): 927-950 (2011) - Patrick Baillot, Paolo Coppola, Ugo Dal Lago:
Light logics and optimal reduction: Completeness and complexity. Inf. Comput. 209(2): 118-142 (2011) - Raphaël Bailly, François Denis:
Absolute convergence of rational series is semi-decidable. Inf. Comput. 209(3): 280-295 (2011) - Frank J. Balbach, Thomas Zeugmann:
Teaching randomized learners with feedback. Inf. Comput. 209(3): 296-319 (2011) - Olaf Beyersdorff, Johannes Köbler, Sebastian Müller:
Proof systems that take advice. Inf. Comput. 209(3): 320-332 (2011) - Hans L. Bodlaender, Arie M. C. A. Koster:
Treewidth computations II. Lower bounds. Inf. Comput. 209(7): 1103-1119 (2011) - Beate Bollig:
Larger lower bounds on the OBDD complexity of integer multiplication. Inf. Comput. 209(3): 333-343 (2011) - Henning Bordihn, Markus Holzer, Martin Kutrib:
Decidability of operation problems for T0L languages and subclasses. Inf. Comput. 209(3): 344-352 (2011) - Torben Braüner:
Intuitionistic hybrid logic: Introduction and survey. Inf. Comput. 209(12): 1437-1446 (2011) - Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek:
Qualitative reachability in stochastic BPA games. Inf. Comput. 209(8): 1160-1183 (2011) - Janusz A. Brzozowski, Jeffrey O. Shallit, Zhi Xu:
Decision problems for convex languages. Inf. Comput. 209(3): 353-367 (2011) - Manuel Lameiras Campagnolo, Kerry Ojakian:
A characterization of computable analysis on unbounded domains using differential equations. Inf. Comput. 209(8): 1135-1159 (2011) - John Case, Samuel E. Moelius:
Optimal language learning from positive data. Inf. Comput. 209(10): 1293-1311 (2011) - Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang:
Faster query algorithms for the text fingerprinting problem. Inf. Comput. 209(7): 1057-1069 (2011) - Ting Yi Chang:
An ID-based multi-signer universal designated multi-verifier signature scheme. Inf. Comput. 209(7): 1007-1015 (2011) - Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat:
A black box for online approximate pattern matching. Inf. Comput. 209(4): 731-736 (2011) - Maxime Crochemore, Dov M. Gabbay:
Reactive automata. Inf. Comput. 209(4): 692-704 (2011) - Elena Czeizler, Eugen Czeizler, Lila Kari, Shinnosuke Seki:
An extension of the Lyndon-Schützenberger result to pseudoperiodic words. Inf. Comput. 209(4): 717-730 (2011) - Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota:
Partially-commutative context-free processes: Expressibility and tractability. Inf. Comput. 209(5): 782-798 (2011) - Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc:
Optimality and competitiveness of exploring polygons by mobile robots. Inf. Comput. 209(1): 74-88 (2011) - Vincent Danos, Thomas Ehrhard:
Probabilistic coherence spaces as a model of higher-order probabilistic computation. Inf. Comput. 209(6): 966-991 (2011) - Jürgen Dassow, Victor Mitrana, Bianca Truthe:
The role of evolutionary operations in accepting hybrid networks of evolutionary processors. Inf. Comput. 209(3): 368-382 (2011) - Cédric Dégremont, Nina Gierasimczuk:
Finite identification from the viewpoint of epistemic update. Inf. Comput. 209(3): 383-396 (2011) - Josée Desharnais, François Laviolette, Amélie Turgeon:
A logical duality for underspecified probabilistic systems. Inf. Comput. 209(5): 850-871 (2011) - Razvan Diaconescu:
Coinduction for preordered algebra. Inf. Comput. 209(2): 108-117 (2011) - Razvan Diaconescu:
Structural induction in institutions. Inf. Comput. 209(9): 1197-1222 (2011) - Gilles Dowek, Ying Jiang:
On the expressive power of schemes. Inf. Comput. 209(9): 1231-1245 (2011)
skipping 54 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-04-25 06:49 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