Остановите войну!
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 75 matches
- 2018
- Maryam Abdollahyan, Greg Elgar, Fabrizio Smeraldi:
Identifying Potential Regulatory Elements by Transcription Factor Binding Site Alignment Using Partial Order Graphs. Int. J. Found. Comput. Sci. 29(8): 1345-1354 (2018) - Michal Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Jakub Radoszewski:
Palindromic Decompositions with Gaps and Errors. Int. J. Found. Comput. Sci. 29(8): 1311-1329 (2018) - Jamie J. Alnasir, Hugh P. Shanahan:
Transcriptomics: Quantifying Non-Uniform Read Distribution Using MapReduce. Int. J. Found. Comput. Sci. 29(8): 1355-1372 (2018) - Harout K. Aydinian, Ferdinando Cicalese, Christian Deppe, Vladimir S. Lebedev:
A Combinatorial Model of Two-Sided Search. Int. J. Found. Comput. Sci. 29(4): 481-504 (2018) - Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto:
Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci. 29(2): 143-164 (2018) - Carl Barton, Chang Liu, Solon P. Pissis:
Fast Average-Case Pattern Matching on Weighted Sequences. Int. J. Found. Comput. Sci. 29(8): 1331-1343 (2018) - Mostafa Nouri Baygi:
The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem. Int. J. Found. Comput. Sci. 29(7): 1231-1245 (2018) - Nicolas Bedon:
Complementation of Branching Automata for Scattered and Countable N-Free Posets. Int. J. Found. Comput. Sci. 29(5): 769-799 (2018) - Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi:
Bidirectional Variable-Order de Bruijn Graphs. Int. J. Found. Comput. Sci. 29(8): 1279-1295 (2018) - Somnath Bera, Kalpana Mahalingam, K. G. Subramanian:
Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator. Int. J. Found. Comput. Sci. 29(3): 403-414 (2018) - Zeynep Nihan Berberler, Esin Yigit:
Link Vulnerability in Networks. Int. J. Found. Comput. Sci. 29(3): 447-456 (2018) - Dietmar Berwanger, Marie van den Bogaard:
Consensus Game Acceptors and Iterated Transductions. Int. J. Found. Comput. Sci. 29(2): 165-186 (2018) - Maria Paola Bianchi, Hans-Joachim Böckenhauer, Tatjana Brülisauer, Dennis Komm, Beatrice Palano:
Online Minimum Spanning Tree with Advice. Int. J. Found. Comput. Sci. 29(4): 505-527 (2018) - Maria Paola Bianchi, Juraj Hromkovic, Ivan Kovác:
On the Size of Two-Way Reasonable Automata for the Liveness Problem. Int. J. Found. Comput. Sci. 29(2): 187-212 (2018) - Khodakhast Bibak, Bruce M. Kapron, Srinivasan Venkatesh, László Tóth:
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes. Int. J. Found. Comput. Sci. 29(3): 357-376 (2018) - Olivier Bournez, Oleksiy Kurganskyy, Igor Potapov:
Reachability Problems for One-Dimensional Piecewise Affine Maps. Int. J. Found. Comput. Sci. 29(4): 529-549 (2018) - Michelangelo Bucci, Gwénaël Richomme:
Greedy Palindromic Lengths. Int. J. Found. Comput. Sci. 29(3): 331-356 (2018) - Elisabet Burjons, Juraj Hromkovic, Rastislav Královic, Richard Královic, Xavier Muñoz, Walter Unger:
Online Graph Coloring Against a Randomized Adversary. Int. J. Found. Comput. Sci. 29(4): 551-569 (2018) - Émilie Charlier, Wolfgang Steiner:
Permutations and Negative Beta-Shifts. Int. J. Found. Comput. Sci. 29(5): 721-740 (2018) - Cédric Chauve, Julien Courtiel, Yann Ponty:
Counting, Generating, Analyzing and Sampling Tree Alignments. Int. J. Found. Comput. Sci. 29(5): 741-767 (2018) - HeeWon Chung, Myungsun Kim:
Encoding of Rational Numbers and Their Homomorphic Computations for FHE-Based Applications. Int. J. Found. Comput. Sci. 29(6): 1023-1044 (2018) - Canan Çiftçi, Aysun Aytaç:
Exponential Independence Number of Some Graphs. Int. J. Found. Comput. Sci. 29(7): 1151-1164 (2018) - Christopher Czyba, Wolfgang Thomas, Christopher Spinrath:
Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change. Int. J. Found. Comput. Sci. 29(2): 213-232 (2018) - Andreas Darmann, Janosch Döcker, Britta Dorn:
The Monotone Satisfiability Problem with Bounded Variable Appearances. Int. J. Found. Comput. Sci. 29(6): 979-993 (2018) - Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier:
Aperiodic String Transducers. Int. J. Found. Comput. Sci. 29(5): 801-824 (2018) - Parisa Derakhshan, Walter Hussak:
Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs. Int. J. Found. Comput. Sci. 29(3): 377-390 (2018) - Jörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela:
Degrees of Infinite Words, Polynomials and Atoms. Int. J. Found. Comput. Sci. 29(5): 825-843 (2018) - Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the Density of Context-Free and Counter Languages. Int. J. Found. Comput. Sci. 29(2): 233-250 (2018) - Daniil Gasnikov, Arseny M. Shur:
Square-Free Partial Words with Many Wildcards. Int. J. Found. Comput. Sci. 29(5): 845-860 (2018) - Maciej Gazda, Tim A. C. Willemse:
Cooking Your Own Parity Game Preorders Through Matching Plays. Int. J. Found. Comput. Sci. 29(4): 571-590 (2018)
skipping 45 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-16 18:30 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