Остановите войну!
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 106 matches
- 2012
- Allani Abderrahim, El-Ghazali Talbi, Khaled Mellouli:
Hybridization of Genetic and Quantum Algorithm for gene Selection and Classification of microarray Data. Int. J. Found. Comput. Sci. 23(2): 431-444 (2012) - Enrique Alba, Franciszek Seredynski, El-Ghazali Talbi, Albert Y. Zomaya:
Preface. Int. J. Found. Comput. Sci. 23(2) (2012) - Artiom Alhazov, Yurii Rogozhin, Sergey Verlan:
On Small Universal Splicing Systems. Int. J. Found. Comput. Sci. 23(7): 1423-1438 (2012) - Pablo Arrighi, Gilles Dowek:
The Physical Church-Turing Thesis and the Principles of Quantum Theory. Int. J. Found. Comput. Sci. 23(5): 1131-1146 (2012) - David Auger, Olivier Teytaud:
The Frontier of Decidability in Partially Observable Recursive Games. Int. J. Found. Comput. Sci. 23(7): 1439-1450 (2012) - Amir M. Ben-Amram, Lars Kristiansen:
On the Edge of Decidability in Complexity Analysis of Loop Programs. Int. J. Found. Comput. Sci. 23(7): 1451-1464 (2012) - Gilles Benattar, Béatrice Bérard, Didier Lime, John Mullins, Olivier H. Roux, Mathieu Sassolas:
Channel Synthesis for Finite Transducers. Int. J. Found. Comput. Sci. 23(6): 1241-1260 (2012) - Hammadi Bennoui, Allaoua Chaoui, Kamel Barkaoui:
On Structural Analysis of Interacting Behavioral Petri Nets for Distributed Causal Model-Based Diagnosis. Int. J. Found. Comput. Sci. 23(7): 1523-1542 (2012) - Bastian Bischoff, James D. Currie, Dirk Nowotka:
Unary Patterns with involution. Int. J. Found. Comput. Sci. 23(8): 1641-1652 (2012) - Francine Blanchet-Sadri:
Algorithmic Combinatorics on Partial Words. Int. J. Found. Comput. Sci. 23(6): 1189-1206 (2012) - Adilson Luiz Bonifácio, Arnaldo Vieira Moura, Adenilso da Silva Simão:
Model Partitions and Compact Test Case Suites. Int. J. Found. Comput. Sci. 23(1): 147-172 (2012) - Henning Bordihn, Martin Kutrib, Andreas Malcher:
On the Computational Capacity of Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 23(3): 713-732 (2012) - Jacir Luiz Bordim, Akihiro Fujiwara, Koji Nakano:
Preface. Int. J. Found. Comput. Sci. 23(4): 761-762 (2012) - Azzedine Boukerche, Rodolfo Bezerra Batista, Alba Cristina Magalhaes Alves de Melo, Felipe Brandt Scarel, Lavir Antonio Bahia Carvalho de Souza:
Exact Parallel Alignment of megabase genomic Sequences with Tunable Work Distribution. Int. J. Found. Comput. Sci. 23(2): 407-429 (2012) - Davide Bresolin, Pietro Sala, Guido Sciavicco:
On Begins, Meets and before. Int. J. Found. Comput. Sci. 23(3): 559-583 (2012) - Lubos Brim, Jakub Chaloupka:
Using Strategy Improvement to Stay Alive. Int. J. Found. Comput. Sci. 23(3): 585-608 (2012) - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
On the Average Size of Glushkov and Partial derivative Automata. Int. J. Found. Comput. Sci. 23(5): 969-984 (2012) - Janusz A. Brzozowski, Bo Liu:
Quotient Complexity of Star-Free Languages. Int. J. Found. Comput. Sci. 23(6): 1261-1276 (2012) - Janusz A. Brzozowski, Baiyu Li, Yuli Ye:
On the Complexity of the Evaluation of Transient Extensions of Boolean Functions. Int. J. Found. Comput. Sci. 23(1): 21-35 (2012) - Alain Bui, Abdurusul Kudireti, Devan Sohier:
An Adaptive Random Walk Based Distributed Clustering Algorithm. Int. J. Found. Comput. Sci. 23(4): 803-830 (2012) - Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
Algorithms for Jumbled Pattern Matching in Strings. Int. J. Found. Comput. Sci. 23(2): 357-374 (2012) - Fabio Burderi:
Full Monoids and Maximal Codes. Int. J. Found. Comput. Sci. 23(8): 1677-1690 (2012) - Mark Burgin:
Decidability and Universality in the Axiomatic Theory of Computability and Algorithms. Int. J. Found. Comput. Sci. 23(7): 1465-1480 (2012) - Michaël Cadilhac, Alain Finkel, Pierre McKenzie:
Bounded Parikh Automata. Int. J. Found. Comput. Sci. 23(8): 1691-1710 (2012) - Cristian S. Calude, Kai Salomaa, Tania Roblot:
State-Size Hierarchy for Finite-State Complexity. Int. J. Found. Comput. Sci. 23(1): 37-50 (2012) - Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Pattern Matching with Swaps in Practice. Int. J. Found. Comput. Sci. 23(2): 323-342 (2012) - Domenico Cantone, Simone Faro, Emanuele Giaquinta:
Adapting Boyer-Moore-like Algorithms for Searching Huffman Encoded Texts. Int. J. Found. Comput. Sci. 23(2): 343-356 (2012) - Julio César Hernández Castro, Juan M. Estévez-Tapiador, Pedro Peris-Lopez, John A. Clark, El-Ghazali Talbi:
Metaheuristic Traceability Attack against SLMAP, an RFID Lightweight Authentication Protocol. Int. J. Found. Comput. Sci. 23(2): 543-553 (2012) - Emilie Charlier, Narad Rampersad, Jeffrey O. Shallit:
Enumeration and Decidable Properties of Automatic Sequences. Int. J. Found. Comput. Sci. 23(5): 1035-1066 (2012) - Krishnendu Chatterjee, Rupak Majumdar:
Discounting and Averaging in Games across Time scales. Int. J. Found. Comput. Sci. 23(3): 609-625 (2012)
skipping 76 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 16:08 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