Остановите войну!
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 94 matches
- 2007
- Parosh Aziz Abdulla, Johanna Högberg, Lisa Kaati:
Bisimulation Minimization of Tree Automata. Int. J. Found. Comput. Sci. 18(4): 699-713 (2007) - Artiom Alhazov, Yurii Rogozhin, Sergey Verlan:
Minimal Cooperation in Symport/antiport Tissue P Systems. Int. J. Found. Comput. Sci. 18(1): 163-180 (2007) - Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo:
Graph Orientation Algorithms to minimize the Maximum Outdegree. Int. J. Found. Comput. Sci. 18(2): 197-215 (2007) - Peter R. J. Asveld:
Generating All Circular Shifts by Context-Free Grammars in Greibach Normal Form. Int. J. Found. Comput. Sci. 18(6): 1139-1149 (2007) - Adrian Atanasiu:
Binary amiable Words. Int. J. Found. Comput. Sci. 18(2): 387-400 (2007) - Benjamin Aziz, Geoff W. Hamilton:
Modelling and Analysis of PKI-Based Systems Using Process Calculi. Int. J. Found. Comput. Sci. 18(3): 593-618 (2007) - Sung Eun Bae, Tadao Takaoka:
Algorithms for k-Disjoint Maximum Subarrays. Int. J. Found. Comput. Sci. 18(2): 319-339 (2007) - Ittai Balaban, Amir Pnueli, Lenore D. Zuck:
Modular Ranking Abstraction. Int. J. Found. Comput. Sci. 18(1): 5-44 (2007) - Sudha Balla, Sanguthevar Rajasekaran, Ion I. Mandoiu:
Efficient Algorithms for degenerate Primer Search. Int. J. Found. Comput. Sci. 18(4): 899-910 (2007) - Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter:
Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice. Int. J. Found. Comput. Sci. 18(4): 715-725 (2007) - Hanane Becha, Paola Flocchini:
Optimal Construction of Sense of Direction in a Torus by a Mobile Agent. Int. J. Found. Comput. Sci. 18(3): 529-546 (2007) - Maurice H. ter Beek, Erzsébet Csuhaj-Varjú, György Vaszil, Markus Holzer:
On Competence in CD Grammar Systems with Parallel Rewriting. Int. J. Found. Comput. Sci. 18(6): 1425-1439 (2007) - Charita Bhika, Sigrid Ewert, Ryan Schwartz, Mutahi Waruhiu:
Table-Driven Context-Free Picture Grammars. Int. J. Found. Comput. Sci. 18(6): 1151-1160 (2007) - Roderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri:
Symbolic Implementation of Alternating Automata. Int. J. Found. Comput. Sci. 18(4): 727-743 (2007) - Oliver Boldt, Helmut Jürgensen:
Soliton Languages are Nearly an Anti-AFL. Int. J. Found. Comput. Sci. 18(6): 1161-1165 (2007) - Henning Bordihn, Markus Holzer, Martin Kutrib:
Hybrid Extended Finite Automata. Int. J. Found. Comput. Sci. 18(4): 745-760 (2007) - Henning Bordihn, Bernd Reichel, Ralf Stiebe, Bianca Truthe:
Preface: Aspects in Language and Automata Theory Special Issue Dedicated to JÜrgen Dassow. Int. J. Found. Comput. Sci. 18(6): 1137-1138 (2007) - Jacir Luiz Bordim, Koji Nakano:
Preface. Int. J. Found. Comput. Sci. 18(3): 433-434 (2007) - Janusz A. Brzozowski, Helmut Jürgensen:
Representation of Semiautomata by Canonical Words and Equivalences, Part II: Specification of Software Modules. Int. J. Found. Comput. Sci. 18(5): 1065-1087 (2007) - Zhenchuan Chai, Zhenfu Cao, Xiaolei Dong:
Efficient ID-Based Multi-Receiver Threshold Decryption. Int. J. Found. Comput. Sci. 18(5): 987-1004 (2007) - Eddie Cheng, László Lipták:
Fault Resiliency of Cayley Graphs Generated by Transpositions. Int. J. Found. Comput. Sci. 18(5): 1005-1022 (2007) - Ludek Cienciala, Lucie Ciencialová, Pierluigi Frisco, Petr Sosík:
On the Power of Deterministic and Sequential Communicating P Systems. Int. J. Found. Comput. Sci. 18(2): 415-431 (2007) - Corinna Cortes, Mehryar Mohri, Ashish Rastogi:
LP Distance and Equivalence of Probabilistic Automata. Int. J. Found. Comput. Sci. 18(4): 761-779 (2007) - Miguel Couceiro, Erkko Lehtonen:
On the Effect of Variable Identification on the Essential Arity of Functions on Finite Sets. Int. J. Found. Comput. Sci. 18(5): 975-986 (2007) - Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi:
The Structure of Factor Oracles. Int. J. Found. Comput. Sci. 18(4): 781-797 (2007) - Elena Czeizler, Stepan Holub, Juhani Karhumäki, Markku Laine:
Intricacies of Simple Word Equations: an Example. Int. J. Found. Comput. Sci. 18(6): 1167-1175 (2007) - Elena Czeizler, Juhani Karhumäki:
On Non-Periodic Solutions of Independent Systems of Word Equations over Three Unknowns. Int. J. Found. Comput. Sci. 18(4): 873-897 (2007) - Mark Daley, Michael Domaratzki, Alexis Morris:
Intra-Molecular Template-Guided Recombination. Int. J. Found. Comput. Sci. 18(6): 1177-1186 (2007) - Werner Damm, Guilherme Pinto, Stefan Ratschan:
Guaranteed Termination in the Verification of Ltl Properties of Non-linear Robust Discrete Time Hybrid Systems. Int. J. Found. Comput. Sci. 18(1): 63-86 (2007) - Gautam K. Das, Sasthi C. Ghosh, Subhas C. Nandy:
Improved Algorithm for Minimum Cost Range Assignment Problem for Linear Radio Networks. Int. J. Found. Comput. Sci. 18(3): 619-635 (2007)
skipping 64 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-03 15:06 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