Остановите войну!
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 68 matches
- 2009
- Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar:
Composed Bisimulation for Tree Automata. Int. J. Found. Comput. Sci. 20(4): 685-700 (2009) - Parosh Aziz Abdulla, Giorgio Delzanno, Noomene Ben Henda, Ahmed Rezine:
Monotonic Abstraction: on Efficient Verification of Parameterized Systems. Int. J. Found. Comput. Sci. 20(5): 779-801 (2009) - Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Bae, Peter Brass, Otfried Cheong, Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Alexander Wolff:
Constructing Optimal Highways. Int. J. Found. Comput. Sci. 20(1): 3-23 (2009) - Haydeh Ahrabian, Abbas Nowzari-Dalini, Fatemeh Zare-Mirakabad:
A Constant Time Algorithm for DNA Add. Int. J. Found. Comput. Sci. 20(3): 549-558 (2009) - Cyril Allauzen, Mehryar Mohri:
N-Way Composition of Weighted Finite-State Transducers. Int. J. Found. Comput. Sci. 20(4): 613-627 (2009) - Marco Almeida, Nelma Moreira, Rogério Reis:
Antimirov and Mosses's Rewrite System Revisited. Int. J. Found. Comput. Sci. 20(4): 669-684 (2009) - Étienne André, Thomas Chatain, Laurent Fribourg, Emmanuelle Encrenaz:
An Inverse Method for Parametric Timed Automata. Int. J. Found. Comput. Sci. 20(5): 819-836 (2009) - Andrew Badr:
HYPER-MINIMIZATION IN O(n2). Int. J. Found. Comput. Sci. 20(4): 735-746 (2009) - Pawel Baturo, Marcin Piatkowski, Wojciech Rytter:
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words. Int. J. Found. Comput. Sci. 20(6): 1005-1023 (2009) - Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. Int. J. Found. Comput. Sci. 20(1): 167-183 (2009) - Yohan Boichut, Roméo Courbis, Pierre-Cyrille Héam, Olga Kouchnarenko:
Handling Non Left-Linear Rules when Completing Tree Automata. Int. J. Found. Comput. Sci. 20(5): 837-849 (2009) - Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
Reduction Graphs from Overlap Graphs for Gene Assembly in Ciliates. Int. J. Found. Comput. Sci. 20(2): 271-291 (2009) - François Cantin, Axel Legay, Pierre Wolper:
Computing Convex Hulls by Automata Iteration. Int. J. Found. Comput. Sci. 20(4): 647-667 (2009) - Domenico Cantone, Salvatore Cristofaro, Simone Faro:
New Efficient Bit-Parallel Algorithms for the (delta, alpha)-Matching Problem with Applications in Music Information Retrieval. Int. J. Found. Comput. Sci. 20(6): 1087-1108 (2009) - Jean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne:
An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical. Int. J. Found. Comput. Sci. 20(4): 763-774 (2009) - Ching-Lueh Chang, Yuh-Dauh Lyuu, Yen-Wu Ti:
Testing Embeddability between Metric Spaces. Int. J. Found. Comput. Sci. 20(2): 313-329 (2009) - Danny Z. Chen, Mark A. Healy, Chao Wang, Bin Xu:
Geometric Algorithms for the Constrained 1-d k-Means Clustering Problems and IMRT Applications. Int. J. Found. Comput. Sci. 20(2): 361-377 (2009) - Manolis Christodoulakis, Gerhard Brey:
Edit Distance with Combinations and Splits and its Applications in OCR Name Matching. Int. J. Found. Comput. Sci. 20(6): 1047-1068 (2009) - Gabriel Ciobanu, Viorel Mihai Gontineac:
Encodings of Multisets. Int. J. Found. Comput. Sci. 20(3): 381-393 (2009) - Wikus Coetser, Derrick G. Kourie, Bruce W. Watson:
On Regular Expression Hashing to Reduce FA Size. Int. J. Found. Comput. Sci. 20(6): 1069-1086 (2009) - Dragos M. Cvetkovic, Tatjana Davidovic:
Multiprocessor Interconnection Networks with Small tightness. Int. J. Found. Comput. Sci. 20(5): 941-963 (2009) - Jeremy E. Dawson, Rajeev Goré:
Termination of Abstract Reduction Systems. Int. J. Found. Comput. Sci. 20(1): 57-82 (2009) - Ryan Dixon, Ömer Egecioglu, Timothy Sherwood:
Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching. Int. J. Found. Comput. Sci. 20(4): 597-612 (2009) - Simone Faro, Thierry Lecroq:
Efficient Variants of the Backward-Oracle-Matching Algorithm. Int. J. Found. Comput. Sci. 20(6): 967-984 (2009) - Ingo Felscher, Wolfgang Thomas:
Compositionality and Reachability with Conditions on Path Lengths. Int. J. Found. Comput. Sci. 20(5): 851-868 (2009) - Matthias Gallé, Pierre Peterlongo, François Coste:
In-Place Update of Suffix Array while Recoding Words. Int. J. Found. Comput. Sci. 20(6): 1025-1045 (2009) - Heidi Gebauer, Yoshio Okamoto:
Fast Exponential-Time Algorithms for the Forest Counting and the Tutte Polynomial Computation in Graph Classes. Int. J. Found. Comput. Sci. 20(1): 25-44 (2009) - Christian Glaßer, Alan L. Selman, Liyu Zhang:
The Informational Content of Canonical Disjoint NP-Pairs. Int. J. Found. Comput. Sci. 20(3): 501-522 (2009) - Jan Friso Groote, Bas Ploeger:
Switching Graphs. Int. J. Found. Comput. Sci. 20(5): 869-886 (2009) - Joachim Gudmundsson, James Harland:
Preface. Int. J. Found. Comput. Sci. 20(1): 1-2 (2009)
skipping 38 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-29 19:12 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