Остановите войну!
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 24 matches
- 2018
- Stefano Aguzzoli, Stefania Boffa, Davide Ciucci, Brunella Gerla:
Finite IUML-algebras, Finite Forests and Orthopairs. Fundam. Informaticae 163(2): 139-163 (2018) - Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu:
Efficient Computation of Palindromes in Sequences with Uncertainties. Fundam. Informaticae 163(3): 253-266 (2018) - Sara Brunetti, Paolo Dulio, Andrea Frosini, Grzegorz Rozenberg:
Preface. Fundam. Informaticae 163(1) (2018) - Supaporn Chairungsee:
Efficient Approaches to Compute Longest Previous Non-overlapping Factor Array. Fundam. Informaticae 163(3): 291-304 (2018) - Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis:
Preface. Fundam. Informaticae 163(3): i (2018) - Enrica Duchi, Veronica Guerrini, Simone Rinaldi:
A Generating Tree for Permutations Avoiding the Pattern 122+3. Fundam. Informaticae 163(1): 21-39 (2018) - Paolo Dulio, Paolo Finotelli, Andrea Frosini, Elisa Pergola, Alice Presenti:
Graph Model Simulation of Human Brain's Functional Activity at Resting State by Means of the FD Model. Fundam. Informaticae 163(1): 93-109 (2018) - Fabien Feschet, Jean-Jacques Lemaire:
Super-resolution in Clinical Conditions: Deep Brain Stimulation Case Study. Fundam. Informaticae 163(1): 41-62 (2018) - Arnab Ganguly, Manish Patil, Rahul Shah, Sharma V. Thankachan:
A Linear Space Data Structure for Range LCP Queries. Fundam. Informaticae 163(3): 245-251 (2018) - Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski:
On Abelian Longest Common Factor with and without RLE. Fundam. Informaticae 163(3): 225-244 (2018) - Christopher J. Henry, Aqeel A. Syed:
A Descriptive Tolerance Nearness Measure for Performing Graph Comparison. Fundam. Informaticae 163(4): 305-324 (2018) - Sahar Hooshmand, Neda Tavakoli, Paniz Abedin, Sharma V. Thankachan:
On Computing Average Common Substring Over Run Length Encoded Sequences. Fundam. Informaticae 163(3): 267-273 (2018) - Behrouz Kheirfam, Afsaneh Nasrollahi:
A Full-Newton Step Interior-point Method Based on a Class of Specific Algebra Transformation. Fundam. Informaticae 163(4): 325-337 (2018) - Matteo Mancini, Mara Cercignani:
Network Models in Neuroimaging: A Survey of Multimodal Applications. Fundam. Informaticae 163(1): 63-91 (2018) - Paul D. Manuel, Sandi Klavzar:
The Graph Theory General Position Problem on Some Interconnection Networks. Fundam. Informaticae 163(4): 339-350 (2018) - Neerja Mhaskar, W. F. Smyth:
Frequency Covers for Strings. Fundam. Informaticae 163(3): 275-289 (2018) - Jakub Michaliszyn, Jan Otop, Piotr Witkowski:
Satisfiability versus Finite Satisfiability in Elementary Modal Logics. Fundam. Informaticae 163(2): 165-188 (2018) - Sumit Mishra, Samrat Mondal, Sriparna Saha:
Towards Obtaining Upper Bound on Sensitivity Computation Process for Cluster Validity Measures. Fundam. Informaticae 163(4): 351-374 (2018) - Rana Faisal Munir, Sergi Nadal, Oscar Romero, Alberto Abelló, Petar Jovanovic, Maik Thiele, Wolfgang Lehner:
Intermediate Results Materialization Selection and Format for Data-Intensive Flows. Fundam. Informaticae 163(2): 111-138 (2018) - Henri Der Sarkissian, Nicola Viganò, Kees Joost Batenburg:
A Data Consistent Variational Segmentation Approach Suitable for Real-time Tomography. Fundam. Informaticae 163(1): 1-20 (2018) - Camelia Schiopu, Eleonor Ciurea:
Maximum Flows in Planar Dynamic Networks with Lower Bounds. Fundam. Informaticae 163(2): 189-204 (2018) - Dipan Lal Shaw, A. S. M. Shohidull Islam, Shuvasish Karmaker, M. Sohel Rahman:
Approximation Algorithms for Three Dimensional Protein Folding. Fundam. Informaticae 163(4): 375-393 (2018) - Miaomiao Tian, Lingyan Wang, Hong Zhong, Jie Chen:
Attribute-based Data Integrity Checking for Cloud Storage. Fundam. Informaticae 163(4): 395-411 (2018) - Lyuyang Tong, Minggang Dong, Bing Ai, Chao Jing:
A Simple Butterfly Particle Swarm Optimization Algorithm with the Fitness-based Adaptive Inertia Weight and the Opposition-based Learning Average Elite Strategy. Fundam. Informaticae 163(2): 205-223 (2018)
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-23 18:59 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