Остановите войну!
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 11 matches
- 2008
- Gilles Audemard, Saïd Jabbour, Lakhdar Sais:
SAT graph-based representation: A new perspective. J. Algorithms 63(1-3): 17-33 (2008) - Yuriy Brun:
Solving satisfiability in the tile assembly model with a constant-size tileset. J. Algorithms 63(4): 151-166 (2008) - Francesco Calimeri, Simona Perri, Francesco Ricca:
Experimenting with parallelism for the instantiation of ASP programs. J. Algorithms 63(1-3): 34-54 (2008) - Luca Di Gaspero, Andrea Roli:
Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony. J. Algorithms 63(1-3): 55-69 (2008) - Marco Gavanelli, Toni Mancini:
RCRA 2007: Experimental evaluation of algorithms for solving problems with combinatorial explosion. J. Algorithms 63(1-3): 1-2 (2008) - Matti Järvisalo, Ilkka Niemelä:
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. J. Algorithms 63(1-3): 90-113 (2008) - Marco Maratea, Francesco Ricca, Wolfgang Faber, Nicola Leone:
Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers. J. Algorithms 63(1-3): 70-89 (2008) - João Marques-Silva:
Model checking with Boolean Satisfiability. J. Algorithms 63(1-3): 3-16 (2008) - Meritxell Vinyals, Andrea Giovannucci, Jesús Cerquides, Pedro Meseguer, Juan A. Rodríguez-Aguilar:
A test suite for the evaluation of mixed multi-unit combinatorial auctions. J. Algorithms 63(1-3): 130-150 (2008) - Richard J. Wallace, Diarmuid Grimes:
Experimental studies of variable selection strategies based on constraint weights. J. Algorithms 63(1-3): 114-129 (2008) - Jon Williamson:
Objective Bayesian probabilistic logic. J. Algorithms 63(4): 167-183 (2008)
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-28 11:50 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