Остановите войну!
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 87 matches
- 2006
- Sergey A. Afonin, Elena Hazova:
Membership and Finiteness Problems for Rational Sets of Regular Languages. Int. J. Found. Comput. Sci. 17(3): 493-506 (2006) - Sergio De Agostino:
Bounded Size Dictionary Compression: Relaxing the Lru Deletion Heuristic. Int. J. Found. Comput. Sci. 17(6): 1273-1280 (2006) - Tatsuya Akutsu:
Algorithms for Point Set Matching with K-differences. Int. J. Found. Comput. Sci. 17(4): 903-918 (2006) - Artiom Alhazov, Rudolf Freund, Marion Oswald:
Cell/symbol complexity of tissue P systems with symport/antiport rules. Int. J. Found. Comput. Sci. 17(1): 3-25 (2006) - Dimitry S. Ananichev, Ilja V. Petrov, Mikhail V. Volkov:
Collapsing Words: a Progress Report. Int. J. Found. Comput. Sci. 17(3): 507-518 (2006) - Sharareh Babvey, Anu G. Bourgeois, José Alberto Fernández-Zepeda, Steven W. McLaughlin:
Scalable and Efficient Implementations of the Ldpc Decoder Using Reconfigurable Models. Int. J. Found. Comput. Sci. 17(2): 303-322 (2006) - Ivan Cibrario Bertolotti, Luca Durante, Riccardo Sisto, Adriano Valenzano:
Exploiting Symmetries for Testing Equivalence Verification in the Spi Calculus. Int. J. Found. Comput. Sci. 17(4): 815-832 (2006) - Alexis Bès, Olivier Carton:
A Kleene Theorem for Languages of Words Indexed by Linear Orderings. Int. J. Found. Comput. Sci. 17(3): 519-542 (2006) - Luca Bianco, Federico Fontana, Vincenzo Manca:
P systems with reaction maps. Int. J. Found. Comput. Sci. 17(1): 27-48 (2006) - Károly J. Böröczky, János Pach, Géza Tóth:
Planar Crossing Numbers of Graphs Embeddable in Another Surface. Int. J. Found. Comput. Sci. 17(5): 1005-1016 (2006) - Srecko Brlek, Gilbert Labelle, Annie Lacasse:
Properties of the Contour Path of Discrete Sets. Int. J. Found. Comput. Sci. 17(3): 543-556 (2006) - Janusz A. Brzozowski, Helmut Jürgensen:
Errata: "representation of Semiautomata by Canonical Words and Equivalences". Int. J. Found. Comput. Sci. 17(5): 1231-1232 (2006) - Domenico Cantone, Simone Faro:
A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem. Int. J. Found. Comput. Sci. 17(6): 1235-1252 (2006) - Luca Cardelli, Gheorghe Paun:
An universality result for a (mem)brane calculus based on mate/drip operations. Int. J. Found. Comput. Sci. 17(1): 49-68 (2006) - Matteo Cavaliere, Vincenzo Deufemia:
Further results on time-free P systems. Int. J. Found. Comput. Sci. 17(1): 69-89 (2006) - Rodica Ceterchi, Mario J. Pérez-Jiménez:
On simulating a class of parallel architectures. Int. J. Found. Comput. Sci. 17(1): 91-110 (2006) - Gabriel Ciobanu, Viorel Mihai Gontineac:
Mealy multiset automata. Int. J. Found. Comput. Sci. 17(1): 111-126 (2006) - Loek G. Cleophas, Kees Hemerik, Gerard Zwaan:
Two Related Algorithms for Root-to-frontier Tree Pattern Matching. Int. J. Found. Comput. Sci. 17(6): 1253-1272 (2006) - Christian A. Duncan, Alon Efrat, Stephen G. Kobourov, Carola Wenk:
Drawing with Fat Edges. Int. J. Found. Comput. Sci. 17(5): 1143-1164 (2006) - Andrzej Ehrenfeucht, Grzegorz Rozenberg:
Covers from Templates. Int. J. Found. Comput. Sci. 17(2): 475-488 (2006) - Amr Elmasry:
A Priority Queue with the Working-set Property. Int. J. Found. Comput. Sci. 17(6): 1455-1466 (2006) - E. Allen Emerson, Kristina D. Hager, Jay H. Konieczka:
Molecular Model Checking. Int. J. Found. Comput. Sci. 17(4): 733-742 (2006) - Ansgar Fehnker, Bruce H. Krogh:
Hybrid System Verification Is not a Sinecure - the Electronic Throttle Control Case Study. Int. J. Found. Comput. Sci. 17(4): 885-902 (2006) - Clelia de Felice, Antonio Restivo:
Preface. Int. J. Found. Comput. Sci. 17(3): 489-492 (2006) - Frantisek Franek, William F. Smyth:
Reconstructing a Suffix Array. Int. J. Found. Comput. Sci. 17(6): 1281-1296 (2006) - Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl:
Trémaux Trees and Planarity. Int. J. Found. Comput. Sci. 17(5): 1017-1030 (2006) - Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro:
Flexible Music Retrieval in Sublinear Time. Int. J. Found. Comput. Sci. 17(6): 1345-1364 (2006) - Dominik D. Freydenberger, Daniel Reidenbach, Johannes C. Schneider:
Unambiguous Morphic Images of Strings. Int. J. Found. Comput. Sci. 17(3): 601-628 (2006) - Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi:
Büchi Complementation Made Tighter. Int. J. Found. Comput. Sci. 17(4): 851-868 (2006) - Daiji Fukagawa, Tatsuya Akutsu:
Fast Algorithms for Comparison of Similar Unordered Trees. Int. J. Found. Comput. Sci. 17(3): 703-729 (2006)
skipping 57 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-24 07:42 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