Остановите войну!
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 60 matches
- 2016
- Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu, M. Sohel Rahman:
Algorithms for Longest Common Abelian Factors. Int. J. Found. Comput. Sci. 27(5): 529-544 (2016) - Saeid Alirezazadeh:
On Pseudovarieties of Forest Algebras. Int. J. Found. Comput. Sci. 27(8): 909-942 (2016) - Jorge Almeida, Emanuele Rodaro:
Semisimple Synchronizing Automata and the Wedderburn-Artin Theory. Int. J. Found. Comput. Sci. 27(2): 127-146 (2016) - Ferhan Nihan Altundag, Goksen Bacak-Turan:
Neighbor Rupture Degree of Harary Graphs. Int. J. Found. Comput. Sci. 27(6): 739-756 (2016) - Ersin Aslan:
Weak-Rupture Degree of Graphs. Int. J. Found. Comput. Sci. 27(6): 725-738 (2016) - Adrian Atanasiu, Wen Chean Teh:
A New Operator over Parikh Languages. Int. J. Found. Comput. Sci. 27(6): 757-770 (2016) - Zuzana Bednárová, Viliam Geffert, Klaus Reinhardt, Abuzer Yakaryilmaz:
New Results on the Minimum Amount of Useful Space. Int. J. Found. Comput. Sci. 27(2): 259-282 (2016) - Somnath Bera, Kalpana Mahalingam:
Some Algebraic Aspects of Parikh q-Matrices. Int. J. Found. Comput. Sci. 27(4): 479-500 (2016) - Dmitry Berdinsky, Bakhadyr Khoussainov:
Cayley Automatic Representations of Wreath Products. Int. J. Found. Comput. Sci. 27(2): 147-160 (2016) - Marin Bertier, Matthieu Perrin, Cédric Tedeschi:
On the Complexity of Concurrent Multiset Rewriting. Int. J. Found. Comput. Sci. 27(1): 67-84 (2016) - Édouard Bonnet, Florian Sikora:
A Note on Edge Isoperimetric Numbers and Regular Graphs. Int. J. Found. Comput. Sci. 27(6): 771-774 (2016) - David Caissy, Andrzej Pelc:
Exploration of Faulty Hamiltonian Graphs. Int. J. Found. Comput. Sci. 27(7): 809-828 (2016) - Eddy Caron, Ajoy Kumar Datta, Franck Petit, Cédric Tedeschi:
Self-Stabilizing Prefix Tree Based Overlay Networks. Int. J. Found. Comput. Sci. 27(5): 607-630 (2016) - Pascal Caron, Jean-Gabriel Luque, Ludovic Mignot, Bruno Patrou:
State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach. Int. J. Found. Comput. Sci. 27(6): 675-704 (2016) - Julien Cassaigne, Idrissa Kaboré:
Abelian Complexity and Frequencies of Letters in Infinite Words. Int. J. Found. Comput. Sci. 27(5): 631-650 (2016) - Hiroyuki Chigahara, Szilárd Zsolt Fazekas, Akihiro Yamamura:
One-Way Jumping Finite Automata. Int. J. Found. Comput. Sci. 27(3): 391- (2016) - Francis Y. L. Chin, Oscar H. Ibarra, Sartaj K. Sahni:
Announcement. Int. J. Found. Comput. Sci. 27(8): 895-896 (2016) - Lunzhi Deng, Jiwen Zeng, Huawei Huang:
Efficient Certificateless Proxy Signature Scheme. Int. J. Found. Comput. Sci. 27(1): 85- (2016) - Chen Fei Du, Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties. Int. J. Found. Comput. Sci. 27(8): 943-964 (2016) - Carole J. Etherington, Matthew W. Anderson, Eric Bach, Jon T. Butler, Pantelimon Stanica:
A Parallel Approach in Computing Correlation Immunity up to Six Variables. Int. J. Found. Comput. Sci. 27(4): 511- (2016) - Szilárd Zsolt Fazekas, Kayoko Shikishima-Tsuji, Akihiro Yamamura:
Preface. Int. J. Found. Comput. Sci. 27(3): 301-304 (2016) - Sven De Felice, Cyril Nicaud:
Average Case Analysis of Brzozowski's Algorithm. Int. J. Found. Comput. Sci. 27(2): 109-126 (2016) - Michael Forsyth, Amlesh Jayakumar, Jarkko Peltomäki, Jeffrey O. Shallit:
Remarks on Privileged Words. Int. J. Found. Comput. Sci. 27(4): 431-442 (2016) - Satoshi Fujita:
On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs. Int. J. Found. Comput. Sci. 27(7): 829-844 (2016) - Toru Fujita, Koji Nakano, Yasuaki Ito:
Fast Simulation of Conway's Game of Life Using Bitwise Parallel Bulk Computation on a GPU. Int. J. Found. Comput. Sci. 27(8): 981- (2016) - Yuri Gurevich:
Past Present. Int. J. Found. Comput. Sci. 27(2): 103-108 (2016) - Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
State Complexity of Insertion. Int. J. Found. Comput. Sci. 27(7): 863-878 (2016) - Markus Holzer, Sebastian Jakobi:
Minimal and Hyper-Minimal Biautomata. Int. J. Found. Comput. Sci. 27(2): 161-186 (2016) - Janusz Januszewski, Lukasz Zielonka:
Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing. Int. J. Found. Comput. Sci. 27(4): 407-430 (2016) - Sang-Ki Ko, Hae-Sung Eom, Yo-Sub Han:
Operational State Complexity of Subtree-Free Regular Tree Languages. Int. J. Found. Comput. Sci. 27(6): 705-724 (2016)
skipping 30 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-27 23:01 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